Selective Hearing: An Approach to Distributed, Eventually Consistent Edge Computation

Meiklejohn, Christopher; Roy, Peter Van

doi:10.1109/srdsw.2015.9

Cited by 9 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Selective Hearing [26] uses a gossip protocol to disseminate monotonically growing sets of updates to provide a runtime to the Lasp [25] programming language. The general architecture is similar to that of SSB, the most striking difference is that Lasp is by design restricted to CRDTs.…”

Section: Related Workmentioning

confidence: 99%

Secure Scuttlebutt

Tarr¹,

Lavoie

Meyer

et al. 2019

Proceedings of the 6th ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

Secure Scuttlebutt (SSB) is a novel peer-to-peer event-sharing protocol and architecture for social apps. In this paper we describe SSB's features, its operations as well as the rationale behind the design. We also provide a comparison with Named Data Networking (NDN), an existing information-centric networking architecture, to motivate a larger exploration of the design space for information-centric networking primitives by formulating an identity-centric approach. We finally discuss SSB's limitations and evolution opportunities. CCS CONCEPTS • Networks → Network architectures; • Software and its engineering → Publish-subscribe / event-based architectures; • Computer systems organization → Peer-to-peer architectures; • Information systems → Linked lists.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure Scuttlebutt

Tarr¹,

Lavoie

Meyer

et al. 2019

Proceedings of the 6th ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

show abstract

“…Datacenter Lasp [11] operates using a structured overlay network. Hybrid Gossip Lasp [12] uses an unstructured overlay network, and by design should achieve greater scalability and provide better fault-tolerance [15].…”

Section: System Architecturementioning

confidence: 99%

Practical evaluation of the Lasp programming model at large scale

Meiklejohn

Enes

Yoo

et al. 2017

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Programming models for building large-scale distributed applications assist the developer in reasoning about consistency and distribution. However, many of the programming models for weak consistency, which promise the largest scalability gains, have little in the way of evaluation to demonstrate the promised scalability. We present an experience report on the implementation and largescale evaluation of one of these models, Lasp, originally presented at PPDP '15, which provides a declarative, functional programming style for distributed applications. We demonstrate the scalability of Lasp's prototype runtime implementation up to 1024 nodes in the Amazon cloud computing environment. It achieves high scalability by uniquely combining hybrid gossip with a programming model based on convergent computation. We report on the engineering challenges of this implementation and its evaluation, speci cally related to operating research prototypes in a production cloud environment. ACM Reference format:C. Meiklejohn et al.of demonstrating the scalability of the Lasp model. Our experience report substantiates that empirically validating scalability is nontrivial, regardless of the programming model.

show abstract

“…Lasp [27,28] is a programming model designed as part of the SyncFree and LightKone EU projects [2,1] focusing on synchronization-free programming of large-scale distributed applications. Lasp sits at one extreme of the CAP theorem: Lasp will sacrifice consistency in order to remain available.…”

Section: Laspmentioning

confidence: 99%

On the Design of Distributed Programming Models

Meiklejohn

2017

Proceedings of the Programming Models and Languages for Distributed Computing

View full text Add to dashboard Cite

Programming large-scale distributed applications requires new abstractions and models to be done well. We demonstrate that these models are possible.Following from both the FLP result and CAP theorem, we show that concurrent programming models are necessary, but not sufficient, in the construction of large-scale distributed systems because of the problem of failure and network partitions: languages need to be able to capture and encode the tradeoffs between consistency and availability.We present two programming models, Lasp and Austere, each of which makes a strong tradeoff with respects to the CAP theorem. These two models outline the bounds of distributed model design: strictly AP or strictly CP. We argue that all possible distributed programming models must come from this design space, and present one practical design that allows declarative specification of consistency tradeoffs, called Spry.

show abstract

Selective Hearing: An Approach to Distributed, Eventually Consistent Edge Computation

Cited by 9 publications

References 8 publications

Secure Scuttlebutt

Secure Scuttlebutt

Practical evaluation of the Lasp programming model at large scale

On the Design of Distributed Programming Models

Contact Info

Product

Resources

About