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 Scholten in 1980.
- Comment
- enThe 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 Scholten in 1980.
- Has abstract
- enThe 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 Scholten in 1980. First, consider the case of a simple process graph which is a tree. A distributed computation which is tree-structured is not uncommon. Such a process graph may arise when the computation is strictly a divide-and-conquer type. A node starts the computation and divides the problem in two (or more, usually a multiple of 2) roughly equal parts and distribute those parts to other processors. This process continues recursively until the problems are of sufficiently small size to solve in a single processor.
- Hypernym
- Algorithm
- Is primary topic of
- Dijkstra–Scholten algorithm
- Label
- enDijkstra–Scholten algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Carel S. Scholten
- Category:Edsger W. Dijkstra
- Category:Graph algorithms
- Category:Termination algorithms
- Distributed system
- Divide and conquer algorithm
- Edsger W. Dijkstra
- Huang's algorithm
- Node (networking)
- Process graph
- Spanning tree (mathematics)
- Termination analysis
- Tree (data structure)
- SameAs
- 4iUih
- Dajkstra-Soltenov algoritam
- m.0bdjfj
- Q5276493
- Алгоритм Дейкстри – Шолтена
- الگوریتم دایکسترا – شولتن
- Subject
- Category:Edsger W. Dijkstra
- Category:Graph algorithms
- Category:Termination algorithms
- WasDerivedFrom
- Dijkstra–Scholten algorithm?oldid=895850878&ns=0
- WikiPageLength
- 5512
- Wikipage page ID
- 4032816
- Wikipage revision ID
- 895850878
- WikiPageUsesTemplate
- Template:Edsger Dijkstra
- Template:Reflist