A new fair scheduling algorithm for periodic tasks on multiprocessors

• Published in: Information processing letters Vol. 111; no. 7; pp. 301 - 309
• Main Authors: Kim, Heeheon, Cho, Yookun
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.03.2011; Elsevier; Elsevier Sequoia S.A
• Subjects: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Approximation; Computer science; control theory; systems; Computer systems performance. Reliability; Decisions; Exact sciences and technology; Least laxity first algorithm; Miscellaneous; Multiprocessing; Multiprocessor; Multiprocessors; Optimization; Optimization algorithms; Periodic tasks; Pfair schedules; Real-time systems; Scheduling; Scheduling algorithms; Software; Studies; Synchronous; Tasks; Theoretical computing; Real-time systems; Multiprocessors; Pfair schedules; Least laxity first algorithm; Periodic tasks; Computer theory; Optimal algorithm; Task scheduling; Scheduling; Real time system; Decision; Multiprocessor; Schedule; Information processing; Environment; Algorithm analysis
• ISSN: 0020-0190; 1872-6119
• DOI: 10.1016/j.ipl.2010.12.007

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. ► We present a new scheduling algorithm on multiprocessors for a periodic task set. ► The algorithm is work-conserving and optimal in terms of schedulability. ► The algorithm can reduce the number of preemptions compared with a Pfair algorithm.