A new fair scheduling algorithm for periodic tasks on multiprocessors |
| |
Authors: | Heeheon Kim Yookun Cho |
| |
Affiliation: | Seoul National University, School of Computer Science and Engineering, 599 Gwanak-ro, Gwanak-gu, Seoul, 151-742, Republic of Korea |
| |
Abstract: | We present a new scheduling algorithm, called PL that is work-conserving and in terms of schedulability, optimal on multiprocessors for a synchronous periodic task set. The PL algorithm is a laxity based algorithm and ensures execution of a task with approximate proportional fairness at each task's period. Existing optimal algorithms on multiprocessors may cause excessive scheduling decisions and preemptions or may not be applied in a discrete environment. The proposed algorithm can be applied in a discrete environment and reduce the number of scheduling decisions and preemptions compared with a Pfair algorithm. |
| |
Keywords: | Real-time systems Periodic tasks Multiprocessors Least laxity first algorithm Pfair schedules |
本文献已被 ScienceDirect 等数据库收录! |
|