Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dijkstra–Scholten_algorithm> ?p ?o }
Showing triples 1 to 11 of
11
with 100 triples per page.
- Dijkstra–Scholten_algorithm abstract "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.First, let us 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 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.".
- Dijkstra–Scholten_algorithm wikiPageID "4032816".
- Dijkstra–Scholten_algorithm wikiPageRevisionID "580753659".
- Dijkstra–Scholten_algorithm subject Category:Graph_algorithms.
- Dijkstra–Scholten_algorithm subject Category:Termination_algorithms.
- Dijkstra–Scholten_algorithm comment "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.First, let us 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 divide-and-conquer type.".
- Dijkstra–Scholten_algorithm label "Dijkstra–Scholten algorithm".
- Dijkstra–Scholten_algorithm sameAs Dijkstra%E2%80%93Scholten_algorithm.
- Dijkstra–Scholten_algorithm sameAs Q5276493.
- Dijkstra–Scholten_algorithm sameAs Q5276493.
- Dijkstra–Scholten_algorithm wasDerivedFrom Dijkstra–Scholten_algorithm?oldid=580753659.