RIST: Um Middleware para Replicação e Interoperabilidade de Sistemas Transacionais
Resumo
Neste trabalho apresentamos o middleware RIST, uma solução para replicação de bases de dados transacionais, que além de encapsular os requisitos necessários para a interoperabilidade em ambientes heterogêneos é tolerante a faltas Bizantinas e totalmente distribuído. O RIST omite toda a complexidade do cliente, de forma que é apresentada ao mesmo uma única base de dados consistente. Além disso, a aplicação cliente não necessita de modificações, já que o RIST segue as especificações do JDBC e pode operar sobre sistemas de gerência de base de dados off-the-shelf proprietários e/ou de código aberto.
Referências
Bernstein, P. A., Hadzilacos, V., and Goodman, N. (1987). Concurrency Control and Recovery in Database Systems. Addison-Wesley.
Birman, K. and van Renesse, R. (2005). Reliable Distributed Systems: Technologies, Web Services, and Applications. Springer.
Budhiraja, N., Marzullo, K., Schneider, F. B., and Toueg, S. (1993). The primary-backup approach. Distributed systems (2nd Ed.), pages 199–216.
Cecchet, E., Julie, M., and Zwaenepoel, W. (2004). C-JDBC: Flexible Database Clustering Middleware. In USENIX Annual Technical Conference.
Défago, X., Schiper, A., and Urbán, P. (2004). Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys, 36(4):372–421.
Dwork, C., Lynch, N. A., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288–322.
Fisher, M., Ellis, J., and Bruce, J. (2003). JDBCTMAPI Tutorial and Reference, Third Edition. Addison Wesley, 3 edition.
Garcia, R., Rodrigues, R., and Preguiça, N. (2011). Efficient middleware for byzantine fault-tolerant database replication. In Proceedings of the 6th European conference on Computer Systems - EuroSys’11. ACM.
Gray, J., Helland, P., O’Neil, P., and Shasha, D. (1996). The dangers of replication and a solution. In SIGMOD ’96: Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pages 173–182, New York, NY, USA. ACM.
Jain, R. K. (1991). The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. John Wiley & Sons.
Kung, H. T. and Robinson, J. T. (1981). On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6:213–226.
Lamport, L., Shostak, R., and Pease, M. (1982). The Byzantine generals problem. ACM Transactions on Programing Languages and Systems, 4(3):382–401.
Lampson, B. W. (2006). Lazy and speculative execution in computer systems. In Shvartsman, A. A., editor, OPODIS’06: Proceedings of the 10th International Conference on Principles of Distributed Systems, volume 4305 of LNCS, pages 1–2. Springer-Verlag.
Lung, L. C. (2009). Tolerância a intrusões em sistemas de computação distribuída. In II Seminário sobre Grandes Desafios da Computação no Brasil, pages 13–16.
Martin, J.-P. and Alvisi, L. (2005). Fast Byzantine consensus. In Proceedings of the Dependable Systems and Networks DSN 2005, pages 402–411.
Pedone, F., Guerraoui, R., and Schiper, A. (2003). The database state machine approach. Distributed and Parallel Databases, 14(1):71–98.
Pedone, F., Schiper, N., and Armendáriz-Iñigo, J. (2011). Byzantine fault-tolerant deferred update replication. In Proceedings of the 5th Latin-American Symposium on Dependable Computing LADC’11. SBC.
Schiper, A. and Raynal, M. (1996). From group communication to transactions in distributed systems. Communications of the ACM, 39:84–87.
Schneider, F. B. (1990). Implementing fault-tolerant service using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319.
Skeen, D. (1981). Nonblocking commit protocols. In SIGMOD ’81: Proceedings of the 1981 ACM SIGMOD international conference on Management of data, pages 133–142, New York, NY, USA. ACM.
Vandiver, B., Balakrishnan, H., Liskov, B., and Madden, S. (2007). Tolerating byzantine faults in transaction processing systems using commit barrier scheduling. In SOSP’07: Proceedings of 21st ACM Symposium on Operating Systems Principles.
Zielinski, P. (2004). Paxos at war. Technical Report UCAM-CL-TR-593, University of Cambridge Computer Laboratory, Cambridge, UK.
Birman, K. and van Renesse, R. (2005). Reliable Distributed Systems: Technologies, Web Services, and Applications. Springer.
Budhiraja, N., Marzullo, K., Schneider, F. B., and Toueg, S. (1993). The primary-backup approach. Distributed systems (2nd Ed.), pages 199–216.
Cecchet, E., Julie, M., and Zwaenepoel, W. (2004). C-JDBC: Flexible Database Clustering Middleware. In USENIX Annual Technical Conference.
Défago, X., Schiper, A., and Urbán, P. (2004). Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys, 36(4):372–421.
Dwork, C., Lynch, N. A., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288–322.
Fisher, M., Ellis, J., and Bruce, J. (2003). JDBCTMAPI Tutorial and Reference, Third Edition. Addison Wesley, 3 edition.
Garcia, R., Rodrigues, R., and Preguiça, N. (2011). Efficient middleware for byzantine fault-tolerant database replication. In Proceedings of the 6th European conference on Computer Systems - EuroSys’11. ACM.
Gray, J., Helland, P., O’Neil, P., and Shasha, D. (1996). The dangers of replication and a solution. In SIGMOD ’96: Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pages 173–182, New York, NY, USA. ACM.
Jain, R. K. (1991). The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. John Wiley & Sons.
Kung, H. T. and Robinson, J. T. (1981). On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6:213–226.
Lamport, L., Shostak, R., and Pease, M. (1982). The Byzantine generals problem. ACM Transactions on Programing Languages and Systems, 4(3):382–401.
Lampson, B. W. (2006). Lazy and speculative execution in computer systems. In Shvartsman, A. A., editor, OPODIS’06: Proceedings of the 10th International Conference on Principles of Distributed Systems, volume 4305 of LNCS, pages 1–2. Springer-Verlag.
Lung, L. C. (2009). Tolerância a intrusões em sistemas de computação distribuída. In II Seminário sobre Grandes Desafios da Computação no Brasil, pages 13–16.
Martin, J.-P. and Alvisi, L. (2005). Fast Byzantine consensus. In Proceedings of the Dependable Systems and Networks DSN 2005, pages 402–411.
Pedone, F., Guerraoui, R., and Schiper, A. (2003). The database state machine approach. Distributed and Parallel Databases, 14(1):71–98.
Pedone, F., Schiper, N., and Armendáriz-Iñigo, J. (2011). Byzantine fault-tolerant deferred update replication. In Proceedings of the 5th Latin-American Symposium on Dependable Computing LADC’11. SBC.
Schiper, A. and Raynal, M. (1996). From group communication to transactions in distributed systems. Communications of the ACM, 39:84–87.
Schneider, F. B. (1990). Implementing fault-tolerant service using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319.
Skeen, D. (1981). Nonblocking commit protocols. In SIGMOD ’81: Proceedings of the 1981 ACM SIGMOD international conference on Management of data, pages 133–142, New York, NY, USA. ACM.
Vandiver, B., Balakrishnan, H., Liskov, B., and Madden, S. (2007). Tolerating byzantine faults in transaction processing systems using commit barrier scheduling. In SOSP’07: Proceedings of 21st ACM Symposium on Operating Systems Principles.
Zielinski, P. (2004). Paxos at war. Technical Report UCAM-CL-TR-593, University of Cambridge Computer Laboratory, Cambridge, UK.
Publicado
19/07/2011
Como Citar
LUIZ, Aldelir Fernando; LUNG, Lau Cheuk; CORREIA, Miguel.
RIST: Um Middleware para Replicação e Interoperabilidade de Sistemas Transacionais. In: SEMINÁRIO INTEGRADO DE SOFTWARE E HARDWARE (SEMISH), 38. , 2011, Natal/RN.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2011
.
p. 1322-1336.
ISSN 2595-6205.
