By Topic

A multiprocessor implementation of the total bandwidth server

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Baruch, S. ; North Carolina Univ., Chapel Hill, NC, USA ; Lipari, G.

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.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004