Tuesday 12th May, 2015
3:00pm to 3:50pm
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.
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.
Sign in to add slides, notes or videos to this session