Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Computer-assisted verification of an algorithm for concurrent timestamps
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
SIAM Journal on Computing
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are based on a recursively defined Precedence Graph. Such constructions have been viewed as hard to understand and to prove correct. Other constructions that are based on the Traceable Use abstraction first proposed by Dwork and Waarts have been regardedas simple and have therefore been preferred. The Dwork-Waarts (DW) algorithm, however, is not space-efficient. Haldar and Vitanyi (HV) gave a more space-efficient construction based on Traceable Use, starting with only safe and regular registers as building blocks. In this paper, we present a new algorithm by making simple modifications to DW. Our algorithm is simple and is more memory-efficient than the DW and HV algorithms.