Total Algorithm - Revision history

Admin: Reverted edits by Eboxytezi (Talk) to last version by Jfromm

2011-02-11T21:45:41Z

Reverted edits by Eboxytezi (Talk) to last version by Jfromm

← Older revision		Revision as of 16:45, 11 February 2011
Line 1:		Line 1:
	~~----~~
	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
	~~----~~
	~~=[http://enececufo.co.cc This Page Is Currently Under Construction And Will Be Available Shortly, Please Visit Reserve Copy Page]=~~
	~~----~~
	~~=[http://enececufo.co.cc CLICK HERE]=~~
	~~----~~
	~~</div>~~
	A '''total algorithm''' is a [[Distributed_Algorithm\|distributed algorithm]] where the participation of all nodes or processes in the network is required before a decision can be taken. It is sometimes also named '''wave algorithm'''. A special form of total algorithm is a '''traversal algorithm''' where all events of a wave a strictly ordered by a causality relation and in which the last event occurs in the same process as the first event, namely in the initiator node.		A '''total algorithm''' is a [[Distributed_Algorithm\|distributed algorithm]] where the participation of all nodes or processes in the network is required before a decision can be taken. It is sometimes also named '''wave algorithm'''. A special form of total algorithm is a '''traversal algorithm''' where all events of a wave a strictly ordered by a causality relation and in which the last event occurs in the same process as the first event, namely in the initiator node.

Eboxytezi at 02:46, 24 November 2010

2010-11-24T02:46:00Z

← Older revision		Revision as of 21:46, 23 November 2010
Line 1:		Line 1:
			----
			<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
			----
			=[http://enececufo.co.cc This Page Is Currently Under Construction And Will Be Available Shortly, Please Visit Reserve Copy Page]=
			----
			=[http://enececufo.co.cc CLICK HERE]=
			----
			</div>
	A '''total algorithm''' is a [[Distributed_Algorithm\|distributed algorithm]] where the participation of all nodes or processes in the network is required before a decision can be taken. It is sometimes also named '''wave algorithm'''. A special form of total algorithm is a '''traversal algorithm''' where all events of a wave a strictly ordered by a causality relation and in which the last event occurs in the same process as the first event, namely in the initiator node.		A '''total algorithm''' is a [[Distributed_Algorithm\|distributed algorithm]] where the participation of all nodes or processes in the network is required before a decision can be taken. It is sometimes also named '''wave algorithm'''. A special form of total algorithm is a '''traversal algorithm''' where all events of a wave a strictly ordered by a causality relation and in which the last event occurs in the same process as the first event, namely in the initiator node.

Jfromm: New page: A '''total algorithm''' is a distributed algorithm where the participation of all nodes or processes in the network is required before a decision can be taken. It...

2008-10-02T19:56:18Z

New page: A '''total algorithm''' is a distributed algorithm where the participation of all nodes or processes in the network is required before a decision can be taken. It...

New page

A '''total algorithm''' is a [[Distributed_Algorithm|distributed algorithm]] where the participation of all nodes or processes in the network is required before a decision can be taken. It is sometimes also named '''wave algorithm'''. A special form of total algorithm is a '''traversal algorithm''' where all events of a wave a strictly ordered by a causality relation and in which the last event occurs in the same process as the first event, namely in the initiator node.

Total algorithms and wave algorithms can be considered as [[Distributed_Algorithm|distributed algorithms]] initiated by a single event where the participation of all processes in the network is required before a particular final event, often a decision, takes place. In wave algorithms and related flooding techniques a node sends new information to all of its neighbors. The activity spreads like a wave or a controlled chain-reaction through the network, and all nodes are visited until the decision can take place and the algorithm is finally terminated. They can be used to spread and disseminate information in a [[Distributed System|distributed system]], to calculate the topology of a network, or to collect and gather information in a distributed system.

Examples for a total algorithm are the

* [[Echo Algorithm]]
* [[Heart Beat Algorithm]]
* [[Phase Algorithm]]

In order to reach all nodes of a system, the algorithm has to broadcast the corresponding
information through the whole system. Often this is done in a first phase.
There are two possibilities to

* '''Flooding''': a node receiving data sends it immediately to all its neighbors by broadcasting
* '''Gossiping''': a node selects from time to time randomly one of its neighbors to send the data

Both result in an epidemic spread of information.
Gossiping is of course much slower than flooding.
Flooding leads to an ordered wave, whereas gossiping leads
to disordered epidemic spread of information.

[[Category:Distributed Algorithms]]