Article

Free access

A comparison of sorting algorithms for the connection machine CM-2

Authors:

Guy E. Blelloch,

Charles E. Leiserson,

Bruce M. Maggs,

C. Greg Plaxton,

Stephen J. Smith,

Marco ZaghaAuthors Info & Claims

SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

Pages 3 - 16

https://doi.org/10.1145/113379.113380

Published: 01 June 1991 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. In J. H. Reif, editor, Lecture Notes in Computer Science: VLS1 Algorithms and Architectures (AWOC 88), vol. 319, pages 339-350. Springer-Verlag, 1988.

Digital Library

[2]

M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c log n parallel steps. Combinatorica, 3:1-19, 1983.

Digital Library

[3]

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

Digital Library

[4]

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.

[5]

K. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computing Conference, volume 32, pages 307-314, 1968.

Digital Library

[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. B lelloch. Vector Models for Data-Parallel Computing. The MIT Press, 1990.

Digital Library

[8]

R. Cole. Parallel merge sort. SlAM Journal on Computing, pages 770-785, 1988.

Digital Library

[9]

R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 206-219, 1986.

Digital Library

[10]

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

Digital Library

[11]

R.E. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 193-203, May 1990.

Digital Library

[12]

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

[13]

W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal ofthe ACM, 17(3):496-507, 1970.

Digital Library

[14]

W. Hoeffding. On the distribution of the number of successes in independent trials. Annals of Mathematical Statistics, 27:713--721, 1956.

[15]

J. S. Huang and Y. C. Chow. Parallel sorting and data partitioning by sampling. In Proceedings of the IEEE Computer Society's Seventh International Computer Software and Applications Conference, pages 627-631, November 1983.

[16]

F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344---354, April 1985.

Digital Library

[17]

T. Leighton and G. Plaxton. A (fairly) simple circuit that (usually) sorts. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 264-274, October 1990.

Digital Library

[18]

P. P. Li. Parallel sorting on Ametek/S14. Technical report, Ametek Computer Research Division, Arcadia, CA, September 1986.

[19]

D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal ofthe ACM, 29(3):642-667, July 1982.

Digital Library

[20]

M. S. Paterson. Improved sorting networks with O(log n) depth. Algorithmica, 5:75-92, 1990.

[21]

C. G. Plaxton. Efficient computation on sparse interconnection networks. Technical Report STAN-CS-89-1283, Stanford University, Department of Computer Science, September 1989.

[22]

M. J. Quinn. Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge. B/T, 29(2):239-250, 1989.

Digital Library

[23]

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

[24]

J.H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. Journal of the ACM, 34(1):60-76, January 1987.

Digital Library

[25]

S.R. Seidel and W. L. George. Binsorting on hypercubes with d-port communication. In Proceedings of the Third Conference on Hypercube Concurrent Computers, pages 1455-1461, January 1988.

Digital Library

[26]

P. Varman and K. Doshi. Sorting with linear speedup on a pipelined hypercube. Technical Report TR-8802, Rice University, Department of Electrical and Computer Engineering, February 1988.

[27]

B. A. Wagar. Hyperquicksort: A fast sorting algorithm for hypercubes. In M. T. Heath, editor, Hypercube Multiprocessors 1987 (Proceedings of the Second Conference on tlypercube Multiprocessors), pages 292-299, Philadelphia, PAL, 1987. SIAM.

[28]

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

Digital Library

[29]

Y. Won and S. Sahni. A balanced bin sort for hypercube muI- ticomputers. Journal of Supercomputing, 2:435-448, 1988.

Cited By

Zhang GHsu OKjolstad F(2024)Compilation of Modular and General Sparse WorkspacesProceedings of the ACM on Programming Languages10.1145/36564268:PLDI(1213-1238)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656426
Dong XDhulipala LGu YSun YLee IChabbi MSteuwer M(2024)Parallel Integer Sort: Theory and PracticeProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638483(301-315)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638483
Zulian PBen Bader SFourestey GKrause RRossinelli D(2024)Data-centric workloads with MPI_SortJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.104833(104833)Online publication date: Jan-2024
https://doi.org/10.1016/j.jpdc.2023.104833
Show More Cited By

Index Terms

Recommendations

The connection machines CM-1 and CM-2: solving nonlinear network problems
ICS '88: Proceedings of the 2nd international conference on Supercomputing

Massively parallel computers — like the Connection Machines CM-1 and CM-2 — have demonstrated remarkable performance in applications like pattern recognition, database searching, dense linear algebra computations and so on. In this paper we discuss the ...
A Comparison of Parallel Sorting Algorithms on Different Architectures
An efficient implementation of the back-propagation algorithm on the connection machine CM-2
NIPS'89: Proceedings of the 2nd International Conference on Neural Information Processing Systems

In this paper, we present a novel implementation of the widely used Back-propagation neural net learning algorithm on the Connection Machine CM-2 - a general purpose, massively parallel computer with a hypercube topology. This implementation runs at ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

June 1991

368 pages

ISBN:0897914384

DOI:10.1145/113379

Chairman:
Tom Leighton
Massachusetts Institute of Technology, Cambridge

Copyright © 1991 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 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA91

Sponsor:

SPAA91: 3rd Annual ACM Symposium on Parallel Algorithms & Architecture

July 21 - 24, 1991

South Carolina, Hilton Head, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

206
Total Citations
View Citations
3,124
Total Downloads

Downloads (Last 12 months)741
Downloads (Last 6 weeks)99

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang GHsu OKjolstad F(2024)Compilation of Modular and General Sparse WorkspacesProceedings of the ACM on Programming Languages10.1145/36564268:PLDI(1213-1238)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656426
Dong XDhulipala LGu YSun YLee IChabbi MSteuwer M(2024)Parallel Integer Sort: Theory and PracticeProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638483(301-315)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638483
Zulian PBen Bader SFourestey GKrause RRossinelli D(2024)Data-centric workloads with MPI_SortJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.104833(104833)Online publication date: Jan-2024
https://doi.org/10.1016/j.jpdc.2023.104833
Guo LKestor G(2023)On Higher-performance Sparse Tensor Transposition2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW59300.2023.00118(697-701)Online publication date: May-2023
https://doi.org/10.1109/IPDPSW59300.2023.00118
Garland M(2023)SortingProgramming Massively Parallel Processors10.1016/B978-0-323-91231-0.00019-7(293-310)Online publication date: 2023
https://doi.org/10.1016/B978-0-323-91231-0.00019-7
Arman ALoguinov D(2022)OrigamiProceedings of the VLDB Endowment10.14778/3489496.348950715:2(259-271)Online publication date: 4-Feb-2022
https://dl.acm.org/doi/10.14778/3489496.3489507
Amrutanshu PBibhuprasad SPanigrahi SJena AKhan M(2022)Impact of Optimized Segment Routing in Software Defined NetworksThe New Advanced Society10.1002/9781119884392.ch12(263-287)Online publication date: 18-Mar-2022
https://doi.org/10.1002/9781119884392.ch12
D A S(2021)Deviations in Efficiencies of Logarithmically Growing Sorting Algorithms at Infinitely Large Datasets2021 Innovations in Power and Advanced Computing Technologies (i-PACT)10.1109/i-PACT52855.2021.9697009(1-5)Online publication date: 27-Nov-2021
https://doi.org/10.1109/i-PACT52855.2021.9697009
Ning BLi JJiang S(2021)Range partitioning within sublinear time: Algorithms and lower boundsTheoretical Computer Science10.1016/j.tcs.2021.01.017857(177-191)Online publication date: Mar-2021
https://doi.org/10.1016/j.tcs.2021.01.017
Makino JMakino J(2021)“Near-Optimal” DesignsPrinciples of High-Performance Processor Design10.1007/978-3-030-76871-3_5(95-134)Online publication date: 31-May-2021
https://doi.org/10.1007/978-3-030-76871-3_5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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