The partitioned dynamic-priority scheduling of sporadic task systems |
| |
| Authors: | Sanjoy K. Baruah Nathan Wayne Fisher |
| |
| Affiliation: | (1) Department of Computer Science, University of North Carolina, Sitterson Hall, CB#3175, Chapel Hill, NC 27599, USA |
| |
| Abstract: | A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation. |
| |
| Keywords: | Sporadic tasks Partitioned scheduling Multiprocessors |
| 本文献已被 SpringerLink 等数据库收录！ |
