D. Dolev and N. Shavit. Bounded concurrent time-stamps are constructible. SIAM Journal on Computing, to appear. Also in Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454--465, 1989. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
Concurrent Timestamping Made Simple - Rainer Gawlick Nancy (1992) (19 citations) Self-citation (Shavit) (Correct)
....sequential timestamp systems. Sequential timestamp systems prohibit concurrent operations. This work was continued in several interesting papers on sequential systems with weaker ordering requirements by Li and Vitanyi [21] Cori and Sopena [8] and Saks and Zaharoglou [26] Dolev and Shavit [9] were the first to provide an axiomatic definition and a construction of a bounded concurrent timestamp system using read write registers. Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been followed by a series of papers ....
....Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been followed by a series of papers directed at providing more efficient and simple to understand bounded ctss algorithms. Israeli and Pinchasov [16] have simplified the [9] algorithm by modifying the labeling scheme of [9] introducing a new label scanning method, and replacing the ordering of events based formal proof [18] of the ctss axioms. Concurrent with our work, Dwork and Waarts [10] presented the most efficient read write register based ctss construction to ....
[Article contains additional citation context not shown here]
D. Dolev and N. Shavit. Bounded concurrent time-stamps are constructible. SIAM Journal on Computing, to appear. Also in Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454--465, 1989.
Concurrent Timestamping Made Simple - Gawlick (1992) (19 citations) Self-citation (Shavit) (Correct)
....bounded sequential timestamp systems. Sequential timestamp systems prohibit concurrent operations. This work was continued in several interesting papers on sequential systems with weaker ordering requirements by Li and Vitanyi [26] Cori and Sopena [9] and Saks and haroglou [35] Dolev and Shavit [11] were the first to define and construct a bounded concurrent timestamp system. However, to quote [12] Their algorithm is ingenious but its proof is long and involved. Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been ....
....but its proof is long and involved. Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been followed by a series of papers directed at providing simpler bounded CTSS algorithm. Israeli and Pinchasov [18] have simplified the [11] algorithm and its proof by modifying the labeling scheme of [11] introducing a new label scanning method, and simplifying the ordering of events based formal proof [23] by reasoning about global states (However, it still takes over 40 pages. Dwork and Waarts [12] have taken a totally ....
[Article contains additional citation context not shown here]
D. Dolev and N. Shavit. Bounded concurrent time-stamps are constructible. SIAM Journal on Computing, to appear. Also in Proceedings of the 21 ' Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454-465, 1989.
Concurrent Timestamping Made Simple - Gawlick, Lynch, Shavit (1995) (19 citations) Self-citation (Shavit) (Correct)
....sequential timestamp systems. Sequential timestamp systems prohibit concurrent operations. This work was continued in several interesting papers on sequential systems with weaker ordering requirements by Li and Vitanyi [21] Cori and Sopena [8] and Saks and Zaharoglou [26] Dolev and Shavit [9] were the first to provide an axiomatic definition and a construction of a bounded concurrent timestamp system using read write registers. Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been followed by a series of papers ....
....Because of the importance of the bounded concurrent timestamping problem, the original solution by Dolev and Shavit has been followed by a series of papers directed at providing more efficient and simple to understand bounded ctss algorithms. Israeli and Pinchasov [16] have simplified the [9] algorithm by modifying the labeling scheme of [9] introducing a new label scanning method, and replacing the ordering of events based formal proof [18] of the ctss axioms. Concurrent with our work, Dwork and Waarts [10] presented the most efficient read write register based ctss construction to ....
[Article contains additional citation context not shown here]
D. Dolev and N. Shavit. Bounded concurrent time-stamps are constructible. SIAM Journal on Computing, to appear. Also in Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454--465, 1989.
Computer-Assisted Verification of an Algorithm for .. - Petrov.. (1996) (3 citations) (Correct)
No context found.
Danny Dolev and Nir Shavit. (1989) Bounded concurrent timestamps are constructible. SIAM Journal of Computing, to appear. Also in 21st ACM Symposium on Theory of Computing, 454--465.
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