2016/09/05 by Borja Arnau de Régil Basáñez, Christopher Meiklejohn, Basáñez, Borja Arnau de Régil +1
Computer Science · #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Logic, programming, and type systems #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1609.01068
openalex publication_date 2016/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a work in progress report on applying deforestation to distributed, dynamic dataflow programming models. We propose a novel algorithm, dynamic path contraction, that applies and reverses optimizations to a distributed dataflow application as the program executes. With this algorithm, data and control flow is tracked by the runtime system used to identify potential optimizations as the system is running. We demonstrate and present preliminary results regarding this technique on an actor-based distributed programming model, Lasp, implemented on the Erlang virtual machine.