26th IEEE International Real-Time Systems Symposium (RTSS'05) (2005)
Dec. 5, 2005 to Dec. 8, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2005.40
Sanjoy Baruah , University of North Carolina at Chapel Hill
Nathan Fisher , University of North Carolina at Chapel Hill
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: it is shown that any set of sporadic tasks that can be partitioned among the processors of an m-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is (4 - 2/m) times as fast.
N. Fisher and S. Baruah, "The Partitioned Multiprocessor Scheduling of Sporadic Task Systems," 26th IEEE International Real-Time Systems Symposium (RTSS'05)(RTSS), Miami, Florida, 2005, pp. 321-329.