Exploiting the locality of memory references to reduce the address bus energy
ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
Real time and dependability concepts
Distributed systems (2nd Ed.)
Self-stabilization
Stability of long-lived consensus (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Low Power Digital CMOS Design
Saving Power in the Control Path of Embedded Processors
IEEE Design & Test
Stability of Multivalued Continuous Consensus
SIAM Journal on Computing
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
OCD: obsessive consensus disorder (or repetitive consensus)
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Theoretical Computer Science
Average long-lived memoryless consensus: the three-value case
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Output stability versus time till output
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the r-th entry of x is a value, selected in a finite set of potential values, produced by the r-th sensor. The sequence of input vectors is assumed to be smooth: exactly one entry of the vector changes from one round to the next one. The system implements a fault-tolerant averaging consensus function f. This function returns, in each round, a representative output value v of the sensor readings x. Assuming there are a + 1 equal entries of the vector, f is required to return a value that appears at least a + 1 times in x. We study strategies that minimize the instability of a fault-tolerant consensus system. More precisely, we find the strategy that minimizes, in average, the frequency of output changes over a random walk sequence on input vectors (where each component of the vector corresponds to a particular sensor reading).