Open AccessJournal Article10.1109/12.83617

A real-time locking protocol

- 01 Jul 1991

- Vol. 40, Iss: 7, pp 793-800

226

TL;DR: It is shown that this protocol leads to freedom from mutual deadlock and can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet its deadlines.

Abstract: The authors examine a priority driven two-phase lock protocol called the read/write priority ceiling protocol. It is shown that this protocol leads to freedom from mutual deadlock. In addition, a high-priority transactions can be blocked by lower priority transactions for at most the duration of a single embedded transaction. These properties can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet its deadlines. Finally, the performance of this protocol is examined for randomly arriving transactions using simulation studies. >

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions mentioned in the paper "A real-time locking protocol" ?

In this paper, the authors examine a prioritydriven two-phase lock protocol called the reador write-priority ceiling protocol.. The authors show that this protocol is free of deadlock, and in addition a high-priority transaction can be blocked by lower priority transactions for at most the duration of a single embedded transaction.. The authors then evaluate system performance experimentally.

Citations

Journal Article•10.1109/5.259432

On real-time databases: concurrency control and scheduling

Philip S. Yu, +3 more

- 01 Jan 1994

TL;DR: This paper develops a taxonomy of the underlying design space of concurrency control including the various techniques for achieving serializability and improving performance and discusses several approaches that explore the nonserializable semantics of real-time transactions to meet the hard deadlines.

...read moreread less

190

Book Chapter•10.1007/978-3-642-88049-0_13

An overview of real-time database systems

Ben Kao, +2 more

- 21 Mar 1995

TL;DR: This paper presents an integrated system, which provides database operations with real-time constraints is generally called a real- time database system (RTDBS) and explains its development and use case.

...read moreread less

141

Journal Article•10.1007/S10619-008-7024-5

Distributed real time database systems: background and literature review

Udai Shanker, +2 more

- 01 Apr 2008

- Distributed and Parallel Databases

TL;DR: This paper first discusses the performance issues that are important to DRTDBS, and then surveys the research that has been done so far on the issues like priority assignment policy, commit protocols and optimizing the use of memory in non-replicated/replicated environment pertaining to distributed real time transaction processing.

...read moreread less

•Journal Article•10.1007/BF01265321

Processing real-time transactions in a replicated database system

Özgür Ulusoy

- 01 Oct 1994

- Distributed and Parallel Databases

TL;DR: The impact of storing multiple copies of data on satisfying the timing constraints of real- time transactions is investigated and a comparison of several real-time concurrency control protocols is provided.

...read moreread less

•Journal Article•10.1016/0306-4379(93)90024-U

Real-time transaction scheduling in database systems

Özgür Ulusoy, +1 more

- 01 Dec 1993

- Information Systems

TL;DR: Two new concurrency control protocols are proposed, one of which is locking-based, and it prevents the priority inversion problem‡ by scheduling the data lock requests based on prioritizing data items, and the second new protocol extends the basic timestamp-ordering method by involving real-time priorities of transactions in the timestamp assignment procedure.

...read moreread less

...

Expand

References

Journal Article•10.1145/321738.321743

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

C. L. Liu, +1 more

- 01 Jan 1973

- Journal of the ACM

TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.

...read moreread less

9.4K

•Book

Concurrency Control and Recovery in Database Systems

Philip A. Bernstein, +2 more

- 01 Feb 1987

TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.

...read moreread less

4.2K

Journal Article•10.1109/12.57058

Priority inheritance protocols: an approach to real-time synchronization

Lui Sha, +2 more

- 01 Sep 1990

- IEEE Transactions on Computers

TL;DR: An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol, both of which solve the uncontrolled priority inversion problem.

...read moreread less

2.5K

Journal Article•10.1145/360363.360369

The notions of consistency and predicate locks in a database system

Kapali P. Eswaran, +3 more

- 01 Nov 1976

- Communications of The ACM

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.

...read moreread less

2.1K

Proceedings Article•10.1109/REAL.1989.63567

The rate monotonic scheduling algorithm: exact characterization and average case behavior

John P. Lehoczky, +2 more

- 05 Dec 1989

TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.

...read moreread less

1.6K

...

Expand

A real-time locking protocol

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions mentioned in the paper "A real-time locking protocol" ?

Citations

On real-time databases: concurrency control and scheduling

An overview of real-time database systems

Distributed real time database systems: background and literature review

Processing real-time transactions in a replicated database system

Real-time transaction scheduling in database systems

References

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Concurrency Control and Recovery in Database Systems

Priority inheritance protocols: an approach to real-time synchronization

The notions of consistency and predicate locks in a database system

The rate monotonic scheduling algorithm: exact characterization and average case behavior

Related Papers (5)

Priority inheritance protocols: an approach to real-time synchronization

Concurrency Control and Recovery in Database Systems

Dynamic real-time optimistic concurrency control

On being optimistic about real-time constraints

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment