Placing Multimode Streaming Applications on Dynamically Partially Reconfigurable Architectures

Algorithm 4

Placement Algorithm.

Initialize list of rectangles, communication bandwidth usage;

for 𝑖=1 to |𝑀| do

 Determine set of modules for which data-dependencies are met, and still unplaced, named 𝐾_𝑖;

 Remove modules from 𝐾_𝑖, for which currently not enough communication bandwidth is available;

 Remove modules from 𝐾_𝑖, for which no suitable feasible position can be found in 𝐺_𝐴 with a first-fit heuristic.

 If more than one module is still included in 𝐾_𝑖, then select one according to criteria such as

 number of descendants, module size, Block-RAM usage, and so forth.

 Place 𝐾_𝑖 in the determined feasible position and update resource usage informations;

end for.