Dijkstra–Scholten algorithm
id:
dijkstra-scholten-algorithm-233-5580206
title:
Dijkstra–Scholten algorithm
text:
The Dijkstra–Scholten algorithm 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 roughly equal parts and distribute those parts to ot
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dijkstra%E2%80%93Scholten_algorithm
date created:
date modified:
2019-05-06T21:40:10Z
main entity:
{"identifier":"Q5276493","url":"https://www.wikidata.org/entity/Q5276493"}
image:
fields total:
13
integrity:
13