Keynote - Jepsen 7: Anna Concurrenina by Kyle Kingsbury

This video was recorded at Scala Days Chicago 2017
Follow us on Twitter @ScalaDays or visit our website for more information scaladays.org
Abstract:
Happy databases are all alike; every unhappy database is unhappy in its own way. Following Tolstoy's insight into distributed systems, we discuss the myriad ways in which the conversations of computer families can break down, leading to broken promises and broken hearts.

[@bazalevNikita]

Looks like the audience didn't appreciate a pun with Anna Concurrenina. For the record, Leo Tolstoy wrote "Anna Karenina"

[@patrateii]

Another great talk from Kyle! I also love the hand-drawn slides!

[@sophiagold5892]

The koan returns -3 because in Scala operators are methods and applying a method to a conditional automatically casts the return value of both branches to be of the same type. Since float has precedence over long, the long is cast to a float which causes it to lose precision and become 123456792. Then both the long and float are cast to a double, which has the highest precedence, in order to evaluate the subtraction method. The result is 123456789 - 123456792 = -3.

[@udomatthiasdrums5322]

cool stuff - love it!!

[@baseman00]

Great talk. If you can beat up NATS Streaming as it's interesting possibility for replacing kafka. Cheers

[@linkernick5379]

Stephen Hammond Yes, very good talk. Aphyr points to the several important moments, that every developer should consider when building distributed systems.