Preemptive scheduling in overloaded systems.
From MaRDI portal
Publication:1401985
DOI10.1016/S0022-0000(03)00070-9zbMATH Open1054.68015OpenAlexW2075653507MaRDI QIDQ1401985FDOQ1401985
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online algorithms. The state of the art
- On the competitiveness of on-line real-time task scheduling
- Title not available (Why is that?)
- Online scheduling with partial job values: does timesharing or randomization help?
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Title not available (Why is that?)
- Competitive deadline scheduling via additional or faster processors
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Improved competitive algorithms for online scheduling with partial job values
- Title not available (Why is that?)
- Title not available (Why is that?)
- On packet scheduling with adversarial jamming and speedup
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
- On-line scheduling to maximize task completions.
- Lowest priority first based feasibility analysis of real-time systems
- An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
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)
