Deadlock-free interval routing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 351-362

  Flammini, Michele ^a,b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; ROUTING PROTOCOLS; TOPOLOGY; TREES (MATHEMATICS);

ARBITRARY NETWORKS; CARTESIAN PRODUCTS OF GRAPHS; COMPACT ROUTING; DEADLOCK-FREE ROUTING; GENERAL NETWORKS; INTERVAL ROUTING; NP-HARDNESS RESULTS; SPACE COMPLEXITY;

NETWORK ROUTING;

EID: 84949653969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023472     Document Type: Conference Paper

References (26)

1. J.C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennès. Systolic acyclic orientations for deadlock prevention on usual networks. Manuscript, 1995.
2. J.C. Bermond and M. Syska. Routage wormhole et canaux virtuel. In M. Cosnaxd M. Nivat and Y. Robert, editors, Algorithmique Parallèle, pages 149-158. Masson, 1992.
3. 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.
4. 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.
5. 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.
6. J. Duato. Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm. In 3rd IEEE Symposium on Parallel and Distributed Processing, 1991.
7. 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.
8. M. Flammini and G. Gambosi. Compact routing in chordal ring networks. Manuscript, 1996.
9. M. Flammini, G. Gambosi, and S. Salomone. Interval routing schemes. To appear on Algorrithmica, 1996.
10. 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.
11. 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.
12. G.N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
13. 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.
14. K.D. Gunther. Prevention of deadlock in packet-switched data transport system. IEEE Trans, on Commun., COM-29:512-514, May 1981.
15. The T9000 Transputer Products Overview Manual. INMOS, 1991.
16. 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.
17. P.M. Merlin and P.J. Schweitzer. Deadlock avoidance in store-and-forwaxd networks: Store and forward deadlock. IEEE Trans, on Commun., COM-28:345-352, March 1980.
18. A.G. Ranade. How to emulate shared memory. In Foundation of Computer Science, pages 185-194, 1985.
19. Jean De Rumeur. Communication dans les réseaux de processeurs. Collection Etudes et Recherchers en Informatique. Masson, 1994.
20. 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.
21. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The Computer Journal, 28:5-8, 1985.
22. A.S. Tannenbaum. Computer Networks. Englewood Cliffs, Prentice Hall, 1988.
23. Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U.K., 1994.
24. 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.
25. J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30:298-307, 1987.
26. 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.