Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uflorida!gatech!hubcap!bjornl
From: bjornl@tarpon.tds.kth.se (Bj|rn Lisper)
Newsgroups: comp.parallel
Subject: Re: Mapping/Scheduling
Message-ID: <5383@hubcap.clemson.edu>
Date: 2 May 89 19:18:27 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 22
Approved: parallel@hubcap.clemson.edu

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