A minimization version of a directed subgraph homeomorphism problem

Brenner, Janina; Fekete, Sándor P.; Veen, Jan C. van der

doi:10.1007/s00186-008-0259-0

Cited by 3 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If an edge e = (u, v) ∈ E(H) in the DFG can be mapped to a path from f(u) to f(v) in the MRRG G, it matches the subgraph homeomorphism definition [Fortune et al 1980]. The subgraph homeomorphism techniques for the CGRA mapping problem have been adopted in Tuhin and Norvell [2008], Alle et al [2008], Brenner et al [2009], and Gnanaolivu et al [2010Gnanaolivu et al [ , 2011. Subgraph homeomorphism, however, requires the edge mappings to be node-disjoint (or edge-disjoint), which means the nodes (or the edges) in the mapping paths for the edges carrying the same data cannot be shared.…”

Section: Subgraph Isomorphism and Subgraph Homeomorphism Mappingmentioning

confidence: 97%

“…The synthesis is carried out through a homeomorphic transformation of the dependency graph of each HyperOp onto the resource graph. Brenner et al [2009] also formalize the CGRA mapping as a subgraph homeomorphism problem, however, they consider general application kernels rather than loops. Particle swarm optimization is adopted for solving the CGRA mapping problem in Gnanaolivu et al [2010Gnanaolivu et al [ , 2011.…”

Section: Related Workmentioning

confidence: 99%

“…A number of CGRA mapping approaches follow the subgraph homeomorphism formalizations, including Tuhin and Norvell [2008], Alle et al [2008], Brenner et al [2009], and Gnanaolivu et al [2010Gnanaolivu et al [ , 2011. The mapping algorithm in Tuhin and Norvell [2008] is adapted from MIRS [Zalamea et al 2003], a modulo scheduler capable of instruction scheduling with register constraints.…”

Section: Related Workmentioning

confidence: 99%

“…To first formalize the CGRA mapping problem, we notice that a number of recent works [Tuhin and Norvell 2008;Alle et al 2008;Brenner et al 2009;Gnanaolivu et al 2010Gnanaolivu et al , 2011 follow subgraph homeomorphism [Fortune et al 1980] formalization. The idea is to test whether the dataflow graph (DFG) representing the loop kernel is subgraph homeomorphic to the modulo routing resource graph (MRRG) representing the CGRA resources and their interconnects.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Graph Minor Approach for Application Mapping on CGRAs

Chen

Mitra

2014

ACM Trans. Reconfigurable Technol. Syst.

View full text Add to dashboard Cite

Coarse-Grained Reconfigurable Arrays (CGRAs) exhibit high performance, improved flexibility, low cost, and power efficiency for various application domains. Compute-intensive loop kernels, which are perfect candidates to be executed on CGRAs, are usually mapped through modified modulo scheduling algorithms. These algorithms should be capable of performing both placement and routing. We formalize the CGRA mapping problem as a graph minor containment problem. We essentially test whether the dataflow graph representing the loop kernel is a minor of the modulo routing resource graph representing the CGRA resources and their interconnects. 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 prune the search space. We introduce additional heuristic strategies that drastically improve the compilation time while still generating optimal or near-optimal mapping solutions. Experimental evaluation confirms the efficiency of our approach.

show abstract