Fabrizio Petrini, Marco Vanneschi  Home/Search
Context Related
| lanl.gov/~fabrizio/pape...ijfcs98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lanl.gov/~fabrizio...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The past few years have seen a rise in popularity of massively parallel architectures that use fat-trees as their interconnection networks. In this paper we formalize a parametric family of fat-trees, the k-ary n-trees, built with constant arity switches interconnected in a regular topology. A simple adaptive routing algorithm for k-ary n-trees sends each message to one of the nearest common ancestors of both source and destination, choosing the less loaded physical channels, and then... (Update)
Context of citations to this paper: More
...routing. The switches are interconnected in a quaternary fat tree topology, which belongs to the more general class of k ary n trees [7, 6]. Elite networks are source routed, and the transmission of each packet is pipelined into the network using wormhole flow control. At...
.... The Elite switches are interconnected in a quaternary fattree topology, which belongs to the more general class of the k ary n trees [9] [8] A quaternary fat tree of dimension n is composed of 4 n processing nodes and n 4 n 1 switches interconnected as a delta...
Cited by: More
Scalable Collective Communication on the ASCI Q Machine - Fabrizio Petrini Juan (2003) (Correct)
Performance Evaluation of the Quadrics Interconnection.. - Petrini, Frachtenberg, .. (2003) (Correct)
A Comparison of Wormhole-Routed Interconnection Networks - Petrini, Vanneschi (1997) (Correct)
Similar documents (at the sentence level): More
64.1%: K-ary N-trees: High Performance Networks for Massively.. - Petrini, Vanneschi (1995) (Correct)
42.9%: Communication Performance of Wormhole Interconnection Networks - Petrini (1997) (Correct)
41.4%: k-ary n-trees: High Performance Networks for Massively.. - Petrini, Vanneschi (1997) (Correct)
Active bibliography (related documents): More All
0.5: Design and Performance Analysis of the Practical Fat Tree.. - Kim, Kwon, Han, Mun (1996) (Correct)
0.4: Multicomputer Routing Techniques - Fulgham (1997) (Correct)
0.3: MediaWorm: A QoS Capable Router Architecture for Clusters - Yum, Kim, Das, Vaidya (2002) (Correct)
Similar documents based on text: More All
0.6: Efficient Total-Exchange in Wormhole-Routed Toroidal Cubes - Petrini, Vanneschi (1997) (Correct)
0.4: SMART: a Simulator of Massive ARchitectures and Topologies - Petrini, Vanneschi (1997) (Correct)
0.3: Latency and Bandwidth Requirements of Massively Parallel.. - Petrini, Vanneschi (1999) (Correct)
Related documents from co-citation: More All
6: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks (context) - Dally, Seitz - 1987
5: Elan Reference Manual (context) - World - 1999
5: Elite Reference Manual (context) - World - 1999
BibTeX entry: (Update)
Fabrizio Petrini and Marco Vanneschi. Performance Analysis of Wormhole Routed k-ary n-trees. International Journal on Foundations of Computer Science, 9(2):157-177, June 1998. http://citeseer.ist.psu.edu/petrini98performance.html More
@article{ petrini98performance,
author = "Fabrizio Petrini and Marco Vanneschi",
title = "Performance Analysis of Wormhole Routed K-Ary N-Trees",
journal = "International Journal of Foundations of Computer Science",
volume = "9",
number = "2",
pages = "157-178",
year = "1998",
url = "citeseer.ist.psu.edu/petrini98performance.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
462 Deadlock-Free Message Routing in Multiprocessor Interconnect.. (context) - Dally, Seitz - 1987
193 The Torus Routing Chip (context) - Dally, Seitz - 1986
173 Hot-spot Contention and Combining in Multistage Interconnect.. (context) - Pfister, Norton - 1985
156 Fat-Trees: Universal Networks for Hardware Efficient Superco.. (context) - Leiserson - 1985
154 Planar Adaptive Routing: Low-Cost Adaptive Networks for Mult.. - Chien, Kim - 1992
144 Virtual Channel Flow Control (context) - Dally - 1992
112 Deadlock-Free Adaptive Routing in Multicomputer Networks Usi.. (context) - Dally, Aoki - 1993
101 An adaptive and Fault-Tolerant Wormhole Routing Strategy for.. (context) - Linder, Harden - 1991
97 A Cost and Speed Model for k-ary n-cube Wormhole Routers - Chien - 1993
69 The Network Architecture of the Connection Machine CM5 (context) - Leiserson - 1992
46 Randomized Routing on Fat-Trees - Greenberg, Leiserson - 1989
39 Network and Processor Architecture for Message-Driven Comput.. (context) - Dally - 1991
38 The Cache Coherence Protocol of the Data Diffusion Machine (context) - Haridi, Hagersten - 1989
35 Prevention of Deadlocks in Packet-Switched Data Transport Sy.. (context) - Gunther - 1981
35 Chaotic Routing: Design and Implementation of an Adaptive Mu.. - Bolding - 1993
34 Technical Summary (context) - Research - 1991
33 Performance Evaluation of Adaptive Routing Algorithms for k-.. (context) - Duato, L'opez - 1994
31 Communication-Efficient Parallel Algorithms for Distributed .. - Leiserson, Maggs - 1988
28 Communication and Computation performance of the CM-5 - Kwan, Tatty et al. - 1993
27 SMART: a Simulator of Massive ARchitectures and Topologies - Petrini, Vanneschi - 1997
26 Deadlock-Free Adaptive Routing Algorithms Multicomputers: Ev.. (context) - Duato - 1991
17 The Case for Chaotic Adaptive Routing - Bolding, Fulgham et al. - 1994
13 Computing Surface 2 reference manuals (context) - Incorporated - 1993
12 Ariadne - An Adaptive Router for Fault-tolerant Multicompute.. (context) - Allen, Gaughan et al. - 1994
11 An Evaluation Study of a Link-Based Data Diffusion Machine - Muller, Stallard et al. - 1994
11 The Data Diffusion Machine with a Scalable Point-to-Point Ne.. - Muller, Stallard et al. - 1993
7 Compressionless Routing: A Framework for Adaptive Fault-tole.. (context) - Kim, Liu et al. - 1994
6 Performance Analysis of a Minimal Adaptive Router - Nguyen, Snyder - 1994
6 Performance Evaluation of the CM-5 Interconnection Network (context) - Lin, Tsang et al. - 1992
5 Optimal Topology for Distributed Shared-Memory Multiprocesso.. (context) - Duato, Malumbres - 1996
4 Metro: A Router Architecture for High-Performance, Short-Hau.. - DeHon, Chong et al. - 1994
4 Recursively Scalable Fat-Trees as Interconnection Networks - Valerio, Moser et al. - 1994
3 Congestion-Free Routing on the CM-5 Data Router (context) - Heller - 1994
3 Using Fat-Trees to Maximize the Number of Processors in a Ma.. - Valerio, Moser et al.
3 Performance of the CM-5 ENEE 646 (context) - Martin, Bader - 1994
2 Fat-Tree Routing for Transit (context) - DeHon - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.c3.lanl.gov/~fabrizio/publications.html): More
Latency and Bandwidth Requirements of Massively Parallel.. - Petrini (1999) (Correct)
LIFE: a Limited Injection, Fully adaptivE.. - Petrini, Duato.. (Correct)
Communication Performance of Wormhole Interconnection Networks - Petrini (1997) (Correct)
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