Real-time scheduling with resource sharing on heterogeneous multiprocessors
From MaRDI portal
Publication:2251407
DOI10.1007/s11241-013-9195-zzbMath1291.68061OpenAlexW2033524130MaRDI QIDQ2251407
Björn Andersson, Gurulingesh Raravi
Publication date: 14 July 2014
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.22/5420
Related Items (2)
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors ⋮ State feedback control of real-time discrete event systems with infinite states
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Provably good multiprocessor scheduling with resource sharing
- Approximation algorithms for scheduling unrelated parallel machines
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- Scheduling subject to resource constraints: Classification and complexity
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
- Partitioned EDF scheduling on a few types of unrelated multiprocessors
- Partitioned EDF scheduling: a closer look
- The partitioned dynamic-priority scheduling of sporadic task systems
- Improved approximation schemes for scheduling unrelated parallel machines
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
This page was built for publication: Real-time scheduling with resource sharing on heterogeneous multiprocessors