Proposta de Implementação de Memória Compartilhada Dinâmica Tolerante a Falhas
Resumo
Sistemas de quóruns são úteis na implementação consistente e confiável de sistemas de armazenamento de dados em presença de falhas. Estes sistemas geralmente compreendem um conjunto estático de servidores que implementam um registrador acessado através de operações de leitura e escrita. Este artigo propõe uma implementação para o FREESTORE, um conjunto de protocolos tolerantes a falhas capazes de emular um registrador em sistemas dinâmicos, onde processos podem entrar e sair, durante sua execução, através de reconfigurações. Um conjunto detalhado de experimentos avalia o desempenho dos protocolos implementados e possibilita uma maior compreensão a respeito do processo de reconfiguração de memória compartilhada.
Referências
Aguilera, M. (2004). A pleasant stroll through the land of infinitely many creatures. SIGACT News, 35(2).
Aguilera, M. K., Keidar, I., and Malkhi A. Shraer, D. (2011). Dynamic atomic storage without consensus. Journal of the ACM, 58:7:1–7:32.
Alchieri, E., Bessani, A., Greve, F., and Fraga, J. (2014). Reconfiguração modular de sistemas de quóruns. In Anais do 32o Simpósio Brasileiro de Redes de Computadores.
Attiya, H., Bar-Noy, A., and Dolev, D. (1995). Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124–142.
Castro, M. and Liskov, B. (2002). Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398–461.
Dwork, C., Lynch, N. A., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288–322.
Fischer, M. J., Lynch, N. A., and Paterson, M. S. (1985). Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382.
Gifford, D. (1979). Weighted voting for replicated data. In 7th ACM Symposium on Operating Systems Principles.
Gilbert, S., Lynch, N., and Shvartsman, A. (2010). Rambo: A robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing, 23(4).
Lamport, L. (1986). On interprocess communication (part II). Distributed Computing, 1(1):203–213.
Lamport, L. (1998). The part-time parliament. ACM Transactions Computer Systems, 16(2):133–169.
Lamport, L. (2001). Paxos Made Simple. ACM SIGACT News, 32(4):18–25.
Malkhi, D. and Reiter, M. (1998). Secure and scalable replication in Phalanx. In 17th Symposium on Reliable Distributed Systems, pages 51–60.
Martin, J.-P. and Alvisi, L. (2004). A Framework for Dynamic Byzantine Storage. In 34th International Conference on Dependable Systems and Networks.
White, B., Lepreau, J., Stoller, L., Ricci, R., Guruprasad, S., Newbold, M., Hibler, M., Barb, C., and Joglekar, A. (2002). An Integrated Experimental Environment for Distributed Systems and Networks. In Proc. of 5th Symposium on Operating Systems Design and Implementations.
Aguilera, M. K., Keidar, I., and Malkhi A. Shraer, D. (2011). Dynamic atomic storage without consensus. Journal of the ACM, 58:7:1–7:32.
Alchieri, E., Bessani, A., Greve, F., and Fraga, J. (2014). Reconfiguração modular de sistemas de quóruns. In Anais do 32o Simpósio Brasileiro de Redes de Computadores.
Attiya, H., Bar-Noy, A., and Dolev, D. (1995). Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124–142.
Castro, M. and Liskov, B. (2002). Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398–461.
Dwork, C., Lynch, N. A., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288–322.
Fischer, M. J., Lynch, N. A., and Paterson, M. S. (1985). Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382.
Gifford, D. (1979). Weighted voting for replicated data. In 7th ACM Symposium on Operating Systems Principles.
Gilbert, S., Lynch, N., and Shvartsman, A. (2010). Rambo: A robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing, 23(4).
Lamport, L. (1986). On interprocess communication (part II). Distributed Computing, 1(1):203–213.
Lamport, L. (1998). The part-time parliament. ACM Transactions Computer Systems, 16(2):133–169.
Lamport, L. (2001). Paxos Made Simple. ACM SIGACT News, 32(4):18–25.
Malkhi, D. and Reiter, M. (1998). Secure and scalable replication in Phalanx. In 17th Symposium on Reliable Distributed Systems, pages 51–60.
Martin, J.-P. and Alvisi, L. (2004). A Framework for Dynamic Byzantine Storage. In 34th International Conference on Dependable Systems and Networks.
White, B., Lepreau, J., Stoller, L., Ricci, R., Guruprasad, S., Newbold, M., Hibler, M., Barb, C., and Joglekar, A. (2002). An Integrated Experimental Environment for Distributed Systems and Networks. In Proc. of 5th Symposium on Operating Systems Design and Implementations.
Publicado
05/05/2014
Como Citar
BRAGA, Mateus; ALCHIERI, Eduardo.
Proposta de Implementação de Memória Compartilhada Dinâmica Tolerante a Falhas. In: WORKSHOP DE TESTES E TOLERÂNCIA A FALHAS (WTF), 15. , 2014, Florianópolis/SC.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2014
.
p. 102-115.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2014.22950.
