Preemptive scheduling in overloaded systems.

DOI10.1016/S0022-0000(03)00070-9MaRDI QIDQ1401985zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, J. Noga, Jiří Sgall, Rob van Stee, Nodari Vakhania, Leah Epstein, Tomáš 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)

Recommendations

• scientific article; zbMATH DE number 2086672
• scientific article; zbMATH DE number 1263237
• Bounding the Power of Preemption in Randomized Scheduling
• Online flow time scheduling in the presence of preemption overhead
• On-line scheduling to maximize task completions.

Cites work

• scientific article; zbMATH DE number 50649 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1796988 (Why is no real title available?)
• scientific article; zbMATH DE number 2086672 (Why is no real title available?)
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Competitive deadline scheduling via additional or faster processors
• On the competitiveness of on-line real-time task scheduling
• Online algorithms. The state of the art
• Online scheduling with partial job values: does timesharing or randomization help?

Cited in

(9)

• Online scheduling with general cost functions
• An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
• On-line scheduling to maximize task completions.
• ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• On packet scheduling with adversarial jamming and speedup
• scientific article; zbMATH DE number 2086672 (Why is no real title available?)
• Lowest priority first based feasibility analysis of real-time systems
• Improved competitive algorithms for online scheduling with partial job values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401985)