|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| T. Shepard, J.A.M. Gagne, "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 669-677, July, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/32.83903, author = {T. Shepard and J.A.M. Gagne}, title = {A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems}, journal ={IEEE Transactions on Software Engineering}, volume = {17}, number = {7}, issn = {0098-5589}, year = {1991}, pages = {669-677}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.83903}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems IS - 7 SN - 0098-5589 SP669 EP677 EPD - 669-677 A1 - T. Shepard, A1 - J.A.M. Gagne, PY - 1991 KW - 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 VL - 17 JA - IEEE Transactions on Software Engineering ER - | |||
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.
[1] S. R. Faulk and D. L. Parnas, "On synchronization in hard-real-time systems,"Commun. ACMvol. 31, no. 3, Mar. 1988.
[2] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[3] J. A. M. Gagné"A pre-run-time scheduling algorithm with application to the CF-188 fighter aircraft," Master's thesis, Royal Military College of Canada, May 1989.
[4] W. M. Gentleman, "Multiprocessor realtime applications," inProc. Int. Spec. Symp. Design Appl. Parallel Dig. Process., Apr. 1988.
[5] E. L. Lawler and D. W. Wood, "Branch and bound methods: A survey,"Oper. Res.vol. 14, pp. 699-719, 1966.
[6] G. J. Li and B. W. Wah, "Computational efficiency of parallel approximate branch and bound algorithms,"IEEE Proc. Int. Conf. Parallel Proces., pp. 473-480, 1984.
[7] E. Margulis, "On scheduling in hard real time monitoring systems," Master's thesis, Dept. Computer Science, Queens Univ., Apr. 1989.
[8] C. D. Shepard and J. A. M. Gagné, "A model of the F-18 mission computer software for pre-run-time scheduling," inProc. IEEE 10 Int. Conf. Distri. Comp. Syst., Paris, France, May 1990.
[9] J. Xu and D. L. Parnas, "Scheduling processes with release times, deadlines, precedence and exclusion relations,"IEEE Trans. Software Eng., vol. 16, pp. 360-368, Mar. 1990.