Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bloom-beacon!gatech!hubcap!beck
From: beck@svax.cs.cornell.edu (Micah Beck)
Newsgroups: comp.hypercube
Subject: Needed - Sort Numbers for iPSC
Message-ID: <501@hubcap.UUCP>
Date: Thu, 24-Sep-87 12:57:02 EDT
Article-I.D.: hubcap.501
Posted: Thu Sep 24 12:57:02 1987
Date-Received: Sat, 26-Sep-87 17:00:22 EDT
Sender: fpst@hubcap.UUCP
Lines: 12
Keywords: sorting, performance, hypercube
Approved: hypercube@hubcap.clemson.edu

I have implemented a recent parallel sorting algorithm (Adaptive Bitonic
Sorting, developed by A. Nicolau and G. Bilardi of Cornell) on the
Intel iPSC hypercube (Rel 3.1.1).   I am interested in any published
performance figures for a fast parallel sort on this architecture.
If possible, I'd like to get the code for the implementation as well.

I'd greatly appreciate any help that I can get, be it a reference or
a listing.  Thanks,

Micah Beck				Department of Computer Science
beck@svax.cs.cornell.edu		Upson Hall, Cornell University
					Ithaca, NY	41853