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

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-and-server) queue. The evolution scheduling is acceptable for the soft real-time system and useful for its performance to achieve fair and effective scheduling. 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.