| Digital Equipment Corp. and (2008) | |||||||||||||||||
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. Categories and Subject Descriptors: D.4. 1 [Operating Systems]: Process Management—concurrency; scheduling; H.2.4 [Database Management]: Systems—concurrency; transaction process-ing | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||