Title :
A multiprocessor implementation of the total bandwidth server
Author :
Baruch, S. ; Lipari, Giuseppe
Author_Institution :
North Carolina Univ., Chapel Hill, NC, USA
Abstract :
Summary form only given. If a periodic task system is scheduled upon an identical multiprocessor platform using the earliest deadline first scheduling algorithm, it is known that the "schedulable utilization" - the largest bound such that any periodic task system with cumulative utilization no larger than this bound is guaranteed to be successfully scheduled - is strictly less than the capacity of the platform. The issue of using the excess processing capacity (the difference between the platform capacity and the schedulable utilization) is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.
Keywords :
bandwidth allocation; multiprocessing systems; processor scheduling; real-time systems; resource allocation; aperiodic jobs; earliest deadline first scheduling algorithm; identical multiprocessor platform; multiprocessor implementation; multiprocessor scheduling; periodic task system; platform capacity; real-time systems; schedulable utilization; total bandwidth server; Bandwidth; Distributed processing; Job design; Multiprocessing systems; Processor scheduling; Real time systems; Scheduling algorithm; Terminology;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
Print_ISBN :
0-7695-2132-0
DOI :
10.1109/IPDPS.2004.1302955