Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Install
Faster access than browser!
 

Dijkstra–Scholten algorithm

Index 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. [1]

11 relations: Algorithm, Carel S. Scholten, Distributed computing, Divide and conquer algorithm, Edsger W. Dijkstra, Huang's algorithm, Node (networking), Process graph, Spanning tree, Termination analysis, Tree (data structure).

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Dijkstra–Scholten algorithm and Algorithm · See more »

Carel S. Scholten

Carel S. Scholten (Amsterdam, 1925 – 2009) was a physicist and a pioneer of computing.

New!!: Dijkstra–Scholten algorithm and Carel S. Scholten · See more »

Distributed computing

Distributed computing is a field of computer science that studies distributed systems.

New!!: Dijkstra–Scholten algorithm and Distributed computing · See more »

Divide and conquer algorithm

In computer science, divide and conquer is an algorithm design paradigm based on multi-branched recursion.

New!!: Dijkstra–Scholten algorithm and Divide and conquer algorithm · See more »

Edsger W. Dijkstra

Edsger Wybe Dijkstra (11 May 1930 – 6 August 2002) was a Dutch systems scientist, programmer, software engineer, science essayist, and early pioneer in computing science.

New!!: Dijkstra–Scholten algorithm and Edsger W. Dijkstra · See more »

Huang's algorithm

Huang's algorithm is an algorithm for detecting termination in a distributed system.

New!!: Dijkstra–Scholten algorithm and Huang's algorithm · See more »

Node (networking)

In telecommunications networks, a node (Latin nodus, ‘knot’) is either a redistribution point or a communication endpoint.

New!!: Dijkstra–Scholten algorithm and Node (networking) · See more »

Process graph

In graph theory a process-graph or P-graph is a directed bipartite graph used in workflow modeling.

New!!: Dijkstra–Scholten algorithm and Process graph · See more »

Spanning tree

In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G, with minimum possible number of edges.

New!!: Dijkstra–Scholten algorithm and Spanning tree · See more »

Termination analysis

In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate.

New!!: Dijkstra–Scholten algorithm and Termination analysis · See more »

Tree (data structure)

In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

New!!: Dijkstra–Scholten algorithm and Tree (data structure) · See more »

Redirects here:

Dijkstra-Scholten Algorithm, Dijkstra-Scholten algorithm.

References

[1] https://en.wikipedia.org/wiki/Dijkstra–Scholten_algorithm

OutgoingIncoming
Hey! We are on Facebook now! »