Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site harvard.ARPA
Path: utzoo!watmath!clyde!bonnie!akgua!whuxlm!whuxl!houxm!vax135!cornell!uw-beaver!tektronix!decvax!genrad!panda!talcott!harvard!brown
From: brown@harvard.ARPA (Bob Brown)
Newsgroups: net.wanted
Subject: Parallel Processing Problem
Message-ID: <354@harvard.ARPA>
Date: Thu, 31-Jan-85 11:17:09 EST
Article-I.D.: harvard.354
Posted: Thu Jan 31 11:17:09 1985
Date-Received: Thu, 7-Feb-85 02:08:33 EST
Distribution: net
Organization: Aiken Computation Laboratory, Harvard
Lines: 23

To all persons interested in parallel computation:

	I am looking for pointers to information (people or published material)
about research (both theoretical and experimental) concerning parallel
computation on finite-processor, infinite process machines.  In particular,
I am interested in research on the topic of processor scheduling in cases
where the number of processes exceeds the number of processors.

	I want to address the problem of establishing an a priori ranking
of processes within a parallel program, so that a compiler can decide which
processes warrant their own processors and which processes are trivial
enough to time-slice on the current processor.

	I appreciate any pointers you can give me.  Please address replies
to elvy@harvard.arpa or harvard!elvy, rather than to the sender of this item.

Thanks,
Marc
-- 
			bob brown

			UUCP:  allegra!harvard!brown
			ARPA:  brown@harvard