Dijkstra–Scholten algorithm: Difference between revisions

Content deleted Content added

Revision as of 02:22, 12 October 2024 edit JJMC89 bot III (talk \| contribs) Bots, Administrators 4,308,426 edits m Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms Tag: Reverted ← Previous edit		Latest revision as of 02:21, 15 December 2024 edit undo Iandiver (talk \| contribs) 426 edits m Move comma in parentheses.
(One intermediate revision by one other user not shown)
Line 12: \| year = 1980}}.</ref> First, consider the case of a simple [[process graph]] which is a [[tree (data structure)\|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 algorithm\|divide-and-conquer]] type. A [[node (networking)\|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. ==Algorithm== Line 55: {{Edsger Dijkstra}} {{DEFAULTSORT:Dijkstra-Scholten Algorithm}} [[Category:~~Algorithms~~Graph ~~in graph theory~~algorithms]] [[Category:Termination algorithms]] [[Category:Edsger W. Dijkstra]]