See this document in CiteSeerX!

A Comparison of Sorting Algorithms for the Connection Machine CM-2 (1991)  (Make Corrections)  (182 citations)
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
ACM Symposium on Parallel Algorithms and Architectures



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cmu.edu/~scandal/p...sortSPAA91.ps.gz
cmu.edu/project/sc...sortSPAA91.ps.gz
utexas.edu/users/plaxton/html...spaa.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/~scandal/papers/ (more)
From:  cmu.edu/~guyb/publications
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of many other sorting algorithms proposed in the literature. Our computational experiments show that the sample sort algorithm, which is a theoretically efficient "randomized" algorithm, is the fastest of the three algorithms on large data ... (Update)

Cited by:   More
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica..   (Correct)
Coarse Grained Parallel Maximum Matching In Convex Bipartite.. - Bose Chan Dehne (1999)   (Correct)
Randomized Parallel List Ranking For - Distributed Memory Multiprocessors   (Correct)

Similar documents (at the sentence level):
66.3%:   An Experimental Analysis of Parallel Sorting Algorithms - Blelloch, Plaxton.. (1998)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Implementations of Randomized Sorting on Large.. - William L.. (1992)   (Correct)
1.0:   An Evaluation of Sorting as a Supercomputer Benchmark - Thearling   (Correct)
1.0:   Parallel Sorting by Overpartitioning - Li, Sevcik (1994)   (Correct)

Similar documents based on text:   More   All
0.6:   A Simple, Fast Parallel Implementation of Quicksort and its.. - Tsigas, Zhang   (Correct)
0.5:   An Optimal Hardware-Algorithm for Sorting Using a.. - Olariu, Pinotti, Zheng   (Correct)
0.3:   A regular N-node bounded degree network for sorting.. - Bieniek, Nölle.. (1995)   (Correct)

Related documents from co-citation:   More   All
31:   A bridging model for parallel computation (context) - Valiant - 1990
29:   Sorting Networks and Their Applications (context) - Batcher - 1968
28:   LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993

BibTeX entry:   (Update)

G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, M. Zagha. A comparison of sorting algorithms for the Connection Machine CM-2. In Proc. of the 3rd ACM-SPAA, pp. 3--16, 1991. http://citeseer.ist.psu.edu/blelloch91comparison.html   More

@inproceedings{ blelloch91comparison,
    author = "Guy E. Blelloch and Charles E. Leiserson and Bruce M. Maggs and C. Greg Plaxton and Stephen J. Smith and Marco Zagha",
    title = "A Comparison of Sorting Algorithms for the Connection Machine {CM}-2",
    booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
    pages = "3-16",
    year = "1991",
    url = "citeseer.ist.psu.edu/blelloch91comparison.html" }
Citations (may not include all citations):
3972   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990  ACM
322   Sorting networks and their applications (context) - Batcher - 1968
227   Parallel merge sort (context) - Cole - 1988  ACM   DBLP
206   Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
159   Tight bounds on the complexity of parallel sorting (context) - Leighton - 1985
132   Fast probabilistic algorithms for hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979  ACM   DBLP
110   parallel steps (context) - Ajtai, Komlos et al. - 1983
109   A logarithmic time sort for linear size networks (context) - Reif, Valiant - 1987  ACM   DBLP
63   Deterministic sorting in nearly logarithmic time on the hype.. - Cypher, Plaxton - 1990
60   Parallel permutation and sorting algorithms and a new genera.. (context) - Nassimi, Sahni - 1982
59   Parallel Sorting Algorithms (context) - Akl - 1985  ACM   DBLP
45   Optimal and sublogarithmic time randomized parallel sorting .. - Rajasekaran, Reif - 1989  ACM   DBLP
40   Deterministic Coin Tossing and Accelerating Cascades: Micro .. (context) - Cole, Vishkin - 1986  ACM   DBLP
39   Improved sorting networks with O (context) - Paterson - 1990
38   Parallel sorting and data partitioning by sampling (context) - Huang, Chow - 1983
34   Samplesort: A sampling approach to minimal storage tree sort.. (context) - Frazer, McKellar - 1970  ACM   DBLP
33   Optimal sorting algorithms for parallel computers (context) - Baudet, Stevenson - 1978
27   the distribution of the number of successes in independent t.. (context) - Hoeffding - 1956
26   simple circuit that (context) - Leighton, Plaxton et al. - 1990
24   Efficient computation on sparse interconnection networks (context) - Plaxton - 1989
12   Analysis and benchmarking of two parallel sorting algorithms.. (context) - Quinn - 1989
11   Network complexity of sorting and graph problems and simulat.. (context) - Aggarwal, Huang - 1988  ACM   DBLP
9   Hyperquicksort: A fast sorting algorithm for hypercubes (context) - Wagar - 1987
9   A balanced bin sort for hypercube multicomputers (context) - Won, Sahni - 1988
8   Sorting with linear speedup on a pipelined hypercube (context) - Varman, Doshi - 1988  ACM   DBLP
6   Binsorting on hypercubes with d-port communication (context) - Seidel, George - 1988  ACM
4   Practical Sorting Algorithms for Hypercube Computers (context) - Wagar - 1990  ACM
3   Sorting on a hypercube (context) - Felten, Karlin et al. - 1986
2   on Ametek/S14. Technical report, Ametek Computer Research Di.. (context) - Li, sorting - 1986



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cmu.edu/~scandal/papers/):   More
Collection-Oriented Languages - Sipelstein (1991)   (Correct)
Cvl: A C Vector Library - Manual Version 2 - Blelloch, Chatterjee, Hardwick, .. (1993)   (Correct)
A Provable Time and Space Efficient Implementation of NESL - Blelloch, Greiner (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC