Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems

  • Vincenzo Bonifaci
  • Alberto Marchetti-Spaccamela
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6347)

Abstract

We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving an open problem in the area of multiprocessor real-time scheduling [S. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Vincenzo Bonifaci
    • 1
  • Alberto Marchetti-Spaccamela
    • 2
  1. 1.Max-Planck Institut für InformatikSaarbrückenGermany
  2. 2.Sapienza Università di RomaRomeItaly

Personalised recommendations