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 .