A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees

Authors:
Hennadiy Leontyev;James H. Anderson
Affiliations:
-;-
Venue:
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Year:
2008

Citing 0
Cited 7

Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Proceedings of the 20th International Conference on Real-Time and Network Systems
Exact and approximate supply bound function for multiprocessor periodic resource model: unsynchronized servers

ACM SIGBED Review
Deadline and activation time assignment for partitioned real-time application on multiprocessor reservations

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multiprocessor scheduling scheme is presented forsupporting hierarchical containers that encapsulate spo-radic soft and hard real-time tasks. In this scheme, eachcontainer is allocated a specified bandwidth, which it usesto schedule its children (some of which may also be con-tainers). This scheme is novel in that, with only soft real-time tasks, no utilization loss is incurred when provisioningcontainers, even in arbitrarily deep hierarchies. Presentedexperiments show that the proposed scheme performs wellcompared to conventional real-time scheduling techniquesthat do not provide container isolation.