[comp.parallel] Mapping/Scheduling

sam@lfcs.edinburgh.ac.uk (S. Manoharan) (05/01/89)

Lookig for references on Mapping/Scheduling. All sorts of help
will be appreciated.

PS: I was pondering over the difference between Scheduling and Mapping:-

"Given a set of computational tasks and a set of processors,
01. Scheduling addresses the problem of when to execute a task
02. Mapping addresses the problem of where to execute a task."

"The scheduling problem is, in general, concerned with time;
whereas the mapping problem is concerned with the resources."

Am I correct?

Voice: 031-667 5076                          S. Manoharan
Janet: sam@uk.ac.ed.lfcs                     Dept of Computer Science
Uucp : ..!mcvax!ukc!lfcs!sam                 University of Edinburgh
Arpa : sam%lfcs.ed.ac.uk@nsfnet-relay.ac.uk  Edinburgh EH9 3JZ    UK.

bjornl@tarpon.tds.kth.se (Bj|rn Lisper) (05/03/89)

In article <5348@hubcap.clemson.edu> sam@lfcs.edinburgh.ac.uk (S. Manoharan)
writes:
%PS: I was pondering over the difference between Scheduling and Mapping:-

%"Given a set of computational tasks and a set of processors,
%01. Scheduling addresses the problem of when to execute a task
%02. Mapping addresses the problem of where to execute a task."

%"The scheduling problem is, in general, concerned with time;
%whereas the mapping problem is concerned with the resources."

%Am I correct?

Scheduling usually assumes that the resources are given. Typically you ask
"given N processors and T tasks with some ordering constraints, execution
times etc., how can they be scheduled on the N processors as to minimize
the total execution time?

Thus, scheduling in general is concerned with both where and when a task is
to be executed.

Bjorn Lisper