Dijkstra–Scholten algorithm: Difference between revisions

Content deleted Content added

Revision as of 21:40, 6 May 2019 edit BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,340 edits m →top: Replace "let us consider" statements per MOS:NOTED and consensus at Wikipedia talk:Manual of Style#"Let us consider" statements, replaced: let us consider → consider Tag: AWB ← Previous edit		Latest revision as of 02:21, 15 December 2024 edit undo Iandiver (talk \| contribs) 426 edits m Move comma in parentheses.
(2 intermediate revisions 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==