Title :
Guaranteeing Pfair supertasks by reweighting
Author :
Holman, Philip ; Anderson, James H.
Author_Institution :
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
Abstract :
We reconsider the "supertask" approach, in which a set of Pfair tasks is scheduled as a single task. We define a "safe" weight threshold for a given supertask in a multiprocessor system with either hard or soft deadlines and either strict or relaxed rate constraints.
Keywords :
processor scheduling; resource allocation; Pfair scheduling; Pfair tasks; multiple processors; multiprocessor system; scheduled; scheduling periodic tasks; supertask; Actuators; Computer science; Costs; Flow graphs; Processor scheduling; Scheduling algorithm;
Conference_Titel :
Real-Time Systems Symposium, 2001. (RTSS 2001). Proceedings. 22nd IEEE
Print_ISBN :
0-7695-1420-0
DOI :
10.1109/REAL.2001.990612
