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

S. Tseng*, Y. H. Chin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 incorporated with the prescheduling policy to form 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 for writing a timely transaction from the aspect of transaction viewpoint.

Original languageEnglish
Pages (from-to)23-42
Number of pages20
JournalJournal of Systems Integration
Volume3
Issue number1
DOIs
StatePublished - 1 Mar 1993

Keywords

  • concurrency control
  • performance evaluation
  • prescheduling
  • Real-time
  • valid ratio

Fingerprint Dive into the research topics of 'Prescheduling policy for real-time concurrency control: A performance evaluation'. Together they form a unique fingerprint.

Cite this