The Community for Technology Leaders
Green Image
<p>Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.</p>
hard real-time systems; pre-run-time scheduling algorithm; process sequencing; multiprocessor applications; preemptable processes; release times; computation times; deadlines; arbitrary precedence; exclusion constraints; branch-and-bound implicit enumeration technique; feasible schedule; timing specifications; F-18 mission computer operational flight program; aerospace computing; multiprocessing systems; real-time systems; scheduling

T. Shepard and J. Gagne, "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 669-677, 1991.
92 ms
(Ver 3.3 (11022016))