|
|||||
|
|
On the complexity of fixed-priority scheduling of periodic, real-time tasks |
|
| Authors: | Joseph Y -T Leung |
| Affiliation: | Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201, U.S.A. Department of Computer Science, Queens College Flushing, New York, NY 11367, U.S.A. |
| Abstract: | We consider the complexity of determining whether a set of periodic, real-time tasks can be scheduled on m  1 identical processors with respect to fixed-priority scheduling. It is shown that the problem is NP-hard in all but one special case. The complexity of optimal fixed-priority scheduling algorithm is also discussed. |
| Keywords: | Periodic Real-time Task Fixed-priority Scheduling Optimal Scheduling Algorithms Multiprocessors System NP-completeness |
| 本文献已被 ScienceDirect 等数据库收录！ | |