TY - GEN
T1 - Shadowing-based crash recovery schemes for real-time database systems
AU - Shu, LihChyun
AU - Sun, Huey-Min
AU - Kuo, Tei-Wei
PY - 1999/6
Y1 - 1999/6
N2 - Predictable performance in the event of failures is of paramount importance in most safety critical real-time database systems. Our research addresses new crash recovery techniques that accommodate pre-run-time timing analysis and utilize design-time information about transactions' data access patterns to improve performance at run time and system restart time. The schemes we will propose are based on a form of shadowing. In contrast to the shadow version algorithm as described previously our schemes reduce overheads at run time, shorten the blocking duration necessary in the transactions' atomic commitment stage, eliminate dynamic storage allocation and reclamation, and permit very fast and bounded-time recovery after a crash by simply retrieving the master record and system version directory from nonvolatile storage. The data structures and algorithms used by our recovery schemes differ when different concurrency control protocols are used. We analyze their characteristics and their impacts on the performance of real-time database systems. Quantitative evaluation of our technique indicates the schemes are much more efficient than traditional log-based techniques.
AB - Predictable performance in the event of failures is of paramount importance in most safety critical real-time database systems. Our research addresses new crash recovery techniques that accommodate pre-run-time timing analysis and utilize design-time information about transactions' data access patterns to improve performance at run time and system restart time. The schemes we will propose are based on a form of shadowing. In contrast to the shadow version algorithm as described previously our schemes reduce overheads at run time, shorten the blocking duration necessary in the transactions' atomic commitment stage, eliminate dynamic storage allocation and reclamation, and permit very fast and bounded-time recovery after a crash by simply retrieving the master record and system version directory from nonvolatile storage. The data structures and algorithms used by our recovery schemes differ when different concurrency control protocols are used. We analyze their characteristics and their impacts on the performance of real-time database systems. Quantitative evaluation of our technique indicates the schemes are much more efficient than traditional log-based techniques.
UR - https://www.scopus.com/pages/publications/84884619210
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84884619210&origin=recordpage
U2 - 10.1109/EMRTS.1999.777473
DO - 10.1109/EMRTS.1999.777473
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0769502407
SN - 9780769502403
T3 - Proceedings - Euromicro Conference on Real-Time Systems
SP - 260
EP - 267
BT - PROCEEDINGS OF The 11th Euromicro Conference on Real-Time Systems
PB - IEEE
T2 - 11th Euromicro Conference on Real-Time Systems (ECRTS 1999)
Y2 - 9 June 1999 through 11 June 1999
ER -