DocumentCode
3556924
Title
On the validity of the global time assumption
Author
Singh, Ambuj K.
Author_Institution
Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA
fYear
1991
fDate
20-24 May 1991
Firstpage
282
Lastpage
289
Abstract
Concurrency in distributed systems is usually modeled by a non-deterministic choice, i.e., a concurrent execution that is a partial order on events is equated with the set of total orders obtained from its interleavings. The validity of this interleaving (or global time) assumption is examined. A novel construction for atomic registers is presented; this construction is correct if the proof is based on partial orders, but is incorrect if all possible interleavings are confused with partial orders in the reasoning
Keywords
concurrency control; distributed processing; atomic registers; concurrency control; concurrent execution; distributed systems; global time assumption; interleavings; partial order; reasoning; validity; Computer science; Concurrent computing; Interleaved codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1991., 11th International Conference on
Conference_Location
Arlington, TX
Print_ISBN
0-8186-2144-3
Type
conf
DOI
10.1109/ICDCS.1991.148678
Filename
148678
Link To Document