2012 24th Euromicro Conference on Real-Time Systems (2006)
July 5, 2006 to July 7, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECRTS.2006.30
Theodore P. Baker , Florida State University
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 with static-priority scheduling on each individual processor. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is not optimal. A quantitative characterization of its worst-case performance is provided in terms of sufficient conditions and resource augmentation approximation bounds. The partitioning algorithm is also evaluated over randomly generated task systems.
Theodore P. Baker, Sanjoy Baruah, Nathan Fisher, "The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities", 2012 24th Euromicro Conference on Real-Time Systems, vol. 00, no. , pp. 118-127, 2006, doi:10.1109/ECRTS.2006.30