Skip to main content
SpringerLink
Log in

Optimal interval routing

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

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

Abstract

Interval routing was introduced to reduce the size of the routing tables. This way of implementing routing functions is quite attractive but very few is known on the topological properties that should satisfy a network to admit an interval routing function satisfying particular constraints (shortest paths, limited number of intervals associated to each direction, etc). In this paper, we investigate the study of optimal interval routing functions, that is routing functions that construct shortest paths. In particular we derive practical tools that allow to determine if a network supports or not an optimal interval routing function. We describe large classes of networks that admit optimal interval routing functions. We also study the case of the usual networks that interconnect the processors of a distributed memory parallel computer.

The first author received the support of the Centre de Recerca Matemàtica, Institut d'Estudis Catalans, Bellaterra, Spain.

Both authors are supported by the research programs ANM and C3.

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. Sheldon B. Akers, Dov Harel, and Balakrishnan Krishnamurthy. The star graph: An attractive alternative to the n-cube. In International Conference on Parallel Processing (ICPP-87), pages 393–400, St. Charles, Illinois, August 1987.

    Google Scholar 

  2. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Improved routing strategies with succint tables. Journal of Algorithms, 11:307–341, February 1990.

    Google Scholar 

  3. Erwin M. Bakker, Jan van Leeuwen, and Richard B. Tan. Linear interval routing. Algorithms Review, 2:45–61, 1991.

    Google Scholar 

  4. Frédéric Desprez, Eric Fleury, and Michel Loi. T9000 et cl04: La nouvelle génération de transputers. Technical Report 93-01, LIP-ENS Lyon, February 1993.

    Google Scholar 

  5. P. Fraigniaud and C. Gavoille. Interval Routing Schemes. Research Report 94-04, Laboratoire de l'Informatique du Parallélisme, ENS-Lyon, France, 1994. Submitted to the Journal of the ACM.

    Google Scholar 

  6. Greg N. Frederickson and Ravi Janardan. Designing networks with compact routing tables. Algorithmica, pages 171–190, 1988.

    Google Scholar 

  7. Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843–857, August 1989.

    Google Scholar 

  8. Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164–181, February 1990.

    Google Scholar 

  9. T. Leighton. Introduction to Parallel Algorithms and architectures: Arrays — Trees — Hypercubes. Morgan Kaufmann, 1992.

    Google Scholar 

  10. M.D. May, P.W. Thompson, and P.H. Welch. Networks, routers and transputers: Function, perfomance, and applications. Technical report, inmos, SGSTHOMSON, 1993.

    Google Scholar 

  11. M. Picquendar. Communication Performances of Several Interconnection Topologies for T9000-C104 Multicomputers. Technical report, Laboratoire de l'Informatique du Parallélisme, 1993.

    Google Scholar 

  12. F. Preparata and J. Vuillemin. The cube connected cycles: a versatile network for parallel computation. Communications of the ACM, 24(5):300–309, 1981.

    Google Scholar 

  13. Peter Rušička. On efficient of interval routing algorithms. In M.P. Chytil, L. Janiga, and V. Koubek, editors, in Mathematical Foundations of Computer Science, volume 324 of Lectures Notes in Computer Science, pages 492–500, 1988.

    Google Scholar 

  14. Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5–8, 1985.

    Google Scholar 

  15. H. S. Stone. Parallel processing with the perfect shuffle. IEEE TC, c-20(2):153–161, 1971.

    Google Scholar 

  16. Jan van Leeuwen and Richard B. Tan. Interval routing. The Computer Journal, 30(4):298–307, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP-CNRS, Ecole Normale Supérieure de Lyon, 69364, Lyon Cedex 07, France

    Pierre Fraigniaud & Cyril Gavoille

Authors
  1. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fraigniaud, P., Gavoille, C. (1994). Optimal interval routing. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation