Journal of the ACM (JACM) - The MIT Press scientific computation series
Generalized asynchronous iterations
Proc. of the conference on algorithms and hardware for parallel processing on CONPAR 86
Parallel asynchronous algorithms for solving boundary value problems
Proceedings of the international workshop on Parallel algorithms & architectures
Asynchronous iterations and order intervals
Proceedings of the international workshop on Parallel algorithms & architectures
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Vectorization and parallelization of irregular problems via graph coloring
ICS '91 Proceedings of the 5th international conference on Supercomputing
Specification, implementation and application of randomized regular registers (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Self-stabilization with path algebra
Theoretical Computer Science
The semantics and execution of a synchronous block-diagram language
Science of Computer Programming
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Randomized registers and iterative algorithms
Distributed Computing
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.01 |
Many problems in the area of symbolic computing can be solved by iterative algorithms. Implementations of these algorithms on multiprocessors can be synchronous or asynchronous. Asynchronous implementations are potentially more efficient because synchronization is a major source of performance degradation in most multiprocessor systems.In this paper, sufficient conditions for the convergence of asynchronous iterations to desired solutions are given. The main sufficient condition is shown to be also necessary for the case of finite data domains. The results are applied to prove the convergence of three asynchronous algorithms for the all-pairs shortest path problem, the consistent labeling problem, and a neural net model.