Research Article
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 having maximum reconfiguration time; | (6): merge paths and according to and add them to ; | // see Algorithm 2 | (7): ; | (8): end while | (9): add all remaining paths and as or-paths to ; | // see Algorithm 3 |
|