We transform the CGRA mapping problem with route sharing into a graph minor problem. Our graph minor formalization provides a solid foundation for application ...
We design an exact graph minor testing approach that exploits the unique properties of both the dataflow graph and the routing resource graph to significantly ...
Coarse-Grained Reconfigurable Arrays (CGRAs) exhibit high performance, improved flexibility, low cost, and power ef- ficiency for various application ...
We formalize the CGRA mapping problem as a graph minor containment problem. We essentially test if the data flow graph representing the loop kernel is a minor ...
[PDF] Graph minor approach for application mapping on CGRAs
www.semanticscholar.org › paper › Grap...
This work transforms the CGRA mapping problem with route sharing into a graph minor problem and provides an efficient framework based on graph mapping to solve ...
Since the definition of the graph minor is restricted to undirected graphs, they extended it by defining the edge contraction operation for directed graphs.
Jun 18, 2013 · We design an exact graph minor testing approach that exploits the unique properties of both the data flow graph and the routing resource graph ...
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained ...
Abstract—A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges.