Yehuda Afek, Eytan Weisberger  Home/Search
Context Related
| math.tau.ac.il/pub/afek/weis.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: toronto.edu/~web...telavivpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Yehuda Afek Eytan Weisberger Hanan Weisman y Computer Science Department, Tel-Aviv University, Israel 69978. Abstract We study a class of synchronization objects in shared memory concurrent systems, which we call common2. This class contains read-modify-write objects that commute (e.g. fetch-and-add), or overwrite (e.g. swap). It is known that this class is contained in the consensus number 2 class of objects [Her91a], and most of the commonly used objects with consensus number 2 are... (Update)
Similar documents based on text: More All
0.5: Delimiting the Power of Bounded Size Synchronization Objects.. - Afek, Stupp (1994) (Correct)
0.2: The Instancy of Snapshots and Commuting Objects - Afek, Weisberger (1993) (Correct)
0.2: A Study of Wait-Free Hierarchies in Concurrent Systems - Scott Mccrickard Georgia (1993) (Correct)
BibTeX entry: (Update)
Yehuda Afek, Eytan Weisberger, and Hanan Weisman. A completeness theorem for a class of synchronization objects. In Proceedings of the Twelfth ACM Symposium on Principles of Distributed Computing, pages 159--170. ACM Press, August 1993. http://citeseer.ist.psu.edu/afek93completeness.html More
@inproceedings{ afek92completeness,
author = "Yehuda Afek and Eytan Weisberger and Hanan Weisman",
title = "A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract)",
booktitle = "Symposium on Principles of Distributed Computing",
pages = "159-170",
year = "1992",
url = "citeseer.ist.psu.edu/afek93completeness.html" }
Citations (may not include all citations):326 Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
99 Atomic snapshots of shared memory - Afek, Attiya et al. - 1990
83 Basic techniques for the efficient coordination of very larg.. - Gottlieb, Lubachevsky et al. - 1983
78 Fast randomized consensus using shared memory - Aspnes, Herlihy - 1990
46 Fault-tolerant wait-free shared objects - Jayanti, Chandra et al. - 1992
35 Counting networks and multi-processor coordination - Aspnes, Herlihy et al. - 1991
35 Optimal time randomized consensus -- making resilient algori.. (context) - Saks, Shavit et al. - 1990
33 Economical solutions for the critical section problem in a d.. (context) - Peterson, Fischer - 1977
33 on Programming Languages and Systems (context) - Herlihy, ACM - 1991
30 Bounded concurrent time-stamp systems are constructible (context) - Dolev, Shavit - 1989
26 Time and space efficient randomized consensus - Aspnes - 1990
26 Bounded polynomialrandomized consensus (context) - Attiya, Dolev et al. - 1989
24 Computing with faulty shared memory (context) - Afek, Greenberg et al. - 1992
24 Linearizable counting networks - Herlihy, Shavit et al. - 1991
20 Randomized wait-free concurrent objects (context) - Herlihy - 1991
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.toronto.edu/~websql/demo-cascon/telaviv-papers.html): More
Sparser: A paradigm for running distributed algorithms - Afek, Ricklin (1990) (Correct)
The Instancy of Snapshots and Commuting Objects - Afek, Weisberger (1993) (Correct)
Delimiting the Power of Bounded Size Synchronization Objects - Afek, Stupp (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