Dijkstra–Scholten algorithm: Difference between revisions

Revision as of 00:34, 5 July 2013

Revision as of 13:29, 8 November 2013

Line 9:

* The initiator of a computation is the root of the tree.

* Upon receiving a computational message:

** If the receiving process is currently not in the computation: the process joins the tree by becoming a child of the sender of the message. (No acknowledgementacknowledgment message is sent at this point.)

** If the receiving process is already in the computation: the process immediately sends an acknowledgementacknowledgment message to the sender of the message.

* When a process has no more children and has become idle, the process detaches itself from the tree by sending an acknowledgementacknowledgment message to its tree parent.

* Termination occurs when the initiator has no children and has become idle.