Results 1 to 10 of about 7,260 (279)
A distributed file service based on optimistic concurrency control [PDF]
ACM SIGOPS Operating Systems Review, 1985 The design of a layered file service for the Amoeba Distributed System is discussed, on top of which various applications can easily be intplemented. The bottom layer is formed by the Amoeba Block Services, responsible for implementing stable storage and
Mullender, Sape J., Tanenbaum, Andrew S.
core +17 more sources
Optimistic Concurrency Control for Distributed Unsupervised Learning [PDF]
, 2013 Research on distributed machine learning algorithms has focused primarily on one of two extremes - algorithms that obey strict concurrency constraints or algorithms that obey few or no such constraints.
Broderick, Tamara +4 more
core +7 more sources
Optimistic concurrency control revisited [PDF]
, 1994 Several years ago optimistic concurrency control gained much attention in the database community. However, two-phase locking was already well established, especially in the relational database market.
Unland, Rainer
core +5 more sources
On optimistic methods for concurrency control [PDF]
Fifth International Conference on Very Large Data Bases, 1979., 1981 Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic” in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between ...
H. T. Kung, John T. Robinson
openalex +3 more sources
Optimistic concurrency control by melding trees [PDF]
Proceedings of the VLDB Endowment, 2011 This paper describes a new optimistic concurrency control algorithm for tree-structured data called meld. Each transaction executes on a snapshot of a multiversion database and logs a record with its intended updates. Meld processes log records in log order on a cached partial-copy of the last committed state to determine whether each transaction ...
Philip A. Bernstein +3 more
openalex +3 more sources
Infinite Resources for Optimistic Concurrency Control [PDF]
Proceedings of the 2018 Morning Workshop on In-Network Computing, 2018 Optimistic concurrency control (OCC) is inefficient for high-contention workloads. When concurrent transactions conflict, an OCC system wastes CPU resources verifying transactions, only to abort them. This paper presents a new system, called Network Optimistic Concurrency Control (NOCC), which reduces load on storage servers by identifying transactions
Theo Jepsen +4 more
openalex +2 more sources
SQL Access Patterns for Optimistic Concurrency Control [PDF]
2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009 5 pages, 1 ...
Fritz Laux, Martti Laiho
openalex +3 more sources
Optimistic concurrency control for abstract data types [PDF]
ACM SIGOPS Operating Systems Review, 1987 A concurrency control technique is optimistic if it allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability. This paper describes several new optimistic concurrency control techniques for objects in distributed systems, proves their correctness and optimality properties, and characterizes the ...
Maurice Herlihy
openalex +3 more sources
Efficient optimistic concurrency control using loosely synchronized clocks [PDF]
ACM SIGMOD Record, 1995 This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and transactional support are provided by servers. The scheme provides both serializability and external consistency for committed transactions; it uses ...
Atul Adya +3 more
openalex +3 more sources
FOCCX: An Optimistic Concurrency Control Protocol over XML
International Journal of Database Theory and Application, 2015 XML concurrency control protocol (CCP) is used to guard the consistence and isolation of transactions in Native XML databases. Experiments show that locking overhead of existing approaches based on locking may be huge, especially in the applications with few or without conflicts. Optimistic concurrency control (OCC) is an alternative to locking.
Weifeng Shan, Husheng Liao
openalex +2 more sources