Evolving processes and evolution schedulers for concurrent scheduling controls and parallel evolutionary computation

Abstract

In this paper we present concepts of evolution scheduling, which will provide us with a better scheduling mechanism for competing processes in the ready queue, the blocked queue, the PC (Priority Control) queue, and the CS (Client & Server) queue. The evolution scheduling is acceptable for the soft 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 existing schedulers we can confidently conclude that where we use round robin, priority, and even FIFO scheduling, we can implement 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 1/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.