This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"
September 1997 (vol. 23 no. 9)
pp. 599-600

Abstract—In Shepard and Gagne [1], 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.

[1] T. Shepard and M. Gagne, “A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems,” IEEE Trans. Software Eng., vol. 17, no. 7, pp. 669-677, July 1991.
[2] T. Shepard and M. Gagne, A Model of the F-18 Mission Computer Software for Preruntime Scheduling Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 62-69, 1990.
[3] J. Xu, “Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations,” IEEE Trans. Software Eng., vol. 19, no. 2, pp. 139-154, Feb. 1993.

Index Terms:
Pre-run-time scheduling, hard real-time systems, branch and bound scheduling algorithm, multiprocessors, precedence constraints.
Citation:
Tarek F. Abdelzaher, Kang G. Shin, "Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"," IEEE Transactions on Software Engineering, vol. 23, no. 9, pp. 599-600, Sept. 1997, doi:10.1109/32.629495
Usage of this product signifies your acceptance of the Terms of Use.