Newsgroups: comp.parallel.pvm
From: montoya@loria.fr (Frederic Montoya)
Subject: Re: Definition of Granularity
Organization: CRIN & INRIA-Lorraine - Nancy - FRANCE
Date: 16 Nov 1994 15:00:24 GMT
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Message-ID: <3ad6q8$qp4@muller.loria.fr>

In article <3a7572$hmq@fstgds15.tu-graz.ac.at>, goller@fcggsg32 (Goller Alois) writes:
|> D. Subramani (Raj.Subramani@ncl.ac.uk) wrote:
|> : Could some kind soul please post/e-mail me a clear
|> : and concise definition of Granularity (or its 
|> : reference). I have yet to see one (clear and concise,
|> : that is) from the six textbooks I have so far
|> : reffered to.
|> 
|> : Mucho gracias.
|> 
|> : Cheers
|> 
|> : -raj.subramani@newcastle.ac.uk
|> 
|> A coarse grained algorithm is generally easier to parallelize
|> than a fine grained one :-)
|> 
|> Seriously: As I looked for the solution of this question, I
|> found many answers from many authors but most of all were
|> different from each other. Who is authorized to give such 
|> a definition?

Hi;

I was thinking that the ratio computation time over communication time
was a commonly accepted definition (and obviously precise).
I would be interested to know about different ones.

Regards;
Frederic.

--

Frederic Montoya

INRIA Lorraine                       Voice : +33 83 59 30 84
LORIA                                Fax   : +33 83 27 83 19
615, rue du Jardin Botanique         E-Mail: montoya@loria.fr
F-54602 Villers les Nancy Cedex      W3    : http://www.loria.fr/~montoya
France

