Total Algorithm
From CasGroup
| Line 1: | Line 1: | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
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. | ||
