[Back]

O. Sluciak, T. Hilaire, M. Rupp:
"A General Formalism For The Analysis Of Distributed Algorithms";
Poster: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2010), Dallas (TX), USA; 03-14-2010 - 03-19-2010; in: "Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2010)", IEEE, (2010), ISBN: 978-1-4244-4296-6; 2890 - 2893.

The major contribution of this paper is the presentation of a general
unifying description of distributed algorithms allowing to map local,
node-based algorithms onto a single global, network-based form. As a first consequence the new description offers to analyze their learning
and steady-state behavior by classical methods. A further consequence
is the analysis of implementation issues as they appear due to quantization in computing and communication links. Exemplarily, we apply the new method on several different averaging algorithms: the Push-Sum protocol, average consensus as well as its quantized form and furthermore examine the effects of quantization noise which is introduced by the bandwidth limited communication links and finite precision computation ability of every node. Statistical properties of these quantization noises are provided and verified by simulations.

distributed algorithms, unified description, implementation, quantization, distributed averaging problem

http://publik.tuwien.ac.at/files/PubDat_180348.pdf

Project Head Markus Rupp:
Signal and Information Processing in Science and Engineering - Entwicklungsmethodik