Scheduling in multiprocessor system using genetic algorithms
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all the tasks. The high performance and reliability of multiprocessors have made them a powerful computing resource. Such computing environment requires an efficient algorithm to determine when and on which processor a given task should execute. This paper investigates dynamic scheduling of real-time tasks in a multiprocessor system to obtain a feasible solution using genetic algorithms combined with well-known heuristics, such as 'Earliest Deadline First' and 'Shortest Computation Time First'. A comparative study of the results obtained from simulations shows that genetic algorithm can be used to schedule tasks to meet deadlines, in turn to obtain high processor utilization.
CitationDahal, K. P., Hossain, A., Varghese, B., Abraham, A., Xhafa, F., Daradoumis, T. Scheduling in multiprocessor system using genetic algorithms. A: International Conference on Computer Information Systems and Industrial Management Applications. "7th International Conference on Computer Information Systems and Industrial Management Applications: Ostrava, The Czech Republic, June 26 - June 28, 2008: proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2008, p. 281-286.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder