Comment on "A pre-run-time scheduling algorithm for hard real-time systems"
- 1 September 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 23 (9) , 599-600
- https://doi.org/10.1109/32.629495
Abstract
In Shepard and Gagne (1991), a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness defined as the difference between the process completion time and deadline. We show in this correspondence that this algorithm does not always succeed in finding a feasible solution, and describe the reason why the algorithm might fail.Keywords
This publication has 3 references indexed in Scilit:
- A model of the F18 mission computer software for pre-run-time schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relationsIEEE Transactions on Software Engineering, 1993
- A pre-run-time scheduling algorithm for hard real-time systemsIEEE Transactions on Software Engineering, 1991