Preemptive priority-based scheduling: an appropriate engineering approach
Alan Burns · 1995
Introduction Recent developments in the analysis of fixed-priority preemptive scheduling have made significant enhancements to the models introduced by Lui and Layland in their seminal 1973 paper [33]. These developments, taken together, now represent a body of analysis that forms the basis for an engineering approach to the design, verification, and implementation of hard real-time systems. In this chapter we review much of this analysis in order to support the thesis that safety critical realtime systems can, and should, be built using these techniques. Preemptive priority-based scheduling prescribes a run-time environment in which tasks, with a priority attribute, are dispatched in priority order. Priorities are, essentially, static. Processes are either runnable, in which case they are held on a notional (priority-ordered) run queue; delayed, in which case they are held Sec. 10.1 Introduction 223 on a notional delay queue; or suspended, in which