Article

Free access

Randomized sorting and selection on mesh-connected processor arrays (preliminary version)

Authors:

Christos Kaklamanis,

Danny Krizanc,

Lata Narayanan,

Thanasis TsantilasAuthors Info & Claims

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

Pages 17 - 28

https://doi.org/10.1145/113379.113381

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

B. Chlebus. Sorting within distance bound on a mesh-connected arrays. In International Syrup. on Optimal Algorithms. Vol. 401 of Lecture Notes in Computer Science, Springer Verlag, NY, pages 232-238, 1989.

Crossref

Google Scholar

[2]

W. Dally. Wire-efficient VLSI multiprocessor communication networks. In Advanced Research in VLSI, pages 391- 415, 1987.

Google Scholar

[3]

M. Kunde. Routing and sorting on mesh-connected arrays. In Aegean Workshop on Computing: VLSI algorithms and architectures. Vol.319 of Lecture Notes in Computer Science, Springer Verlag, NY, pages 423-433, 1988.

Digital Library

Google Scholar

[4]

M. Kunde. 1-selection and related problems on grids of processors. Technical report, Institut fur Informatik, Technische Universitat, Munchen, 1989.

Google Scholar

[5]

T. Leighton, F. Makedon, and I. Tollis. A 2n-2 step algorithm for routing in an n x n array with constant size queues. In Symposium on Parallel Algorithms and Architecture, pages 328-335, 1989.

Digital Library

Google Scholar

[6]

N. Megiddo. Parallel algorithms for finding the maximum and median almost surely in constant time. Technical report, Carnegie-Mellon University, 1982.

Google Scholar

[7]

S. Rajasekaran. Randomized parallel selection. In Foundations of Software Technology and Theory of Computation, 1990. to appear.

Digital Library

Google Scholar

[8]

R. Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM Journal of Computing, 14(2):396-411, May 1985.

Crossref

Google Scholar

[9]

S. Rajasekaran and Th. Tsantilas. Optimal routing algorithms for meshconnected processor arrays. Algorithmica (to appear), 1991. Preliminary version in Proc. AWOC '88, Lecture Notes in Computer Science, vol. 319, Springer-Verlag (1988), pp. 411-422.

Digital Library

Google Scholar

[10]

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

Digital Library

Google Scholar

[11]

C. Schnorr and A. Shamir. An optimal sorting algorithm for mesh connected computers. In Symposium on the Theory of Computation, pages 255-263, 1986.

Digital Library

Google Scholar

[12]

C. Thompson and H. Kung. Sorting on a mesh connected parallel computer. Communications of the A CM, 20:263- 270, 1977.

Digital Library

Google Scholar

[13]

L. Valiant. Parallelism in comparison problems. SIAM Journal of Computing, 4:348-355, 1975.

Crossref

Google Scholar

Cited By

View all

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
Suel T(2005)On randomized and deterministic schemes for routing and sorting on fixed-connection networksParallel and Distributed Processing10.1007/3-540-64359-1_711(384-386)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-64359-1_711
Show More Cited By

Index Terms

Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Data structures design and analysis
      1. Sorting and searching

Recommendations

Multipacket Selection on Mesh-Connected Processor Arrays
IPPS '92: Proceedings of the 6th International Parallel Processing Symposium

The authors show efficient, deterministic algorithms for selection on the mesh-connected processor array, in the case when there are several elements at every processor. In particular, on a p-processor mesh, with N or=p elements, stored N/p at every ...
Fast deterministic selection on mesh-connected processor arrays

We present a deterministic algorithm for selecting the element of rankk amongN=n2 elements, 1≤k≤N, on ann n mesh-connected processor array in 1.45n parallel computation steps, using constant-sized queues (for large enoughn). This is a considerable ...
Selection, sorting, and routing on mesh-connected processor arrays

Comments

Information & Contributors

Information

Published In

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

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]

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

26
Total Citations
View Citations
329
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)10

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
Suel T(2005)On randomized and deterministic schemes for routing and sorting on fixed-connection networksParallel and Distributed Processing10.1007/3-540-64359-1_711(384-386)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-64359-1_711
Krizanc D(2005)A survey of randomness and parallelism in comparison problemsParallel and Distributed Processing10.1007/3-540-64359-1_703(324-329)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-64359-1_703
Krizanc DNarayanan L(2005)Sorting and selection on arrays with diagonal connectionsParallel and Distributed Computing Theory and Practice10.1007/3-540-58078-6_12(121-136)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-58078-6_12
Rajasekaran S(2005)Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selectionAlgorithms—ESA '9310.1007/3-540-57273-2_66(309-320)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57273-2_66
Kunde M(2005)Block gossiping on grids and tori: Deterministic sorting and routing match the bisection boundAlgorithms—ESA '9310.1007/3-540-57273-2_62(272-283)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57273-2_62
Krizanc DNarayanan LRaman R(2005)Fast deterministic selection on mesh-connected processor arraysFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-54967-6_79(336-346)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-54967-6_79
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.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Multipacket Selection on Mesh-Connected Processor Arrays

Fast deterministic selection on mesh-connected processor arrays

Selection, sorting, and routing on mesh-connected processor arrays

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Multipacket Selection on Mesh-Connected Processor Arrays

Fast deterministic selection on mesh-connected processor arrays

Selection, sorting, and routing on mesh-connected processor arrays

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations