On non-preemptive scheduling of recurring tasks using inserted idle times
From MaRDI portal
Publication:1891163
DOI10.1006/inco.1995.1028zbMath0828.68028OpenAlexW1993462908MaRDI QIDQ1891163
Muralidhar K. Venkatrao, Rodney R. Howell
Publication date: 28 May 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0f1f4788f08a220a6eba98e937cec4f53de97bf9
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items
The non-preemptive scheduling of periodic tasks upon multiprocessors, SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time, Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job, Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms