A multiprocessor implementation of the total bandwidth server

  • Sanjoy Baruah
  • , Giuseppe Lipari

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 in algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.

Original languageEnglish
Title of host publicationProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Pages541-550
Number of pages10
StatePublished - 2004
EventProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) - Santa Fe, NM, United States
Duration: Apr 26 2004Apr 30 2004

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Volume18

Conference

ConferenceProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Country/TerritoryUnited States
CitySanta Fe, NM
Period04/26/0404/30/04

Keywords

  • Aperiodic jobs
  • Earliest deadline first
  • Multiprocessor scheduling
  • Periodic task systems
  • Real-time systems

Fingerprint

Dive into the research topics of 'A multiprocessor implementation of the total bandwidth server'. Together they form a unique fingerprint.

Cite this