A tighter extra-resource analysis of online deadline scheduling
From MaRDI portal
Publication:1781800
DOI10.1007/s10878-005-6854-6zbMath1107.90021OpenAlexW1978818753WikidataQ58062997 ScholiaQ58062997MaRDI QIDQ1781800
Tusen-Wan Johnny Ngan, Tak-Wah Lam, Kar-Keung To
Publication date: 8 June 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/48415
competitive analysisonline algorithmsearliest deadline firstextra-resource analysisfirm deadline scheduling
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Extra processors versus future information in optimal deadline scheduling
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- Applying extra-resource analysis to load balancing.
- Scheduling Broadcasts with Deadlines
- Speed is as powerful as clairvoyance
- Maximizing job completions online
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Scheduling in the dark
- Algorithms - ESA 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A tighter extra-resource analysis of online deadline scheduling