ACM Home Page
Please provide us with feedback. Feedback
Multi-objective design space exploration using genetic algorithms
Full text PdfPdf (498 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the tenth international symposium on Hardware/software codesign table of contents
Estes Park, Colorado
SESSION: Design space exploration and architectural design of HW/SW systems table of contents
Pages: 67 - 72  
Year of Publication: 2002
ISBN:1-58113-542-4
Authors
Maurizio Palesi  University of Catania, V.le Andrea Doria, 6, Catania, Italy
Tony Givargis  UC Irvine, Irvine, CA
Sponsors
IEEE-CS\DATC : IEEE Computer Society
IFIP WG 10.5 : IFIP WG 10.5
SIGSOFT: ACM Special Interest Group on Software Engineering
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 84,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/774789.774804
What is a DOI?

ABSTRACT

In this work, we provide a technique for efficiently exploring a parameterized system-on-a-chip (SoC) architecture to find all Pareto-optimal configurations in a multi-objective design space. Globally, our approach uses a parameter dependency model of our target parameterized SoC architecture to extensively prune non-optimal sub-spaces. Locally, our approach applies Genetic Algorithms (GAs) to discover Pareto-optimal configurations within the remaining design points. The computed Pareto-optimal configurations will represent the range of performance (e.g., timing and power) tradeoffs that are obtainable by adjusting parameter values for a fixed application that is mapped on the parameterized SoC architecture. We have successfully applied our technique to explore Pareto-optimal configurations for a number of applications mapped on a parameterized SoC architecture.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
C. J. Alpert, L. W. Hagen, and A. B. Kahng. A hybrid multilevel/genetic approach for circuit partitioning. In Fifth ACM/SIGDA Physical Design Workshop, pages 100--105, Apr. 1996.
 
3
 
4
C. A. C. Coello. A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information Systems. An International Journal, 1(3):269--308, Aug. 1999.
5
 
6
 
7
 
8
J. Heitkötter and D. Beasley. The hitch-hiker's guide to evolutionary computation. http://surf.de.uu.net/encore/www/, Apr. 12 2001.
 
9
 
10
Y.-M. Jiang, K.-T. Cheng, and A. Krstic. Estimation of maximum power and instantaneous current using a genetic algorithm. In Proceedings of IEEE Custom Integrated Circuits Conference, pages 135--138, May 1997.
 
11
V. Kommu and I. Pomenraz. GAFAP: Genetic algorithm for FPGA technology mapping. In European Design Automation Conference, pages 300--305, 1993.
 
12
J. Lienig and K. Thulasiraman. A genetic algorithm for channel routing in VLSI circuits. Evolutionary Computation, 1(4):293--311, 1993.
13
 
14
 
15
D. Saab, Y. Saab, and J. Abraham. Automatic test vector cultivation for sequential vlsi circuits using genetic algorithms. IEEE Transactionsn Computer-Aided Design, 15(10):1278--1285, Oct. 1996.
 
16
K. Shahookar and P. Mazumder. A genetic approach to standard cell placement using metagenetic parameter optimization. IEEE Transactions on Computer-Aided Design, 9:500--511, May 1990.
17
 
18
 
19
E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the performance of the strength pareto evolutionary algorithm. Technical Report TIK-Report 103, Computer Engineering and Communication Networks Lab, Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092, May 2001.
 
20
E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE transactions on Evolutionary Computation, 4(3):257--271, Nov. 1999.

CITED BY  22

Collaborative Colleagues:
Maurizio Palesi: colleagues
Tony Givargis: colleagues