Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control

Buchmann, Alejandro; McCarthy, Dennis R.; Hsu, Meichun; Dayal, Umeshwar

doi:10.1109/icde.1989.47251

Cited by 67 publications

(17 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the data dependence analysis can be applied to batch jobs or database programming because entire contents of a transaction is known beforehand. Also this technique can be used by the transaction preanalysis technique in realtime database [1].…”

Section: Discussionmentioning

confidence: 99%

Data Dependence Analysis for an Untrusted Transaction Manager

Kang¹

1992

View full text Add to dashboard Cite

There are two components in the scheduler for multilevel-secure databases which use the replicated architecture; global and local schedulers. Since the global scheduler, which enforces data consistency among replicas, has to make scheduling decisions based on transactions (i.e., without any knowledge of actual data or physical layout of data), an accurate analysis technique which can detect conflicts among queries is needed. The data dependence analysis introduced here provides a method for precisely determining whether the portions of relations affected by various database operations overlap without the knowledge of actual data.

show abstract

Section: Discussionmentioning

confidence: 99%

Data Dependence Analysis for an Untrusted Transaction Manager

Kang¹

1992

View full text Add to dashboard Cite

show abstract

“…Buchmann et al [9] proposed a system architecture for the integration of functions from operating systems and RTDBSs. The architecture provides an interface between the operating system's scheduler and the RTDBS's concurrency control module.…”

Section: Integration With Operating Systemsmentioning

confidence: 99%

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

“…Buchmann [6] proposed a framework that integrated several real-time scheduling algorithms with the two-phase locking protocol to form a class of new real-time database scheduling algorithms. The combined algorithm is a priority-based, wound-wait strategy.…”

Section: Introductionmentioning

confidence: 99%

Prescheduling policy for real-time concurrency control: A performance evaluation

Tseng¹,

Chin

1993

Journal of Systems Integration

View full text Add to dashboard Cite

Abstract.A new priority management policy, a prescheduling policy, is proposed. This policy can be applied on any conventional concurrency control protocol to schedule a real-time transaction. Costly preemption is avoided by the prescheduling policy, and parsing dataset of a transaction is not needed. Three widely used conventional concurrency control protocols (dynamic two-phase locking, basic timestamp ordering, and optimistic) are incor porated with the prescheduling policy to lbrm three real-time concurrency control protocols. Performance of the three protocols is evaluated from three different viewpoints: database management systems, protocols, and transaction. From a database management system viewpoint, we show the prescheduling policy can improve the performance of protocols by raising the valid ratio and reducing restart counts. In general, two-phase locking with the prescheduling policy performs the best in most cases and yields the best choice for concurrency control in a real-time application. Deciding factors that affect performance of each protocol are identified from protocol viewpoint. Some suggestions are given fbr writing a timely transaction from the aspect of transaction viewpoint.

show abstract

Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control

Cited by 67 publications

References 9 publications

Data Dependence Analysis for an Untrusted Transaction Manager

Data Dependence Analysis for an Untrusted Transaction Manager

Research issues in real-time database systems Survey paper

Prescheduling policy for real-time concurrency control: A performance evaluation

Contact Info

Product

Resources

About