|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
24 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Dynamic Path Contraction for Distributed, Dynamic Dataflow Languages | | Borja Arnau de Régil Basáñez
; Christopher S. Meiklejohn
; | | Date: |
5 Sep 2016 | | Abstract: | 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. | | Source: | arXiv, 1609.1068 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER