Improving predictability of transaction execution times in real-time databases

被引:10
作者
Rastogi, R
Seshadri, S
Bohannon, P
Leinbaugh, D
Silberschatz, A
Sudarshan, S
机构
[1] Bell Labs, Murray Hill, NJ 07974 USA
[2] Indian Inst Technol, Dept Comp Sci & Engn, Bombay 400076, Maharashtra, India
关键词
transactions; versioning; concurrency-control; aging; consistency; locking; timestamps; deadlines;
D O I
10.1023/A:1008143228351
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a design for multi-version concurrency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to execute without obtaining data item locks or system latches. Our schemes enable a system to provide the guarantee that updaters will never interfere with read-only transactions, and read-only transactions will not be delayed due to data contention. Consequently, transaction executions become more predictable-this partially alleviates a major problem in real-time database system (RTDBS) scheduling, namely, significant unpredictability in transaction execution times. As a result, in addition to a transaction's deadline, a more accurate estimate of its execution time can also be taken into account, thus facilitating better scheduling decisions. Our contributions include several space saving techniques for the main-memory implementation, including improved methods for logical aging of data items and the introduction of physical aging for low-level structures. Some of these schemes have been implemented on a widely-used software platform within Lucent, and the full scheme is implemented in the Dali main-memory storage manager.
引用
收藏
页码:283 / 302
页数:20
相关论文
共 50 条
  • [21] Intelligent Replication for Distributed Active Real-Time Databases Systems
    Salem, Rashed
    Saleh, Safa'a
    Abdul-Kader, Hattem
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2018, 15 (03) : 505 - 513
  • [22] Abort-oriented concurrency control for real-time databases
    Kuo, TW
    Liang, MC
    Shu, LC
    IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (07) : 660 - 673
  • [23] Real-time transaction scheduling: A framework for synthesizing static and dynamic factors
    Chakravarthy, S
    Hong, DK
    Johnson, T
    REAL-TIME SYSTEMS, 1998, 14 (02) : 135 - 170
  • [24] Exhaustive computation of the scheduled task execution sequences of a real-time application
    ChoquetGeniet, A
    Geniet, D
    Cottet, F
    FORMAL TECHNIQUES IN REAL-TIME AND FAULT-TOLERANT SYSTEMS, 1996, 1135 : 246 - 262
  • [25] A model in Petri nets to analyze quality of service in real-time databases
    Neto, PFR
    Perkusich, MLB
    2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 300 - 305
  • [26] Nested Transaction Concurrency Control in Parallel Real-Time Dat-abases
    潘怡
    卢炎生
    Journal of Donghua University(English Edition), 2005, (02) : 114 - 119
  • [27] A sensor transaction scheduling algorithm for maintaining real-time data temporal validity
    Bai Tian
    Li Guo-hui
    Liu Yun-sheng
    JOURNAL OF CENTRAL SOUTH UNIVERSITY OF TECHNOLOGY, 2011, 18 (06): : 2068 - 2073
  • [28] Priority assignment in distributed real-time databases using optimistic concurrency control
    Lam, KY
    Lee, VCS
    Hung, SL
    Kao, BCM
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1997, 144 (05): : 324 - 330
  • [29] Concurrency control protocol for dynamic priority scheduling in hard real-time databases
    Wang, HA
    Wang, Q
    Wang, K
    Jin, H
    Dai, GZ
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (01): : 6 - 11
  • [30] A characterization of re-execution costs for real-time abort-oriented protocols
    Shu, LC
    FIFTH INTERNATIONAL CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 1998, : 286 - 292