On reducing the dataflow-graph hosting area
Borut Robič, Jurij Šilc, P. Blaznik, Peter Kolbezen · 2002
An examination is made of the problem of mapping a dataflow program graph onto a data-driven processor array with hexagonal cells. A particular mapping scheme is analyzed to show that, in general, it results in a low area utilization. An optimization method for reducing the hosting area is introduced with descriptions of two possible implementations.>