This paper presents an investigation into the optimal scheduling of realtime
tasks of a multiprocessor system using hybrid genetic algorithms (GAs). A comparative
study of heuristic approaches such as `Earliest Deadline First (EDF)¿ and
`Shortest Computation Time First (SCTF)¿ and genetic algorithm is explored and
demonstrated. The results of the simulation study using MATLAB is presented and
discussed. Finally, conclusions are drawn from the results obtained that genetic algorithm
can be used for scheduling of real-time tasks to meet deadlines, in turn to obtain
high processor utilization.
Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/2552 |
Date | January 2007 |
Creators | Varghese, B., Hossain, M. Alamgir, Dahal, Keshav P. |
Publisher | Springer Verlag |
Source Sets | Bradford Scholars |
Language | English |
Detected Language | English |
Type | Conference paper, Accepted Manuscript |
Rights | © 2007 Springer Verlag. Reproduced in accordance with the publisher's self-archiving policy. Original publication is available at http://www.springerlink.com |
Relation | http://www.springerlink.com |
Page generated in 0.0036 seconds