Using Genetic Algorithms for solving partitioning problem in codesign

Authors:
Mouloud Koudil;Karima Benatchba;Daniel Dours
Affiliations:
Inslilut Nalional de formation en Informalique, Oued Smar, Algérie 16270;Inslilut Nalional de formation en Informalique, Oued Smar, Algérie 16270;Institut de Recherche en Tnformatique de Toulouse, TRTT - UPS, UMR CNRS 5505, Uni-versité Toulouse III, Toulouse Cedex, France 31062
Venue:
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Year:
2009

Citing 7
Cited 1

System design methodologies: aiming at the 100 h design cycle

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Formal verification of embedded systems based on CFSM networks

DAC '96 Proceedings of the 33rd annual Design Automation Conference
The Codesign of Embedded Systems: A Unified Hardware/Software Representation

The Codesign of Embedded Systems: A Unified Hardware/Software Representation
Two-Level Hardware/Software Partitioning Using CoDe-X

ECBS '96 Proceedings of the IEEE Symposium and Workshop on Engineering of Computer Based Systems
The extended partitioning problem: hardware/software mapping and implementation-bin selection

RSP '95 Proceedings of the Sixth IEEE International Workshop on Rapid System Prototyping (RSP'95)
Configuration-level hardware/software partitioning for real-time embedded systems

CODES '94 Proceedings of the 3rd international workshop on Hardware/software co-design
CASTLE: an interactive environment for HW-SW Co-Design

CODES '94 Proceedings of the 3rd international workshop on Hardware/software co-design

Solving partitioning problem in codesign with ant colonies

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partitioning problem in codesign is of critical importance since it has big impact on cost/performance characteristics of the final product. Tt is an NP-Complete problem that deals with the different constraints relative to the system and the underlying target architecture. The reported partitioning approaches have several drawbacks (they are often dedicated to a particular application or target architecture, they operate at a unique granularity level, most of them are manual and impossible to apply for complex systems, the number of constraints they deal with is generally limited...). This paper introduces an automatic approach using genetic algorithms to solve partitioning in codesign. This approach is totally independent of target architecture. Another advantage of this approach is that it allows determining dynamically the granularity of the objects to partition, making it possible to browse more efficiently solution space.