scholarly journals M-Functions and Parallel Asynchronous Algorithms

1990 ◽  
Vol 27 (1) ◽  
pp. 136-140 ◽  
Author(s):  
Didier El Baz
Keyword(s):  
Asynchronous Algorithms ◽  
Parallel Asynchronous Algorithms

The run-time efficiency of parallel asynchronous algorithms

1991 ◽  
Vol 40 (11) ◽  
pp. 1260-1266 ◽  
Author(s):  
M. Dubois ◽  
F.A. Briggs
Keyword(s):  
Time Efficiency ◽  
Asynchronous Algorithms ◽  
Run Time ◽  
Parallel Asynchronous Algorithms

Parallel asynchronous algorithms for discrete data

1990 ◽  
Vol 37 (3) ◽  
pp. 588-606 ◽  
Author(s):  
Aydin Üresin ◽  
Michel Dubois
Keyword(s):  
Discrete Data ◽  
Asynchronous Algorithms ◽  
Parallel Asynchronous Algorithms

scholarly journals A Relaxation of Üresin and Dubois’ Asynchronous Fixed-Point Theory in Agda

2019 ◽  
Vol 64 (5) ◽  
pp. 857-877
Author(s):  
Matthew L. Daggitt ◽  
Ran Zmigrod ◽  
Timothy G. Griffin
Keyword(s):  
Fixed Point ◽  
Numerical Analysis ◽  
Fixed Point Theory ◽  
Iterative Algorithms ◽  
Point Theory ◽  
Proof Assistant ◽  
Convergence Conditions ◽  
Counter Example ◽  
Asynchronous Algorithms ◽  
Parallel Asynchronous Algorithms

AbstractÜresin and Dubois’ paper “Parallel Asynchronous Algorithms for Discrete Data” shows how a class of synchronous iterative algorithms may be transformed into asynchronous iterative algorithms. They then prove that the correctness of the resulting asynchronous algorithm can be guaranteed by reasoning about the synchronous algorithm alone. These results have been used to prove the correctness of various distributed algorithms, including in the fields of routing, numerical analysis and peer-to-peer protocols. In this paper we demonstrate several ways in which the assumptions that underlie this theory may be relaxed. Amongst others, we (i) expand the set of schedules for which the asynchronous iterative algorithm is known to converge and (ii) weaken the conditions that users must prove to hold to guarantee convergence. Furthermore, we demonstrate that two of the auxiliary results in the original paper are incorrect, and explicitly construct a counter-example. Finally, we also relax the alternative convergence conditions proposed by Gurney based on ultrametrics. Many of these relaxations and errors were uncovered after formalising the work in the proof assistant Agda. This paper describes the Agda code and the library that has resulted from this work. It is hoped that the library will be of use to others wishing to formally verify the correctness of asynchronous iterative algorithms.

scholarly journals Parallel asynchronous algorithms: A survey

2020 ◽  
Vol 149 ◽  
pp. 102896 ◽  
Author(s):  
Pierre Spiteri
Keyword(s):  
Asynchronous Algorithms ◽  
Parallel Asynchronous Algorithms

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

2000 ◽  
Vol 104 (1) ◽  
pp. 91-108 ◽  
Author(s):  
F. Guerriero ◽  
R. Musmanno
Keyword(s):  
Shortest Paths ◽  
Asynchronous Algorithms ◽  
Parallel Asynchronous Algorithms

Some convergence results for asynchronous algorithms

1982 ◽  
Vol 39 (3) ◽  
pp. 325-340 ◽  
Author(s):  
Mouhamed Nabih El Tarazi
Keyword(s):  
Asynchronous Algorithms ◽  
Convergence Results

Component Based Framework for Designing and Validating Asynchronous Algorithms for Electrical Measurement and Protection

2021 ◽  
Author(s):  
Louis Bonicel ◽  
Roland Bohrer ◽  
Benoit Leprettre ◽  
Frederic Petrot ◽  
Frederic Rousseau
Keyword(s):  
Electrical Measurement ◽  
Asynchronous Algorithms
Sign in / Sign up

Export Citation Format

Share Document