A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees

Download Now
Provided by: University of North Carolina
Topic: Hardware
Format: PDF
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 paper 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.
Download Now

Find By Topic