Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems

  • Authors:
  • Sanjoy Baruah;Nathan Fisher

  • Affiliations:
  • The University of North Carolina at Chapel Hill;Wayne State University

  • Venue:
  • OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The multiprocessor Deadline-Monotonic scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.