Placing Multimode Streaming Applications on Dynamically Partially Reconfigurable Architectures

Algorithm 1

Merging two data flow graphs 𝐺_𝑖 and 𝐺_𝑗.

(1): initialize merged graph 𝐺_𝑀;

(2): extract all paths 𝑃_𝑖/𝑗 of 𝐺_𝑖/𝑗;

(3): While at least one pair of paths with non-empty MACSeq or MACStr exists do.

(4):  calculate MACSeq/MACStr 𝑆_𝑖,𝑗 for each pair (𝑝_𝑖,𝑝_𝑗)∈𝑃_𝑖×𝑃_𝑗;

(5):  find pair (𝑝_𝑖,𝑝_𝑗) with 𝑆^max_𝑖,𝑗 having maximum reconfiguration time;

(6):  merge paths 𝑝_𝑖 and 𝑝_𝑗 according to 𝑆^max_𝑖,𝑗 and add them to 𝐺_𝑀;

                     // see Algorithm 2

(7): 𝑃_𝑖/𝑗=𝑃_𝑖/𝑗⧵𝑝_𝑖/𝑗;

(8): end while

(9): add all remaining paths 𝑝∈𝑃_𝑖 and 𝑝∈𝑃_𝑗 as or-paths to 𝐺_𝑀;

                     // see Algorithm 3