research-article

A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks

Author:

José DuatoAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 6, Issue 9

Pages 976 - 987

https://doi.org/10.1109/71.466634

Published: 01 September 1995 Publication History

Abstract

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed in [25] for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms presented in [25] are extended, so that they can take advantage of the alternative paths offered by the network.

References

[1]

W.C. Athas and C.L. Seitz, “Multicomputers: Message-passing concurrent computers,” Computer, vol. 21, no. 8, pp. 9-24, Aug. 1988.]]

Digital Library

[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,” Proc. Fourth ACM Symp. Parallel Algorithms Architectures, June 1992.]]

Digital Library

[3]

S. Borkar, et al., “iWarp: An integrated solution to high-speed parallel computing,” Proc. Supercomputing ’88, Nov. 1988.]]

Digital Library

[4]

G.T. Byrd, N.P. Saraiya, and B.A. Delagi, “Multicast communication in multiprocessor systems,” Proc. 1989 Int’l Conf. Parallel Processing, pp. I-196-I-200, Aug. 1989.]]

[5]

C. Chiang and L.M. Ni, “Multi-address encoding for multicast,” Proc. Parallel Computer Routing and Comm. Workshop, May 1994.]]

Digital Library

[6]

A.A. Chien and J.H. Kim, “Planar-adaptive routing: Low-cost adaptive networks for multiprocessors,” Proc. 19th Ann. Int’l Symp. Comput. Architecture, May 1992.]]

Digital Library

[7]

W.J. Dally, “Virtual-channel flow control,” IEEE Trans. Parallel Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.]]

Digital Library

[8]

W.J. Dally and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels,” IEEE Trans. Parallel Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.]]

Digital Library

[9]

W.J. Dally and C.L. Seitz, “The torus routing chip,” Distributed Comput., vol. 1, no. 3, pp. 187-196, Oct. 1986.]]

[10]

W.J. Dally and C.L. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks,” IEEE Trans. Comput., vol. 36, no. 5, pp. 547-553, May 1987.]]

Digital Library

[11]

J. Duato, “On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects,” Proc. Second European Distributed Memory Computing Conf., Apr. 1991.]]

Digital Library

[12]

J. Duato, “On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies,” Proc. Parallel Architectures Languages Europe 91, June 1991.]]

Digital Library

[13]

J. Duato, “Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm,” Proc. Third IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1991.]]

Digital Library

[14]

J. Duato, “Improving the efficiency of virtual channels with time-dependent selection functions,” Proc. Parallel Architectures Languages Europe 92, June 1992.]]

Digital Library

[15]

J. Duato, “A new theory of deadlock-free adaptive multicast routing in wormhole networks,” Proc. Fifth IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1993.]]

Digital Library

[16]

J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. Parallel Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.]]

Digital Library

[17]

J. Duato, “A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks,” Proc. Int’l Conf. Parallel Processing, Aug. 1994.]]

Digital Library

[18]

E. Fleury and P. Fraigniaud, “Strategies for multicasting in meshes,” Proc. Int’l Conf. Parallel Processing, Aug. 1994.]]

Digital Library

[19]

P.T. Gaughan and S. Yalamanchili, “Adaptive routing protocols for hypercube interconnection networks,” Computer, vol. 26, no. 5, pp. 12-23, May 1993.]]

Digital Library

[20]

C.J. Glass and L.M. Ni, “The turn model for adaptive routing,” Proc. 19th Ann. Int’l Symp. Comput. Architecture, May 1992.]]

Digital Library

[21]

C.R. Jesshope, P.R. Miller, and J.T. Yantchev, “High performance communications in processor networks,” Proc. 16th Ann. Int’l Symp. Comput. Architecture, May-June 1989.]]

Digital Library

[22]

H.T. Kung, “Deadlock avoidance for systolic communication,” Proc. 15th Ann. Int’l Symp. Comput. Architecture, May-June 1988.]]

Digital Library

[23]

Y. Lan, A.H. Esfahanian, and L.M. Ni, “Multicast in hypercube multiprocessors,” J. Parallel Distributed Comput., pp. 30-41, Jan. 1990.]]

Digital Library

[24]

X. Lin and L.M. Ni, “Multicast communication in multicomputers networks,” Proc. 1990 Int’l Conf. Parallel Processing, pp. III-114-III-118, Aug. 1990.]]

[25]

X. Lin and L.M. Ni, “Deadlock-free multicast wormhole routing in multicomputer networks,” Proc. 18th Ann. Int’l Symp. Comput. Architecture, May 1991.]]

Digital Library

[26]

X. Lin, P.K. McKinley, and A.H. Esfahanian, “Adaptive multicast wormhole routing in 2D mesh multicomputers,” Proc. Parallel Architectures Languages Europe 93, June 1993.]]

Digital Library

[27]

X. Lin, P.K. McKinley, and L.M. Ni, “The message flow model for routing in wormhole-routed networks,” Proc. 1993 Int’l Conf. Parallel Processing, Aug. 1993.]]

Digital Library

[28]

X. Lin, A.H. Esfahanian, P.K. McKinley, and A. Burago, “Adaptive wormhole routing in hypercube multicomputers,” Proc. Fifth IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1993.]]

Digital Library

[29]

X. Lin and L.M. Ni, “Multicast communication in multicomputer networks,” IEEE Trans. Parallel Distributed Systems, vol. 4, no. 10, pp. 1,104-1,117, Oct. 1993.]]

Digital Library

[30]

X. Lin, P.K. McKinley, and L.M. Ni, “Deadlock-free multicast wormhole routing in 2D mesh multicomputers,” IEEE Trans. Parallel Distributed Systems, vol. 5, no. 8, pp. 793-804, Aug. 1994.]]

Digital Library

[31]

D.H. Linder and J.C. Harden, “An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes,” IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.]]

Digital Library

[32]

Z. Liu and H. Wu, “Performance evaluation of adaptive wormhole routing in 3D mesh networks,” Proc. 26th Ann. Simulation Symp., 1993.]]

[33]

P. López and J. Duato, “Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions,” Proc. Parallel Architectures Languages Europe 93, June 1993.]]

Digital Library

[34]

P.K. McKinley, H. Xu, A.H. Esfahanian, and L.M. Ni, “Unicast-based multicast communication in wormhole-routed networks,” Proc. 1992 Int’l Conf. Parallel Processing, Aug. 1992.]]

[35]

NCUBE Co., NCUBE 6400 Processor Manual, 1990.]]

[36]

L.M. Ni, “Communication issues in multicomputers,” Proc. First Workshop Parallel Processing, Taiwan, pp. 52-64, Dec. 1990.]]

[37]

L.M. Ni and P.K. McKinley, “A survey of wormhole routing techniques in direct networks,” Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.]]

Digital Library

[38]

D.K. Panda, S. Singal, and P. Prabhakaran, “Multidestination message passing mechanism conforming to base wormhole routing scheme,” Proc. Parallel Computer Routing and Comm. Workshop, May 1994.]]

Digital Library

[39]

C.L. Seitz, J. Seizovic, and W.K. Su, “The C programmer’s abbreviated guide to multicomputer programming,” Tech. Rep. Caltech-CS-TR-88-1, Dept. of Computer Science, California Inst. ofTechnology, Jan. 1988.]]

Digital Library

Cited By

Ouyang YSun CLi RWang QLi J(2022)Transit ring: bubble flow control for eliminating inter-ring communication congestionThe Journal of Supercomputing10.1007/s11227-022-04712-z79:2(1161-1181)Online publication date: 21-Jul-2022
https://dl.acm.org/doi/10.1007/s11227-022-04712-z
Bharadwaj SYin JBeckmann BKrishna TLi Z(2020)KiteProceedings of the 57th ACM/EDAC/IEEE Design Automation Conference10.5555/3437539.3437683(1-6)Online publication date: 20-Jul-2020
https://dl.acm.org/doi/10.5555/3437539.3437683
Abad PPuente VGregorio J(2013)LIGEROACM Transactions on Architecture and Code Optimization10.1145/2400682.24006969:4(1-21)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1145/2400682.2400696
Show More Cited By

Index Terms

A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

Deadlock avoidance is a key issue in wormhole networks. A first approach [8] consists of removing the cyclic dependencies between channels. Many deterministic and adaptive routing algorithms have been proposed based on that approach. Although the ...
A new theory of deadlock-free adaptive multicast routing in wormhole networks
SPDP '93: Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed previously. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic ...
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms

This paper presents a framework to design fully-adaptive, deadlock-free wormhole algorithms for a variety of network topologies. The main theoretical contributions are (a) design of new wormhole algorithms using store-and-forward algorithms, (b) a ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 6, Issue 9

September 1995

95 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © Copyright © 1995 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 September 1995

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ouyang YSun CLi RWang QLi J(2022)Transit ring: bubble flow control for eliminating inter-ring communication congestionThe Journal of Supercomputing10.1007/s11227-022-04712-z79:2(1161-1181)Online publication date: 21-Jul-2022
Bharadwaj SYin JBeckmann BKrishna TLi Z(2020)KiteProceedings of the 57th ACM/EDAC/IEEE Design Automation Conference10.5555/3437539.3437683(1-6)Online publication date: 20-Jul-2020
Abad PPuente VGregorio J(2013)LIGEROACM Transactions on Architecture and Code Optimization10.1145/2400682.24006969:4(1-21)Online publication date: 20-Jan-2013
Menezo LPuente VAbad PGregorio JFeo JFaraboschi PVilla O(2012)Improving coherence protocol reactiveness by trading bandwidth for latencyProceedings of the 9th conference on Computing Frontiers10.1145/2212908.2212929(143-152)Online publication date: 15-May-2012
Samman FHollstein TGlesner M(2010)Adaptive and deadlock-free tree-based multicast routing for networks-on-chipIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2009.201975818:7(1067-1080)Online publication date: 1-Jul-2010
Jayasimha DSchwiebert LManivannan DMay J(2003)A foundation for designing deadlock-free routing algorithms in wormhole networksJournal of the ACM10.1145/636865.63686950:2(250-275)Online publication date: 1-Mar-2003
Foreman D(2002)Managing Data in Distributed Multimedia Conferencing ApplicationsIEEE MultiMedia10.1109/MMUL.2002.10419469:4(30-37)Online publication date: 1-Oct-2002
Duato JYalamanchili SNi L(2002)Interconnection NetworksundefinedOnline publication date: 6-Aug-2002
Tseng YYang MJuang T(1999)Achieving Fault-Tolerant Multicast in Injured Wormhole-Routed Tori and Meshes Based on Euler Path ConstructionIEEE Transactions on Computers10.1109/12.81111848:11(1282-1296)Online publication date: 1-Nov-1999
Fleury EFraigniaud P(1998)Strategies for Path-Based Multicasting in Wormhole-Routed MeshesJournal of Parallel and Distributed Computing10.5555/294843.29484753:1(26-62)Online publication date: 25-Aug-1998
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents