Concurrent Timestamping made simple
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 171-183
- https://doi.org/10.1007/bfb0035176
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!Published by Association for Computing Machinery (ACM) ,1992
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Atomic Snapshots of Shared MemoryPublished by Defense Technical Information Center (DTIC) ,1990
- Bounded Concurrent Time-Stamp Systems Are ConstructiblePublished by Defense Technical Information Center (DTIC) ,1989
- Bounded time-stampsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On processor coordination using asynchronous hardwarePublished by Association for Computing Machinery (ACM) ,1987
- On interprocess communicationDistributed Computing, 1986
- The mutual exclusion problemJournal of the ACM, 1986
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974