Graph Constraints in Embedded System Design - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Graph Constraints in Embedded System Design


In this paper, we present application of graph constraints combined with finite domain constraints for embedded system optimization problems. In particular, we present methods for identification and selection of computational patterns as well as application scheduling with these patterns that has direct application in ASIP processor design. In this work we use connected component, (sub)graph isomorphism and clique constraints. Our experimental results show that these methods work for relatively large examples and provide much better results than previous heuristic based approaches.
No file

Dates and versions

inria-00481135 , version 1 (06-05-2010)


  • HAL Id : inria-00481135 , version 1


Christophe Wolinski, Krzysztof Kuchcinski, Kevin Martin, Antoine Floch, Erwan Raffin, et al.. Graph Constraints in Embedded System Design. Worshop on Combinatorial Optimization for Embedded System Design (COESD 2010), Jun 2010, Bologne, Italy. ⟨inria-00481135⟩
153 View
0 Download


Gmail Facebook Twitter LinkedIn More