Abstract
This paper analyzes the behavior and performance of four dynamic algorithms for multiprocessor scheduling of hard real-time tasks. The well-known algorithms are the Earliest Deadline First (EDF) algorithm and the Least Laxity First (LLF) algorithm. An important feature of the original ones is that they are guarantee-oriented. The performance of these algorithms has been measured through simulations which analyze the behavior of the algorithms under two main load hypotheses: static loads and dynamic loads. The simulation results present practical bounds and a comparative study of the loads that they are able to guarantee, context switches and cpu utilization. Copyright © 1997 Elsevier Science Ltd
Sign-in/Register to access full text options 
Free) 
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 call
