A new algorithm for scheduling periodic, real-time tasks |
| |
Authors: | Joseph Y -T Leung |
| |
Affiliation: | (1) Computer Science Program, University of Texas at Dallas, 75080 Richardson, TX, USA |
| |
Abstract: | We consider the problem of preemptively scheduling a set of periodic, real-time tasks on a multiprocessor computer system. We give a new scheduling algorithm, the so-called Slack-Time Algorithm, and show that it is more effective than the known Deadline Algorithm. We also give an (exponential-time) algorithm to decide if a task system is schedulable by the Slack-Time or the Deadline Algorithm. The same algorithm can also be used to decide if a task system is schedulable by any given fixed-priority scheduling algorithm. This resolves an open question posed by Leung and Whitehead. Finally, it is shown that the problem of deciding if a task system is schedulable by the Slack-Time, the Deadline, or any given fixed-priority scheduling algorithm is co-NP-hard for each fixedm. |
| |
Keywords: | Periodic Real-time tasks Multiprocessor system Schedulability co-NP-hard |
本文献已被 SpringerLink 等数据库收录! |
|