Fabrizio Petrini and Marco Vanneschi. Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes. In Supercomputing 96, Pittsburgh, PA, November 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Adaptive Bubble Router - Puente, Izu, Beivide, Gregorio.. (2001) (Correct)
....under random traffic is of 15 when compared with VCAda OAC. We should note that Bubble is limiting 20 V. PUENTE, C. IZU, R. BEIVIDE, J.A. GREGORIO, F. VALLEJO AND J.M. PRELLEZO the injection of packets at high loads and this is a mechanism which improves network throughput for both wormhole [23] and cut through networks [17] In this case, limiting injection proves to be more effective than the additional static virtual channel of VCbased routers. The exception is for SIC based routers in which the differences in channel multiplexing distort the result. However, when we incorporate the ....
F. Petrini, M. Vanneschi, "Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes", Proceedings Supercomputing'96, Nov. 1996.
Efficient Total-Exchange in Wormhole-Routed Toroidal Cubes - Petrini (1999) Self-citation (Petrini) (Correct)
....is limited by network contention [9] A similar algorithm has been recently adopted by the Cray T3E [22] A central point of our adaptive algorithm is the interface between the processor and the router. We assume that packets can enter the network using only a subset of the adaptive channels [19]. This limitation, known as source throttling, makes the network throughput stable when the network operates above saturation [5] which is the typical case when we execute a total exchange algorithm. 4 Total exchange algorithms The algorithms that can be used to implement the total exchange on ....
Fabrizio Petrini and Marco Vanneschi. Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes. In Supercomputing 96, Pittsburgh, PA, November 1996.
Network Performance under Physical Constraints - Petrini, Vanneschi (1997) Self-citation (Petrini Vanneschi) (Correct)
....processor and the router. We assume that packets can enter the network passing through a single injection or memory channel placed between the processor and the router. This limitation, known as source throttling, makes the network throughput stable when the network operates above saturation [27] [28]. 4 Relevant details of the network model This section presents a router model and a simulation environment, that are used in the following sections to analyze the performance of the k ary n trees and the k ary n cubes under various traffic loads and flow control strategies. This model is ....
F. Petrini and M. Vanneschi, "Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes," in Supercomputing 96, (Pittsburgh, PA), November 1996.
Efficient Personalized Communication on Wormhole Networks - Petrini, Vanneschi (1997) Self-citation (Petrini Vanneschi) (Correct)
....is limited by network contention [21] A similar algorithm has been recently adopted by the Cray T3E [22] A central point of our adaptive algorithm is the interface between the processor and the router. We assume that packets can enter the network using only a subset of the adaptive channels [23]. This limitation, known as source throttling, makes the network throughput stable when the network operates above saturation [24] 3 k ary n trees Processor Switch External Connections Figure 2: The structure of a fat tree. Processors are located at the leaves, while internal nodes contain ....
F. Petrini and M. Vanneschi, "Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes," in Supercomputing 96, (Pittsburgh, PA), November 1996.
Communication Performance of Wormhole Interconnection Networks - Petrini (1997) Self-citation (Petrini) (Correct)
....time of only 25 . Unfortunately, this result does not generalize to the toroidal cube. CHAPTER 1. INTRODUCTION 11 Part of the results of this thesis together with some related work, not shown here for brevity, either appeared in the literature or are still under review [118] 120] 121] 123] [122] [124] 117] 130] 129] 127] 128] 119] 125] 126] 47] 1.6 Thesis Overview The thesis is organized as follows. Chapter 2 deals with the topological properties of interconnection networks. It discusses many aspects and measures commonly used to evaluate and compare topologies and provides ....
....in the limited injection algorithm the surface is smooth, in the basic algorithm there is a deep valley in the center of the mesh. This non uniformity causes the loss of performance of basic algorithm. A more detailed discussion on the limited injection strategies can be found in [38] 105] and [122]. CHAPTER 6. BASIC NETWORK PERFORMANCE 89 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 4 8 16 32 Fraction of capacity Packet size (bytes) Throughput vs. packet size (Uniform traffic) modified original 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 4 8 16 32 Packet size (bytes) ....
Fabrizio Petrini and Marco Vanneschi. Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes. In Supercomputing 96, Pittsburgh, PA, November 1996.
Efficient Total-Exchange In Wormhole-Routed Toroidal Cubes - Petrini (2000) Self-citation (Petrini) (Correct)
....is limited by network contention [9] A similar algorithm has been recently adopted by the Cray T3E [22] A central point of our adaptive algorithm is the interface between the processor and the router. We assume that packets can enter the network using only a subset of the adaptive channels [19]. This limitation, known as source throttling, makes the 6 F. Petrini network throughput stable when the network operates above saturation [5] which is the typical case when we execute a total exchange algorithm. 4 TOTAL EXCHANGE ALGORITHMS The algorithms that can be used to implement the ....
Petrini, F.---Vanneschi, M.: Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes. In Supercomputing 96, Pittsburgh, PA, November 1996.
Total-Exchange on Wormhole k-ary n-cubes with Adaptive Routing - Petrini (1998) (2 citations) Self-citation (Petrini) (Correct)
....choice is limited by network contention. A similar algorithm has been recently adopted by the Cray T3E [7] A central point of this adaptive algorithm is the interface between the processor and the router. We assume that packets can enter the network using only a subset of the adaptive channels [5]. This limitation, known as source throttling, makes the network throughput stable when the network operates above saturation, which is the typical case when we execute a totalexchange algorithm. When the adaptive routing function can choose between two distinct directions the algorithm picks one ....
F. Petrini and M. Vanneschi. Minimal Adaptive Routing with Limited Injection on Toroidal k-ary n-cubes. In Supercomputing 96, Pittsburgh, PA, November 1996.
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