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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
