The notions of consistency and predicate locks in a database system

Eswaran, Kapali P.; Gray, Jim; Lorie, Raymond A.; Traiger, I. L.

doi:10.1145/360363.360369

Cited by 1,544 publications

(152 citation statements)

References 3 publications

Supporting

Mentioning

146

Contrasting

Unclassified

Order By: Relevance

“…Finally the original paper on two-phase locking made explicit the idea of locking not just objects, but program predicates [10]. Logical locks are such predicates, which we realize in practice by mapping logical locks onto physical locks using a lock placement.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Concurrent data representation synthesis

et al. 2012

View full text Add to dashboard Cite

We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a representation of the relations as sets of cooperating data structures as well as the placement and acquisition of locks to synchronize concurrent access to those data structures. The resulting code is correct by construction: individual relational operations are implemented correctly and the aggregate set of operations is serializable and deadlock free. The relational specification also permits a high-level optimizer to choose the best performing of many possible legal data representations and locking strategies, which we demonstrate with an experiment autotuning a graph benchmark.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Concurrent data representation synthesis

et al. 2012

View full text Add to dashboard Cite

show abstract

“…Some fellow schedulers also use the same notions as Omega. The purpose of using OCC in shared-state scheduling is to maintain integrity of cell state and serial equivalence [10,11] of concurrent schedule transactions. Since Kung and Robinson firstly proposed Optimistic concurrency control in 1981 [12].…”

Section: Background and Motivationmentioning

confidence: 99%

“…Coarse-grained conflict detection is similar to backward validation and more suitable for users who have stricter requirement about serial equivalence [10,11]. Finegrained conflict detection is a completed relaxed method which has no concurrency control mechanism.…”

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

“…The Two phase locking protocol [17] consists of two consecutive phases for handling transaction locks:…”

Section: Two-phase Lockingmentioning

confidence: 99%

Blocking reduction for distributed transaction processing within MANETs

Obermeier

Böttcher

Hett

et al. 2009

Distrib Parallel Databases

View full text Add to dashboard Cite

Atomic commit protocols for distributed transactions in mobile ad-hoc networks have to consider message delays and network failures. We consider ad-hoc network scenarios, in which participants hold embedded databases and offer services to other participants. Services that are composed of several other services can access and manipulate data of physically different databases. In such a scenario, distributed transaction processing can be used to guarantee atomicity and serializability throughout all databases. However, with problems like message loss, node failure, and network partitioning, mobile environments make it hard to get estimations on the duration of a simple message exchange.In this article, we focus on the problem of setting up reasonable time-outs when guaranteeing atomicity for transaction processing within mobile ad-hoc networks, and we show the effect of setting up "wrong" time-outs on the transaction throughput and blocking time. Our solution, which does not depend on time-outs, shows a better performance in unreliable networks and remarkably reduces the amount of blocking.

show abstract

The notions of consistency and predicate locks in a database system

Cited by 1,544 publications

References 3 publications

Concurrent data representation synthesis

Concurrent data representation synthesis

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

Blocking reduction for distributed transaction processing within MANETs

Contact Info

Product

Resources

About