Article

Free access

Matching the bisection bound for routing and sorting on the mesh

Authors:

Michael Kaufmann,

Sanguthevar Rajasekaran,

Jop F. SibeynAuthors Info & Claims

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

Pages 31 - 40

https://doi.org/10.1145/140901.140905

Published: 01 June 1992 Publication History

PDF eReader

References

[1]

Angluin, D., and Valiant, L.G., 'Fast Probabilistic Algorithms for Hamiltonian Paths and Matchings,' journal of Computer and Systems Science, 18, 1979, pp. 155-193.

Crossref

Google Scholar

[2]

Chernoff, H., 'A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,' Annals of Mathematical Statistics 23, 1952, pp. 493-507.

Crossref

Google Scholar

[3]

Dally, W., 'Wire-efficient VLSI Multiprocessor Communication Networks,' in Advanced Research in VLSI, 1987, pp. 391-415.

Google Scholar

[4]

Kaklamanis, C., Krizanc, D., Narayanan, L., and Tsantilas, Th., 'Randomized Sorting and Selection on mesh Connected Processor Arrays,' Proc. ACM Symposium on Parallel Algorithms and Architectures, 1991.

Digital Library

Google Scholar

[5]

Kaufmann, M., and Sibeyn, J., 'Randomized Multi-Packet Routing on Meshes,' Techn. Rep. RUU-CS-91-48, Dep. of CS, Utrecht University, Utrecht, 1991.

Google Scholar

[6]

Kaufmann, M., and Sibeyn, J., 'Multi Packet Routing in Lightly Loaded Processor Arrays, draft (1991).

Google Scholar

[7]

Krizanc, D., Rajasekaran, S., and Tsantilas, T. 'Optimal Routing Algorithms for Mesh Connected Processor Arrays,' Proc. VLSI Algorithms and Architectures: AWOC, 1988. Springer-Verlag Lecture Notes in Computer Science #319, pp. 411-22. To appear in Algorithmica.

Digital Library

Google Scholar

[8]

Kunde, M., and Tensi, T. 'Multi-Packet Routing on Mesh Connected Arrays,' Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 336-343.

Digital Library

Google Scholar

[9]

Kunde, M., 'Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound,' IEEE Symposium on Foundations of Computer Science, 1991, pp. 141-150.

Digital Library

Google Scholar

[10]

Kunde, M., 'Routing and Sorting on Grids', Habilitatlon the~i~, Technical University of Munich 1991.

Google Scholar

[11]

Leighton, T., 'Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes', Morgan-Kaufmann Publishers, San Mateo, California, 1992.

Digital Library

Google Scholar

[12]

Leighton, T., Makedon, F., and Tollis, I.G. 'A 2n- 2 Step Algorithm for Routing in an n x n Array With Constant Size Queues,' Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 328-335.

Digital Library

Google Scholar

[13]

Makedon, F., Simvonis, A., 'On bit Serial packet routing for the mesh and the torus.' Proc. third Symposium on Frontiers of Massively Parallel Computation, 1990, pp. 294-302.

Crossref

Google Scholar

[14]

Park, A., and Balasubramanian, K., 'Reducing Communication Costs for Sorting on Mesh- Connected and Linearly Connected Parallel Computers,' J. of Parallel and Distributed Computing, 9, 1990, pp. 318-322.

Crossref

Google Scholar

[15]

Rajasekaran, S., 'Randomized Algorithms for Packet Routing on the Mesh,' to appear in Advances in Parallel Algorithms, Blackwell Scientific Publications, 1991.

Digital Library

Google Scholar

[16]

Rajasekaran, S., 'k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh,' Technical Report, Department of CIS, University of Pennsylvania, Philadelphia, PA 19104, October 1991.

Google Scholar

[17]

Rajasekaran, S., and Overholt, R., 'Constant Queue Routing on a Mesh,' Proc. Symp. on Theor. Aspects of Comp. Sc., 1990. Springer-Verlag Lecture Notes in Comp. Sc ~480, pp 444-455. To appear in JPDC.

Digital Library

Google Scholar

[18]

Rajasekaran, S., and Raghavachari, M., 'Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh,' to be presented in the IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, Dec. 1991.

Google Scholar

[19]

Rajasekaran, S., and Sen, S., 'Random Sampling Techniques and Parallel Algorithms Design,' in Synthesis of Parallel Algorithms, editor: Reif, J.H., Morgan-Kaufmann Publishers, San Mateo, California, 1992.

Google Scholar

[20]

Rajasekaran, S., and Tsantilas, T. 'An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh like Routing Networks,' Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science, 1987. Springer-Verlag Lecture Notes in Computer Science #287, pp. 226-241.

Digital Library

Google Scholar

[21]

Reischuk, R., 'Probabilistic Parallel Algorithms for Sorting and Selection,' SIAM Journal of Computing, 14(2), 1985, pp. 396-411.

Digital Library

Google Scholar

[22]

Schnorr, C.P., and Shamir, A., 'An Optimal Sorting Algorithm for a Mesh Connected Parallel Computer,' Comm. ACM, 20 (1977) pp. 263-270.

Digital Library

Google Scholar

[23]

Valiant, L.G., and Brebner, G.J., 'Universal Schemes for Parallel Communication,' In Proc. 13th ACM Symposium on Theory of Computing, 1981, pp. 263-277.

Digital Library

Google Scholar

Cited By

View all

Osterloh A(2008)Deterministic hot-potato permutation routing on the mesh and the torusProceedings of the 5th international conference on Theory and applications of models of computation10.5555/1791834.1791857(223-233)Online publication date: 25-Apr-2008
Osterloh A(2008)Deterministic Hot-Potato Permutation Routing on the Mesh and the TorusTheory and Applications of Models of Computation10.1007/978-3-540-79228-4_20(223-233)Online publication date: 2008
Kumar AManjunath DKuri J(2008)Wireless NetworkingundefinedOnline publication date: 24-Mar-2008
Show More Cited By

Index Terms

Matching the bisection bound for routing and sorting on the mesh
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Tighter upper bound for sorting permutations with prefix transpositions

Permutations are sequences where each symbol in the given alphabet Σ appears exactly once. A transposition is an operation that exchanges two adjacent sublists in a permutation; if one of these sublists is restricted to be a prefix then one obtains a ...
Improved upper bound for sorting permutations by prefix transpositions
Abstract
Modelling of chromosomes with permutations has triggered the research of sorting permutations using global rearrangement operations in computational molecular biology. One such rearrangement is transposition which swaps two adjacent ...
A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network

1/2 network capacity is often believed to be the limit of worst-case throughput for mesh networks. However, this letter provides a new optimal worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix two-dimensional mesh ...

Comments

Information & Contributors

Information

Published In

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

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 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

30
Total Citations
View Citations
225
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)9

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Osterloh A(2008)Deterministic hot-potato permutation routing on the mesh and the torusProceedings of the 5th international conference on Theory and applications of models of computation10.5555/1791834.1791857(223-233)Online publication date: 25-Apr-2008
Osterloh A(2008)Deterministic Hot-Potato Permutation Routing on the Mesh and the TorusTheory and Applications of Models of Computation10.1007/978-3-540-79228-4_20(223-233)Online publication date: 2008
Kumar AManjunath DKuri J(2008)Wireless NetworkingundefinedOnline publication date: 24-Mar-2008
Savchenko MFrazzoli E(2005)On the time complexity of conflict-free vehicle routingProceedings of the 2005, American Control Conference, 2005.10.1109/ACC.2005.1470521(3536-3541)Online publication date: 2005
Sibeyn J(2005)Sample sort on meshesEuro-Par'97 Parallel Processing10.1007/BFb0002762(389-398)Online publication date: 26-Sep-2005
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
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
Juurlink BRao PSibeyn J(2005)Worm-hole gossiping on meshesEuro-Par'96 Parallel Processing10.1007/3-540-61626-8_47(361-369)Online publication date: 8-Jun-2005
Sibeyn J(2005)Routing on triangles, tori and honeycombsMathematical Foundations of Computer Science 199610.1007/3-540-61550-4_176(529-541)Online publication date: 2-Jun-2005
Kaufmann MSibeyn JSuel T(2005)Beyond the worst-case bisection bound: Fast sorting and ranking on meshesAlgorithms — ESA '9510.1007/3-540-60313-1_135(75-88)Online publication date: 1-Jun-2005
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Tighter upper bound for sorting permutations with prefix transpositions

Improved upper bound for sorting permutations by prefix transpositions

A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network

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

Tighter upper bound for sorting permutations with prefix transpositions

Improved upper bound for sorting permutations by prefix transpositions

A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations