(Enter summary)
Abstract: Current MIMD computers support the execution of data parallel programs by providing a tree
network to perform fast barrier synchronizations. However, there are two major limitations to using
tree networks: The first arises due to control nesting in programs, and the second arises when the
MIMD computer needs to run several programs simultaneously.
First, we present two hardware barrier synchronization schemes which can support deep levels
of control nesting in data parallel programs.... (Update)
Context of citations to this paper: More
.... this paper is restricted to hardware supported barriers because they are usually an order of magnitude faster than software barriers [5]. interference. In BTM, a synchronization message also traverses nonmember nodes. However, unlike the CS tree, messages are simply forwarded to...
.... in this paper is restricted to hardware supported barriers because they are usually an order of magnitude faster than software barriers [5]. 1 requiring any lookup at the barrier registers of the router. Thus, the routing delay across a nonmember node in BTM is only a...
Cited by: More
A Fast Tree-Based Barrier Synchronization on Switch-Based.. - Sangman Moh Chansu (2000)
(Correct)
A Fast Tree-Based Barrier Synchronization without.. - Moh, Yu, Youn, Han.. (2000)
(Correct)
Similar documents (at the sentence level):
54.5%: Efficient Techniques for Fast Nested Barrier.. - Ramakrishnan, Scherson, .. (1995)
(Correct)
Active bibliography (related documents): More All
0.4: Low-cost Fault-tolerance in Barrier Synchronizations - Sandeep Kulkarni Anish
(Correct)
0.3: Flattening is an Improvement (Extended Abstract) - Riely, Prins (2000)
(Correct)
0.3: Flattening is an Improvement - Riely, Prins (2000)
(Correct)
Similar documents based on text: More All
0.4: A Framework for Parallel Job Scheduling - Subramanian (1995)
(Correct)
0.4: An Operating System Framework for Large Parallel.. - Scherson..
(Correct)
0.3: NetCDF User's Guide for C - An Access Interface for . . . - Rew, al. (1997)
(Correct)
Related documents from co-citation: More All
4: A survey of wormhole routing techniques in direct networks (context) - Ni, McKinley - 1993
4: Parallel Programming with MPI (context) - Peter - 1997
4: A cost and speed model for k-ary ncube wormhole routers
- Chien - 1993
BibTeX entry: (Update)
V. Ramakrishnan, I. D. Scherson, and R. Subramanian, "Efficient Techniques for Nested and Disjoint Barrier Synchronization," Journal of Parallel and Distributed Computing, Vol. 58, pp. 333356, Aug, 1999. http://citeseer.ist.psu.edu/article/ramakrishnan99efficient.html More
@article{ ramakrishnan99efficient,
author = "Vara Ramakrishnan and Isaac D. Scherson and Raghu Subramanian",
title = "Efficient Techniques for Nested and Disjoint Barrier Synchronization",
journal = "Journal of Parallel and Distributed Computing",
volume = "58",
number = "2",
pages = "333--356",
year = "1999",
url = "citeseer.ist.psu.edu/article/ramakrishnan99efficient.html" }
Citations (may not include all citations):
239
Algorithms for scalable synchronization on shared-memory mul.. (context) - Mellor-Crummey, Scott - 1991
178
The Connection Machine CM-5 Technical Summary (context) - Corporation, MA - 1991
164
The network architecture of the connection machine CM
- Leiserson - 1992
56
The Paralation Model: Architecture-Independent Parallel Prog.. (context) - Sabot - 1988
53
Efficient implementation of barrier synchronization in wormh..
- Xu, McKinley et al. - 1992
42
Synchronization without contention (context) - Mellor-Crummey, Scott - 1991
40
Connection machine LISP: Fine-grained parallel symbolic proc.. (context) - Steele, Hillis - 1986
39
The fuzzy barrier: A mechanism for high speed synchronizatio.. (context) - Gupta - 1989
31
Cray Research Massively Parallel Processor System CRAY TD (context) - The, Massively et al. - 1993
19
Cray TD System Architecture Overview Manual (context) - Inc, Cray et al. - 1993
18
A scalable implementation of barrier synchronization using a.. (context) - Gupta, Hill - 1989
12
The effects of multiprogramming on barrier synchronization (context) - Markatos, Crovella et al. - 1991
9
Compiling data parallel programs for MIMD architectures (context) - Hatcher, Lapadula et al. - 1992
6
Dynamic barrier architecture for multi-mode fine grain paral.. (context) - Cohen, Dietz et al. - 1994
4
Adaptive backoff synchronization techniques (context) - Agrawal, Cherian - 1989
3
Efficient techniques for fast nested barrier synchronization
- Ramakrishnan, Scherson et al. - 1995
3
high-performance barrier synchronization on networks of work.. (context) - Johnson, Lilja et al. - 1997
3
Achieving low cost synchronization in a multiprocessor syste.. (context) - Gupta, Epstein - 1990
2
Using schedular information to achieve optimal barrier synch.. (context) - Kontothanasiss, Wisniewski - 1993
Documents on the same site (http://www.ics.uci.edu/~schark/): More
Rate of Change Load Balancing in Distributed and Parallel.. - Luis Miguel Campos
(Correct)
A Lower Bound for Dynamic Scheduling of Data Parallel Programs - Fabricio Alves Barbosa
(Correct)
Bounds on Gang Service Scheduling - Silva, Scherson (1999)
(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