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 Oct
|13:30 - 13:52|
Joscha DrechslerTechnische Universität Darmstadt, Guido SalvaneschiTU Darmstadt, Ragnar MogkTechnische Universität Darmstadt, Mira MeziniTechnical University of DarmstadtLink to publication
|13:52 - 14:15|
Tillmann RendelUniversity of Marburg, Jonathan Immanuel BrachthäuserUniversity of Marburg, Klaus OstermannUniversity of MarburgLink to publication
|14:15 - 14:37|
|Link to publication|
|14:37 - 15:00|
Ralf MitschkeTechnical University of Darmstadt, Sebastian ErdwegTU Darmstadt, Mirko KöhlerTechnical University of Darmstadt, Mira MeziniTechnical University of Darmstadt, Guido SalvaneschiTU DarmstadtLink to publication