An integrated real-time locking protocol

Son, Sang H.; Park, Seog; Lin, Yi

doi:10.1109/icde.1992.213156

Cited by 20 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Expectations about the performance of data-priority-based locking protocol were confirmed by experimental results [66,68]. Examples of other lock-based concurrency control protocols developed for RTDBSs include those provided by Agrawal et al [5] and by Son et al [61]. The protocols presented in [5] were motivated by the observation that the blocking behavior of locking, protocols can greatly degrade the performance of RTDBSs.…”

Section: Concurrency Control With Soft~firm Deadline Transactionsmentioning

confidence: 87%

“…A rather complex locking protocol was introduced by Son et al [61] to be used in RTDBSs. In this protocol, the serialization order of active transactions is adjusted dynamically, making it possible for high-priority transactions to be executed before lower-priority transactions, while lower-priority transactions may not have to be aborted in resolving data conflicts.…”

Section: Concurrency Control With Soft~firm Deadline Transactionsmentioning

confidence: 99%

See 1 more Smart Citation

Research issues in real-time database systems Survey paper

Ulusoy

1995

Information Sciences

View full text Add to dashboard Cite

Today's real-time systems are characterized by managing large volumes of data. Efficient database management algorithms for accessing and manipulating data are required to satisfy timing constraints of supported applications. Real-time database systems involve a new research area investigating possible ways of applying database systems technology to real-time systems. Management of real-time information through a database system requires the integration of concepts from both real-time systems and database systems. Some new criteria need to be developed to involve timing constraints of real-time applications in many database systems design issues, such as transaction/query processing, data buffering, CPU, and IO scheduling. In this paper, a basic understanding of the issues in real-time database systems is provided and the research efforts in this area are introduced. Different approaches to various problems of real-time database systems are briefly described, and possible future research directions are discussed.

show abstract

Section: Concurrency Control With Soft~firm Deadline Transactionsmentioning

confidence: 87%

Section: Concurrency Control With Soft~firm Deadline Transactionsmentioning

confidence: 99%

Research issues in real-time database systems Survey paper

Ulusoy

1995

Information Sciences

View full text Add to dashboard Cite

show abstract

“…Researchers have proposed various techniques in the design of a database system to improve and to guarantee the system performance. The majority of the work is in the design of efficient concurrency control protocols to meet transaction deadlines and, at the same time, to maintain database consistency [AGM92,HLC90,OS95,SPL92]. Researchers often assumed that the behavior and/or characteristics of transactions in RTDBS are more predictable than those in conventional database systems [KS96].…”

Section: Related Workmentioning

confidence: 99%

A multi-version data model for executing real-time transactions in a mobile environment

Lam

Kuo

2001

Proceedings of the 2nd ACM International Workshop on Data Engineering for Wireless and Mobile Access

View full text Add to dashboard Cite

With the significant advances in mobile computing technology, there is an increasing demand for various mobile applications to process transactions in a real-time fashion. When remote data access is considered in a mobile environment, data access delay becomes one of the most serious problems in meeting transaction deadlines. In this paper, we propose a multi-version data model and adopt the relative consistency as the correctness criterion for processing of real-time transactions in a mobile environment. The purpose is to reduce the impacts of unpredictable and unreliable mobile network on processing of the real-time transactions. Under the proposed model, the overheads for concurrency control can be significantly reduced, and the data availability is much enhanced even under network failures. A real-time transaction may access stale data, provided that they are relatively consistent with the data accessed by the transaction, and the staleness of the data is within the requirements. An image transaction model, which prefetches multiple data versions at fixed hosts, is proposed to reduce the data access delay and to simplify the management of the realtime transactions in a mobile environment. The image transaction model also helps in reducing the transaction-restart overheads and minimizing the impacts of the unpredictable performance of mobile network on transaction executions.

show abstract

“…Agrawal et al [5] proposed a new locking approach, referred to as ordered sharing, which attempts to eliminate blocking of read and write operations in RTDBSs. In [42], Son et al examined a priority-driven locking protocol which decomposes the problem of concurrency control into two subproblems, namely read-write synchronization and write-write synchronization, and integrates the solutions to two subproblems considering transaction priorities. Kim and Srivastava [26] proposed new multiversion concurrency control algorithms to increase concurrency in RTDBSs.…”

Section: Introductionmentioning

confidence: 99%

Processing real-time transactions in a replicated database system

Ulusoy

1994

Distrib Parallel Databases

View full text Add to dashboard Cite

Abstract.A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. It is difficult to satisfy all timing constraints due to the consistency requirements of the underlying database. In scheduling the transactions it is aimed to process as many transactions as possible within their deadlines. Replicated database systems possess desirable features for real-time applications, such as a high level of data availability, and potentially improved response time for queries. On the other hand, multiple copy updates lead to a considerable overhead due to the communication required among the data sites holding the copies. In this paper, we investigate the impact of storing multiple copies of data on satisfying the timing constraints of real-time transactions. A detailed performance model of a distributed database system is employed in evaluating the effects of various workload parameters and design alternatives on the system performance. The performance is expressed in terms of the fraction of satisfied transaction deadlines. A comparison of several real-time concurrency control protocols, which are based on different approaches in involving timing constraints of transactions in scheduling, is also provided in performance experiments.

show abstract

An integrated real-time locking protocol

Cited by 20 publications

References 10 publications

Research issues in real-time database systems Survey paper

Research issues in real-time database systems Survey paper

A multi-version data model for executing real-time transactions in a mobile environment

Processing real-time transactions in a replicated database system

Contact Info

Product

Resources

About