Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!rutgers!gatech!hubcap!matloff%crow.Berkeley.EDU
From: matloff%crow.Berkeley.EDU@ucbvax.Berkeley.EDU (Norman Matloff)
Newsgroups: comp.parallel
Subject: Re: One parallel v. many uniprocessor algorithms
Message-ID: <5390@hubcap.clemson.edu>
Date: 3 May 89 11:53:10 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 16
Approved: parallel@hubcap.clemson.edu

In article <5374@hubcap.clemson.edu> mcvax!cernvax!hjm@uunet.UU.NET (Hubert Matthews) writes:
>One of the things that I didn't see mentioned (perhaps someone said it
>and I missed it) regarding the Distributed Simulation discussion about
>whether it is "better" to run several simulations in parallel or have
>one algorithm spread over several processors is the subject of memory
>requirements, or roughly translated: cost.

Several people mentioned it.  I made the claim that "most" queuing
applications don't have large memory requirements, so that it's not 
an issue in these cases.  Typically the largest component of memory 
usage is the event list.  The latter typically has length approximately 
equal to the number of servers, which in "typical" applications is on the
order of 10's or at most 100's  --  thus not a large memory requirement
at all.

   Norm