TY - GEN
T1 - A crash recovery algorithm based on multiple logs that exploits parallelism
AU - Kumar, Akhil
N1 - Publisher Copyright:
© 1990 IEEE.
PY - 1990
Y1 - 1990
N2 - The paper describes an efficient algorithm for recovery based on multiple logs. The standard WAL algorithm is designed to work with a single log. Since each transaction is required to write a commit record to the log, it imposes limits on the maximum achievable throughput even if group commits are allowed. These limits are well below the needs of high transaction rate systems in airlines and in other areas. Another problem with a 'single log' algorithm is that the tail of the log is a 'hot spot' because of severe contention for it. It is shown that both these problems are solved by extending the write-ahead logging method into a multiple log algorithm which allows transactions to write to one of several logs, and also permits each log to perform checkpoints and I/O operations in parallel. A further advantage of multiple logs is that parallelism can be exploited at recovery time. An algorithm is outlined that speeds up recovery by scanning the multiple logs in parallel.
AB - The paper describes an efficient algorithm for recovery based on multiple logs. The standard WAL algorithm is designed to work with a single log. Since each transaction is required to write a commit record to the log, it imposes limits on the maximum achievable throughput even if group commits are allowed. These limits are well below the needs of high transaction rate systems in airlines and in other areas. Another problem with a 'single log' algorithm is that the tail of the log is a 'hot spot' because of severe contention for it. It is shown that both these problems are solved by extending the write-ahead logging method into a multiple log algorithm which allows transactions to write to one of several logs, and also permits each log to perform checkpoints and I/O operations in parallel. A further advantage of multiple logs is that parallelism can be exploited at recovery time. An algorithm is outlined that speeds up recovery by scanning the multiple logs in parallel.
UR - http://www.scopus.com/inward/record.url?scp=85067946715&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067946715&partnerID=8YFLogxK
U2 - 10.1109/SPDP.1990.143525
DO - 10.1109/SPDP.1990.143525
M3 - Conference contribution
AN - SCOPUS:85067946715
T3 - Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing 1990, SPDP 1990
SP - 156
EP - 159
BT - Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing 1990, SPDP 1990
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP 1990
Y2 - 9 December 1990 through 13 December 1990
ER -