|
|
|
|
esep
|
|
Current Version: 1.4
License Type: GPL
|
|
Home Site:
Source Code Availability: Yes
Available Binary Packages:
Targeted Platforms: Software/Hardware Requirements:
|
|
Other Links:
Mailing Lists/USENET News Groups: User Comments:
|
SAL Home
| 
Parallel Computing
| 
Programming Languages & Systems
esep (Evolution Scheduling and Evolving Processes) is an evolution scheduler,
based on genetic algorithms and evolutionary programming.
esep shows the concepts of evolution scheduling, which will provide us
with a better scheduling mechanism for competing processes in the
ready queue and even the blocked queue.
The evolution scheduling is acceptable
for the real-time system and useful for its performance to
achieve fair and effective scheduling. In the comparison
of queue dispatching and process dispatching of the evolution
scheduler with other ones of existing schedulers,
round robin, priority, and even FIFO scheduling, we can
confidently conclude that where we use the round
robin, priority, and even FIFO scheduling, we can imple-
ment evolution scheduling to substitute for them without
warning the application programmers to change their expectation
of the scheduling controls. On the other hand, for
those who pursue evolutionary computation, this is good
news. It allows them to carry out natural competition in
an easy way consistent with their operating system and
programming language. Each evolving process, one with the
ability to improve its adaptation to the environment,
reflects on the CPU usage rate and I/O throughput load
with its fitness function, and the evolution scheduler
elaborates the optimization winner for the next quantum.
So there are many benefits for both scheduler designers
and evolutionary programmers.
