Algoritmos para eleição de lider em sistemas distribuidos

AUTOR(ES)
DATA DE PUBLICAÇÃO

1998

RESUMO

The main feature of a distributed system is to allow many computers, at different locations, to work together performing a common task, making the sharing of resources and the distribution of services possible. However, due to the difficulty of acquiring a global view of the system, the development of distributed algorithms is very complex. Several distributed applications make use of a distinguished processor to execute some special task. This processor generally is called coordinator or leader; the leader election problem consists of finding a distributed algorithm for a given network such that, at the end of the execution, only one processor has been declared leader. This dissertation presents, a survey of the main algorithms for the leader election problem, analyzing their message and time complexities and attempting to classify the algorithms according to the system model and the basic principle used in their development

ASSUNTO(S)

sistemas operacionais distribuidos (computadores) algoritmos processamento

ACESSO AO ARTIGO

Documentos Relacionados