The Community for Technology Leaders
Green Image
ABSTRACT
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. Since the partitioning problem is easily seen to be 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: It is shown that any set of sporadic tasks that can be partitioned among the processors of an m{\hbox{-}}{\rm processor} identical multiprocessor platform will be partitioned by this algorithm on an m{\hbox{-}}{\rm processor} platform in which each processor is (3-1/m) times as fast.
INDEX TERMS
Sporadic tasks, partitioned scheduling, multiprocessors, resource augmentation.
CITATION
Nathan Fisher, Sanjoy Baruah, "The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems", IEEE Transactions on Computers, vol. 55, no. , pp. 918-923, July 2006, doi:10.1109/TC.2006.113
97 ms
(Ver 3.1 (10032016))