Home > Conference materials > Papers > Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Weakly Connected Topologies
Original title:
Dependency of the Convergence Rate Mean Extent of Variation on the Repetitions Number in Weakly Connected Topologies
Authors:
Kenyeres, Martin ; Novotný, Bohumil Document type: Papers
Language:
eng Publisher:
Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií Abstract:
This paper deals with the stochastic distributed algorithm – the push-sum protocol. We examine the effect of experiments repetitions on the mean of the convergence rates quantities. The main goal of the executed experiments is to show how many repetitions of the push-sum protocol are necessary to achieve a statistically credible representative of the obtained set of data. Within this paper, we have focused on weakly connected structures.
Keywords:
Distributed computing; The convergence rate mean extent of variation; The push-sum protocol Host item entry: Proceedings of the 22nd Conference STUDENT EEICT 2016, ISBN 978-80-214-5350-0
Institution: Brno University of Technology
(web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library. Original record: http://hdl.handle.net/11012/83996