Eleição de líder com qualidade de serviço para o modelo falha-e-recuperação

• Ano de defesa: 2017
• Autor(a) principal: Reis, Vinícius Angiolucci
• Orientador(a): Vieira, Gustavo Maciel Dias
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de São Carlos; Câmpus Sorocaba
• Programa de Pós-Graduação: Programa de Pós-Graduação em Ciência da Computação - PPGCC-So
• Palavras-chave em Português: Algorítmos computacionais; Tolerância a falha (Computadores); Qualidade de serviço; Algoritmos distribuídos
• Palavras-chave em Inglês: Computer algorithms; Fault-tolerant computing; Quality of service; Distributed algorithms
• Área do conhecimento CNPq: CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://repositorio.ufscar.br/handle/ufscar/9136

A distributed system is a set of processes and links that is desgined to provide computing power and data persistency, even on the presence of failures. To encapsulate the abstraction of time and to determine which processes have currently failed, these distributed systems are based on unreliable failure detectors, which in its turn are used as a leader election service. Many works are dedicated to analyze the quality of service (QoS) of failure detectors, but a few of them has analyzed the QoS of a leader election algorithm. In this work, we present the NFD-L leader election algorithm, designed to work on crash-recovery distributed systems and to follow the QoS specification defined by Chen, Toueg e Aguilera (2002). We used NFD-L to elect Paxos coordinators for a replication framework and compared the observed QoS for NFD-L with the behavior of the framework native leader election algorithm that is not designed to explicitly meet any QoS requirement.