Sciweavers

Share
ECRTS
2008
IEEE

A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees

10 years 10 months ago
A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees
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 realtime 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.
Hennadiy Leontyev, James H. Anderson
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where ECRTS
Authors Hennadiy Leontyev, James H. Anderson
Comments (0)
books