DocumentCode
2348321
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
fYear
2001
fDate
3-6 Dec. 2001
Firstpage
203
Lastpage
212
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium, 2001. (RTSS 2001). Proceedings. 22nd IEEE
Print_ISBN
0-7695-1420-0
Type
conf
DOI
10.1109/REAL.2001.990612
Filename
990612
Link To Document