Data networks
Some aspects of the parallel and distributed iterative algorithms—a survey
Automatica (Journal of IFAC)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Development of a Class of Distributed Termination Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
A Class of Termination Detection Algorithms For Distributed Computation
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Achieving Distributed Termination without Freezing
IEEE Transactions on Software Engineering
A Decentralized Convergence Detection Algorithm for Asynchronous Parallel Iterative Algorithms
IEEE Transactions on Parallel and Distributed Systems
A new stopping criterion for linear perturbed asynchronous iterations
Journal of Computational and Applied Mathematics
High Performance Computing for Computational Science - VECPAR 2008
| Hi-index | 0.00 |
We consider n-processor distributed systems where the ith processor executes asynchronously the iteration x"i = @?"i,(x). It is natural to terminate the iteration of the ith processor when some local condition, such as x"i@?"i(x): 'small', holds. However, local termination conditions of this type may not lead to global termination because of the asynchronous character of the algorithm. In this paper, we propose several approaches to modify the original algorithm and/or supplement it with an interprocessor communication protocol so that this difficulty does not arise. Some of the resulting procedures can be recast as termination detection schemes for arbitrary finite, distributed computations.