|
|
(One intermediate revision by one other user not shown) |
Line 1: |
Line 1: |
| {{Unreferenced|date=December 2009}}
| | Hello, my name is Andrew and my spouse doesn't like it at all. Since he was 18 he's been operating as an information officer but he ideas on altering it. For a while I've been in Alaska but I will have to move in a year or two. To perform lacross is one of the issues she loves most.<br><br>Feel free to surf to my web site [http://www.khuplaza.com/dent/14869889 real psychics] |
| '''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 ''[[Journal of Computers]]''. | |
| | |
| ==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.
| |
| | |
| ==Algorithm==
| |
| Huang's algorithm can be described by the following:
| |
| * Initially all processes are idle.
| |
| * A distributed task is started by a process sending a computational message to another process. This initial process to send the message is the "controlling agent".
| |
| ** The initial weight of the controlling agent is <math>w</math> (usually 1).
| |
| * The following rules are applied throughout the computation:
| |
| ** 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.
| |
| | |
| Some weaknesses to Huang's algorithm are that it is unable to detect termination if a message is lost in transit or if a process fails while in an active state.
| |
| | |
| ==See also==
| |
| * [[Dijkstra-Scholten algorithm]]
| |
| | |
| {{DEFAULTSORT:Huang's Algorithm}}
| |
| [[Category:Termination algorithms]]
| |
Hello, my name is Andrew and my spouse doesn't like it at all. Since he was 18 he's been operating as an information officer but he ideas on altering it. For a while I've been in Alaska but I will have to move in a year or two. To perform lacross is one of the issues she loves most.
Feel free to surf to my web site real psychics