SCHEDULING REAL-TIME TASKS IN MULTIPROCESSOR SYSTEMS USING GENETIC ALGORITHMS | ||||
JES. Journal of Engineering Sciences | ||||
Article 10, Volume 37, No 3, May and June 2009, Page 691-698 PDF (309.59 K) | ||||
Document Type: Research Paper | ||||
DOI: 10.21608/jesaun.2009.126495 | ||||
View on SCiNiTO | ||||
Authors | ||||
E. M. Saad1; H. A. Keshk1; M. A. Saleh1; A.A. Hamam2 | ||||
1Faculty of Engineering Helwan University, Helwan, Egypt | ||||
2Thebes Academy, Giza, Egypt | ||||
Abstract | ||||
Multiprocessors have been employed as a powerful computing means for executing real-time tasks, especially where a uniprocessor system would not be sufficient to execute all the tasks. This paper investigates dynamic scheduling algorithm for real-time tasks in a multiprocessor systems to obtain a feasible solution using genetic algorithms combined with earliest deadline first (EDF) and shortest computation time first (SCTF). A comparative study of the results obtained from simulations shows that genetic algorithm can be used to schedule tasks to meet their deadlines time , in addition to obtain high processor utilization. | ||||
Keywords | ||||
Task Graph; Optimization; Real-time system; genetic algorithms; multiprocessor scheduling | ||||
Statistics Article View: 67 PDF Download: 219 |
||||