Skip to Main content Skip to Navigation
Conference papers

Task-based execution of synchronous dataflow graphs for scalable multicore computing

Abstract : Dataflow models of computation have early on been acknowledged as an attractive methodology to describe parallel algorithms, hence they have become highly relevant for programming in the current multicore processor era. While several frameworks provide tools to create dataflow descriptions of algorithms, generating parallel code for programmable processors is still sub-optimal due to the scheduling overheads and the semantics gap when expressing parallelism with conventional programming languages featuring threads. In this paper we propose an optimization of the parallel code generation process by combining dataflow and task programming models. We develop a task-based code generator for PREESM, a dataflow-based prototyping framework, in order to deploy algorithms described as synchronous dataflow graphs on multicore platforms. Experimental performance comparison of our task generated code against typical thread-based code shows that our approach removes significant scheduling and synchronization overheads while maintaining similar (and occasionally improving) application throughput. © 2017 IEEE.
Complete list of metadata
Contributor : Laurent Jonchère Connect in order to contact the contributor
Submitted on : Tuesday, February 20, 2018 - 2:59:52 PM
Last modification on : Monday, October 5, 2020 - 9:50:26 AM



G. Georgakarakos, S. Kanur, J. Lilius, K. Desnos. Task-based execution of synchronous dataflow graphs for scalable multicore computing. 2017 IEEE International Workshop on Signal Processing Systems, SiPS 2017, Oct 2017, Lorient, France. pp. 8110023, ⟨10.1109/SiPS.2017.8110023⟩. ⟨hal-01713369⟩



Record views