The implementation of an integrated concurrency control and recovery scheme

Chan, Ann M.; Fox, Stephen; Lin, Wen-Te K.; Nori, Aditya V.; Ries, Daniel R.

doi:10.1145/582353.582386

Cited by 111 publications

(50 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since Kung and Robinson firstly proposed Optimistic concurrency control in 1981 [12]. So far, many OCC algorithms have been proposed for centralized database system and distributed database system [13,14,15]. Some OCC algorithms, such as OCCSacrifice [16], OCC-Broadcast Commit [17] [18] have been widely used in many fields.…”

Section: Background and Motivationmentioning

confidence: 99%

Multi Attribute D-S Evidence Theory Based OCC for Shared-State Scheduling in Large Scale Cluster

Qiang²,

Zhou³

et al. 2016

Int. J. Onl. Eng.

View full text Add to dashboard Cite

Abstract-With the growth of big data problems, nowadays the size of cloud-scale computing clusters is growing rapidly to run complicated parallel processing jobs. To full utilize cluster resources, the cluster management system is being challenged by the scaling cloud size and the often more complicated application requirements. Omega scheduling software provides a flexible and scalable shared-state scheduling architecture for large scale cluster scheduling. One of its key ideas is using an optimistic concurrency control (OCC) algorithm to let parallel schedulers concurrently make decisions. However, there are few studies exploring to extend OCC for a shared-state scheduling architecture. Furthermore, most of the traditional' shared-state scheduling architectures also use the same OCCs as Omega does. In this paper, we present a multi attribute Dempster-Shafer (D-S) evidence theory based OCC for shared-state scheduling. This OCC adapts the multi attribute D-S evidence theory to help making conflict decisions for some scheduling transactions. Experiments' results show that our method can obtain in some respects more optimized scheduling results compared to coarse-grained conflict detection of Omega.Index Terms-large scale cluster scheduling; multi attribute D-S evidence theory; optimistic concurrency control; Shared-state scheduling

show abstract

Section: Background and Motivationmentioning

confidence: 99%

Multi Attribute D-S Evidence Theory Based OCC for Shared-State Scheduling in Large Scale Cluster

Qiang²,

Zhou³

et al. 2016

Int. J. Onl. Eng.

View full text Add to dashboard Cite

show abstract

“…Hybrid atomicity encompasses techniques that combine locking with timestamps [6,8,1,2]. An event tree is a tree of events.…”

Section: Hybrid Atomicitymentioning

confidence: 99%

“…[28,27,26]), and hybrid schemes employing both locking and timestamps (e.g. [6,8,1,2]). This paper proposes a new criterion for evaluating these mechanisms: the constraints they impose on the availability of replicated data.…”

Section: Introductionmentioning

confidence: 99%

Concurrency and availability as dual properties of replicated atomic data

Herlihy

1990

J. ACM

View full text Add to dashboard Cite

A replicated object is a typed object that provides a set of operations to its clients. A quorum for an operation is any set of sites whose co-operation suffices to execute that operation. An operation's quorums determine its availability, and constraints on quorum assignment determine the range of availability properties realizable by replication. This paper compares the constraints on availability and concurrency imposed by three classes of atomicity mechanisms, respectively encompassing generalized two-phase locking, multiversion timestamping, and hybrid techniques. An analysis of the constraints on quorum assignment necessary to maximize the concurrency permitted within each class shows that only the class encompassing hybrid mechanisms is undominated: (1) Hybrid schemes permit more quorum assignments than timestamping schemes, even though they place incomparable constraints on concurrency. (2) Hybrid and locking schemes place incomparable constraints on quorum assignment, even though hybrid schemes support more concurrency. (3) Timestamping and locking schemes are incomparable with respect to both concurrency and quorum assignment. (4) Bounding the maximum depth of transaction nesting tightens constraints on concurrency for ail three classes, but reduces the constraints on quorum assignment for hybrid schemes only. (5) Bounding the number of versions retained by multiversion timestamping schemes reduces concurrency but enhances availability.

show abstract

“…A system encompassing multiple objects is atomic if all component objects are atomic and serializable in a common order. The optimistic mechanisms introduced in this paper serialize transactions in the order they commit (as observed by a system of logical clocks [18]), and are thus compatible with pessimistic methods that induce the same ordering (e.g., [5,6,8,14,16,22] …”

Section: Assumptions and Definitionsmentioning

confidence: 99%

Optimistic concurrency control for abstract data types

Herlihy

1987

SIGOPS Oper. Syst. Rev.

View full text Add to dashboard Cite

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 circumstances under which each is likely to be useful. These techniques have the following novel aspects. First, unlike many methods that classify operations only as reads or writes, these techniques systematically exploit type-specific properties of objects to validate more interleavings. Necessary and sufficient validation conditions are derived directly from an object's data type specification. Second, these techniques are modular: they can be applied selectively on a per-object (or even per-operation) basis in conjunction with standard pessimistic techniques such as two-phase locking, permitting optimistic methods to be introduced exactly where they will be most effective. Third, when integrated with quorum-consensus replication, these techniques circumvent certain tradeoffs between concurrency and availability imposed by comparable pessimistic techniques. Finally, the accuracy and efficiency of validation are further enhanced by some technical improvements: distributed validation is performed as a sideeffect of the commit protocol, and validation takes into account the results of operations, accepting certain interleavings that would have produced delays in comparable pessimistic schemes.

show abstract

The implementation of an integrated concurrency control and recovery scheme

Abstract: This paper describes the

Cited by 111 publications

References 5 publications

Multi Attribute D-S Evidence Theory Based OCC for Shared-State Scheduling in Large Scale Cluster

Multi Attribute D-S Evidence Theory Based OCC for Shared-State Scheduling in Large Scale Cluster

Concurrency and availability as dual properties of replicated atomic data

Optimistic concurrency control for abstract data types

Contact Info

Product

Resources

About