A Laxity Based On-Line Real-Time Scheduling Algorithm for Multiprocessor Systems


The KIPS Transactions:PartA, Vol. 16, No. 6, pp. 437-442, Dec. 2009
10.3745/KIPSTA.2009.16.6.437,   PDF Download:

Abstract

For multiprocessor systems, Earliest Deadline First (EDF) based on deadline and Least Laxity First (LLF) based on laxity are not suitable for practical environment since EDF has low schedulability and LLF has high context switching overhead. As a combining of EDF and LLF to improve the performance, Earliest Deadline Zero Laxity (EDZL) was proposed. EDZL is basically the same as EDF. But if the laxity of a task becomes zero, its priority is promoted to the highest level. In this paper, we propose Least Laxity Zero Laxity (LLZL) which is based on LLF. But context switching is allowed only if the laxity of a task on rady queue becomes zero. Simulation results show that LLZL has high schedulability approaching to LLF and low context switching overhead similar to EDF. In comparison with EDZL, LLZL has better performance in both of schedulability and context switching overhead.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. E. Cho and Y. S. Kim, "A Laxity Based On-Line Real-Time Scheduling Algorithm for Multiprocessor Systems," The KIPS Transactions:PartA, vol. 16, no. 6, pp. 437-442, 2009. DOI: 10.3745/KIPSTA.2009.16.6.437.

[ACM Style]
Kyu Eok Cho and Yong Seok Kim. 2009. A Laxity Based On-Line Real-Time Scheduling Algorithm for Multiprocessor Systems. The KIPS Transactions:PartA, 16, 6, (2009), 437-442. DOI: 10.3745/KIPSTA.2009.16.6.437.