Article

Free access

Implementations of randomized sorting on large parallel machines

Authors:

William L. Hightower,

John H. ReifAuthors Info & Claims

SPAA '92: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Pages 158 - 167

https://doi.org/10.1145/140901.140918

Published: 01 June 1992 Publication History

First page of PDF

References

[1]

A. Aggarwal and M.-D. A. Huang, Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMs by Interconnection Networks; Lecture Notes in Computer Science VLSI Algorithms and Architectures (AWOC 88) (ed. by John Reif), vol. 319, pp. 339-350, Springer-Verlag, 1988.

Digital Library

[2]

M.Ajtai, J. Komlos, and E. Szemeredil, Sorting in c log n Parallel Steps, Combinatorica, 3:1-19, 1983.

Digital Library

[3]

D. Angluin and L.G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, Journal of Computer and System Sciences, 18(2):155-193, April 1979.

[4]

S.G. Akl;, Parallel Sorting Algorithms, Academic Press, Toronto, 1985.

Digital Library

[5]

K. Batcher; Sorting Networks and Their Applications, Proceedings of the AFIPS Spring Joint Computing Conference, vol. 32, pp.307- 314, 1968.

[6]

G. Baudet and D. Stevenson, Optimal Sorting Algorithms for Parallel Computers, IEEE Transactions on Computers, C-27:84-87, 1978.

Digital Library

[7]

G.E. Blelloch, Vector Models for Data-Parallel Computing, The MIT Press, 1990.

Digital Library

[8]

G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, and M. Zagha; A Comparison of Sorting Algorithms for the Connection Machine CM-2; 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 21-24, 1991, Hilton Head, SC, pp.3-16.

Digital Library

[9]

B. Chlebus, Sorting Within Distance Bound on a Mesh-Connected Arrays, International Symposium on Optimal Algotihms, vol. 401 of Lecture Notes in Computer Science, pp. 232-238, Springer-Verlag, NY, 1989.

Digital Library

[10]

R. Cole, Parallel Merge Sort, SlAM Journal on Computing, pp. 770-785, 1988.

Digital Library

[11]

R. Cole and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 206-219, 1986.

Digital Library

[12]

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press and McGraw Hill, 1990.

Digital Library

[13]

R.E. Cypher and C.G. Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 193-203, May 1990.

Digital Library

[14]

D.J. DeWitt, J.F. Naughton, D.F. Schneider, Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting, Computer Sciences TR#1043, University of Wisconsin - Madison, 1991.

[15]

E. Felten, S. Karlin, and S. Otto, Sorting on a Hypercube, Hm 244, Caltech/JPL, 1986.

[16]

W.D. Frazer and A.C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the ACM, 17(3):496- 507, 1970.

Digital Library

[17]

W. Hoeffding, On the Distribution of the Number of Successes in Independent Trials, Annals of Mathematical Statistics, 27:713-721, 1956.

[18]

J.S. Huang and Y.C. Chow, Parallel Sorting and Data Partitioning by Sampling, Proceedings of the IEEE Computer Society's Seventh International Computer Software and Applications Conference, pp. 627-631, November 1983.

[19]

C. Kaklamanis, D. Krizanc, L. Narayanan, and T. Tsantilas, Randomized Sorting and Selection on Mesh-Connected Processor Arrays, 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 21-24, 1991, Hilton Head, SC, pp. 17-28.

Digital Library

[20]

M. Kunde, Routing and Sorting on Mesh- Connected Arrays, Aegan Workshop on Computing" VLSI Algorithms and Architectures, vol. 319 of Lecture Notes in Computer Science, pp. 423-433, Springer- Verlag, NY, 1988.

Digital Library

[21]

M. Kunde, 1-selection and Related Problems on Grids of Processors, Aegan Workshop on Computing: VLSI Algorithms and Architectures, vol. 319 of Lecture Notes in Computer Science, pp. 423-433, Springer- Verlag, NY, 1988.

[22]

F.T. Leighton, Tight Bounds on the Complexity of Parallel Sorting, IEEE Transactions on Computers, C-34(4):344-354, April 1985.

Digital Library

[23]

T. Leighton and G. Plaxton, A (Fairly) Simple Circuit That (Usually) Sorts, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 264-274, October 1990.

Digital Library

[24]

D. Nassimi and S. Sahni, Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network, Journal of the A CM, 29(3):642-667, July 1982.

Digital Library

[25]

M.S. Paterson, Improved Sorting Networks with O(log n) Depth, Algorithmica, 5::75-92, 1990.

Digital Library

[26]

C.G. Plaxton, Efficient Computation on Sparse Interconnection Networks, Technical Report STAN-CS-89-1283, Stanford University, Department of Computer Science, September 1989.

[27]

J.F. Prins, Efficient Bitonic Sorting of Large Arrays on the MasPar MP-1, 3rd Symposium on Frontiers of Massively Parallel Processing, 1990; expanded version Technical Report 91- 041, Univ. of North Carolina, 1991.

[28]

M.J. Quinn, Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hypersort and Quickmerge, BIT, 29(2):239-250, 1989.

Digital Library

[29]

S. Rajasekaran and J.H. Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms, SlAM Journal on Computing, 18(3):594-607, June 1989.

Digital Library

[30]

J.H. Reif and L.G. Valiant, A Logarithmic Time Sort for Linear Size Networks, 15th Annual ACM Symposium on Theory of Computing, Boston, MA, pp. 10-16, 1983; also in Journal of the ACM, 34(1):60-76, January 1987.

Digital Library

[31]

R. Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection, SlAM Journal of Computing, 14(2):396-411, May 1985.

Digital Library

[32]

C. Schnorr and A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers, Symposium on the Theory of Computation, pp. 255-263, 1986.

Digital Library

[33]

S.R. Seidel and W.L. George, Binsorting on Hypercubes with d-port Communication, Proceedings of the Third Conference on Hypercube Concurrent Computers, pp. 1455- 1461, January 1988.

Digital Library

[34]

C.D. Thompson and H.T. Kung, Sorting on a Mesh-connected Parallel Computer, Communications of the ACM 20(4):263-271, 1977.

Digital Library

[35]

J. Ullman, Computational Aspects of VLSI, Computer Science Press, 1983

Digital Library

[36]

P. Varman and K. Doshi, Sorting with Linear Speedup on a Pipelined Hypercube, Technical Report TR-9902, Rice University, Department of Electrical and Computer Engineering, February 1988.

[37]

B.A. Wagar, Hyperquicksort: A Fast Sorting Algorithm for Hypercubes, Hypercube Multiprocessors 1987 (Proceedings of the Second Conference on Hypercube Multiprocessors) (ed. M.T. Heath), pp. 292- 299, Philadelphia, PA, 1987. SIAM.

[38]

B.A. Wagar, Practical Sorting Algorithms for Hypercube Computers, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, July 1990.

Digital Library

[39]

Y. Won and S. Sahni, A Balanced Bin Sort for Hypercube Multicomputers. Journal of Supercomputing, 2:435-448, 1988.

Cited By

Han YHe X(2022)More Efficient Parallel Integer SortingInternational Journal of Foundations of Computer Science10.1142/S012905412250007133:05(411-427)Online publication date: 24-Mar-2022
https://doi.org/10.1142/S0129054122500071
Chakaravarthy VChoi JJoseph DMurali PPandian SSabharwal YSreedhar D(2018)On Optimizing Distributed Tucker Decomposition for Sparse TensorsProceedings of the 2018 International Conference on Supercomputing10.1145/3205289.3205315(374-384)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3205289.3205315
Han YHe X(2012)More efficient parallel integer sortingProceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-29700-7_26(279-290)Online publication date: 14-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29700-7_26
Show More Cited By

Index Terms

Implementations of randomized sorting on large parallel machines

Recommendations

Parallel database sorting

Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published ...
Communication-Efficient Parallel Sorting

We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most ...
Sorting in Parallel Database Systems
HPC '00: Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2

Sorting in database processing is frequently required using Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past-published work has ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '92: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

June 1992

441 pages

ISBN:089791483X

DOI:10.1145/140901

Chairman:
Lawrence Snyder
Univ. of Washington, Seattle

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA92

Sponsor:

SPAA92: 4th Annual ACM Symposium on Parallel Algorithms and Architectures

June 29 - July 1, 1992

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
409
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)4

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Han YHe X(2022)More Efficient Parallel Integer SortingInternational Journal of Foundations of Computer Science10.1142/S012905412250007133:05(411-427)Online publication date: 24-Mar-2022
https://doi.org/10.1142/S0129054122500071
Chakaravarthy VChoi JJoseph DMurali PPandian SSabharwal YSreedhar D(2018)On Optimizing Distributed Tucker Decomposition for Sparse TensorsProceedings of the 2018 International Conference on Supercomputing10.1145/3205289.3205315(374-384)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3205289.3205315
Han YHe X(2012)More efficient parallel integer sortingProceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-29700-7_26(279-290)Online publication date: 14-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29700-7_26
Sibeyn J(2005)Sample sort on meshesEuro-Par'97 Parallel Processing10.1007/BFb0002762(389-398)Online publication date: 26-Sep-2005
https://doi.org/10.1007/BFb0002762
Narayanan L(2005)Randomized algorithms on the meshParallel and Distributed Processing10.1007/3-540-64359-1_715(408-417)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-64359-1_715
Sanders PHansch T(2005)Efficient massively parallel quicksortSolving Irregularly Structured Problems in Parallel10.1007/3-540-63138-0_2(13-24)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-63138-0_2
Rüb C(2005)On the average running time of odd-even merge sortSTACS 9510.1007/3-540-59042-0_99(491-502)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59042-0_99
Tsigas PYi Zhang (2003)A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.10.1109/EMPDP.2003.1183613(372-381)Online publication date: 2003
https://doi.org/10.1109/EMPDP.2003.1183613
Sibeyn J(2003)Faster deterministic sorting through better samplingTheoretical Computer Science10.1016/S0304-3975(02)00321-3290:3(1829-1850)Online publication date: 3-Jan-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900321-3
Krizanc DRajasekaran S(2001)Random Sampling: Sorting and SelectionHandbook of Randomized Computing10.1007/978-1-4615-0013-1_1(1-21)Online publication date: 2001
https://doi.org/10.1007/978-1-4615-0013-1_1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents