Preemptive scheduling in overloaded systems.

DOI10.1016/S0022-0000(03)00070-9zbMath1054.68015OpenAlexW2075653507MaRDI QIDQ1401985

Rob van Stee, Marek Chrobak, Nodari Vakhania, John Noga, Jiří Sgall, Leah Epstein, Tomas Tichý

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00070-9

zbMATH Keywords

SchedulingOnline algorithmsDeadlineResource augmentation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Improved competitive algorithms for online scheduling with partial job values ⋮ Lowest priority first based feasibility analysis of real-time systems ⋮ Online competitive algorithms for maximizing weighted throughput of unit jobs ⋮ On packet scheduling with adversarial jamming and speedup ⋮ ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO ⋮ Unnamed Item

Cites Work

• Online algorithms. The state of the art
• On the competitiveness of on-line real-time task scheduling
• Online scheduling with partial job values: does timesharing or randomization help?
• Competitive deadline scheduling via additional or faster processors
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preemptive scheduling in overloaded systems.