Author:
Bermond Jean-Claude,Di Ianni Miriam,Flammini Michele,Perennes Stephane
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. B. Awerbuch, S. Kutten, and D. Peleg. Efficient deadlock-free routing. In 10th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 177–188, Montreal, Canada, 1991.
2. P.E. Berman, L. Gravano, G.D. Pifarré, and J.L.C. Sanz. Adaptive deadlock and livelock-free routing with all minimal paths in torus networks. In 4th Symposium on Parallel Algorithms and Architectures (SPAA), pages 3–12, June 1992.
3. 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.
4. 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.
5. 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.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献