Distributed asynchronous convergence detection without detection protocol
Abstract
In this paper, we address the problem of detecting the moment when an ongoing asynchronous parallel iterative process can be terminated to provide a sufficiently precise solution to a fixed-point problem being solved. Formulating the detection problem as a global solution identification problem, we analyze the snapshot-based approach, which is the only one that allows for exact global residual error computation. From a recently developed approximate snapshot protocol providing a reliable global residual error, we experimentally investigate here, as well, the reliability of a global residual error computed without any prior particular detection mechanism. Results on a single-site supercomputer successfully show that such high-performance computing platforms possibly provide computational environments stable enough to allow for simply resorting to non-blocking reduction operations for computing reliable global residual errors, which provides noticeable time saving, at both implementation and execution levels.
Cite
@article{arxiv.2206.15418,
title = {Distributed asynchronous convergence detection without detection protocol},
author = {Guillaume Gbikpi-Benissan and Frederic Magoules},
journal= {arXiv preprint arXiv:2206.15418},
year = {2022}
}