Graph Constraints in Embedded System Design

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00481135
Contributor : François Charot <>
Submitted on : Thursday, May 6, 2010 - 9:21:35 AM
Last modification on : Thursday, November 15, 2018 - 11:57:39 AM

Identifiers

  • HAL Id : inria-00481135, version 1

Citation

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⟩

Share

Metrics

Record views

341