Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Consistencia Eventual Fuerte y Elasticidad superlativa con Akka

Consistencia Eventual Fuerte y Elasticidad superlativa con Akka

Presentación para el DevFest de colombia-dev.

Yuji Kiriki

October 08, 2015
Tweet

More Decks by Yuji Kiriki

Other Decks in Programming

Transcript

  1. 8 falacias de los sistemas distribuidos + La red es

    confiable. + La latencia es 0. + El ancho de banda es infinito. + La red es segura. + La topología no cambia. + Sólo hay un administrador. + El costo de transporte es 0. + La red es homogenea. Tomado de https://blogs.oracle.com/jag/resource/Fallacies.html el 15/10/2015
  2. Spanner: Google’s Globally Distributed Database. Corbett, James C. and Dean,

    Jeffrey and Epstein, Michael and Fikes, Andrew and Frost, Christopher and Furman, J. J. and Ghemawat, Sanjay and Gubarev, Andrey and Heiser, Christopher and Hochschild, Peter and Hsieh, Wilson and Kanthak, Sebastian and Kogan, Eugene and Li, Hongyi and Lloyd, Alexander and Melnik, Sergey and Mwaura, David and Nagle, David and Quinlan, Sean and Rao, Rajesh and Rolig, Lindsay and Saito, Yasushi and Szymaniak, Michal and Taylor, Christopher and Wang, Ruth and Woodford, Dale . ACM Trans. Comput. Syst. August 2013. Volume 31, number 3. ACM New York, NY, USA.
  3. Exactly-once semantics in a replicated messaging system. Conference Proceedings: Data

    Engineering, 2001. Proceedings. 17th International Conference. Yongqiang Huang; Garcia-Molina, H. IEEE 2001.
  4. problema de los dos generales "2-generals" by Jens Erat -

    created by myself. Licensed under GFDL via Commons - https: //commons.wikimedia.org/wiki/File:2-generals.svg#/media/File:2-generals.svg
  5. Puedo hacer un DistSys que sea simultáneamente: + 100% Consistente

    + 100% Disponible + y tolerar particiones de red.
  6. CRDT, primer párrafo Is a partially ordered set that has

    a join (a least upper bound) for any nonempty finite subset.
  7. CRDT, tercer párrafo … and any such operation induces a

    partial order such that the result of the operation for any two elements is the least upper bound of the elements with respect to this partial order.
  8. Que dados dos o más CRDT, se pueden fundir (merge)

    en: + Cualquier órden + Con cualquier procedencia + Cualquier número de veces + Y los resultados siempre convergerán consistentemente.
  9. Semilattice. (2015, June 10). In Wikipedia, The Free Encyclopedia. Retrieved

    21:35, October 14, 2015, from https://en.wikipedia.org/w/index.php? title=Semilattice&oldid=666316943
  10. Por Akka: + Actor model. + Accrual failure detector. +

    Epidemic gossip protocols. + Consistent hashing. + Descentralized P2P. + Vector clocks. + Próximamente RAFT.