Rainer Gawlick  Home/Search
Context Related
| mit.edu/publication...MITLCSTR556.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: mit.edu/publications/pubs/ps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Concurrent Timestamp Systems (CTSS) allow processes to temporally order concurrent events in an asynchronous shared memory system. Bounded memory constructions of a CTSS are extremely powerful tools for concurrency control, and are the basis for solutions to many co- ordination problems including mutual exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfortunately, known bounded CTSS constructions seem to be complex from the algorithmic point of view. Because of... (Update)
Context of citations to this paper: More
.... snapshots, coin ipping, bounded round numbers, timestamps, and multi writer registers [1, 2, 5, 7, 8, 9, 10, 11, 13, 20, 21, 24, 25, 26, 28, 30, 32, 38, 34, 35, 39, 40, 46, 59] . Indeed, the cost of this na ve implementation is easily shown to be a lower bound on the...
.... have been used to solve randomized consensus [7, 8] and approximate agreement [11] and to implement bounded concurrent timestamps [18] and other types of objects [9, 19] Because snapshot objects are much easier for programmers to use, researchers have spent a great deal...
Cited by: More
A Simple, Memory-Efficient Bounded Concurrent.. - Shikaripura, Kshemkalyani (Correct)
Space-Optimal Multi-Writer Snapshot Objects Are Slow - Fatourou, Fich, Ruppert (2002) (Correct)
Efficient Object Sharing in Shared-Memory Multiprocessors - Moir (1996) (Correct)
Similar documents (at the sentence level):
11.0%: Concurrent Timestamping Made Simple - Gawlick, Lynch, Shavit (1995) (Correct)
Active bibliography (related documents): More All
0.8: Bounded Concurrent Time-Stamping - Dolev, Shavit (1997) (Correct)
0.5: A Hundred Impossibility Proofs for Distributed Computing - Lynch (1989) (Correct)
0.5: Collective Asynchronous Reading with Polylogarithmic.. - Chlebus, Kowalski.. (Correct)
Similar documents based on text: More All
0.6: Time-Lapse Snapshots - Dwork, Herlihy, Plotkin, al. (1994) (Correct)
0.5: Simple Wait-free Multireader Registers (Extended Abstract) - Vitányi (Correct)
0.5: Bounded Concurrent Timestamp Systems Using Vector Clocks - Haldar, Vitanyi (2002) (Correct)
Related documents from co-citation: More All
17: On achieving consensus using a shared memory (context) - Abrahamson - 1988
14: Bounded Time-Stamps (context) - Israeli, Li - 1987
14: Time-lapse snapshots - Dwork, Herlihy et al.
BibTeX entry: (Update)
Rainer Gawlick. (1992) Concurrent timestamping made simple. Master's Thesis, MIT EECS. http://citeseer.ist.psu.edu/gawlick92concurrent.html More
@inproceedings{ gawlick92concurrent,
author = "Rainer Gawlick and Nancy A. Lynch and Nir Shavit",
title = "Concurrent Timestamping Made Simple",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "171-183",
year = "1992",
url = "citeseer.ist.psu.edu/gawlick92concurrent.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Specifying, modules - 1983
208 An Axiomatic Proof Technique for Parallel Programs (context) - Owicki, Gries - 1976
142 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
125 Wait-free synchronization - Herlihy - 1991
99 Atomic Snap- shots of Shared Memory - Afek, Attiya et al. - 1990
78 Forward and backward simulations for timing based systems - Lynch, Vaandrager - 1991
59 Bounded time stamps (context) - Israeh, Li - 1987
52 parts I and II (context) - On, communication - 1986
52 parts I and II (context) - The, problem - 1986
48 Concurrent reading while writing ii: the multi-writer case (context) - Peterson, Burns - 1987
40 Constructing multi-reader atomic values from non-atomic valu.. (context) - Burns, Peterson - 1987
26 Distributed fifo allocation of identical resources using sma.. - Fischer, Lynch et al. - 1989
26 Bounded polynomial randomized consensus (context) - Attiya, Dolev et al. - 1989
25 the correctness of atomic multi-writer registers (context) - Schaffer - 1988
23 Resource allocation with immunity to limited process failure - Fischer, Lynch et al. - 1979
18 Simple and Efficient Bounded Concurrent timestamping - or - .. (context) - Dwork, Waarts - 1991
13 The virtue of patience: concurrent programming with and with.. - Anderson, Gouda - 1988
12 Some Combinatorial aspects of timestamp systems - Cori, Sopena - 1991
10 Multiple-Writer Composite Registers (context) - Anderson - 1989
7 Com- munications of the ACM (context) - Lamport, solution et al. - 1974
7 Com- munications of the ACM (context) - Time, the et al. - 1978
7 A Very Simple Construction for Atomic Multiwriter Registers (context) - Li, Vitanyi - 1987
6 A linear time bounded concurrent timestamp scheme (context) - Israeli, Pinchasov - 1991
6 Shared register access by asynchronous hardware (context) - Vitanyi, Awerbuch - 1986
5 How to Share Concurrent Asynchronous Wait-free Variables (context) - Li, Vitanyi - 1989
4 Bounded concurrent time-stamps are constructible (context) - Dolev, Shavit - 1989
3 Hierarchical Correcntess Proofs for Distributed Algorithms (context) - Lynch, Tuttle - 1987
3 Uniform construction for wait-free variables (context) - Li, Vitanyi - 1988
3 Mechanically Checked Proof of Kernel Speci- fication (context) - Bevier, gaard-Andersen - 1991
2 On process coordination using asynchronous hard- ware (context) - Chor, Israeli et al. - 1987
2 Memory requirements for agreement among unreliable asynchron.. (context) - Lui, Abu-Amara - 1987
2 Private Communication (context) - Attiya, tterlihy - 1991
2 Concurrent time stamping (context) - Shavit - 1989
1 OptimaJ Space Distributed Move-to-front Lists (context) - Saks, Zaharoglou - 1991
1 Goldman Distributed Alogorithms (context) - Lynch - 1988
1 Yelick Modelling Shared State in a Shared Action Model (context) - Goldman, Lynch - 1992
1 Algorithms for Mutual Exclusion (context) - Rayhal - 1986
1 Specification and Implementation of Atomic Data Types (context) - Wiehl - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/): More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998) (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987) (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998) (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