marcoz@@husc6.harvard.edu (Marco Zagha) (07/24/90)
This summer at Thinking Machines, a group of researchers has been evaluating and implementing various sorting algorithms for the Connection Machine CM-2. We have many references to theoretical descriptions of parallel sorting algorithms, but very few references to actual implementations and timings of these algorithms on parallel machines. Ideally, we would like to find references to published work or benchmarks. But we would also find any unpublished data very helpful, e.g. timings of the system sort routine or other sorting implementations. Thank you, Marco Zagha (marcoz@think.com) Thinking Machines Corporation and Carnegie Mellon University (617) 876-1111, x2477