LVars

Kuper, Lindsey; Newton, Ryan

doi:10.1145/2502323.2502326

Cited by 39 publications

(5 citation statements)

References 29 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is very similar to the approach taken by LVars [14] to provide deterministic parallel programming. Our work expands on this work by providing this deterministic parallelism across computing nodes, in a fault-tolerant manner.…”

Section: Discussionmentioning

confidence: 71%

Derflow

Bravo

Roy

et al. 2014

Proceedings of the Thirteenth ACM SIGPLAN Workshop on Erlang

View full text Add to dashboard Cite

Erlang implements a message-passing execution model in which concurrent processes send each other messages asynchronously. This model is inherently non-deterministic: a process can receive messages sent by any process which knows its process identifier, leading to an exponential number of possible executions based on the number messages received. Concurrent programs in nondeterministic languages are notoriously hard to prove correct and have led to well-known disasters.Furthermore, Erlang natively provides distribution and process clustering. This enables processes to asynchronously communicate between different virtual machines across the network, which increases the potential non-determinism.We propose a new execution model for Erlang, "Deterministic Dataflow Programming", based on a highly available, scalable single-assignment data store implemented on top of the riak core distributed systems framework. This execution model provides concurrent communication between Erlang processes, yet has no observable non-determinism. Given the same input values, a deterministic dataflow program will always return the same output values, or never return; liveness under failures is sacrificed to ensure safety. Our proposal provides a distributed deterministic dataflow solution that operates transparently over distributed Erlang, providing the ability to have highly-available, fault-tolerant, deterministic computations.

show abstract

Section: Discussionmentioning

confidence: 71%

Derflow

Bravo

Roy

et al. 2014

Proceedings of the Thirteenth ACM SIGPLAN Workshop on Erlang

View full text Add to dashboard Cite

show abstract

“…Baquero et al [2015] give general techniques for composing state-based CRDTs, the other kind of CRDTs besides op-based, using lattice merge functions. Similar techniques are used by the Bloom distributed programming model [Conway et al 2012] and the LVars parallel programming model [Kuper and Newton 2013]. While those works use lattice theory to compose state-based CRDTs, we use an idea from abstract algebra to compose op-based CRDTs.…”

Section: Related Workmentioning

confidence: 99%

“…While those works use lattice theory to compose state-based CRDTs, we use an idea from abstract algebra to compose op-based CRDTs. Also, those works (especially Conway et al [2012] and Kuper and Newton [2013]) focus on composition in the sense of composite data types (e.g., tuples and dictionaries), while we focus on composing different operations acting on the same base data type.…”

Section: Related Workmentioning

confidence: 99%

Composing and decomposing op-based CRDTs with semidirect products

Weidner

Miller

Meiklejohn

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventually consistent replicated data types that automatically resolve conflicts between concurrent operations. Op-based CRDTs must be designed differently for each data type, and current designs use ad-hoc techniques to handle concurrent operations that do not naturally commute. We present a new construction, the semidirect product of op-based CRDTs, which combines the operations of two CRDTs into one while handling conflicts between their concurrent operations in a uniform way. We demonstrate the construction's utility by using it to construct novel CRDTs, as well as decomposing several existing CRDTs as semidirect products of simpler CRDTs. Although it reproduces common CRDT semantics, the semidirect product can be viewed as a restricted kind of operational transformation, thus forming a bridge between these two opposing techniques for constructing replicated data types. CCS Concepts: • Software and its engineering → Data types and structures; • Theory of computation → Distributed algorithms.

show abstract

“…Lasp [Meiklejohn and Van Roy 2015a,b] tackles the problem of deriving one CRDT from another, preventing multiple derivations to produce duplicates. LVars [Kuper and Newton 2013] uses monotonicity for deterministic concurrency and has been combined with CRDTs to provide determinism and distribution [Kuper and Newton 2014]. Bloom [Conway et al 2012] supports declarative composition of monotonic operations to write monotonic programs.…”

Section: Abstractions For Unreliable Networkmentioning

confidence: 99%

A fault-tolerant programming model for distributed interactive applications

Mogk

Drechsler

Salvaneschi

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Ubiquitous connectivity of web, mobile, and IoT computing platforms has fostered a variety of distributed applications with decentralized state. These applications execute across multiple devices with varying reliability and connectivity. Unfortunately, there is no declarative fault-tolerant programming model for distributed interactive applications with an inherently decentralized system model. We present a novel approach to automating fault tolerance using high-level programming abstractions tailored to the needs of distributed interactive applications. Specifically, we propose a calculus that enables formal reasoning about applications' dataflow within and across individual devices. Our calculus reinterprets the functional reactive programming model to seamlessly integrate its automated state change propagation with automated crash recovery of device-local dataflow and disconnection-tolerant distribution with guaranteed automated eventual consistency semantics based on conflict-free replicated datatypes. As a result, programmers are relieved of handling intricate details of distributing change propagation and coping with distribution failures in the presence of interactivity. We also provides proofs of our claims, an implementation of our calculus, and an empirical evaluation using a common interactive application. CCS Concepts: • Theory of computation → Distributed computing models; • Software and its engineering → Software fault tolerance; Data flow languages.

show abstract

LVars

Cited by 39 publications

References 29 publications

Derflow

Derflow

Composing and decomposing op-based CRDTs with semidirect products

A fault-tolerant programming model for distributed interactive applications

Contact Info

Product

Resources

About