Utilization bounds for EDF scheduling on real-time multiprocessor systems
From MaRDI portal
Publication:1770566
DOI10.1023/B:TIME.0000033378.56741.14zbMath1067.68025OpenAlexW2019745154MaRDI QIDQ1770566
José María López, José Luis Díaz, Daniel García
Publication date: 7 April 2005
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:time.0000033378.56741.14
partitioningmultiprocessor schedulingbin-packing problemearliest deadline first schedulingmultiprocessor utilization bounds
Related Items (13)
On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling ⋮ Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions ⋮ The partitioned dynamic-priority scheduling of sporadic task systems ⋮ Provably good multiprocessor scheduling with resource sharing ⋮ CPU scheduling and memory management for interactive real-time applications ⋮ Global EDF scheduling for parallel real-time tasks ⋮ Analysis and implementation of the multiprocessor bandwidth inheritance protocol ⋮ 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 ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Cluster scheduling for real-time systems: utilization bounds and run-time overhead ⋮ Robust Allocation and Scheduling Heuristics for Dynamic, Distributed Real-Time Systems
This page was built for publication: Utilization bounds for EDF scheduling on real-time multiprocessor systems