A pre-run-time scheduling algorithm for hard real-time systems

Author

Shepard, Terry ; Gagné, J. A Martin

Author_Institution

Dept. of Electr. & Comput. Eng., R. Mil. Coll. of Canada, Kingston, Ont., Canada

Volume

17

Issue

7

fYear

1991

fDate

7/1/1991 12:00:00 AM

Firstpage

669

Lastpage

677

Abstract

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

Keywords

aerospace computing; multiprocessing systems; real-time systems; scheduling; F-18 mission computer operational flight program; arbitrary precedence; branch-and-bound implicit enumeration technique; computation times; deadlines; exclusion constraints; feasible schedule; hard real-time systems; multiprocessor applications; pre-run-time scheduling algorithm; preemptable processes; process sequencing; release times; timing specifications; Algorithm design and analysis; Application software; Processor scheduling; Real time systems; Runtime; Scheduling algorithm; Senior members; Software algorithms; Software maintenance; Timing;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.83903

Filename

83903