We have an amazing meetup this month: Jeff Hodges will be talking about Go and escape hatches; Neil Conway from Berkeley's CS Program will be on hand to talk about Bloom, CALM, CRDTS, and writing reliable distributed programs. See below for full details. You'll want to be at this meetup.
As usual, we'll be at the Basho offices. The date is Wednesday, June 27th. We'll get started just after 7PM, so try to arrive promptly. The food and beer is on Basho. Bring your hard questions.
Go and Escape Hatches
Jeff Hodges, Engineer
This talk will be all about Go, the language. Specifically, it will be an exploration of the escape hatches it gives the developer, and how its simple, clear design allows the developer to do more with less.
Logic and Lattices for Eventually Consistent Distributed Programming
Neil Conway, Berkeley CS
Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging.
In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. I'll then discuss our recent work on extending CALM to support a broader range of programs, drawing upon ideas from CRDTs.
Seats are limited. Register early and often, and please release your seat if you won't be able to make it. Hope to see you there. Let me know if you have any questions.