Efficient incremental algorithm for identifying consistent checkpoints

Loon Been Chen; I-Chen Wu

doi:10.1109/ICPADS.1998.741028

Efficient incremental algorithm for identifying consistent checkpoints

Loon Been Chen^*, I-Chen Wu

^*此作品的通信作者

資訊工程學系

研究成果 › 同行評審

摘要

In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. In this paper, we design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p²M) time in total, where p is the number of processes and M is the number of checkpoints.

原文	English
頁面	122-129
頁數	8
DOIs	https://doi.org/10.1109/ICPADS.1998.741028
出版狀態	Published - 1998
事件	Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China 持續時間: 14 12月 1998 → 16 12月 1998

Conference

Conference	Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS
城市	Tainan, China
期間	14/12/98 → 16/12/98

存取文件

10.1109/ICPADS.1998.741028

其它文件與鏈接

Link to publication in Scopus

引用此

@conference{5049d906dfd3443183e175861c4857a9,

title = "Efficient incremental algorithm for identifying consistent checkpoints",

abstract = "In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. In this paper, we design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p2M) time in total, where p is the number of processes and M is the number of checkpoints.",

author = "Chen, {Loon Been} and I-Chen Wu",

year = "1998",

doi = "10.1109/ICPADS.1998.741028",

language = "English",

pages = "122--129",

note = "Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS ; Conference date: 14-12-1998 Through 16-12-1998",

}

TY - CONF

T1 - Efficient incremental algorithm for identifying consistent checkpoints

AU - Chen, Loon Been

AU - Wu, I-Chen

PY - 1998

Y1 - 1998

N2 - In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. In this paper, we design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p2M) time in total, where p is the number of processes and M is the number of checkpoints.

AB - In a distributed system, identifying consistent checkpoints is essential for error recovery and debugging. In this paper, we design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p2M) time in total, where p is the number of processes and M is the number of checkpoints.

UR - http://www.scopus.com/inward/record.url?scp=0032297736&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.1998.741028

DO - 10.1109/ICPADS.1998.741028

M3 - Paper

AN - SCOPUS:0032297736

SP - 122

EP - 129

T2 - Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS

Y2 - 14 December 1998 through 16 December 1998

ER -

Efficient incremental algorithm for identifying consistent checkpoints

摘要

Conference

存取文件

其它文件與鏈接

指紋

引用此