Path: utzoo!attcan!uunet!jarthur!usc!zaphod.mps.ohio-state.edu!math.lsa.umich.edu!math.lsa.umich.edu!emv
From: job00542@uxa.cso.uiuc.edu
Newsgroups: comp.archives
Subject: [comp.sys.sequent] Re: Timing parallel programs on Balance
Message-ID: <1990Jun28.212942.19953@math.lsa.umich.edu>
Date: 28 Jun 90 21:29:42 GMT
Sender: emv@math.lsa.umich.edu (Edward Vielmetti)
Reply-To: job00542@uxa.cso.uiuc.edu
Followup-To: comp.sys.sequent
Organization: University of Michigan, Department of Mathematics
Lines: 19
Approved: emv@math.lsa.umich.edu (Edward Vielmetti)
X-Original-Newsgroups: comp.sys.sequent

Archive-name: gang-scheduler/28-Jun-90
Original-posting-by: job00542@uxa.cso.uiuc.edu
Original-subject: Re: Timing parallel programs on Balance
Archive-site: maddog.llnl.gov [128.115.10.1]
Reposted-by: emv@math.lsa.umich.edu (Edward Vielmetti)


/* Written 10:21 pm  Jun 27, 1990 by hafner@ordin.cs.wisc.edu in uxa.cso.uiuc.edu:comp.sys.sequent */

> Gang scheduling is a way to utilize a group of processors without
> any interference from the OS.  Essentially, the processors are removed
> from the "pool" of free processors and completely assigned to the
> user.

Thanks!  Luckily, I found a gang scheduler for the Balance-- written by Dr.
Eugene Brooks and available via anonymous ftp to maddog.llnl.gov.  I haven't
tried it yet, but it looks promising.

James Bordner