A new look at egocentric algorithms

mhempel2's photo
By Michael Hempel Tue, 01/30/2018 - 11:00

Publication Type:

Conference Paper

Authors:

Azadmanesh, A.H.; Sharif, Hamid

Source:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on (2004)

Keywords:

approximate agreement, distributed agreements, distributed algorithms, egocentric algorithms, fault tolerant computing, mean-subsequence-egocentric voting, synchronous communication system, voting algorithms

Abstract:

With respect to approximate agreement, some categories of voting algorithms have been developed. This research presents an approach to one family of algorithms called egocentric algorithms, and analyzes the conditions under which the approach performs better than the existing egocentric voting algorithms. In addition, the approach provides some insight into the voting process of such algorithms.