论文信息 - On reasoning with the global time assumption

On reasoning with the global time assumption

Concurrency in distributed systems is usually modeled by a nondeterministic interleaving of atomic events. The consequences of this interleaving (or global time) assumption on the specifications and proofs of distributed programs are examined in this paper. A construction for atomic registers is presented; this construction has the surprising property that it is correct with respect to a specification based on partial orders but is incorrect with respect to a naively derived specification based on global time.

Ambuj K. Singh | Ambuj K. Singh

[1] Shai Ben-David,et al. The global time assumption and semantics for concurrent systems , 1988, PODC '88.

[2] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[3] Gil Neiger,et al. Causal Memory , 1991, WDAG.

[4] Doron A. Peled,et al. Interleaving set temporal logic , 1987, PODC '87.

[5] Frank D. Anger,et al. On Lamport's interprocessor communication model , 1989, TOPL.

[6] Gary L. Peterson,et al. Constructing multi-reader atomic values from non-atomic values , 1987, PODC '87.

[7] Haim Gaifman,et al. Modeling concurrency by partial orders and nonlinear transition systems , 1988, REX Workshop.

[8] Jayadev Misra. Axioms for Memory Access in Asynchronous Hardware Systems , 1984, Seminar on Concurrency.

[9] Richard Newman-Wolfe,et al. A protocol for wait-free, atomic, multi-reader shared variables , 1987, PODC '87.

[10] Baruch Awerbuch,et al. Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11] Bard Bloom. Constructing Two-Writer Atomic Registers , 1988, IEEE Trans. Computers.

[12] Leslie Lamport,et al. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[13] Ambuj K. Singh,et al. The elusive atomic register revisited , 1987, PODC '87.