Distributed-Memory FastFlow Building Blocks

We present the new distributed-memory run-time system (RTS) of the C++-based open-source structured parallel programming library FastFlow . The new RTS enables the execution of FastFlow shared-memory applications written using its Building Blocks (BBs) on distributed systems with minimal changes to...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of parallel programming Ročník 51; číslo 1; s. 1 - 21
Hlavní autori: Tonci, Nicolò, Torquati, Massimo, Mencagli, Gabriele, Danelutto, Marco
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.02.2023
Springer Nature B.V
Predmet:
Algorithms
Code reuse
Communication
Computer networks
Computer Science
Distributed memory
Parallel programming
Processor Architectures
Software
Software Engineering/Programming and Operating Systems
Special Issue on High-Level Parallel Programming and Applications (HLPP 2022)
Theory of Computation
Distributed programming
Algorithmic skeletons
Parallel patterns
High-level parallel programming
Building blocks
ISSN:0885-7458, 1573-7640
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present the new distributed-memory run-time system (RTS) of the C++-based open-source structured parallel programming library FastFlow . The new RTS enables the execution of FastFlow shared-memory applications written using its Building Blocks (BBs) on distributed systems with minimal changes to the original program. The changes required are all high-level and deal with introducing distributed groups ( dgroup ), i.e., logical partitions of the BBs composing the application streaming graph. A dgroup , which in turn is implemented using FastFlow ’s BBs, can be deployed and executed on a remote machine and communicate with other dgroups according to the original shared-memory FastFlow streaming programming model. We present how to define the distributed groups and how we faced the problem of data serialization and communication performance tuning through transparent messages’ batching and their scheduling. Finally, we present a study of the overhead introduced by dgroups considering some benchmarks on a sixteen-node cluster.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-7458
1573-7640
DOI:10.1007/s10766-022-00750-5