Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1994: Algorithms and Computation pp 333–341Cite as

Fast deterministic Hot-Potato routing on processor arrays

  • Conference paper
  • First Online:

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

Abstract

Hot-Potato routing is a very simple and powerful approach for processor communication in parallel networks and it is widely used in practice. For the permutation routing problem on meshes, which is the standard problem considered in the literature, we develop new analysis techniques and double the efficiency of the best deterministic algorithms. We also present lower bounds for the greedy method applied to HotPotato schemes.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acampora, A.S., Shah, S.I.A., ‘Multihop lightwave networks: a comparison of storeand forward and hot-potato routing,’ IEEE INFOCOM, pp. 10–19, 1991.

    Google Scholar 

  2. Athas, W.C., ‘Physically Compact, High Performance Multicomputers,’ MIT Conference on Advanced Research in VLSI, pp. 302–313, 1990.

    Google Scholar 

  3. Baran P., ‘On distributed communications networks,’ IEEE Transactions on Communications, pp. 1–9, 1964.

    Google Scholar 

  4. Borodin A., J.E. Hopcroft, ‘Routing, merging and sorting on parallel models of computation,’ Journal of Computer Systems and Sciences, pp. 130–145, 1985.

    Google Scholar 

  5. Feige, U., P. Raghavan, ‘Exact Analysis of Hot-Potato Routing,’ Proc. 33rd Symp. on Foundations of Computer Science, pp. 553–562, IEEE, 1992.

    Google Scholar 

  6. Greenberg, A.G. and B. Hajek, ‘Deflection routing in hypercube networks,’ IEEE Trans. Communications, 1992.

    Google Scholar 

  7. Hillis, W.D., ‘The Connection Machine,’ MIT Press, 1985.

    Google Scholar 

  8. Kaklamanis Ch., D. Krizanc, S. Rao, ‘Hot-potato routing on processor arrays,’ Proc. ACM Symp. on Parallel Algorithms and Architectures, pp. 273–282, 1993.

    Google Scholar 

  9. Leighton, F.T., Introduction to Parallel Algorithms and Architectures: ArraysTrees-Hypercubes, Morgan-Kaufmann Publishers, San Mateo, California, 1992.

    Google Scholar 

  10. Maxemchuk, N.F., ‘Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks,’ IEEE INFOCOM, pp. 800–809, 1989.

    Google Scholar 

  11. Newman, I., A. Schuster, ‘Hot-Potato Algorithms for Permutation Routing,’ Proc. ISTCS, June 1993.

    Google Scholar 

  12. Schnorr, C.P., A. Shamir, ‘An Optimal Sorting Algorithm for Mesh Connected Computers,’ 18th Symp. on Theory of Computing, pp. 255–263, ACM, 1986.

    Google Scholar 

  13. Seitz, ‘The Caltech Mosaic C: an experimental, fine-grain multicomputer,’ 4th Annual ACM Symp. on Parallel Algorithms and Architectures, 1992.

    Google Scholar 

  14. Smith, B., ‘Architecture and Applications of the HEP Multiprocessor Computer System,’ Proc. 4th Real Time Signal Processing, pp. 241–248, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Michael Kaufmann & Harald Lauer

  2. Department of E&CE, University of Newcastle, 2308, NSW, Australia

    Heiko Schröder

Authors
  1. Michael Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harald Lauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heiko Schröder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaufmann, M., Lauer, H., Schröder, H. (1994). Fast deterministic Hot-Potato routing on processor arrays. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_197

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_197

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation