article

Free access

Value-based scheduling in real-time database systems

Authors:

Jayant R. Haritsa,

Michael J. Carey,

Miron LivnyAuthors Info & Claims

The VLDB Journal — The International Journal on Very Large Data Bases, Volume 2, Issue 2

Pages 117 - 152

Published: 01 April 1993 Publication History

Abstract

In a real-time database system, an application may assign a value to a transaction to reflect the return it expects to receive if the transaction commits before its deadline. Most research on real-time database systems has focused on systems where all transactions are assigned the same value, the performance goal being to minimize the number of missed deadlines. When transactions are assigned different values, the goal of the system shifts to maximizing the sum of the values of those transactions that commit by their deadlines. Minimizing the number of missed deadlines becomes a secondary concern. In this article, we address the problem of establishing a priority ordering among transactions characterized by both values and deadlines that results in maximizing the realized value. Of particular interest is the tradeoff established between these values and deadlines in constructing the priority ordering. Using a detailed simulation model, we evaluate the performance of several priority mappings that make this tradeoff in different, but fixed, ways. In addition, a "bucket" priority mechanism that allows the relative importance of values and deadlines to be controlled is introduced and studied. The notion of associating a penalty with transactions whose deadlines are not met is also briefly considered.

References

[1]

Abbott, R. and Garcia-Molina, H. Scheduling real-time transactions: A performance evaluation. Proceedings of the Fourteenth International Conference on Very Large Database Systems, Los Angeles, 1988.

[2]

Abbott, R. and Garcia-Molina, H. Scheduling real-time transactions with diskresident data. Proceedings of the Fifteenth International Conference on Very Large Database Systems, Amsterdam, 1989.

[3]

Abbott, R. and Garcia-Molina, H. Scheduling I/O requests with deadlines: A performance evaluation. Proceedings of the Eleventh IEEE Real-Time Systems Symposium, Orlando, FL, 1990.

[4]

Agrawal, R., Carey, M., and Livny, M. Concurrency control performance modeling: Alternatives and implications. ACM Transactions on Database Systems, 12(4):609-654, 1987.

[5]

Baruah, S. and Rosier, L. Limitations concerning on-line scheduling algorithms for overloaded real-time systems. Proceedings of the Eighth IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, GA, 1991.

[6]

Biyabani, S., Stankovic, J., and Ramamritham, K. The integration of deadline and criticalness in hard real-time scheduling. Proceedings of the Ninth Real-Time Systems Symposium, Huntsville, AL, 1988.

[7]

Buchmann, A., McCarthy, D., Hsu, M., and Dayal, U. Time-critical database scheduling: A framework for integrating real-time scheduling and concurrency control. Proceedings of the Fifth International Conference on Data Engineering, Los Angeles, 1989.

[8]

Dertouzos, M. Control robotics: The procedural control of physical processes. Proceedings of the IFIP Congress, 1974.

[9]

Eswaran, K., Gray, J., Lorie, R., and Traiger, I. The notions of consistency and predicate locks in a database system. Communications of the ACM, 19(11):624-633, 1976.

[10]

Franaszek, P. and Robinson, J. Limitations of concurrency in transaction processing. ACM Transactions on Database Systems, 10(1):1-28, 1985.

[11]

Gray, J. Notes on database operating systems. In: Bayer, R., Graham, R., and Seegmuller, G., eds., Operating Systems: An Advanced Course, Springer-Verlag, 1979.

[12]

Haritsa, J., Carey, M., and Livny, M. On being optimistic about real-time constraints. Proceedings of the Ninth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, Nashville, TN, 1990a.

[13]

Haritsa, J., Carey, M., and Livny, M. Dynamic real-time optimistic concurrency control. Proceedings of the Eleventh IEEE Real-Time Systems Symposium, Orlando, FL, 1990b.

[14]

Haritsa, J., Livny, M., and Carey, M. Earliest-deadline scheduling for real-time database systems. Proceedings of the Twelfth IEEE Real-Time Systems Symposium, San Antonio, TX, 1991.

[15]

Haritsa, J., Carey, M., and Livny, M. Data access scheduling in firm real-time database systems. Journal of Real-Time Systems, 4:203-241, 1992.

[16]

Huang, J., Stankovic, J., Towsley, D., and Ramamritham, K. Experimental evaluation of real-time transaction processing. Proceedings of the Tenth IEEE Real-Time System Symposium, Santa Monica, CA, 1989.

[17]

Huang, J. and Stankovic, J. Buffer management in real-time databases. COINS Technical Report 90-65, University of Massachusetts, Amherst, MA, 1990a.

[18]

Huang, J. and Stankovic, J. Concurrency control in real-time database systems: Optimistic scheme vs. two-phase locking. COINS Technical Report 90-66, University of Massachusetts, Amherst, MA, 1990b.

[19]

Jensen, E. Locke, C., and Tokuda, H. A time-driven scheduling model for real-time operating systems. Proceedings of the Sixth IEEE Real-Time Systems Symposium, 1985.

[20]

Koren, G. and Shasha, D. Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. Technical Report CS TR 594, Courant Institute, New York University, New York, NY, 1992.

[21]

Kung, H. and Robinson, J. On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6(2):213-226, 1981.

[22]

Livny, M. DeNet User's Guide, Version 1.0, Computer Science Department, University of Wisconsin, Madison, WI, 1988.

[23]

Locke, C. Best effort decision-making for real-time scheduling. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1986.

[24]

Menasce, D. and Nakanishi, T. Optimistic vs. pessimistic concurrency control mechanisms in database management systems. Information Systems, 7(1):13-27, 1982.

[25]

Reed, D. Naming and synchronization in a decentralized computer system. Ph.D. Thesis, Department of Computer Science, Massachusetts Institute of Technology, Boston, MA, 1978.

[26]

Robinson, J. Design of concurrency controls for transaction processing systems, Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA, 1982.

[27]

Sha, L., Rajkumar, R., and Lehoczky, J. Priority inheritance protocols: An approach to real-time synchronization. Technical Report CMU-CS-87-181, Departments of Computer Science, Electrical and Computer Engineering, and Statistics, Carnegie-Mellon University, Pittsburgh, PA, 1987.

[28]

Stankovic, J. and Zhao, W. On real-time transactions. ACM SIGMOD Record, 17(1):4-18, 1988.

Cited By

Saxena GRahman MChainani NLin CCaragea GChowdhury FMarcus RKraska TPandis INarayanaswamy BDas SPandis ISelçuk Candan KAmer-Yahia S(2023)Auto-WLM: Machine Learning Enhanced Workload Management in Amazon RedshiftCompanion of the 2023 International Conference on Management of Data10.1145/3555041.3589677(225-237)Online publication date: 4-Jun-2023
https://dl.acm.org/doi/10.1145/3555041.3589677
Ding BKot LGehrke J(2018)Improving optimistic concurrency control through transaction batching and operation reorderingProceedings of the VLDB Endowment10.14778/3282495.328250212:2(169-182)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.14778/3282495.3282502
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3187009.317774011:5(648-662)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1145/3187009.3177740
Show More Cited By

Value-based scheduling in real-time database systems
1. Information systems
  1. Data management systems
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

An Adaptive Value-Based Scheduling Policy for Multiprocessor Real-Time Database Systems
DEXA '97: Proceedings of the 8th International Workshop on Database and Expert Systems Applications

In a real-time application, a transaction may be assigned a value to reflect the profit of completing the transaction before its deadline. Satisfying both goals of maximizing the totally obtained profit and minimizing the number of missed transactions ...
Scheduling Value-Based Nested Transactions in Distributed Real-Time Database Systems

Many noticeable studies have focussed on scheduling flat transactions in a distributed real-time database system (RTDBS). However, a nested transaction model has been widely adopted in many real-life applications such as Internet stock trading systems ...
Transaction scheduling in firm real-time database systems

Comments

Information & Contributors

Information

Published In

cover image The VLDB Journal — The International Journal on Very Large Data Bases

The VLDB Journal — The International Journal on Very Large Data Bases Volume 2, Issue 2

April 1993

123 pages

ISSN:1066-8888

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 April 1993

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
683
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)4

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Saxena GRahman MChainani NLin CCaragea GChowdhury FMarcus RKraska TPandis INarayanaswamy BDas SPandis ISelçuk Candan KAmer-Yahia S(2023)Auto-WLM: Machine Learning Enhanced Workload Management in Amazon RedshiftCompanion of the 2023 International Conference on Management of Data10.1145/3555041.3589677(225-237)Online publication date: 4-Jun-2023
https://dl.acm.org/doi/10.1145/3555041.3589677
Ding BKot LGehrke J(2018)Improving optimistic concurrency control through transaction batching and operation reorderingProceedings of the VLDB Endowment10.14778/3282495.328250212:2(169-182)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.14778/3282495.3282502
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3187009.317774011:5(648-662)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1145/3187009.3177740
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3177732.317774011:5(648-662)Online publication date: 5-Oct-2018
https://dl.acm.org/doi/10.1145/3177732.3177740
Xu CSharaf MZhou XZhou A(2014)Quality-aware schedulers for weak consistency key-value data storesDistributed and Parallel Databases10.1007/s10619-013-7136-432:4(535-581)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1007/s10619-013-7136-4
Chi YHacígümüş HHsiung WNaughton J(2013)Distribution-based query schedulingProceedings of the VLDB Endowment10.14778/2536360.25363676:9(673-684)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.14778/2536360.2536367
Zhu YSharaf MZhou X(2011)Scheduling with freshness and performance guarantees for web applications in the cloudProceedings of the Twenty-Second Australasian Database Conference - Volume 11510.5555/2460396.2460413(133-142)Online publication date: 17-Jan-2011
https://dl.acm.org/doi/10.5555/2460396.2460413
Chi YMoon HHacigümüş H(2011)iCBSProceedings of the VLDB Endowment10.14778/2002938.20029424:9(563-574)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.14778/2002938.2002942
Chi YMoon HHacigümüş HTatemura J(2011)SLA-treeProceedings of the 14th International Conference on Extending Database Technology10.1145/1951365.1951383(129-140)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1951365.1951383
Wu HLuo QLi JLabrinidis ADiao YJensen CNascimento MTatbul N(2009)Quality aware query scheduling in wireless sensor networksProceedings of the Sixth International Workshop on Data Management for Sensor Networks10.1145/1594187.1594197(1-6)Online publication date: 24-Aug-2009
https://dl.acm.org/doi/10.1145/1594187.1594197
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents