A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm

Abstract In the multiprocessor systems, scheduling is a major issue in their operation, which is also an important problem in other area such as manufacturing, process control, economics, operation research and, etc. An efficient scheduling onto the processes that minimizes the entire run time and also average of response time is vital for achieving a high performance. Solving this problem is very hard and many attempts have been made to solve the problem, using classical algorithms and intelligent methods. In fact in all researches including intelligent methods, the classical algorithm is the basic part of the solution. Even in intelligent methods, which genetic algorithm has been used, when a final chromosome is produced after some generation, a classical algorithm is used to produce an optimal scheduling based on this chromosome. In this paper a novel intelligent solution has been proposed based on genetic algorithm and chromosome background tree without using any classical algorithm. In this method the genetic algorithm presents the optimal scheduling, directly from the produced chromosome in final generation. The time of transferring data between processes is considered, and also the method not only minimizes the entire run time, but also minimizes the average of the response time of all processes.

[1]  Mark Moir,et al.  Pfair scheduling of fixed and migrating periodic tasks on multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[2]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[3]  Prashant J. Shenoy,et al.  Deadline fair scheduling: bridging the theory and practice of proportionate pair scheduling in multiprocessor systems , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

[4]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[5]  James H. Anderson,et al.  Efficient scheduling of soft real-time applications on multiprocessors , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[6]  Arjan J. C. van Gemund,et al.  Fast and effective task scheduling in heterogeneous systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[7]  Mark Moir,et al.  Static-priority periodic scheduling on multiprocessors , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[8]  Kenichi Hagihara,et al.  Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays , 2001, PPAM.

[9]  H. K. Dai,et al.  Multi-heuristic list scheduling genetic algorithm for task scheduling , 2003, SAC '03.

[10]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

[11]  James H. Anderson,et al.  Adapting Pfair scheduling for symmetric multiprocessors , 2005, J. Embed. Comput..

[12]  Andrew S. Tanenbaum,et al.  Modern Operating Systems , 1992 .

[13]  Sanjoy K. Baruah,et al.  Fairness in periodic real-time scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[14]  Tarek A. El-Ghazawi,et al.  A Parallel Genetic Algorithm for Task Mapping on Parallel Machines , 1999, IPPS/SPDP Workshops.

[15]  Babak Hamidzadeh,et al.  Dynamic scheduling strategies for shared-memory multiprocessors , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[16]  H. K. Dai,et al.  Integrating Random Ordering into Multi-heuristic List Scheduling Genetic Algorithm , 2003 .

[17]  Xue Hui-feng.  A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems , 2005 .

[18]  Teodor Gabriel Crainic,et al.  Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems , 2006, Comput. Oper. Res..