Executing a dataflow program on a parallel platform requires assigning to each buffer a given size so that correct program executions take place without introducing any deadlock. Furthermore, in the case of dynamic dataflow programs, specific buffer size assignments lead to significant differences in the throughput, hence a more appropriate optimization problem is to specify the buffer sizes so that the throughput is maximized and the used resources are minimized. This paper introduces a new heuristic methodology for the buffer dimensioning of dynamic dataflow programs, which is considered as a stage of a more general design space exploration process
This paper addresses the problem of trading-off between the minimization of program and data memory ...
Real-time stream processing applications such as software defined radios are usually executed concur...
International audienceThis paper introduces and assesses a new technique to minimize the memory foot...
The trade-off between throughput and memory constraints is a common design problem in embedded syste...
The trade-off between throughput and memory constraints is a common design problem in embedded syste...
The implementations of signal processing systems on the emerging many-core or multi-core processing ...
Minimizing buffer sizes of dynamic dataflow implementations without introducing deadlocks or reducin...
This paper presents a dataflow design methodology and an associated co-exploration environment, focu...
The implementation and optimization of dynamic dataflow programs on multi/many-core platforms requir...
This paper presents a new approach to buffer dimensioning for dynamic dataflow implementations. A no...
This paper presents a new approach to buffer dimensioning for dynamic dataflow implementations. A no...
International audienceHigh-Level Synthesis (HLS) tools are mature enough to provide efficient code g...
Abstract in Undetermined This paper describes a methodology for the optimization of portable paralle...
The analysis of the trace graphs generated by dataflow program executions has been shown to be an ef...
This paper addresses the problem of trading-off between the minimization of program and data memory ...
This paper addresses the problem of trading-off between the minimization of program and data memory ...
Real-time stream processing applications such as software defined radios are usually executed concur...
International audienceThis paper introduces and assesses a new technique to minimize the memory foot...
The trade-off between throughput and memory constraints is a common design problem in embedded syste...
The trade-off between throughput and memory constraints is a common design problem in embedded syste...
The implementations of signal processing systems on the emerging many-core or multi-core processing ...
Minimizing buffer sizes of dynamic dataflow implementations without introducing deadlocks or reducin...
This paper presents a dataflow design methodology and an associated co-exploration environment, focu...
The implementation and optimization of dynamic dataflow programs on multi/many-core platforms requir...
This paper presents a new approach to buffer dimensioning for dynamic dataflow implementations. A no...
This paper presents a new approach to buffer dimensioning for dynamic dataflow implementations. A no...
International audienceHigh-Level Synthesis (HLS) tools are mature enough to provide efficient code g...
Abstract in Undetermined This paper describes a methodology for the optimization of portable paralle...
The analysis of the trace graphs generated by dataflow program executions has been shown to be an ef...
This paper addresses the problem of trading-off between the minimization of program and data memory ...
This paper addresses the problem of trading-off between the minimization of program and data memory ...
Real-time stream processing applications such as software defined radios are usually executed concur...
International audienceThis paper introduces and assesses a new technique to minimize the memory foot...