Title :
The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
Author :
Baruah, Sanjoy ; Fisher, Nathan
Author_Institution :
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
fDate :
7/1/2006 12:00:00 AM
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-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is (3-(1/m)) times as fast.
Keywords :
computational complexity; multiprocessing systems; processor scheduling; resource allocation; NP-hard partitioning problem; deadline-constrained sporadic task systems; m-processor identical multiprocessor platform; partitioned multiprocessor scheduling; period parameter; polynomial-time algorithm; relative-deadline parameter; resource augmentation; Algorithm design and analysis; Costs; Law; Legal factors; Multiprocessing systems; Partitioning algorithms; Polynomials; Processor scheduling; Resumes; Scheduling algorithm; Sporadic tasks; multiprocessors; partitioned scheduling; resource augmentation.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2006.113
