sam@lfcs.edinburgh.ac.uk (S Manoharan) (04/04/91)
What are they, and why are they called so? I haven't found a concrete definition anywhere. Two possible explanations crop up: 1. Greedy schedule = List schedule. Greedy, since no processor remins idle when there is a task that it can execute. 2. Greedy schedule = A schedule that uses branch-and-bound search. Greedy, for it looks for the best of all the alternatives. Anyone out there to enlighten me? Thanks in advance ... Manoharan. -- =========================== MODERATOR ============================== Steve Stevenson {steve,fpst}@hubcap.clemson.edu Department of Computer Science, comp.parallel Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell