Huang's algorithm: Difference between revisions

Revision as of 10:39, 2 February 2011

Latest revision as of 21:23, 23 May 2025

(16 intermediate revisions by 14 users not shown)

Line 1:

{{UnreferencedMore citations needed|date=DecemberFebruary 20092022}}

'''Huang's algorithm''' is an [[algorithm]] for detecting [[Termination analysis|termination]] in a [[distributed system]]. The algorithm was proposed by [[Shing-Tsaan Huang]] in 1989 in the ''[[JournalInformation ofProcessing ComputersLetters]]''.<ref>{{cite journal |last1=Huang |first1=Shing-Tsaan |author1-link=Shing-Tsaan Huang |title=Termination detection by using distributed snapshots |journal=Information Processing Letters |volume=32 |issue=3 |pages=113–119 |year=1989 |url=https://www.sciencedirect.com/science/article/abs/pii/0020019089900100 |doi=10.1016/0020-0190(89)90010-0 |url-access=subscription }}</ref>

==Termination detection==

The basis of termination detection is in the concept of a distributed system process' state. At any time, a process in a distributed system is either in an active state or in an idle state. An active process may become idle at any time but an idle process may only become active again upon receiving a computational message.

Termination occurs when all processes in the distributed system become idle and there are no computational messages in transit.

Line 15:

** A process sending a message splits its current weight between itself and the message.

** A process receiving a message adds the weight of the message to itself.

** Upon becoming idle, a process sends a message containing its entire weight back to the controlling agent and it goes idle.

** Termination occurs when the controlling agent has a weight of <math>w</math> and is in the idle state.

Line 21:

==See also==

* [[Dijkstra-ScholtenDijkstra–Scholten algorithm]]

==Notes==

{{reflist}}

{{DEFAULTSORT:Huang's Algorithm}}