Distributed REScala: An Update Algorithm for Distributed Reactive Programming
Reactive programming improves the design of reactive applications by relocating the logic for managing dependencies between dependent values away from the application logic to the language implementation. Many distributed applications are reactive. Yet, existing change propagation algorithms are not suitable in a distributed setting.
We propose Distributed REScala, a reactive language with a change propagation algorithm that works without centralized knowledge about the topology of the dependency structure among reactive values and avoids unnecessary propagation of changes, while retaining safety guarantees (glitch freedom). Distributed REScala enables distributed reactive programming, bringing the benefits of reactive programming to distributed applications. We demonstrate the enabled design improvements by a case study. We also empirically evaluate the performance of our algorithm in comparison to other algorithms in a simulated distributed setting.
Thu 23 OctDisplayed time zone: Tijuana, Baja California change
13:30 - 15:00
|Distributed REScala: An Update Algorithm for Distributed Reactive Programming|
Joscha Drechsler Technische Universität Darmstadt, Guido Salvaneschi TU Darmstadt, A: Ragnar Mogk Technische Universität Darmstadt, A: Mira Mezini Technical University of DarmstadtLink to publication
|From Object Algebras to Attribute Grammars|
Tillmann Rendel University of Marburg, Jonathan Immanuel Brachthäuser University of Marburg, Klaus Ostermann University of MarburgLink to publication
|Late Data Layout: Unifying Data Representation Transformations|
OOPSLALink to publication
|i3QL: Language-Integrated Live Data Views|
Ralf Mitschke Technical University of Darmstadt, Sebastian Erdweg TU Darmstadt, Mirko Köhler Technical University of Darmstadt, Mira Mezini Technical University of Darmstadt, Guido Salvaneschi TU DarmstadtLink to publication