MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
From MaRDI portal
Publication:1330422
DOI10.1016/0304-3975(94)90165-1zbMath0938.68549OpenAlexW2044260124MaRDI QIDQ1330422
Publication date: 21 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90165-1
Related Items
Maximizing job benefits on-line ⋮ A competitive algorithm for throughput maximization on identical machines ⋮ A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Energy Efficient Deadline Scheduling in Two Processor Systems ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ A general framework for handling commitment in online throughput maximization ⋮ MOCA ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Scheduling parallel tasks with individual deadlines
Cites Work
- Unnamed Item
- On fixed priority scheduling, offsets and co-prime task periods
- Competitive snoopy caching
- Scheduling periodically occurring tasks on multiple processors
- On the competitiveness of on-line real-time task scheduling
- On the power of randomization in on-line algorithms
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
