On the composability of consistency conditions |
| |
Authors: | Roy Friedman Roman Vitenberg |
| |
Affiliation: | a Computer Science Department, Technion - The Israel Institute of Technology, Haifa 32000, Israel b Institute of Computer Science, The Hebrew University of Jerusalem, Givat Ram, Jerusalem 91904, Israel |
| |
Abstract: | This paper presents a formal framework, which is based on the notion of a serialization set, that enables to compose a set of consistency conditions into a more restrictive one. To exemplify the utility of this framework, a list of very basic consistency conditions is identified, and it is shown that various compositions of the basic conditions yield some of the most commonly used consistency conditions, such as sequential consistency, causal memory, and Pipelined RAM. The paper also lists several applications that can benefit from even weaker semantics than Pipelined RAM that can be expressed as a composition of a small subset of the basic conditions. |
| |
Keywords: | Concurrency Distributed computing Distributed systems Formal semantics |
本文献已被 ScienceDirect 等数据库收录! |
|