Concurrent Timestamping Made Simple
| dc.contributor.advisor | Lynch, Nancy A. | en_US |
| dc.contributor.advisor | Shavit, Nir | en_US |
| dc.contributor.author | Gawlick, Rainer | en_US |
| dc.date.accessioned | 2023-03-29T15:19:27Z | |
| dc.date.available | 2023-03-29T15:19:27Z | |
| dc.date.issued | 1992-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149732 | |
| dc.description.abstract | Concurrent Timestamp Systems (CTSS) allow processes to temporally order concurrent events in an asynchronous shared memory system. Bounded memory constructions of a CTSS are extremely powerful tools for concurrency control, and are the basis for solutions to many coordination problems including mutual exclusion, randomized consensus, and multiwriter multireader atomic registers. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-556 | |
| dc.title | Concurrent Timestamping Made Simple | en_US |
| dc.identifier.oclc | 27929886 |
