Schedulability issues for EDZL scheduling on real-time multiprocessor systems |
| |
| Authors: | Yi-Hsiung Chao Kwei-Jay Lin |
| |
| Affiliation: | a Department of Computer Science and Information Engineering, National Taiwan Normal University, Taiwan, ROC
b Department of Electrical Engineering and Computer Science, University of California, Irvine, USA |
| |
| Abstract: | EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1−1/e)≈0.6321m, where e≈2.718 is the Euler's number. |
| |
| Keywords: | Scheduling Real-time scheduling EDF LLF EDZL Schedulability analysis |
| 本文献已被 ScienceDirect 等数据库收录！ |
