Useful Links
Study guides
Linear algebra
Calculus
Statistics
Econometrics
Algorithms
>
Concurrent algorithms
>
Distributed algorithms
>
Termination algorithms
Applied mathematics
>
Algorithms
>
Distributed algorithms
>
Termination algorithms
Mathematical logic
>
Algorithms
>
Distributed algorithms
>
Termination algorithms
Theoretical computer science
>
Algorithms
>
Distributed algorithms
>
Termination algorithms
Category: Termination algorithms
Dijkstra–Scholten algorithm
The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Sch
Huang's algorithm
Huang's algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by in 1989 in the .