Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!usc!ucsd!mvb.saic.com!ncr-sd!ncrcae!hubcap!fpst
From: sam@lfcs.edinburgh.ac.uk (S Manoharan)
Newsgroups: comp.parallel
Subject: Greedy schedules ....
Message-ID: <1991Apr4.133608.28559@hubcap.clemson.edu>
Date: 4 Apr 91 10:33:26 GMT
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Reply-To: S Manoharan <sam@lfcs.edinburgh.ac.uk>
Organization: Clemson University
Lines: 19
Approved: parallel@hubcap.clemson.edu
Organisation: Dept of Computer Science, University of Edinburgh

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