A new look at egocentric algorithms

Author

Azadmanesh, Azad H. ; Sharif, Hamid

Author_Institution

Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA

fYear

2004

fDate

7-9 July 2004

Firstpage

333

Lastpage

340

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.

Keywords

distributed algorithms; fault tolerant computing; approximate agreement; distributed agreements; egocentric algorithms; mean-subsequence-egocentric voting; synchronous communication system; voting algorithms; Algorithm design and analysis; Clocks; Computer science; Convergence; Delay; Electronic voting; Performance analysis; Sampling methods; Sensor systems and applications; Synchronization;

fLanguage

English

Publisher

ieee

Conference_Titel

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

ISSN

1521-9097

Print_ISBN

0-7695-2152-5

Type

conf

DOI

10.1109/ICPADS.2004.1316112

Filename

1316112

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3215684