The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities

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.

• Type: Conference
• Year: 2006
• Where: ECRTS
• Authors: Nathan Fisher, Sanjoy K. Baruah, Theodore P. Baker
• Keywords: ECRTS 2006, Identical Multiprocessor Platform, Partitioning Algorithm, Polynomial-time Algorithm