DocumentCode
238546
Title
Dataflow Programming Using AGAPIA
Author
Paduraru, Ciprian I.
Author_Institution
Dept. of Comput. Sci., Univ. of Bucharest, Bucharest, Romania
fYear
2014
fDate
24-27 June 2014
Firstpage
87
Lastpage
94
Abstract
As distributed applications became more commonplace and more sophisticated, new programming languages and models for distributed programming were created. In the context of continuously increasing data flows in parallel applications, there is a renewed interest in the dataflow paradigm. This paper shows why AGAPIA language is suitable for dataflow programming. AGAPIA is capable of expressing massive parallelism in a manageable way for programmers, allowing building dynamic nodes and links in the data flow graph at runtime. The nodes of the dataflow graph, also called programs, are modular and reusable. The communication is transparent for users allowing them to concentrate on the high level flow and algorithm. A complete application and an analysis in terms of productivity and performance are presented in order to demonstrate the AGAPIA´s capabilities.
Keywords
data flow computing; data flow graphs; distributed programming; parallel languages; AGAPIA language; data flow graph; data flow programming; distributed programming; programming languages; programming models; Arrays; Computer languages; Parallel processing; Programming; Runtime; Silicon; Syntactics;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing (ISPDC), 2014 IEEE 13th International Symposium on
Conference_Location
Marseilles
Print_ISBN
978-1-4799-5918-1
Type
conf
DOI
10.1109/ISPDC.2014.15
Filename
6900205
Link To Document