A fast parallel re-computation with redundancy mechanism for parallel digital terrain analysis

Dou, Wanfeng; Miao, Shoushuai

doi:10.1007/s10586-016-0644-z

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to data repartition, the partitioned sub-blocks will form into a tree structure. 12 Figure 2 shows a quad-tree of the partitioned data blocks. Each layer has 4 k data blocks, where k is the kth layer in the quad-tree.…”

Section: Framework Of Parallel Re-computingmentioning

confidence: 99%

“…11 This re-computing method adopting redundancy mechanism is deeply discussed in theory. 12 An initial performance analysis for parallel re-computation method is discussed in literature. 13 This paper extends further the analysis of system performance in different redundancy strategies and designs and implements a parallel computing system in master/slave mode by adopting a multi-thread mechanism to detect the errors and start the re-computation while an error appears.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance evaluation of parallel re-computing algorithm in different data distribution modes

Dou

Miao

2017

Journal of Algorithms & Computational Technology

Self Cite

View full text Add to dashboard Cite

With the rapid increase of spatial data resolution, the huge volume of datasets makes geo-computation more timeconsuming especially when operating some complex algorithms, i.e. viewshed analysis and drainage network extraction in digital terrain analysis. Parallel computing is regarded as an efficient solution by utilizing more computing resources. Among them, the stable and credible services play an irreplaceable role in parallel computing, especially when an error occurs in the large-scale scientific computing. In this paper, a master/slave approach to implement the parallel re-computing is proposed based on redundancy mechanism. Once some errors in application layer are detected, the original data block with computation errors is further partitioned into several sub-blocks which are re-computed by the surviving processes concurrently to improve the efficiency of failure recovery. The multi-thread strategy in the main process is responsible for the distribution of data blocks, detecting errors and starting re-computing procedure concurrently. Performance evaluation is conducted in different data distributed modes by theory analysis. The experimental results show that the performance of fault-tolerant parallel computing is different by way of adopting different data distribution modes.

show abstract

Section: Framework Of Parallel Re-computingmentioning

confidence: 99%