Concurrency Control in Distributed Database Systems
Reads0
Chats0
TLDR
A survey of concurrency control methods for distributed database concurrency can be found in this paper, where the authors decompose the problem into two major subproblems, read-write and write-write synchronization, and describe a series of synchromzation techniques for solving each subproblem.Abstract:
In this paper we survey, consolidate, and present the state of the art in distributed database concurrency control. The heart of our analysts is a decomposition of the concurrency control problem into two major subproblems: read-write and write-write synchronization. We describe a series of synchromzation techniques for solving each subproblem and show how to combine these techniques into algorithms for solving the entire concurrency control problem. Such algorithms are called "concurrency control methods." We describe 48 principal methods, including all practical algorithms that have appeared m the literature plus several new ones. We concentrate on the structure and correctness of concurrency control algorithms. Issues of performance are given only secondary treatment.read more
Citations
More filters
On the Efficiency and Scalability of Decentralised Monitoring using Mobile Agents
TL;DR: Several alternative solutions based on Mobile Agents, specifically tailored to network monitoring are described, and the key problem of computing efficiently the initial number and location of MAs is addressed, and two algorithms for rapid MA deployment are proposed.
Journal ArticleDOI
Implementation of a declarative state-transition system
TL;DR: An implementation scheme for Declarative state‐transition systems is described and a presentation of the implementation of PPS, a DST system for parallel logic programming is illustrated.
Journal ArticleDOI
Performance analysis of locking methods with limited wait depth
TL;DR: An analysis of RPS is provided, which is extensible to modified WDL with a performance comparable to WDL, but requiring fewer comparisons to determine the transaction to be aborted, up to the point at which the peak throughput is attained in an infinite resource system.
Adaptive Co-Allocation of Distributed Resources for Parallel Applications
Marco A. S. Netto,Rajkumar Buyya +1 more
TL;DR: This thesis contributes to the area of distributed systems by proposing adaptive resource co-allocation policies for message passing and BoT applications, which aim at reducing user response time and increasing system utilisation.
Proceedings ArticleDOI
Transactional Tasks: Parallelism in Software Transactions
TL;DR: Transactional tasks have several useful properties: they are coordinated, they maintain serializability, and they do not introduce non-determinism, allowing the potential parallelism of a program to be fully exploited, while preserving the properties of the separate models where possible.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
The notions of consistency and predicate locks in a database system
TL;DR: It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
Journal ArticleDOI
Monitors: an operating system structuring concept
TL;DR: In this paper, the authors develop Brinch-Hansen's concept of a monitor as a method of structuring an operating system and describe a possible method of implementation in terms of semaphores and give a suitable proof rule.
Book ChapterDOI
Notes on Data Base Operating Systems
TL;DR: This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.