Computer systems science and engineering vol:14 issue:3 pages:155-165
In this paper, we study consistent synchronous multi-rate data flow graphs to determine the minimal required buffer sizes that still guarantee the construction of a deadlock-free static schedule. A graph is split up in chains and clusters that can be studied independently. We present the results for chains, as well as for the most frequent clusters. The results will be used in the rapid prototyping environment GRAPE-II in case the emulation hardware contains FPGAs, or when memory is critical.