Don't give up on serializability just yet!

A session at GOTO Chicago 2015

Tuesday 12th May, 2015

3:00pm to 3:50pm (CST)

Having constraints and guarantees about the way a program executes makes it much easier for developers to reason about concurrency.

It's a common belief that providing serializability, one of the strongest forms of consistency in transaction processing, is too expensive for general use.

We describe research that introduces new techniques for making conflicting serializable transactions faster, on both multi-core and distributed systems.

About the speaker

This person is speaking at this event.
Neha Narula

PhD student in PDOS, the Parallel and Distributed Operating Systems group at MIT

Neha Narula is a PhD candidate at MIT building fast, scalable distributed systems. In a previous life she was a Senior Software Engineer at Google, where she designed the first version of Blobstore, a system for storing and serving petabytes of immutable data, and worked on Native Client, a system for running native code securely through the browser. She cares a lot about coffee, bourbon, how we get our news, and securing user data.

Next session in Room 2

4:05pm Distributed Systems #2 by Caitie McCaffrey

Sign in to add slides, notes or videos to this session

Tell your friends!


Time 3:00pm3:50pm CST

Date Tue 12th May 2015

Short URL


View the schedule


See something wrong?

Report an issue with this session