James Aspnes, Maurice Herlihy  Home/Search
Context Related
Links: ACM DBLP | yale.edu/homes/aspnes/spaa90full.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: yale.edu/homes/...spaa90abstract (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the asynchronous PRAM model, processes communicate by atomically reading and writing shared memory locations. This paper investigates the extent to which asynchronous PRAM permits long-lived, highly concurrent data structures. An implementation of a concurrent object is wait-free if every operation will complete in a finite number of steps, and it is k-bounded wait-free, for some k > 0, if every operation will complete within k steps. In the first part of this paper, we show that there are... (Update)
Cited by: More
Scalable and Lock-Free Concurrent Dictionaries - Sundell, Tsigas (2004) (Correct)
Collective Asynchronous Reading with Polylogarithmic.. - Chlebus, Kowalski.. (Correct)
Space-Optimal Multi-Writer Snapshot Objects Are Slow - Fatourou, Fich, Ruppert (2002) (Correct)
Similar documents (at the sentence level):
7.3%: Impossibility Results for Asynchronous PRAM (Extended Abstract) - Herlihy (1991) (Correct)
Active bibliography (related documents): More All
0.5: The Asynchronous Computability Theorem for t-Resilient Tasks - Herlihy, Shavit (1993) (Correct)
0.5: Two-Phase Write Posting on Symmetric Multiprocessors - Chung, Sun, Peir, Lai (Correct)
0.4: The Topological Structure of Asynchronous Computability - Herlihy, Shavit (1996) (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.4: Waitfree distributed memory management by Create, and Read.. - Hesselink, Groote (1998) (Correct)
0.4: Long-lived, Fast, Waitfree Renaming with Optimal.. - Eberly, Higham.. (Correct)
Related documents from co-citation: More All
26: Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
24: Linearizability: A correctness condition for concurrent objects (context) - Herlihy, Wing - 1992
16: Memory requirements for agreement among unreliable asynchronous processes (context) - Loui, Abu-Amara - 1987
BibTeX entry: (Update)
J. Aspnes and M. Herlihy, "Wait-Free Data Structures in the Asynchronous PRAM Model", Proceedings of the Second Annual ACM Symposium on Parallel Architectures and Algorithms, July, 1990. http://citeseer.ist.psu.edu/article/aspnes00waitfree.html More
@inproceedings{ aspnes90waitfree,
author = "James Aspnes and Maurice Herlihy",
title = "Wait-Free Data Structures in the Asynchronous {PRAM} Model",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "340--349",
year = "2000",
url = "citeseer.ist.psu.edu/article/aspnes00waitfree.html" }
Citations (may not include all citations):917 and the ordering of events in a distributed system (context) - Lamport, clocks - 1978
606 How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
357 The directory-based cache coherence protocol for the DASH mu.. (context) - Lenoski, Laudon et al. - 1990 ACM DBLP
326 Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
186 A methodology for implementing highly concurrent data struct.. - Herlihy - 1990 ACM DBLP
181 ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
139 introduction to inputoutput automata (context) - Tuttle, to et al. - 1988
116 Concurrency control in distributed database systems (context) - Bernstein, Goodman - 1981 ACM DBLP
85 The APRAM: incorporating asynchrony into the PRAM model (context) - Cole, Zajicek - 1989 ACM DBLP
78 Fast randomized consensus using shared memory - Aspnes, Herlihy - 1990 ACM DBLP
77 Reaching approximate agreement in the presence of faults - Dolev, Lynch et al. - 1986
72 A more practical PRAM model (context) - Gibbons - 1989 ACM DBLP
72 Implementing and programming causal distributed shared memor.. (context) - Ahamad, Hutto et al. - 1990
63 Concurrent reading and writing (context) - Lamport - 1977 ACM DBLP
60 The serializability of concurrent database updates - Papadimitriou - 1979
57 Impossibility and universality results for wait-free synchro.. (context) - Herlihy - 1988 ACM DBLP
56 Slow memory: weakening consistency to enhance concurrency in.. (context) - Hutto, Ahamad - 1989
52 parts I and II (context) - Lamport, communication - 1986
48 Concurrent reading while writing ii: the multi-writer case (context) - Peterson, Burns - 1986 DBLP
48 Constructing two-writer atomic registers (context) - Bloom - 1988
45 Wait-free data structures in the asynchronous PRAM model - Aspnes, Herlihy - 1990 ACM DBLP
40 Constructing multi-reader atomic values from non-atomic valu.. (context) - Burns, Peterson - 1987
38 Are wait-free algorithms fast - Attiya, Lynch et al. - 1994
37 Asynchronous shared memory parallel computation (context) - Nishimura - 1990
36 A combinatorial characterization of the distributed tasks wh.. (context) - Biran, Moran et al. - 1988
35 The expected advantage of asynchrony (context) - Cole, Zajicek - 1990 ACM DBLP
35 Parallel algorithms with processor failures and delays - Buss, Kanellakis et al. - 1991 ACM DBLP
27 ACM Transactions on Programming Languages and Systems (context) - Peterson, while - 1983
20 Asymptotically optimal algorithms for approximate agreement (context) - Fekete - 1986
17 Inexact agreement: Accuracy (context) - Mahaney, Schneider - 1985
16 Atomic snapshots using lattice agreement (context) - Attiya, Herlihy et al. - 1995 DBLP
15 SIAM Journal on Computing (context) - Attiya, Rachman et al. - 1998
15 multi-reader shared variables (context) - Newman-Wolfe, for et al. - 1987
14 Impossibility results for asynchronous PRAM (context) - Herlihy - 1991
13 Towards a topological characterization of asynchronous compl.. - Hoest, Shavit - 1997
9 Order Number GA (context) - System, operation
6 Pseudo read-modify-write operations: Bounded wait-free imple.. (context) - Anderson, Gro - 1991
5 Technical Report TR (context) - registers - 1989
3 Ninth ACM Symposium on Principles of Distributed Computing (context) - Afek, Attiya et al. - 1990
3 A scalable shared memory (context) - Lipton, Sandberg - 1988
2 Weak ordering - a new denition (context) - Adve, Hill - 1990
1 Ecient parallel algorithms on restartable fail-stop processo.. (context) - Kannelakis, Shvartsman - 1991
1 A feature taxonomy and survey of synchronization primitive i.. (context) - Glew, Hwu - 1990
1 Specication and implementation of atomic data types (context) - Weihl - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yale.edu/homes/aspnes/spaa90-abstract.html):
Wait-Free Data Structures in the Asynchronous PRAM Model - Aspnes, Herlihy (1990) (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