Recursive Task Generation for Scalable SDF Graph Execution on Multicore Processors

Dataflow modelling is a popular technique for describing parallel algorithms. Using dataflow, algorithm parallelism can be modelled and analysed efficiently at a high level of abstraction. However, challenges arise when translating dataflow semantics into executable code, mainly due to scheduling and synchronization overheads. Invoking task programming models in order to generate efficient code from dataflow representations has been proposed as a promising methodology to optimise the translation process.In this paper, we propose recursive task execution as an optimisation for the dataflow-based code generation process. Our approach is based on extracting synchronous dataflow graph information in order to reduce scheduling overheads and improve load balancing when executing task-based code on multicore processors. We use PREESM dataflow-based prototyping framework to implement and test our concept. Results show that our proposed optimisation enhances code scalability therefore enabling higher application throughput.