Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!uwm.edu!linac!att!pacbell.com!ucsd!mvb.saic.com!ncr-sd!ncrcae!hubcap!fpst
From: dwns@doc.ic.ac.uk (David W N Sharp)
Newsgroups: comp.parallel
Subject: Parallel Sorting Algorithms Ref
Message-ID: <1991Mar26.211955.11592@hubcap.clemson.edu>
Date: 26 Mar 91 11:48:35 GMT
Sender: dwns@doc.ic.ac.uk
Followup-To: comp.parallel
Organization: Dept. of Computing, Imperial College, London, UK.
Lines: 27
Approved: parallel@hubcap.clemson.edu
Source-Info:  From (or Sender) name not authenticated.


In article 2281 a list of parallel sorting references was given.
Readers may also be interested in the massively parallel quicksort algorithm
described in

D.W.N. Sharp & M.D.Cripps, "A Parallel Implementation Strategy for Quicksort,"
Proc. 1989 IEE International Symposium on Computer Architecture and Digital
Signal Processing, Hong Kong, 11-14 October 1989, pp.305-309.

The algorithm is also explained (after a synthesis of it by
program transformation) in chapter 6 of

D.W.N Sharp, "Functional language Program Transformation For Parallel Computer
Architectures," Ph.D. thesis, Dept. of Computing, Imperial College, London,
Dec. 1990.


David Sharp.
dwns@uk.ac.ic.doc



-- 
=========================== MODERATOR ==============================
Steve Stevenson                            {steve,fpst}@hubcap.clemson.edu
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell