J. Duato, P. Lopez, and S. Yalamanchili. Deadlock- and livelock-free routing protocols for wave switching. In Proceedings of the 11th International Parallel Processing Symposium, pp. 570--577, April 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Two-Stage Fault-Tolerant k-ary Tree Multiprocessors - Izadi, Füsun, Özgüner (2000) (Correct)
....Logical P(1,1) P(1,1) Node P2 In Node P2 Out Figure 2: Spare node S(0,0) replacing faulty node P(1,1) We next describe how a two level enhanced cluster k ary tree tolerates faulty nodes and faulty links. Each node is made of a computation module and a wave switching communication module [2]. Wave switching implements circuit switching and wormhole switching concurrently; permanent connections and long messages use the circuitswitched segment while short messages are transmitted using the wormhole switching. We assume that faulty nodes retain their ability to communication. This is a ....
J. Duato, P. Lopez, and S. Yalamanchili. Deadlock- and livelock-free routing protocols for wave switching. In Proceedings of the 11th International Parallel Processing Symposium, pp. 570--577, April 1997.
Tree-Based Fault-Tolerant Multicast in Multicomputer Networks - Wang, Blough (1997) (2 citations) (Correct)
....level procedure must exist to deal with the problem no matter what switching mechanism is used. An interesting topic of future study is to combine PCS and wormhole routing together to achieve better delivery for multicast. Such an approach has already been suggested to improve unicast performance [8] since PCS produces shorter latencies for long messages while wormhole routing is better for short messages. A router could provide PCS with multicast support and wormhole routing with only unicast support. Multicasts would be first attempted using PCS and destinations that are not reached after ....
J. Duato, et al., "Deadlock and Livelock Free Routing Protocols for Wave Switching", IPPS-11 Proceedings, pp. 570-- 577, 1997.
Issues in the Design of Direct Multiprocessor Networks - Ravindran, Stumm (1997) (Correct)
....to buffered wormhole switching, where the number of channels a blocked packet can hold decreases significantly, the throughput gained by using hybrid switching is not that high. Recently, wave switching that combines circuit switching and wormhole switching had been proposed by Duato et al. [21]. A wave router has two or more switches. One of the switches uses wormhole switching while others implement circuit switching. Circuit switching is used between nodes that are going to communicate frequently while wormhole switching is used to transmit packets for which circuit switching is not ....
J. Duato, P. Lopez, and S. Yalamanchilli, "Deadlock- and livelock-free routing protocols for wave switching," Proc. Intl. Parallel Processing Symposium, June 1997.
Performance Issues in the Design of Hierarchical-ring and Direct .. - Ravindran (1998) (Correct)
....of links a packet can block [73] 7 3. wave switching combines circuit switching and wormhole switching, whereby circuit switching is used between nodes that are going to communicate frequently, while wormhole switching is used to transmit packets for which circuit switching is not efficient [24]. In this dissertation we propose buffered wormhole switching and will show in Chapter 6 that this can reduce latency and improve system throughput in both hierarchical ring and direct networks. 2.3.4 Cell Switching An important variation of cut through switching is cell switching [5, 42, 43, ....
....significantly without large NIC buffer space requirements. ffl A blocking cell switching is an attractive alternative to the blocking wormhole switching with single flit buffers. Chapter 7 Routing Deadlock free routing techniques in 2 dimensional direct networks have been studied thoroughly [18, 24, 25, 26] and therefore we only briefly present them here. For 2 dimensional meshes, dimension ordered routing is a minimal and deterministic routing algorithm. It routes a packet al..ong the lowest dimension first for as far it must go, before routing it on the next higher dimension. Dimension ordered ....
J. Duato, P. Lopez, and S. Yalamanchilli, "Deadlock- and livelock-free routing protocols for wave switching," Proc. Intl. Parallel Processing Symposium, June 1997.
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