Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!amdcad!ames!ll-xn!husc6!bloom-beacon!gatech!hubcap!pase From: pase@ogcvax.UUCP (Douglas M. Pase) Newsgroups: comp.hypercube Subject: Re: needed pointers to enumeration sort Message-ID: <625@hubcap.UUCP> Date: Thu, 5-Nov-87 08:54:11 EST Article-I.D.: hubcap.625 Posted: Thu Nov 5 08:54:11 1987 Date-Received: Sun, 8-Nov-87 03:09:27 EST Sender: fpst@hubcap.UUCP Lines: 9 Keywords: Radix sort, Connection Machine, CACM, Parallel solutions Approved: hypercube@hubcap.clemson.edu In article dgis!duc@uunet.uu.net (Duc Tran) writes: >Could somebody provide me some pointers to the algorithm for "enumeration >sort" on parallel machines such as the Connection Machine? An interesting article on the Connection Machine appeared in the December 1986 issue of the Communications of the ACM. It has a *radix sort* for the CM, but I'm not sure that is what you want. It is really quite an interesting article as they show how they have managed to obtain a lot of parallelism for problems which were previously thought to be quite serial in nature (such as parsing).