See this document in CiteSeerX!

An Architecture for Optimal All-to-All Personalized Communication (1994)  (Make Corrections)  (46 citations)
Susan Hinrichs, Corey Kosak, David R. O'Hallaron, Thomas M. Stricker, and...
ACM Symposium on Parallel Algorithms and Architectures



  Home/Search   Context   Related

 
View or download:
cmu.edu/project/iw...municationarch.ps
cs.inf.ethz.ch/str...icationarch.ps.gz
cs.inf.ethz.ch/CoP...icationarch.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/afs/cs/project/i...papers (more)
From:  cs.inf.ethz.ch/CoPs/paperstom...
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In all-to-all personalized communication (AAPC), every node of a parallel system sends a potentially unique packet to every other node. AAPC is an important primitive operation for modern parallel compilers, since it is used to redistribute data structures during parallel computations. As an extremely dense communication pattern, AAPC causes congestion in many types of networks and therefore executes very poorly on general purpose, asynchronous message passing routers. We present and evaluate a ... (Update)

Cited by:   More
Message Scheduling for All-to-all Personalized Communication on .. - Faraj, Yuan   (Correct)
Beyond the Worst-Case Bisection Bound: Fast Sorting and.. - Kaufmann, Sibeyn, Suel (1995)   (Correct)
CC-MPI: A Compiled Communication Capable MPI Prototype.. - Karwande, Yuan..   (Correct)

Similar documents (at the sentence level):
69.8%:   An Architecture for Optimal All-to-All Personalized.. - Hinrichs, Kosak.. (1994)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Fast Message Assembly Using Compact Address Relations - Peter Dinda (1996)   (Correct)
0.3:   Final Report on Research in Parallel Computing.. - December Carnegie (1996)   (Correct)
0.2:   The Performance Impact Of Address Relation Caching - Peter Dinda   (Correct)

Similar documents based on text:   More   All
0.5:   From AAPC Algorithms to High Performance Permutation.. - Stricker, Hardwick (1996)   (Correct)
0.3:   On Scheduling All-to-All Personalized Connections and.. - Zhang, Qiao (1996)   (Correct)
0.3:   Scheduling in Unidirectional WDM Rings and Its Extensions - Xijun Zhang And (1997)   (Correct)

Related documents from co-citation:   More   All
12:   Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies (context) - Scott - 1991
9:   Reconfiguration with time division multiplexing MINs for multiprocessor communic.. - Qiao, Melhem - 1994
8:   Optimum Broadcasting and Personalized Communication in Hypercubes (context) - Johnsson, Ho - 1989

BibTeX entry:   (Update)

S. Hinrichs, C. Kosak, D. O'Hallaron, T. Stricker, and R. Take, "An architecture for optimal all-to-all personalized communication," in ACM Symposium on Parallel Algorithms and Architectures, (Cape May, New Jersey), July 1994. http://citeseer.ist.psu.edu/hinrichs94architecture.html   More

@inproceedings{ hinrichs94architecture,
    author = "Susan Hinrichs and Corey Kosak and David R. O'Hallaron and Thomas Stricker and Riichiro Take",
    title = "An Architecture for Optimal All-to-All Personalized Communication",
    booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
    pages = "310-319",
    year = "1994",
    url = "citeseer.ist.psu.edu/hinrichs94architecture.html" }
Citations (may not include all citations):
835   High Performance Fortran Language Specification Version - FORTRAN - 1993
587   PVM: a Framework for Parallel Distributed Computing - SUNDERAM - 1990
531   LogP: towards a realistic model of parallel computation - CULLER, KARP et al. - 1992
169   Optimum Broadcasting and Personalized Communication in Hyper.. (context) - JOHNSSON, HO - 1989
164   The Network Architecture of the ConnectionMachineCM - LEISERSON, ABUHAMDEH et al. - 1992
110   iWarp: An Integrated Solution to HighSpeed Parallel Computin.. - BORKAR - 1988
95   Supporting Systolic and Memory Communication in iWarp - BORKAR - 1990
73   Exploiting Task and Data Parallelism on a Multicomputer - SUBHLOK, STICHNOTH et al. - 1993
68   Generating Communication for Array Statements: Design - STICHNOTH, O'HALLARON et al. - 1994
58   Adaptive Deadlock- and Livelock-Free Routing with All Minima.. - BERMAN, GRAVANO et al. - 1992
49   Efficient All-to-All Communication Patterns in Hypercube and.. (context) - SCOTT - 1991
46   An Architecture for Optimal All-to-All Personalized Communic.. - HINRICHS, KOSAK et al. - 1994
38   Complete Exchange on a Circuit Switched Mesh (context) - BOKHARI, BERRYMAN - 1992
22   Multiphase complete exchange on a circuit switched hypercube (context) - BOKHARI - 1991
16   Communication algorithms for isotropic tasks in hypercubes a.. (context) - VARVARIGOS, BERTSEKAS - 1992
15   Draft Document for a Standard Message Passing Interface (context) - PASSING, FORUM - 1993
11   Cray TD System Architecture Overview (context) - System, Tech et al. - 1993
8   Decoupling Communication Services for Compiled Parallel Prog.. (context) - STRICKER, STICHNOTH et al. - 1994
8   PS Product Overview (context) - CORP - 1991
7   All-to-All Personalized Communication on a Wrap-around Mesh (context) - HORIE, HAYASHI - 1991
6   Message Routing on Irregular 2D-Meshes and Tori - STRICKER - 1991
4   Scalable Parallel Computing - The IBM 9076 Scalable POWERPar.. (context) - SNIR - 1993
2   An Architecture for Parallel Database Computing (context) - TAKE, NOGUCHI et al. - 1991
2   Design and implementation of an interconnection network for .. (context) - HORIE, ISHIHATA et al. - 1992
2   Compiler Resource Management for Connection -Based Communica.. (context) - HINRICHS - 1994
2   Designing Broadcating Algorithms in the Postal Model for Mes.. (context) - BAR-NOY, KIPNIS - 1992
1   A Routing Method for All-to-all Burst onHypercube Networks (context) - TAKE - 1987
1   Supporting sets of arbitrary connectionson iWarp through com.. (context) - FELDMANN, STRICKER et al. - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cmu.edu/afs/cs/project/iwarp/member/fx/public/www/papers.html):   More
Global Register Allocation Based on Graph Fusion - Lueh, Gross, Adl-Tabatabai (1996)   (Correct)
Debugging a Parallel Program: Capturing Inter-Processor.. - Gross, Hinrichs (1992)   (Correct)
An Architecture for Optimal All-to-All Personalized.. - Hinrichs, Kosak.. (1994)   (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