A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

  • Authors:
  • Hennadiy Leontyev;James H. Anderson

  • Affiliations:
  • Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175;Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175

  • Venue:
  • Real-Time Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A multiprocessor scheduling scheme is presented for supporting hierarchical containers that encapsulate sporadic soft and hard real-time tasks. In this scheme, each container is allocated a specified bandwidth, which it uses to schedule its children (some of which may also be containers). This scheme is novel in that, with only soft real-time tasks, no utilization loss is incurred when provisioning containers, even in arbitrarily deep hierarchies. Presented experiments show that the proposed scheme performs well compared to conventional real-time scheduling techniques that do not provide container isolation.