Scheduling real-time transactions
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 17 (3) , 513-560
- https://doi.org/10.1145/132271.132276
Abstract
Managing transactions with real-time requirements presents many new problems. In this paper we address several: How can we schedule transactions with deadlines? How do the real-time constraints affect concurrency control? How should overloads be handled? How does the scheduling of 1/0 requests affect the timeliness of transactions? How should exclusive and shared locking be handled? We describe a new group of algorithms for scheduling real-time transactions that produce serializable schedules. We present a model for scheduling transactions with deadlines on a single processor disk resident database system, and evaluate the scheduling algorithms through detailed simulation experiments.Keywords
This publication has 13 references indexed in Scilit:
- Dynamic real-time optimistic concurrency controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Scheduling real-time transactionsACM SIGMOD Record, 1988
- The HiPAC project: combining active databases and timing constraintsACM SIGMOD Record, 1988
- Enhancing availability in distributed real-time databasesACM SIGMOD Record, 1988
- Adding Time to Synchronous Process CommunicationsIEEE Transactions on Computers, 1987
- Progressive Transaction Recovery in Distributed DB/DC SystemsIEEE Transactions on Computers, 1987
- Principles of transaction-oriented database recoveryACM Computing Surveys, 1983
- Using semantic knowledge for transaction processing in a distributed databaseACM Transactions on Database Systems, 1983
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973