Skip to main content
SpringerLink
Log in

Adaptive and oblivious algorithms for d-cube permutation routing

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

Abstract

Assuming d-port multiaccepting communication, we design an optimal locally adaptive permutation routing algorithm on the binary hypercube of dimension 7 (called 7-cube). We also prove an Ω(√N/log N) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the d-cube, d ≤ 6.

Research partially supported by an endowed Komatsu Chair Visiting Professorship at the Graduate School of Information Science, Japan Advanced Institute of Science and Technology

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, S. and Padmanabhan, K.: Performance of the Direct Binary N-cube Network for Multiprocessors. IEEE Transactions on Computers, C-38 (7) 1989, 1000–1011.

    Article  Google Scholar 

  2. W. A. Aiello, W. A., Leighton, F. T., Maggs, B. M., Newman, M.: Fast Algorithms for Bit Serial Routing on a Hypercube. Mathematical Systems Theory. 24, 1991 253–271.

    Google Scholar 

  3. Borodin, A. and Hopcroft, J. E.: Routing, Merging, and Sorting on Parallel Models of Computation. Journal of Computer and System Science. 30, 1985, 130–145.

    Article  Google Scholar 

  4. Cypher, R., Plaxton, C. G.: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. In Proc. 22nd ACM Symposium of Theory of Computing. 1990 193–203.

    Google Scholar 

  5. Grammatikakis, M., Hsu, D. F., Hwang, F. K.: Universality of the D-cube, D < 8. In Proc. Parallel Computer Conference (PARCO 93), Advances in Parallel Computing, Elsevier Sience Publishers. 1993 to appear.

    Google Scholar 

  6. Kaklamanis, C., Krizanc, D., Tsantilas, A.: Tight Bounds for Oblivious Routing on the Hypercube. In Proc. 2nd Annual ACM Symposium of Parallel Algorithms and Architectures. 1990 31–36.

    Google Scholar 

  7. Valiant, L. G., and Brebner, G. J.: Universal Schemes for parallel communication. In Proc. 13th ACM Symposium of Theory of Computing. 1981 263–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, F.O.R.T.H., 711 10, Heraklion, Greece

    Miltos D. Grammatikakis

  2. Computer and Information Science, Fordham University, 10458, Bronx, NY

    D. Frank Hsu

  3. AT&T Bell Laboratories, 07974, Murray Hill, NJ

    Frank K. Hwang

Authors
  1. Miltos D. Grammatikakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Frank Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank K. Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grammatikakis, M.D., Hsu, D.F., Hwang, F.K. (1993). Adaptive and oblivious algorithms for d-cube permutation routing. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_246

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_246

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation