Abstract
k-Interval Labeling Schemes (k-ILS) are compact routing schemes on general networks which have been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chips. In this paper we introduce an extension of the k-ILS to the 〈k, s∼>-DFILS (Deadlock-Free ILS), where k is the number of intervals and s is the number of buffers used at each node or edge to prevent deadlock. Whereas k-ILS only compactly represents shortest paths between pairs of nodes, this new extension aims to represent those particular ones that give rise also to deadlock-free routing controllers which use a low number of buffers per node or per edge. In this paper we prove new NP-hardness results on the problem of devising low occupancy schemes, also for classical k-ILS. Moreover, while space complexity results are given for 〈k, s∼>-DFILS in arbitrary networks, tight results are shown for specific topologies, such as trees, rings, grids, complete graphs and chordal rings. Finally, trade-offs are derived between the number of intervals k and the number of buffers s in Deadlock-Free Interval Routing Schemes for hypercubes, grids, tori and Cartesian products of graphs.
Work supported by the EU TMR Research Training Grant N. ERBFMBICT960861, by the EU ESPRIT Long Term Research Project ALCOM-IT under contract N. 20244 and by the Italian MURST 40% project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
Preview
Unable to display preview. Download preview PDF.
References
J.C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennès. Systolic acyclic orientations for deadlock prevention on usual networks. Manuscript, 1995.
J.C. Bermond and M. Syska. Routage wormhole et canaux virtuel. In M. Cosnard M. Nivat and Y. Robert, editors, Algorithmique Parallèle, pages 149–158. Masson, 1992.
Robert Cypher and Luis Gravano. Requirements for deadlock-free, adaptive packet routing. In 11th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 25–33, 1992.
W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comp., C-36, N.5:547–553, May 1987.
M. Di Ianni, M. Flammini, R. Flammini, and S. Salomone. Systolic acyclic orientations for deadlock prevention. In 2nd Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1995.
J. Duato. Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm. In 3rd IEEE Symposium on Parallel and Distributed Processing, 1991.
J. Duato. On the design of deadlock-free adaptive routing algorithms for multicomputers: theoretical aspects. In 2nd European Conference on Distributed Memory Computing, volume 487 of Lecture Notes in Computer Science, pages 234–243. Springer-Verlag, 1991.
M. Flammini and G. Gambosi. Compact routing in chordal ring networks. Manuscript, 1996.
M. Flammini, G. Gambosi, and S. Salomone. Interval routing schemes. To appear on Algorithmica, 1996.
M. Flammini, J. van Leeuwen, and A. Marchetti Spaccamela. The complexity of interval routing on random graphs. In 20th Symposium on Mathematical Foundation of Computer Science (MFCS), volume 969 of Lecture Notes in Computer Science, pages 37–49. Springer-Verlag, 1995.
E. Fleury and P. Fraigniaud. Deadlocks in adaptive wormhole routing. Research Report, Laboratoire de l'Informatique du Parallélisme, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, March 1994.
G.N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171–190, 1988.
C. Gavoille and S. Pérennès. Lower bounds for interval routing on 3-regular networks. In 3rd Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1996.
K.D. Gunther. Prevention of deadlock in packet-switched data transport system. IEEE Trans. on Commun., COM-29:512–514, May 1981.
The T9000 Transputer Products Overview Manual. INMOS, 1991.
E. Kranakis, D. Krizanc, and S.S. Ravi. On multi-label linear interval routing schemes. In 19th Workshop on Graph Theoretic Concepts in Computer Science (WG), volume 790 of Lecture Notes in Computer Science, pages 338–349. Springer-Verlag, 1993.
P.M. Merlin and P.J. Schweitzer. Deadlock avoidance in store-and-forward networks: Store and forward deadlock. IEEE Trans. on Commun., COM-28:345–352, March 1980.
A.G. Ranade. How to emulate shared memory. In Foundation of Computer Science, pages 185–194, 1985.
Jean De Rumeur. Communication dans les réseaux de processeurs. Collection Etudes et Recherchers en Informatique. Masson, 1994.
P. Ruzicka. On efficiency of interval routing algorithms. In Mathematical Foundations of Computer Science (MFCS), volume 324 of Lecture Notes in Computer Science, pages 492–500. Springer-Verlag, 1988.
N. Santoro and R. Khatib. Labeling and implicit routing in networks. The Computer Journal, 28:5–8, 1985.
A.S. Tannenbaum. Computer Networks. Englewood Cliffs, Prentice Hall, 1988.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U.K., 1994.
J. van Leeuwen and R.B. Tan. Routing with compact routing tables. In G. Rozemberg and A. Salomaa, editors, The book of L, pages 259–273. Springer-Verlag, 1986.
J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30:298–307, 1987.
J. van Leeuwen and R.B. Tan. Compact routing methods: A survey. In 1st Colloquium on Structural Information and Communication Complexity (SICC), pages 71–93. Carleton University Press, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M. (1997). Deadlock-free interval routing schemes. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023472
Download citation
DOI: https://doi.org/10.1007/BFb0023472
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive