LIN, X., MCKINLEY, P., AND ESFAHANIAN, A. Adaptive multicast wormhole routing in 2D mesh multicomputers. In Proc. of the 5th conference on Parallel Architectures and Languages, Lecture notes in Computer Science (1993), vol. 694, pp. 228--241.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of this author no systematic study of the subject exists. There are some attempts at analytical modeling of wormhole switched networks [32, 39, 87] They are all characterized by imposing crude assumptions about stochastic independence. Otherwise, studies are based on simulation experiments [6, 13, 34, 35, 50, 88, 102, 103, 105, 106]. Unfortunately, the random nature of output data is often neglected in these cases. Usually little or nothing is said about the experimental design, hence it is hard to put confidence in the results. Combining the fact that analytical work rests on stochastic independence with the fact that ....

....is the source for two unfortunate characteristics. First, unbuffered networks are particularly susceptible to deadlocks [37, 40] Second, the throughput degrades rapidly when suspended packets are not removed from the links [32] For both reasons multicasting becomes a particularly hard problem [102, 103]. A deadlock is illustrated in figure 2.5 and results from cyclic channel dependencies. This occurs more frequently in wormhole switched networks since channels become coupled by the flow control scheme. Throughput degradation is illustrated by the topmost case in figure 2.6. A packet destined ....

LIN, X., MCKINLEY, P., AND ESFAHANIAN, A. Adaptive multicast wormhole routing in 2D mesh multicomputers. In Proc. of the 5th conference on Parallel Architectures and Languages, Lecture notes in Computer Science (1993), vol. 694, pp. 228--241.

....the routing algorithm must be able to continue to function in the presence of faults. Lin et al. 13] have proposed a hardware supported multicast routing methodology called path based routing A number of multicast routing algorithms for the mesh have been developed based on this technique [2, 12, 13, 19, 21]. These algorithms are free from deadlock and livelock and enjoy low message latency. Several of the path based routing algorithms for faultfree meshes require no virtual channels [12, 13] However, existing fault tolerant path based routing algorithms [2, 19, 21] require at least two virtual ....

....A number of multicast routing algorithms for the mesh have been developed based on this technique [2, 12, 13, 19, 21] These algorithms are free from deadlock and livelock and enjoy low message latency. Several of the path based routing algorithms for faultfree meshes require no virtual channels [12, 13]. However, existing fault tolerant path based routing algorithms [2, 19, 21] require at least two virtual channels per physical channel. In this paper we present a new fault tolerant pathbased routing algorithm for the mesh requiring no virtual channels. This algorithm is based on a new pathbased ....

[Article contains additional citation context not shown here]

X. Li, P. McKinley, and A-H. Esfahanian. Adaptive multicast wormhole routing in 2D mesh multicomputers. In Proc. 1993 Parallel Architectures and Languages Europe Conference (PARLE'93), pages 228--241, June 1993.

.... of multidestination routing is that a message can be delivered to multiple destinations with the same startup latency as a message sent to a single destination [12, 17] Lin et al. have proposed a multidestination based routing algorithm for the mesh known as the Hamiltonian path based algorithm [11, 12]. Panda et al. 17] have proposed a general multidestination based Base Routing Conformed Path (BRCP) methodology in which an underlying deadlock free unicast routing algorithm is used in conjunction with the multidestination hardware mechanism. Specifically, to avoid deadlock each worm must ....

X. Li, P. McKinley, and A-H. Esfahanian. Adaptive multicast wormhole routing in 2D mesh multicomputers. In Proc. 1993 Parallel Architectures and Languages Europe Conference (PARLE'93), pages 228-- 241, June 1993.

....without suffering ramifications. This type of multicast is called path based multicast. Routing algorithms like dualpath and multi path were presented using 2D meshes. New partially and fully adaptive path based multicast wormhole routing algorithms called PM, FM and LD were defined for 2D meshes [4]. However, the design of deadlock free adaptive multicast algorithms is complex. For this reason, new methodologies for designing deadlockfree adaptive multicast algorithms were proposed in [1, 5] Recently, the BRCP (Base Routing Conformed Path) model was developed [7] This is a new path based ....

....supports unicast routing, path based multicast routing and tree based multicast routing with pruning. In our experiments, we run several simulations to analyze the behavior of tree based multicast routing against unicast routing and path based multicast routing algorithms like Dual Path [6] and PM [4]. 4.1. Simulation Parameters and Router Design. All multicast messages have one data flit, a typical data size for invalidationmessages in distributed shared memory multiprocessors. The number of destinations of each multicast message varies between 4 and 25. A uniform distribution is used to ....

[Article contains additional citation context not shown here]

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

....or to implement data bases or barrier synchronization mechanisms (see [33] Of course, many multicasts can occur simultaneously in the network. The multicast problem has been studied under both store and forward routing (see for instance [18, 24] and wormhole routing (see for instance [2, 10, 19, 21, 22, 23, 27, 30, 32, 34]) In this paper, we focus on the multicast problem under wormhole routing. We will make use of a particular hardware facility called path based [15, 23, 29] that allows intermediate destination to get a copy of the multicasted message. We will propose new algorithms for the mesh topology. ....

....12, and the node labeled 41. The black arrows represent the deterministic path given by R d , and the shadowed arrows represent all the additional paths given by the adaptive routing function R a . Note that there exists other adaptive deadlock free routing functions on the mesh: see for instance [21]. Clearly, the best advantage of an adaptive routing function over a deterministic routing function is the possibility to choose an alternative route in case of high traffic in the network. However, it is pointed out in [1, 4] that this advantage is tedious since adding even few virtual channels ....

X. Lin, P. K. McKinley, and A-H. Esfahanian. Adaptive multicast wormhole routing in 2D mesh multicomputers. In 1993 Parallel Architectures and Languages Europe Conference (PARLE '93), pages 228--241, Munich, Germany, June 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC