Real-Time k-bounded Preemptive Scheduling
From MaRDI portal
Publication:5232552
DOI10.1137/1.9781611974317.11zbMATH Open1429.68031OpenAlexW2294519362MaRDI QIDQ5232552
Baruch Schieber, Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir
Publication date: 12 September 2019
Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974317.11
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems ⋮ Unnamed Item ⋮ Bounding the Power of Preemption in Randomized Scheduling ⋮ REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
This page was built for publication: Real-Time k-bounded Preemptive Scheduling
