William L. Hightower, Jan F. Prins, John H. Reif  Home/Search
Context Related
| unc.edu/pub/technicalrep...92018.ps.Z unc.edu/~prins/docs/bflashalg.ps unc.edu/pub/publications/...92018.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/research/EXPAR/p...node10 (more) From: utah.edu/~cs672...nc.techreports (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a sophisticated randomized sampling technique to form a splitter set, but Samplesort distributes the splitter set to each processor while Flashsort uses splitter-directed routing. In this paper we present B-Flashsort, a new batched-routing variant of Flashsort designed to sort N>P values using P processors connected in a d-dimensional mesh and using constant space in... (Update)
Context of citations to this paper: More
...processor memory before moving to the next processor. In this case the fastest available sorting algorithms are the Flashsort algorithms [17]. 13 10.2.3 A Particle Migration Strategy The schemes we have outlined so far all make heavy use of the global router. We can avoid the...
.... has been influenced by a number of interesting comparisons between parallel sorting algorithms regarding their practical usefulness ([3, 9, 6]) However, rather than screening a number of quite different algorithms, we intensively study on one basic strategy namely...
Cited by: More
Non-Blocking Synchronization: Algorithms and Performance Evaluation - Zhang (2003) (Correct)
A Randomized Parallel Sorting Algorithm With an Experimental.. - Helman, Bader, JaJa (1998) (Correct)
On the Efficient Implementation of Massively Parallel Quicksort - Sanders, Hansch (1997) (Correct)
Active bibliography (related documents): More All
1.6: A Comparison of Sorting Algorithms for the.. - Blelloch.. (1991) (Correct)
1.1: Parallel Sorting by Overpartitioning - Li, Sevcik (1994) (Correct)
0.6: An Experimental Analysis of Parallel Sorting Algorithms - Blelloch, Plaxton.. (1998) (Correct)
Similar documents based on text: More All
0.4: B-Flashsort: A High-performance Sort for the MasPar MP-1 and MP-2.. - Prins (1992) (Correct)
0.3: Efficient Oblivious Parallel Sorting on the MasPar MP-1 - Brockmann, Wanka (1996) (Correct)
0.3: Randomized Algorithms for Binary Search and Load Balancing on.. - Reif, Sen (1990) (Correct)
Related documents from co-citation: More All
27: A comparison of sorting algorithms for the Connection Machine CM - Blelloch, Leiserson et al. - 1991
19: Sorting Networks and Their Applications (context) - Batcher - 1968
18: MasPar Parallel Application Language (context) - Corporation, CA - 1993
BibTeX entry: (Update)
W. L. Hightower, J. F. Prins, J. H. Reif. Implementation of randomized sorting on large parallel machines. In Proc. of 4th ACM-SPAA, pp. 158--167, 1992. http://citeseer.ist.psu.edu/91922.html More
@inproceedings{ hightower92implementations,
author = "William L. Hightower and Jan Prins and John H. Reif",
title = "Implementations of Randomized Sorting on Large Parallel Machines",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "158-167",
year = "1992",
url = "citeseer.ist.psu.edu/91922.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
322 Sorting Networks and Their Applications (context) - Batcher - 1968
227 Parallel Merge Sort (context) - Cole - 1988
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
182 A Comparison of Sorting Algorithms for the Connection Machin.. - Blelloch, Leiserson et al. - 1991
159 Tight Bounds on the Complexity of Parallel Sorting (context) - Leighton - 1985
134 Computational Aspects of VLSI (context) - Ullman - 1983
132 Fast Probabilistic Algorithms for Hamiltonian Circuits and M.. (context) - Angluin, Valiant - 1979
110 Parallel Steps (context) - Ajtai, Komlos et al. - 1983
79 Sorting on a Mesh-connected Parallel Computer (context) - Thompson, Kung - 1977
72 An Optimal Sorting Algorithm for Mesh Connected Computers (context) - Schnorr, Shamir - 1986
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
51 Parallel Sorting on a Shared-Nothing Architecture using Prob.. - DeWitt, Naughton et al. - 1991
49 Probabilistic Parallel Algorithms for Sorting and Selection (context) - Reischuk - 1985
45 Optimal and Sublogarithmic Time Randomized Parallel Sorting .. - Rajasekaran, Reif - 1989
40 Deterministic Coin Tossing and Accelerating Cascades: Micro .. (context) - Cole, Vishkin - 1986
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
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
25 Randomized Sorting and Selection on Mesh-Connected Processor.. (context) - Kaklamanis, Krizanc et al. - 1991
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
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
7 selection and Related Problems on Grids of Processors (context) - Kunde - 1988
6 Binsorting on Hypercubes with d-port Communication (context) - Seidel, George - 1988
4 Practical Sorting Algorithms for Hypercube Computers (context) - Wagar - 1990
3 Sorting on a Hypercube (context) - Felten, Karlin et al. - 1986
1 Sorting Within Distance Bound on a Mesh-Connected Arrays (context) - Chlebus - 1989
1 Aegan Workshop on Computing: VLSI Algorithms and Architectur.. (context) - Kunde, Sorting et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.umiacs.umd.edu/research/EXPAR/papers/3549/node10.html):
Parallel Sorting by Overpartitioning - Li, Sevcik (1994) (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