Sciweavers

13 search results - page 1 / 3
» Bounded concurrent timestamp systems using vector clocks
Sort
View
95
Voted
JACM
2002
87views more  JACM 2002»
14 years 10 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
87
Voted
WDAG
2005
Springer
92views Algorithms» more  WDAG 2005»
15 years 3 months ago
Plausible Clocks with Bounded Inaccuracy
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...
Brad T. Moore, Paolo A. G. Sivilotti
78
Voted
PODC
1997
ACM
15 years 2 months ago
Lazy Consistency Using Loosely Synchronized Clocks
Thispaperdescribesanewschemeforguaranteeingthattransactions in a client/server system observe consistent state while they are running. The scheme is presented in conjunction with ...
Atul Adya, Barbara Liskov
80
Voted
IPL
1998
89views more  IPL 1998»
14 years 10 months ago
A Limitation of Vector Timestamps for Reconstructing Distributed Computations
Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used t...
Colin J. Fidge
ISTCS
1992
Springer
15 years 1 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit