A non-preemptive scheduling algorithm for soft real-time systems

DOI10.1016/J.COMPELECENG.2006.04.002zbMath1109.68128OpenAlexW2154684758MaRDI QIDQ865712

Robert Akl, Wen-Ming Li, Krishna M. Kavi

Publication date: 20 February 2007

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc30824/

zbMATH Keywords

soft real-time systemsbest-effort schedulingearliest deadline first (edf)group-edfnon-preemptive real-time schedulingshortest job first (sjf)

Mathematics Subject Classification ID

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

Related Items (3)

Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks ⋮ A group priority earliest deadline first scheduling algorithm ⋮ On controlling prioritized discrete event systems with real-time constraints

This page was built for publication: A non-preemptive scheduling algorithm for soft real-time systems