Mutual-Aid: Diskless Checkpointing Scheme for Tolerating Double Faults

Chiu, Jane-Ferng; Hao, Wei-Hua

doi:10.1109/hpcc.2008.123

Cited by 5 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To compare with other diskless checkpointing schemes for Tolerating Double Faults [20], our method stores all the executed states and data directories of each thread based on diskless checkpointing. Furthermore, the recovery time of I/O operation could be decreased because all the fault tasks were decomposed and distributed to usable processors.…”

Section: Discussionmentioning

confidence: 99%

A Diskless Checkpointing Algorithm for Cluster Architectures Applied to Geospatial Raster Data Processing

Song

Dou

Tang

et al. 2014

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

In recent years, due to the increasing calculation demands for the massive spatial data analysis, the parallel computing based on high-performance computers has become an inevitable trend of geospatial raster data processing, such as digital terrain analysis (DTA for short), remote sensing interpretation and digital soil mapping. A key problem is how to design a fault-tolerant software to enhance the stability and robustness of scientific application. This paper presents an approach of failure recovery for distributed memory parallel computing. Furthermore, we adopt the master/slave programming model and present a framework of redundant master mode, which the failure occurring on the master node could not lead to a breakdown of the whole system. This approach schedules the failing task by dividing all the failing data into several partitions according to the calculating scale of failure. By means of the Fault-Tolerant Granularity Model, the scheduling algorithm can assign the failing task dynamically. Finally, taking example of digital terrain analysis, two experiments are discussed that based on the data size and the number of failures. Simulation results indicate that the proposed scheduling algorithm based on Fault-Tolerant Granularity Model achieves lower fault tolerance overhead than the rollback recovery scheme when several processors fail simultaneously.

show abstract

Section: Discussionmentioning

confidence: 99%