ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

On Being Optimistic about Real-Time Constraints.

Jayant R. Haritsa, Michael J. Carey, Miron Livny: On Being Optimistic about Real-Time Constraints. PODS 1990: 331-343
@inproceedings{DBLP:conf/pods/HaritsaCL90,
  author    = {Jayant R. Haritsa and
               Michael J. Carey and
               Miron Livny},
  title     = {On Being Optimistic about Real-Time Constraints},
  booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on
               Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee},
  publisher = {ACM Press},
  year      = {1990},
  isbn      = {0-89791-352-3},
  pages     = {331-343},
  ee        = {http://doi.acm.org/10.1145/298514.298585, db/conf/pods/HaritsaCL90.html},
  crossref  = {DBLP:conf/pods/90},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Performance studies of concurrency control algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic techniques. Real-time database systems have special characteristics - timing constraints are associated with transactions, performance criteria are based on satisfaction of these timing constraints, and scheduling algorithms are priority driven. In light of these special characteristics, results regarding the performance of concurrency control algorithms need to be re-evaluated. We show in this paper that the following parameters of the real-time database system - its policy for dealing with transactions whose constraints are not met, its knowledge of transaction resource requirements, and the availability of resources - have a significant impact on the relative performance of the concurrency control algorithms. In particular, we demonstrate that under a policy that discards transactions whose constraints are not met, optimistic concurrency control outperforms locking over a wide range of system utilization. We also outline why, for a variety of reasons, optimistic algorithms appear well-suited to real-time database systems.

Copyright © 1990 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...

Printed Edition

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee. ACM Press 1990, ISBN 0-89791-352-3
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Online Edition: ACM Digital Library


References

[Abbo88]
Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-time Transactions: a Performance Evaluation. VLDB 1988: 1-12 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Abbo89]
Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-Time Transactions with Disk Resident Data. VLDB 1989: 385-396 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Agra87]
Rakesh Agrawal, Michael J. Carey, Miron Livny: Concurrency Control Performance Modeling: Alternatives and Implications. ACM Trans. Database Syst. 12(4): 609-654(1987) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Care88]
Michael J. Carey, Miron Livny: Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication. VLDB 1988: 13-25 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Care89]
Michael J. Carey, Rajiv Jauhari, Miron Livny: Priority in DBMS Resource Scheduling. VLDB 1989: 397-410 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Eswa76]
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Kung81]
H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Livn88]
...
[Mena82]
Daniel A. Menascé, Tatuo Nakanishi: Optimistic versus pessimistic concurrency control mechanisms in database management systems. Inf. Syst. 7(1): 13-27(1982) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Robi82]
...
[Sha87]
...
[Jack63]
...
[Klei75]
...

Copyright © Fri Mar 12 17:19:55 2010 by Michael Ley (ley@uni-trier.de)