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
Low Power Digital CMOS Design
Saving Power in the Control Path of Embedded Processors
IEEE Design & Test
Stability of long-lived consensus
Journal of Computer and System Sciences
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
Output stability versus time till output
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The optimal strategy for the average long-lived consensus
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 5.23 |
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 i-th entry of x is a binary value produced by the i-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 functionf. This function returns, in each round, a representative output valuev of the sensor readings x. Assuming that at most t entries of the vector can be erroneous, f is required to return a value that appears at least t+1 times in x. We introduce the definition of instability of the system, which consists in the number of output changes over a random sequence of input vectors. We first design optimal (with respect to the instability measure) consensus systems: D"0 without memory, and D"1 with memory. Then we quantify the gain factor due to memory by computing c"n(t), the number of decision changes performed by D"0 per decision change performed by D"1.