Clyde P. Kruskal, Larry Rudolph, Marc Snir  Home/Search
Context Related
| nyu.edu/pub/ultra/ucn/101...ucn105.ps.Z 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: nyu.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A new formalism is given for read-modify-write (RMW) synchronization operations. This formalism is used to extend the memory reference combining mechanism, introduced in the NYU Ultracomputer, to arbitrary RMW operations. A formal correctness proof of this combining mechanism is given. General requirements for the practicality of combining are discussed. Combining is shown to be practical for many useful memory access operations. This includes memory updates of the form mem_val := mem_val op... (Update)
Context of citations to this paper: More
.... combining interconnection network that is perfectly suited for implementing synchronous concurrent reads and writes is formally treated in [62] (the combining properties are used in their simplest form only to implement concurrent access to memory) Finally, fail stop processors...
.... [10] hardware switches can perform combining on several different kinds of messages, including reads, writes and fetch and add operations [15]. The most notable example of software combining for performing fetch and add are the combining trees of Goodman et as. 8] and Yew et...
Cited by: More
The Cost of Concurrent, Low-Contention Read&Modify&Write - Busch, Mavronicolas, Spirakis (2003) (Correct)
Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (Correct)
Combining Funnels: A new twist on an old tale... - Shavit, Zemach (1998) (Correct)
Active bibliography (related documents): More All
1.0: An Overview of the NYU Ultracomputer Project - Gottlieb (1986) (Correct)
0.7: Designing VLSI Network Nodes to Reduce Memory Traffic.. - Dickey, Gottlieb.. (1986) (Correct)
0.6: Systolic Combining Switch Designs - Dickey (1994) (Correct)
Similar documents based on text: More All
0.4: Can an Operation Both Update the State and Return a Meaningful.. - Hoepman (2001) (Correct)
0.2: Bibliography - June Ss (Correct)
0.2: Parallel Prefix Computation with Few Processors - Egecioglu, Koc (1992) (Correct)
Related documents from co-citation: More All
26: Algorithms for scalable synchronization on shared-memory multiprocessors (context) - Mellor-Crummey, Scott - 1991
23: Basic techniques for the efficient coordination of very large numbers of coopera.. - Gottlieb, Lubachevsky et al. - 1983
20: Efficient Synchronization Primitives for LargeScale Cache-Coherent Multiprocesso.. (context) - GOODMAN, VERNON et al. - 1989
BibTeX entry: (Update)
C.P. Kruskal, L. Rudolph, , and M. Snir. Efficient synchronization on multiprocessors with shared memory. In Fifth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 1986. http://citeseer.ist.psu.edu/kruskal86efficient.html More
@article{ kruskal88efficient,
author = "Clyde P. Kruskal and Larry Rudolph and Marc Snir",
title = "Efficient Synchronization on Multiprocessors with Shared Memory",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "10",
number = "4",
pages = "579--601",
year = "1988",
url = "citeseer.ist.psu.edu/kruskal86efficient.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1978
917 and the Ordering of Events in a Distributed System (context) - Lamport - 1978
606 How To Make a Multiprocessor Computer That Correctly Execute.. (context) - Lamport - 1979
201 Parallel Prefix Computations (context) - Ladner, Fisher - 1980
173 Hot Spot' Contention and Combining in Multistage Interconnec.. (context) - Pfister - 1985
157 Architectures and Applications of the HEP Multiprocessor Com.. (context) - Smith - 1981
90 The IBM Research Parallel Processor Prototype (context) - Pfister - 1985
86 The Specification of Process Synchronization by Path Express.. (context) - Campbell, Haberman - 1976
85 Operating System Concepts (context) - Peterson, Silbershatz - 1983
83 Hierarchical ordering of sequential processes (context) - Dijkstra - 1971
70 The Cosmic Cube (context) - Seitz - 1985
43 On Describing the Behavior and Implementation of Distributed.. - Lynch, Fisher - 1981
36 Concurrent Processes and their Syntax (context) - Milne, Milner - 1979
21 The NYU Ultracomputer -- Designing an MIMD Parallel Computer (context) - Gottlieb, Grishman et al. - 1984
20 Contention is no Obstacle to Shared-Memory Multiprocessing (context) - Rettberg, Thomas - 1986
16 Fully Distributed Parallel Machine (context) - Sullivan, Bashkow et al. - 1977
14 Coordinating Parallel Processors: A Partial Unification (context) - Gottlieb, Kruskal - 1981
8 A Synchronization Scheme and Its Applications for Large Scal.. (context) - Yew - 1984
7 Software Structures for Ultraparallel Computing (context) - Rudolph - 1981
7 Essential Issues in Multiprocessor Systems (context) - Gajski, Peir - 1985
7 A VLSI Combining Network for the NYU Ultracomputer (context) - Dickey, Kenner et al. - 1985
3 Principles of Architecture for Systems of Parallel Processes (context) - Collier - 1981
2 Efficient and Correct Execution of Programs That Share Memor.. (context) - Shasha, Snir - 1986
2 An Implementation of a Combining Network for the NYU Ultraco.. (context) - Dickey, Kenner et al. - 1986
2 Data Flow Execution of Fortran Loops (context) - Peir, Gajski - 1985
2 Programming Considerations for Parallel Computers (context) - Draughon, Grishman et al. - 1967
1 to appear in Distributed Computing (context) - Lamport
1 Efficient Techniques for Coordinating Sequential Processors (context) - Gottlieb, Lubachevsky et al. - 1983
1 The Effectiveness of Combining in Multistage Interconnection.. (context) - Lee, Kruskal et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.nyu.edu.html): More
Interconnection Network Switch Architectures and Combining .. - Dickey, Gottlieb, Liu (Correct)
Tight Comparison Bounds On The Complexity Of Parallel Sorting - Azar, Vishkin (1987) (Correct)
An Optimal Selection Algorithm - Cole (1986) (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