摘要 : This paper presents a comprehensive comparison between job-level dynamic scheduling algorithms on real-time multiprocessor environments using simulation. Earliest Deadline First (EDF) and Least Laxity First (LLF) are two well-know... 展开 This paper presents a comprehensive comparison between job-level dynamic scheduling algorithms on real-time multiprocessor environments using simulation. Earliest Deadline First (EDF) and Least Laxity First (LLF) are two well-known and extensively applied dynamic scheduling algorithms which have been proved to be optimal on uniprocessor systems. However, neither is shown to be optimal on multiprocessors. Many researches have already been done on aforementioned algorithms, but to the best of our knowledge, none of which has compared the efficiency of the two algorithms under similar conditions. Perhaps the main reason is that LLF algorithm is fully dynamic and impractical to implement. In this research, we have used a practical version of LLF which is called the Modified Least Laxity First (MLLF) algorithm instead of the traditional LLF and have compared its performance with the EDF algorithm. The MLLF is a job-level dynamic and optimal strategy on uniprocessor systems, similar to the EDF algorithm. We have investigated the performance of EDF and MLLF based on load factor from many different aspects. 收起