COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Lasp: Dataflow programming for large-scale distributed applications
Lasp: Dataflow programming for large-scale distributed applicationsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Liang Wang. Consistency is hard and coordination is expensive. As we move into the world of connected ‘Internet of Things’ style applications, or large-scale mobile applications, devices have less power, periods of limited connectivity, and operate over unreliable asynchronous networks. This poses a problem with shared state: how do we handle concurrent operations over shared state, while clients are offline, and ensure that values converge to a desirable result without making the system unavailable? We look at a new programming model, called Lasp. This programming model combines distributed convergent data structures with a dataflow execution model designed for distribution over large-scale applications. This model supports arbitrary placement of processing node: this enables the user to author applications that can be distributed across data centers and pushed to the edge. Bio: Christopher Meiklejohn loves distributed systems and programming languages. Previously, Christopher worked at Basho Technologies, Inc. on the distributed key-value store, Riak. Christopher develops a programming model for distributed computation, called Lasp. Christopher is currently a Ph.D. student at the Université Catholique de Louvain in Belgium. This talk is part of the Computer Laboratory Systems Research Group Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsYeni Liste Symposium on Computational Biology Thinking Society: What is Life? Clare Politics Cambridge Natural History Society Stephen Roskill Memorial LectureOther talksFirst order rigidity of higher rank arithmetic lattices (note the nonstandard day) Organoid systems to study the maternal-fetal dialogue of early pregnancy Emma Hart: Remaking the Public Good in the American Marketplace during the Early Republic Positive definite kernels for deterministic and stochastic approximations of (invariant) functions Intravital Imaging – Applications and Image Analysis/ Information session on Borysiewicz Biomedical Sciences Fellowships Dr Michael Hastings: Circadian Rhythms |