Declarative, Secure, Convergent Edge Computation
Christopher Meiklejohn

TL;DR
This paper introduces Lasp, a programming model designed for secure, natural, and coordination-free edge computation supporting eventual consistency in distributed systems.
Contribution
It proposes Lasp, a novel functional language-like model that facilitates secure, natural, and coordination-free edge computing with eventual consistency.
Findings
Lasp supports an eventually consistent, coordination-free distributed model.
The model is inspired by concurrent functional languages.
Preliminary results show feasibility for secure edge computation.
Abstract
Eventual consistency is a more natural model than strong consistency for a distributed system, since it is closer to the underlying physical reality. Therefore, we propose that it is important to find a programming model that is both congenial to developers and supports eventual consistency. In particular, we consider that a crucial test for such a model is that it should support edge computation in a both natural and secure way. We present a preliminary work report with an initial solution, called Lasp, which resembles a concurrent functional language while naturally supporting an eventually consistent coordination-free distribution model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Distributed systems and fault tolerance · Cloud Computing and Resource Management
