Composite Data Types in Dynamic Dataflow Languages as Copyless Memory Sharing Mechanism

This paper presents new optimization approaches aiming at reducing the impact of memory accesses on the performance of dataflow programs. The approach is based on introducing a high level management of composite data types in dynamic dataflow programming language for the memory processing of data tokens. It does not require essential changes to the model of computation (MOC) or to the dataflow program itself. The objective of the approach is to remove the unnecessary constraints of memory isolations without introducing limitations to the scalability and composability properties of the dataflow paradigm. Thus the identified optimizations allow to keep the same design and programming philosophy of dataflow, whereas aiming at improving the performance of the specific configuration implementation. The different optimizations can be integrated into the current RVC-CAL design flows and synthesis tools and can be applied to different sub-networks partitions of the dataflow program. The paper introduces the context, the definition of the optimization problem and describes how it can be applied to dataflow designs. Some examples of the optimizations are provided.


Published in:
Lecture Notes in Computer Science, 11540, 717-724
Presented at:
Computational Science – ICCS 2019
Year:
Jun 08 2019
Keywords:
Other identifiers:
Laboratories:




 Record created 2019-06-17, last modified 2019-08-12

Final:
Poster - Download fulltextPDF
10.1007_978-3-030-22750-0_70 - Download fulltextPDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)