Schedulability analysis of global scheduling algorithms on multiprocessor platforms

  • BERTOGNA, Marko
  • LIPARI, Giuseppe
  • M. Cirinei
Publication date
January 2009

Abstract

This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of ...

Extracted data

Related items

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
  • Bertogna, Marko
  • M., Cirinei
  • G., Lipari
January 2009

This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...

New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors
  • BERTOGNA, Marko
  • M. CIRINEI
  • G. LIPARI
January 2005

In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or ...

Improved schedulability analysis of EDF on multiprocessor platforms
  • Bertogna, Marko
  • M., Cirinei
  • G., Lipari
January 2005

Multiprocessor hardware platforms are now being considered for embedded systems, due to their high c...

We use cookies to provide a better user experience.