Termination Detection: Difference between revisions
From CasGroup
Jump to navigationJump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
[[Distributed Algorithm|Distributed algorithms]] for '''termination detection''' are unique for [[Distributed System|distributed systems]] because the problem of termination detection does not exist in non-distributed systems. A large variety of algorithms exist, for instance the ones proposed by | |||
* Mattern (e.g. | * Mattern (e.g. "Vectoralgorithm" or "Credit-Recovery") | ||
* Dijkstra-Feijen-Van Gasteren (1983) | * Dijkstra-Feijen-Van Gasteren (1983) | ||
* Dijkstra-Scholten (1980) | * Dijkstra-Scholten (1980) | ||
[[Category:Distributed Algorithms]] | [[Category:Distributed Algorithms]] | ||
Latest revision as of 16:45, 11 February 2011
Distributed algorithms for termination detection are unique for distributed systems because the problem of termination detection does not exist in non-distributed systems. A large variety of algorithms exist, for instance the ones proposed by
- Mattern (e.g. "Vectoralgorithm" or "Credit-Recovery")
- Dijkstra-Feijen-Van Gasteren (1983)
- Dijkstra-Scholten (1980)
