11-20
Robust Abstractions for Replicated Shared State

[[{"fid":"478","view_mode":"embedded_left","fields":{"format":"embedded_left","field_file_image_alt_text[und][0][value]":"Sebastian Burckhardt","field_file_image_title_text[und][0][value]":"","field_file_caption_credit[und][0][value]":"%3Cp%3ESebastian%20Burckhardt%3C%2Fp%3E%0A","field_file_caption_credit[und][0][format]":"full_html"},"type":"media","attributes":{"alt":"Sebastian Burckhardt","height":375,"width":250,"class":"media-element file-embedded-left"},"link_text":null}]]In the age of cloud-connected mobile devices, users want responsive apps that read and write shared data everywhere, at all times, even if network connections are slow or unavailable. Replication and eventual consistency, while able to deliver this experience, require us to face the complexity of asynchronous update propagation and conflict resolution. Our research goal is to find abstractions that encapsulate this complexity, in order to simplify the programming of distributed applications that are responsive, reactive, and collaborative.

In this talk, we first discuss the general principles of eventual consistency. Then, we introduce our programming model, consisting of cloud types (for declarative type-based conflict resolution) and the GLUT model (an operational consistency model based on a global log of update transactions). Finally, we report on our practical experiences with supporting cloud types and GLUT in the TouchDevelop programming language and mobile development environment.

Sebastian Burckhardt was born and raised in Basel, Switzerland, where he studied Mathematics at the local University. During an exchange year at Brandeis University, he discovered his affinity to Computer Science and immigrated to the United States. After a few years of industry experience at  IBM, he returned to academia and earned his PhD in Computer Science at the University of Pennsylvania.  Since then, he has worked as a researcher at Microsoft Research in Redmond.  His general research interest is the study of programming models for of concurrent, parallel, and distributed systems. More specific interests include consistency models, concurrency testing, self-adjusting computation, and the concurrent revisions programming model.

Date and Time
Thursday November 20, 2014 4:30pm - 5:30pm
Location
Computer Science Small Auditorium (Room 105)
Host
David Walker

Contributions to and/or sponsorship of any event does not constitute departmental or institutional endorsement of the specific program, speakers or views presented.

CS Talks Mailing List