Article

Free access

Tight bounds for oblivious routing in the hypercube

Authors:

C. Kaklamanis,

D. Krizanc,

T. TsantilasAuthors Info & Claims

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

Pages 31 - 36

https://doi.org/10.1145/97444.97453

Published: 01 May 1990 Publication History

PDF eReader

References

[1]

R. ALELIUNAS, Randomized Parallel Communication, in Pro~. ACM Symp. on Principles of Distributed Computing, 1982, pp. 60-72.

Digital Library

Google Scholar

[2]

J. AUBERT AND B. SCHNEIDER, Ddcomposition de la somme cartgsienne d'un cycle et de l'uniou de deux cycles hamilloniens en cycles hamiltoniens, Discrete Mathematics 38 (1982) pp. 7-16.

Digital Library

Google Scholar

[3]

A. BORODIN AND J. HOr'CrtOFT, Routing, Merging and Sorting on Parallel Models of Computation, JCSS 30 (1985), pp. 130-145.

Digital Library

Google Scholar

[4]

D. KrttZANC, D. PELEG ASD E. UPFAL, A Time- Randomness Tradeoff for Oblivions Routing, in Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 93-102.

Digital Library

Google Scholar

[5]

D. KRIZANC, S. RAJASEKARAN AND TH. TSAN- TILAS, Optimal Routing Algorithms for Mesh- Connected Processor Arrays, in Proc. AWOC '88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag (1988), pp. 411-422.

Digital Library

Google Scholar

[6]

I. PartBErtrtY, An Optimal Time Bound for Oblivious Routing, to appear in Algorithmica.

Google Scholar

[7]

M. O. RABIN, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance, J. of ACM, 36 (1989), pp. 335-348.

Digital Library

Google Scholar

[8]

G. R.INGEL, Uber drei kombinatorische Probleme am n-dimensionalen W~rfel und W~rfelgitter, Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 20 (1955), pp. 10-19.

Crossref

Google Scholar

[9]

L. G. VALIANT, A Scheme for Fast Parallel Communication, SIAM J. Comp. 11 (1982), pp. 350- 361.

Crossref

Google Scholar

[10]

L. G. VALIANT, General Purpose Parallel Architectures, to appear in Handbook of Theoretical Computer Science, ed. J. van Leeuwan, North- Holland, 1990.

Digital Library

Google Scholar

[11]

L. G. VALIANT AND G. J. BREUNErt, Universal Schemes for Parallel Communication, Ia Proc. 13th ACM Symposium on Theory of Computing, 1981, pp. 263-277.

Digital Library

Google Scholar

[12]

J. ULLMAN, Computational Aspects of VLSI, Computer Science Press, 1984.

Digital Library

Google Scholar

[13]

E. UPFAL, Efficient Schemes for Parallel Communication, :I. of ACM 31 (1984), pp. 507-517.

Digital Library

Google Scholar

[14]

D. H. WIEDEMANN, Hamming Geometry, Ph. D. Thesis, University of Waterloo, Waterloo, Ontario, 1986.

Google Scholar

Cited By

View all

Amir DWilson TShrivastav VWeatherspoon HKleinberg RAgarwal RLeonardi SGupta A(2022)Optimal oblivious reconfigurable networksProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520020(1339-1352)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520020
Békési JGalambos G(2016)RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_351(1868-1871)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_351
Bansal N(2014)Oblivious RoutingEncyclopedia of Algorithms10.1007/978-3-642-27848-8_261-2(1-6)Online publication date: 28-Oct-2014
https://doi.org/10.1007/978-3-642-27848-8_261-2
Show More Cited By

Index Terms

Tight bounds for oblivious routing in the hypercube

Recommendations

Nearly tight bounds for wormhole routing
SFCS '94: Proceedings of the 35th Annual Symposium on Foundations of Computer Science

We present nearly tight bounds for wormhole muting on Butterfly networks which indicate it is fundamentally different from store-and-forward packet routing. For instance, consider the problem of routing N log N (randomly generated) log N length messages ...
Tight lower bounds for greedy routing in uniform small world rings
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing

We consider augmented ring-based networks with vertices 0,...,n-1, where each vertex is connected to its left and right neighbor and possibly to some further vertices (called long range contacts). The outgoing edges of a vertex v are obtained by ...
Adaptive packet routing in a hypercube
C³P: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1

All commercial hypercubes use fixed-path routing for packet switching. However, it has long been known that adaptive routing reduces packet delay by sending packets via less congested areas. Moreover, the hypercube topology contains many alternative, ...

Comments

Information & Contributors

Information

Published In

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

May 1990

417 pages

ISBN:0897913701

DOI:10.1145/97444

Chairman:
F. T. Leighton
Massachusetts Institute of Technology, Cambridge, MA

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

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA90

Sponsor:

Computer Tech Inst.
CTI
SIGACT
SIGARCH
EATCS
IEEE-CS

SPAA90: 2nd Annual ACM Symposium on Parallel Algorithms & Architecture

July 2 - 6, 1990

Island of Crete, Greece

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
786
Total Downloads

Downloads (Last 12 months)84
Downloads (Last 6 weeks)8

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Amir DWilson TShrivastav VWeatherspoon HKleinberg RAgarwal RLeonardi SGupta A(2022)Optimal oblivious reconfigurable networksProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520020(1339-1352)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520020
Békési JGalambos G(2016)RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_351(1868-1871)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_351
Bansal N(2014)Oblivious RoutingEncyclopedia of Algorithms10.1007/978-3-642-27848-8_261-2(1-6)Online publication date: 28-Oct-2014
https://doi.org/10.1007/978-3-642-27848-8_261-2
Busch CMagdon-Ismail M(2012)Optimal Oblivious Routing in Hole-Free NetworksQuality, Reliability, Security and Robustness in Heterogeneous Networks10.1007/978-3-642-29222-4_30(421-437)Online publication date: 2012
https://doi.org/10.1007/978-3-642-29222-4_30
Busch CMagdon-Ismail MXi J(2010)Oblivious Routing for Sensor Network TopologiesTheoretical Aspects of Distributed Computing in Sensor Networks10.1007/978-3-642-14849-1_13(381-406)Online publication date: 8-Nov-2010
https://doi.org/10.1007/978-3-642-14849-1_13
Yuan XNienaber WDuan ZMelhem R(2009)Oblivious routing in fat-tree based system area networks with uncertain traffic demandsIEEE/ACM Transactions on Networking10.1109/TNET.2009.201285317:5(1439-1452)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TNET.2009.2012853
Räcke H(2009)Survey on Oblivious Routing StrategiesProceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice10.1007/978-3-642-03073-4_43(419-429)Online publication date: 15-Jul-2009
https://dl.acm.org/doi/10.1007/978-3-642-03073-4_43
Laing AKrumme D(2009)Optimal permutation routing for low‐dimensional hypercubesNetworks10.1002/net.2032555:2(149-167)Online publication date: 31-Jul-2009
https://doi.org/10.1002/net.20325
Busch CMagdon-Ismail MXi J(2008)Optimal Oblivious Path Selection on the MeshIEEE Transactions on Computers10.1109/TC.2008.2357:5(660-671)Online publication date: 1-May-2008
https://dl.acm.org/doi/10.1109/TC.2008.23
Békési JGalambos G(2008)RoutingEncyclopedia of Algorithms10.1007/978-0-387-30162-4_351(791-793)Online publication date: 2008
https://doi.org/10.1007/978-0-387-30162-4_351
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

Nearly tight bounds for wormhole routing

Tight lower bounds for greedy routing in uniform small world rings

Adaptive packet routing in a hypercube

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

Nearly tight bounds for wormhole routing

Tight lower bounds for greedy routing in uniform small world rings

Adaptive packet routing in a hypercube

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