Fabrizio Petrini, Marco Vanneschi  Home/Search
Context Related
| lanl.gov/~fabrizio/paper...pact97.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: Bridging models, as the BSP, tend to abstract the characteristics of the interconnection networks using a small set of parameters, by dividing the computation in supersteps and organizing the communication in global patterns called h-relations. In this paper we evaluate, through experimental results conducted on a wormhole-routed bi-dimensional torus and a quaternary fat-tree with 256 processing nodes, the execution time of three families of h-relations with variable degree of imbalance. We... (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
21.9%: Network Performance under Physical Constraints - Petrini, Vanneschi (1997) (Correct)
17.7%: Performance Analysis of Wormhole Routed k-ary n-trees - Petrini, Vanneschi (1998) (Correct)
14.3%: A Comparison of Wormhole-Routed Interconnection Networks - Petrini, Vanneschi (1997) (Correct)
Active bibliography (related documents): More All
0.5: Communication-Efficient and Memory-Bounded External.. - Lee, Ranka, Shankar (Correct)
0.3: On Configuration of Switch-Based Networks with Wormhole Switching - Lee, Hong, Kim (Correct)
0.2: Network Performance with Distributed Memory Scientific Applications - Petrini (1998) (Correct)
Similar documents based on text: More All
0.5: Performance Analysis of Minimal Adaptive Wormhole Routing.. - Petrini, Vanneschi (1997) (Correct)
0.3: SMART: a Simulator of Massive ARchitectures and Topologies - Petrini, Vanneschi (1997) (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: 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
2: Latency and Bandwidth Requirements of Massively Parallel Programs: FFT as a Case.. - Petrini, Vanneschi - 1999
BibTeX entry: (Update)
Fabrizio Petrini and Marco Vanneschi. Efficient Personalized Communication on Wormhole Networks. Unpublished, January 1997. http://citeseer.ist.psu.edu/petrini97efficient.html More
@inproceedings{ petrini97efficient,
author = "Fabrizio Petrini and Marco Vanneschi",
title = "Efficient Personalized Communication on Wormhole Networks",
booktitle = "{IEEE} {PACT}",
pages = "52-63",
year = "1997",
url = "citeseer.ist.psu.edu/petrini97efficient.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
144 Virtual Channel Flow Control (context) - Dally - 1992
112 Deadlock-Free Adaptive Routing in Multicomputer Networks Usi.. (context) - Dally, Aoki - 1993
97 A Cost and Speed Model for k-ary n- cube Wormhole Routers - Chien - 1993
88 Questions and Answers about BSP - Skillicorn, Hill et al. - 1996
76 A Necessary and Sufficient Condition for Deadlock-Free Adapt.. - Duato - 1994
76 A Necessary and Sufficient Condition for Deadlock-Free Adapt.. - Duato - 1995
71 Limits on Interconnection Network Performance - Agarwal - 1991
69 The Network Architecture of the Connection Machine CM-5 (context) - Leiserson - 1992
55 Models and Languages for Parallel Computation - Skillicorn, Talia - 1996
50 Towards Efficiency and Portability: Programming with the BSP.. - Goudreau, Lang et al. - 1996
38 Assessing Fast Network Interfaces (context) - Culler, Liu et al.
38 The Cache Coherence Protocol of the Data Diffusion Machine (context) - Haridi, Hagersten - 1989
36 Fast Parallel Sorting Under LogP: Experience with the CM-5 - Dusseau, Culler et al. - 1996
34 Technical Summary (context) - Research - 1991
31 Communication-Efficient Parallel Algorithms for Distributed .. - Leiserson, Maggs - 1988
31 Universal Computing (context) - McColl - 1996
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 Parallel Algorithms for Personalized Communication and Sorti.. - Helman, Bader et al. - 1996
26 The Cray T3E Network: Adaptive Routing in a High Performance.. (context) - Scott, Thorson - 1996
24 the Design and Implementation of Broadcast and Global Combin.. (context) - Bruck, Coster et al. - 1996
18 BSP vs. LogP - Bilardi, Herley et al. - 1996
16 Compiling for Shared-Memory and Message-Passing Computers - Larus - 1994
13 Many-to-many Personalized Communication with Bounded Traffic - Ranka, Shankar et al. - 1995
13 Computing Surface 2 reference manuals (context) - Incorporated - 1993
12 Designing Broadcasting Algorithms in the Postal Model for Me.. - Bar-Noy, Kipnis - 1992
12 Efficient Communication Using Total-Exchange - Rao, Suel et al. - 1995
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 Minimal Adaptive Routing with Limited Injection on Toroidal .. - Petrini, Vanneschi - 1996
6 Performance Evaluation of the CM-5 Interconnection Network (context) - Lin, Tsang et al. - 1992
6 Practical Barrier Synchronization (context) - Hill, Skillicorn - 1996
3 Performance of the CM5 ENEE 646 (context) - Martin, Bader - 1994
3 Congestion-Free Routing on the CM5 Data Router (context) - Heller - 1994
3 k-ary n-trees: High Performance Networks for Massively Paral.. - Petrini, Vanneschi - 1997
2 Lessons Learned form Implementing BSP (context) - Hill, Skillicorn - 1996
2 The Transportation Primitive - Shankar, Alsabti et al. - 1994
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