TU Darmstadt / ULB / TUprints

A Fault-Tolerant Programming Model for Distributed Interactive Applications

Mogk, Ragnar ; Drechsler, Joscha ; Salvaneschi, Guido ; Mezini, Mira (2020)
A Fault-Tolerant Programming Model for Distributed Interactive Applications.
In: Proceedings of the ACM on Programming Languages, 2019, 3 (OOPSLA)
doi: 10.25534/tuprints-00014554
Article, Secondary publication, Publisher's Version

Copyright Information: CC BY 4.0 International - Creative Commons, Attribution.

Download (565kB) | Preview
Item Type: Article
Type of entry: Secondary publication
Title: A Fault-Tolerant Programming Model for Distributed Interactive Applications
Language: English
Date: 4 December 2020
Place of Publication: Darmstadt
Year of primary publication: 2019
Publisher: Association for Computing Machinery
Journal or Publication Title: Proceedings of the ACM on Programming Languages
Volume of the journal: 3
Issue Number: OOPSLA
DOI: 10.25534/tuprints-00014554
Corresponding Links:
Origin: Secondary publication via Golden Open Access

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.

Status: Publisher's Version
URN: urn:nbn:de:tuda-tuprints-145545
Classification DDC: 000 Generalities, computers, information > 004 Computer science
Divisions: 20 Department of Computer Science > Sichere Mobile Netze
20 Department of Computer Science > Software Technology
LOEWE > LOEWE-Zentren > emergenCITY
Date Deposited: 04 Dec 2020 08:48
Last Modified: 20 Oct 2023 10:50
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/14554
Actions (login required)
View Item View Item