Fabrizio Petrini  Home/Search
Context Related
| lanl.gov/cic19/teams/par_arch/...cai.ps 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/cic19/tea...Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on a toroidal mesh with wormhole switching. This algorithm is based on an important property of the wormhole networks that reach high performance under uniform traffic using adaptive routing. The experimental results, conducted on a 256 nodes... (Update)
Context of citations to this paper: More
.... 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...
Cited by: More
Communication Performance of Wormhole Interconnection Networks - Petrini (1997) (Correct)
Similar documents (at the sentence level): More
22.0%: Total-Exchange on Wormhole k-ary n-cubes with Adaptive Routing - Petrini (1998) (Correct)
14.8%: Efficient Total-Exchange in Wormhole-Routed Toroidal Cubes - Petrini, Vanneschi (1997) (Correct)
11.7%: Efficient Personalized Communication on Wormhole Networks - Petrini, Vanneschi (1997) (Correct)
Active bibliography (related documents): More All
0.5: Exchanging Messages of Different Sizes - Goldman, Peters, Denis (2002) (Correct)
0.3: Network Performance Assessment under the BSP Model - Gerbessiotis, Petrini (1998) (Correct)
0.2: K-ary N-trees: High Performance Networks for Massively.. - Petrini, Vanneschi (1995) (Correct)
Similar documents based on text: More All
0.5: Performance Analysis of Minimal Adaptive Wormhole Routing.. - Petrini, Vanneschi (1997) (Correct)
0.3: Latency and Bandwidth Requirements of Massively Parallel.. - Petrini, Vanneschi (1999) (Correct)
0.2: Routing in Bidirectional k-ary n-cubes with the Red Rover Algorithm - Draper (1997) (Correct)
Related documents from co-citation: More All
2: Latency and Bandwidth Requirements of Massively Parallel Programs: FFT as a Case.. - Petrini, Vanneschi - 1999
2: A Necessary and Sufficient Condition for Deadlock Free Adaptive Routing in Wormh.. - - 1995
2: Performance in Parallel Simulation of Interconnection Networks (context) - Burger, Wood - 1995
BibTeX entry: (Update)
Fabrizio Petrini and Marco Vanneschi. Efficient Total-Exchange in WormholeRouted Toroidal Cubes. Submitted to Euro-Par'97, January 1997. http://citeseer.ist.psu.edu/petrini00efficient.html More
@inproceedings{ petrini97efficient,
author = "Fabrizio Petrini and Marco Vanneschi",
title = "Efficient Total-Exchange in Wormhole-Routed Toroidal Cubes",
booktitle = "European Conference on Parallel Processing",
pages = "171--175",
year = "1997",
url = "citeseer.ist.psu.edu/petrini00efficient.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
462 Deadlock-Free Message Routing in Multiprocessor Interconnect.. (context) - Dally, ---Seitz - 1987
193 The Torus Routing Chip (context) - Dally, ---Seitz - 1986
129 cube Interconnection Networks (context) - Dally - 1990
112 Deadlock-Free Adaptive Routing in Multicomputer Networks Usi.. (context) - Dally, ---Aoki - 1993
112 A New Theory of Deadlock-Free Adaptive Routing in Wormhole N.. - Duato - 1993
93 IEEE Transactions on Parallel and Distributed Systems (context) - Dally - 1992
35 Chaotic Routing: Design and Implementation of an Adaptive Mu.. - Bolding - 1993
34 All-to-All Communication on Meshes with Wormhole Routing - Thakur, ---Choudary - 1994
34 Cray TE Network Adaptive Routing High Performance D Toru (context) - The, Adaptive et al. - 1996
33 Performance Evaluation of Adaptive Routing Algorithms for k-.. (context) - Duato, ---L - 1994
27 SMART: a Simulator of Massive ARchitectures and Topologies - Petrini, ---Vanneschi - 1997
13 Congestion-Free Routing on the CM-5 Data Router (context) - Heller - 1994
12 Structured Communication in Torus Networks (context) - Fraigniaud, ---Peters - 1995
7 Minimal Adaptive Routing with Limited Injection on Toroidal .. - Petrini, ---Vanneschi - 1996
5 Worm-Hole Gossiping on Meshes - Juurlink, ---Rao et al. - 1996
4 An Architecture for All-to-All Personalized Communication (context) - Hinrichs, ---Kosak et al. - 1994
3 Optimal Broadcsting and Personalized Communication in Hyperc.. (context) - Johnsson, ---Ho - 1989
2 A Necessary and Su#cient Condition for Deadlock-Free Adaptiv.. (context) - Duato - 1995
2 Study of Switching Systems in Computer Communication Network.. (context) - Kermani, ---Kleinrock - 1980
2 cient Algorithms for All-to-All Communications in Multi-Port.. (context) - Bruck, --- et al. - 1994
2 A Necessary and Su#cient Condition for Deadlock-Free Adaptiv.. (context) - Duato - 1994
1 cient Total-Exchange in Wormhole-Routed Toroidal Cubes (context) - Skillicorn, ---Hill et al. - 1998
1 cient Communication Using Total-Exchange (context) - Rao, Torsten - 1995
Documents on the same site (http://www.c3.lanl.gov/cic19/teams/par_arch/Publications.html): More
The Performance Realities Of Massively Parallel.. - Lubeck, Simmons.. (1992) (Correct)
Performance Evaluation of the SGI Origin2000: A.. - Wasserman, Lubeck.. (Correct)
Benchmark Tests on a Silicon Graphics R8000-Based Workstation - Wasserman (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