Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Hardware Software Partitioning Using Genetic Algorithm
Hyderabad, India
January 04-January 07
ISBN: 0-8186-7755-4
D. Saha, Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
A. Basu, Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
R.S. Mitra, Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
Hardware software co-design is gaining importance with the advent of CAD for embedded systems. A key phase in such designs is partitioning the specification into hardware and software implementation sets. The problem being combinatorically explosive, several greedy search algorithms have been proposed for hardware software partitioning. In this paper, we model the hardware software partitioning problem as a Constraint Satisfaction Problem (CSP), and present a genetic algorithm based approach to solve the CSP in order to obtain the partitioning solution.
Index Terms:
software engineering, hardware software partitioning, genetic algorithm, hardware software co-design, CAD, embedded systems, specification partitioning, constraint satisfaction problem
Citation:
D. Saha, A. Basu, R.S. Mitra, "Hardware Software Partitioning Using Genetic Algorithm," vlsid, pp.155, Tenth International Conference on VLSI Design: VLSI in Multimedia Applications, 1997