Newsgroups: comp.parallel.pvm,comp.parallel.mpi
From: nmm1@cus.cam.ac.uk (Nick Maclaren)
Subject: Re: NESL
Organization: University of Cambridge, England
Date: 26 May 1998 10:17:23 GMT
Message-ID: <6ke4rj$pfv$1@lyra.csx.cam.ac.uk>


In article <356A8449.65F319C5@obs.unige.ch>, Daniel Pfenniger <Daniel.Pfenniger@obs.unige.ch> writes:
|> Lars Rzymianowicz wrote:
|> > 
|> > Daniel Pfenniger wrote:
|> 
|> > > The simplicity of coding parallel algorithms is however attractive
|> > > (a quicksort algorithm is coded in ten lines with NESL in comparison
|> > > of 1700 with MPI).
|> >      ^^^^
|> > 
|> > First, you don't seem to be an experienced MPI programmer, ey? ;-)
|> 
|> The 1700 lines for MPI code comes from the NESL site.

Well, I could write Quicksort for MPI in 17,000 lines, or even 170,000.
But I am pretty sure that I could also write it in 170, and certainly
in 500.  It wouldn't be a good Quicksort, but 10 lines of code in any
language isn't going to be a good one, either.


Nick Maclaren,
University of Cambridge Computing Service,
New Museums Site, Pembroke Street, Cambridge CB2 3QG, England.
Email:  nmm1@cam.ac.uk
Tel.:  +44 1223 334761    Fax:  +44 1223 334679