2002 · 40 citations · 14 references
ComputingComputer EngineeringComputer ScienceDatabasesDistributed SystemsReal-time SystemsConcurrency ControlData SynchronizationDeadline AnalysisDistributed TransactionsReal-time SchedulingSchedulability AnalysisPrototypingReal-time Concurrency ControlReal-time DatabasesReal-time Locking ProtocolsReal-time Transaction ProcessingSynchronizationSynchronization ProtocolsTwo-phase Locking
The problem of priority scheduling in real-time database systems is addressed. A prototyping environment for investigating distributed software is presented. Specific priority-based real-time locking protocols are discussed, together with a performance study which illustrates the use of the prototyping environment for evaluation of synchronization protocols for real-time database systems. The priority ceiling protocol, which achieves a high degree of schedulability and system predictability, is investigated, and its performance is compared with that of other techniques and design choices. It is shown that this technique might be appropriate for real-time transaction scheduling since it is very stable over the wide range of transaction sizes, and compared with two-phase locking protocols, it reduces the number of deadline-missing transactions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
14
The notions of consistency and predicate locks in a database system
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie et al. · Communications of the ACM · 1976 · 2K citations · Full text
Scheduling real-time transactions
Robert Abbott, Héctor García-Molina · ACM Transactions on Database Systems · 1992 · 574 citations · Full text