Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!wuarchive!emory!hubcap!kddlab!icot31.icot.or.jp!hawley
From: kddlab!icot31.icot.or.jp!hawley@uunet.UU.NET (David John Hawley)
Newsgroups: comp.parallel
Subject: Re: parallel sorting algorithm references
Keywords: sort, distributed
Message-ID: <13401@hubcap.clemson.edu>
Date: 4 Mar 91 03:48:30 GMT
References: <13340@hubcap.clemson.edu>
Sender: fpst@hubcap.clemson.edu
Organization: Fifth Generation Computing Systems (ICOT), Tokyo, Japan
Lines: 16
Approved: parallel@hubcap.clemson.edu


In article <13340@hubcap.clemson.edu> nyan@cs.ualberta.ca (Nyan Lo) writes:
>I am interested in some sorting algorithms to sort a one dimemsion
>array of integer using several workstations connected together. I
>appreciate any information I can get. Thanks in advance.

I am also interested in the sorting problem for multicomputers.
A brief tour through the recent literature came up with only one
algorithm: the distributed version of the "rank sort".

Please "tee" any references off to me also!

---------------------------
David Hawley, ICOT, 4th Lab
csnet: hawley%icot.jp@relay.cs.net uucp:{enea,inria,mit-eddie,ukc}!icot!hawley
ICOT, 1-4-28 Mita, Minato-ku, Tokyo 108 JAPAN. TEL/FAX {81-3-456-}2514/1618