The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
IEEE Transactions on Software Engineering
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Wait-free Test-and-Set (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
ISTCS'92 Proceedings of the Israel Symposium on Theory of Computing and Systems
Concurrent Timestamping Made Simple
ISTCS'92 Proceedings of the Israel Symposium on Theory of Computing and Systems
A new solution to the critical section problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Theoretical Computer Science
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
Theoretical Computer Science
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Constructing regular variables in message passing systems
Journal of Parallel and Distributed Computing
Atomic snapshots using lattice agreement
Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: a shared disk on distributed storage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Highly-fair bakery algorithm using symmetric tokens
Information Processing Letters
The failure detector abstraction
ACM Computing Surveys (CSUR)
Brief announcement: sharing memory in a self-stabilizing manner
DISC'10 Proceedings of the 24th international conference on Distributed computing
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
How hard is it to take a snapshot?
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
The space complexity of unbounded timestamps
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Time-stamps are labels which a system adds to its data items. These labels enable the system to keep track of the temporal precedence relations among its data elements. Many distributed protocols and some applications use the natural numbers as time-stamps. The natural numbers however are not useful for bounded protocols. In this paper we develop a theory of bounded time-stamps. Time-stamp schemes are defined and the complexity of their implementation is analyzed. This indicates a direction for developing a general tool for converting time-stamp based protocols to bounded protocols.