Ni, L. M. and McKinley, P. K. 1993. A survey of wormhole routing techniques in direct networks. IEEE Computer 26, 2, 62--76. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Design and Evaluation of the Hamal Parallel Computer - Grossman (2002) (1 citation) (Correct)
....into idempotent forms for repeated transmission over unreliable networks [Eslick94] no general mechanism providing lightweight end to end idempotence has previously been reported. As a result, most previous and existing parallel architectures have implemented non discarding networks ( Hwang93] [Ni93], Culler99] The practice of discarding packets is common among WAN net working technologies such as Ethernet [Metcalfe83] and ATM [Rooholamini] end to end protocols such as TCP [Postel81] are required to ensure reliable message delivery over these networks. However, WAN oriented protocols ....
Lionel M. Ni, Philip K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks", IEEE Computer, Vol. 26, No. 2, 1993, pp. 62-76. 151
A Lightweight Idempotent Messaging Protocol for Faulty - Brown (2002) (1 citation) (Correct)
....idempotent forms for repeated transmission over unreliable networks [13] no general mechanism providing lightweight end to end idempotence has previously been reported. As a result, most parallel architectures have implemented non discarding networks which take responsibility for message delivery [18, 22, 6]. Such networks can only tolerate limited types of network failure. Many parallel networks can be configured to route around static faults, e.g. the Cray T3D [5] By contrast, very few networks are able to handle dynamic faults, but examples do exist: the SGI Spider router [15] can detect and ....
Lionel M. Ni, Philip K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks", IEEE Computer, Vol. 26, No. 2, 1993, pp. 62-76.
A Low-cost Router Design for k-ary n-cube Networks - Carrión, Díaz, Caminero (2002) (Correct)
....dicult due to the fact that there are a myriad of design factors which can impact the nal performance [16] Even though, the most extended tendencies suggest the use of an adaptive routing scheme, virtual channels and wormhole switching. A survey of wormhole routing algorithms can be found in [17]. Other routing algorithms are speci cally designed for cut through ow control [13] They need larger bu er capacity but are less sensitive to propagation delay. This makes them quite attractive [1] Moreover, when a header it is blocked, all the data its in the packet are stored in the same ....
L. M. Ni and P. K. McKinley, A survey of wormhole routing techniques in direct networks, IEEE Computer Magazine 26 (1993), no. 2, 62-76.
Random Data Accesses on a Coarse-grained Parallel Machine II. .. - Ranka, Shankar (1994) (Correct)
....between processors has a start up overhead of v, while the data transfer rate is 1 p. For our complexity analysis we assume that v and p are constant, independent of the link congestion and distance between two nodes. With new techniques such as wormhole routing and randomized routing [15, 14, 8, 17], the distance between communicating processors seems to be less of a determining factor on the amount of time needed to complete the communication. Further, the effect of link contention (due to several messages traversing common links along their routes) is limited due to presence of virtual ....
Lionel M. Ni and Philip K. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks, IEEE Computer, 26(2):62-76, February 1993.
Self-Stabilizing Wormhole Routing on Ring Networks - Datta, Gradinariu.. (2002) (Correct)
....be executed on some processor p. P 2 ) follows from (R1) The lchannel variable is set to the message identifier of the received header flit if it is forwarded, or to 0 if the header flit is delivered. P 3 ) follows from (R4) Deadlocks are resolved by packet preemption as discussed in [13]. After some time, the timeout action (R4) is activated on a nonempty set W of processors, the Buffer variables of one or more deadlocked processors are discarded from the network, and the CTS variables of those processors are set to LOW. By the code of the algorithm, Predicates (P 1 ) P 2 ) ....
L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks," IEEE Computer, Vol. 26,
Exploiting the Routing Flexibility for Energy/Performance.. - Hu, Marculescu (2002) (7 citations) (Correct)
....the first to address the mapping and routing path allocation problems for tile based architectures and provide an efficient way to solve them. Although routing (especially wormhole based routing [3] has been a hot research topic in the area of direct networks for parallel and distributed systems [6][7] 8] the specifics of NoC force us to re think standard network techniques and adapt them to the context of NoC architectures. In what follows, we address this issue by presenting a suitable routing technique for NoC together with an algorithm for automatic generation of the routing function. ....
L. M. Ni, P. K. McKinley "A survey of wormhole routing techniques in direct networks," Computer, vol. 26, no. 2, Feb. 1993.
Execution Based Evaluation of MINs for Cache-Coherent.. - Kumar, Bhuyan, Iyer (1996) (Correct)
....effect of all these advances in the INs has to be judged from the real changes in the execution time of scientific applications. Therefore, we have chosen the approach of execution driven simulation to capture as much detail as possible. Circuit switching, packet switching and wormhole routing [3] are the switching techniques used by INs in multiprocessors. In this paper we will consider only the packet switching and wormhole routing techniques because circuit switching is known to be less efficient. In case of packet switching, a message is divided into fixed size packets, each packet ....
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.
Effect of Virtual Channels and Memory Organization on.. - Kumar, Bhuyan (1996) (Correct)
....or simulation model. Moreover, the effect of all these advances in the INs has to be judged from the real changes in the execution time of scientific applications. Therefore, we have chosen the approach of execution driven simulation to capture as much detail as possible. Wormhole routing [3] is an efficient technique to reduce the latency of internode messages. In wormhole routing, the messages packets are divided into small flits, typically 8 32 bits long, and sent over the network in a pipeline fashion, one flit after another between adjacent nodes. Virtual channels [4] are used in ....
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.
Performance Analysis of Wormhole Switching - With Adaptive Routing (Correct)
....of the performance of wormhole switching with adaptive routing in a two dimensional torus. Our analysis focuses on minimal and fully adaptive routing that allows a message to use any shortest path between source and destination. 1 Introduction In the wormhole switching technique [2] [11] any message is partitioned into a set of flits. The transmission works as follows: after passing through a channel, the header flit tries to get another channel while the data flits are transmitted through the already obtained channels. In the case of channel contention, the message flits are ....
....obtained channels are released only at the end of the message transmission, a mechanism to prevent deadlock must be considered. This is done by using multiple virtual channels multiplexed on each physical link and forcing a pre defined order on the allocation of virtual channels to messages [2] [11]. An adaptive routing policy allowing messages to use only shortest paths is called minimal. Moreover, an adaptive routing policy is called fully adaptive if a message is allowed to follow any path of the minimal (or non minimal) class. In this paper we propose an analytical approach to evaluate ....
L.M. Ni, and P.K. McKinley, "A survey of wormhole routing techniques in direct networks", IEEE Computer, vol. 26, no. 2, Feb. 1993, pp. 62--76.
An Ecient Placement and Routing Technique for - Fault-Tolerant Distributed.. (Correct)
No context found.
Ni, L. M. and McKinley, P. K. 1993. A survey of wormhole routing techniques in direct networks. IEEE Computer 26, 2, 62--76.
An Ecient Placement and Routing Technique for.. - Distributed Embedded.. (Correct)
No context found.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62--76, 1993.
Unknown - (Correct)
No context found.
Lionel M. Ni and Philip K. McKinley. "A Survey of Wormhole Routing Techniques in Direct Networks." IEEE Computer, 26(2):62--76, 1993.
Efficient Agent-based Multicast on Wormhole Switch-based.. - Yi-Fang Lin Jan-Jan (2003) (Correct)
No context found.
L. Ni and P. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62--76, February 1993.
A Simple Incremental Network Topology for Wormhole.. - Pangfeng Liu Jan-Jan (2001) (Correct)
No context found.
L.M. Ni and P.K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62--76, February 1993.
An Ecient Placement and Routing Technique for.. - Distributed Embedded.. (Correct)
No context found.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62--76, 1993.
An Ecient Placement and Routing Technique for - Fault-Tolerant Distributed.. (Correct)
No context found.
Ni, L. M. and McKinley, P. K. 1993. A survey of wormhole routing techniques in direct networks. IEEE Computer 26, 2, 62--76.
An Analytical Model of Adaptive Wormhole Routing - With Time-Out Khonsari (Correct)
No context found.
L. Ni, P.K. McKinley, A survey of wormhole routing techniques in direct networks, IEEE Computer 26(2), pp. 62-76, 1993.
Performance Evaluation of a New Hardware Supported.. - Kumar, Najjar, Srimani (2001) (Correct)
No context found.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, pages 62--76, 1993.
Scheduling a Divisible Task in a 2-Dimensional Toroidal Mesh - Blazewicz, Drozdowski, al. (1999) (Correct)
No context found.
L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks", Computer, vol. 26, pp. 62-76, February 1993.
On-Chip Stochastic Communication - Dumitras, Marculescu (2003) (2 citations) (Correct)
No context found.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 1993.
On Measuring the Performance of Adaptive Wormhole Routing - And Jayasimha Intel (1997) (Correct)
No context found.
L. M. Ni and P. K. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, 26(2):62--76, February 1993.
A Formal View of Multicomputers - Gallud, García, Quiles (Correct)
No context found.
L.M. Ni and P.K. Mckinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, pages 62--76, February 1993.
HERMES: an Infrastructure for Low Area Overhead.. - Moraes, Calazans, .. (2004) (Correct)
No context found.
Ni, L.; et al. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, v. 26(2), Feb 1993, pp. 62 --76.
Static and Dynamic Low-Congested Interval Routing Schemes - Cicerone, Di Stefano.. (1998) (Correct)
No context found.
L.M. Ni and P.K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Trans. Comp., 1993.
Can Scatter Communication Benefit from Multidestination.. - Banikazemi, Panda (Correct)
No context found.
L. Ni and P. K. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, pages 62--76, Feb. 1993.
First 50 documents Next 50
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