A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees
From MaRDI portal
Publication:1039308
DOI10.1007/S11241-009-9076-7zbMath1185.68115OpenAlexW2478511932MaRDI QIDQ1039308
James H. Anderson, Hennadiy Leontyev
Publication date: 27 November 2009
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-009-9076-7
Related Items (7)
Generalized tardiness bounds for global multiprocessor scheduling ⋮ Cache-aware compositional analysis of real-time multicore virtualization platforms ⋮ Multiprocessor extensions to real-time calculus ⋮ Globally scheduled real-time multiprocessor systems with GPUs ⋮ Compositional multiprocessor scheduling: the GMPR interface ⋮ A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees ⋮ The limited-preemptive feasibility of real-time tasks on uniprocessors
Uses Software
Cites Work
- Group-based Pfair scheduling
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees
- Tardiness bounds under global EDF scheduling on a multiprocessor
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees