A PRE-RUN-TIME SCHEDULING ALGORITHM FOR HARD REAL-TIME SYSTEMS - COMMENT

In Shepard and Gagne [1], a branch-and-bound implicit enumeration algo rithm is described whose purpose is to generate a feasible schedule, i f any, for each processor on a multiprocessing node running hard real- time processes. The optimization criterion is to minimize process late ness 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 reaso n why the algorithm might fail.