loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth Great Lakes Symposium on VLSI
Efficient Algorithms for Finding Highly Acceptable Designs Based on Module-Utility Selections
Ann Arbor, Michigan
March 04-March 06
ISBN: 0-7695-0104-4
Chantana Chantrapornchai, University of Notre Dame
Edwin H.-M. Sha, University of Notre Dame
Xiaobo (Sharon) Hu, University of Notre Dame
In this paper, we present an iterative framework to solve module selection problem under resource, latency, and power constraints. The framework associates a utility measure with each module. This measurement reflects the usefulness of the module for a given a design goal. Using modules with high utility values will result in superior designs. We propose a heuristic which iteratively perturbs module utility values until they lead to good module selections. Our experiments show that the module selections formed by combinations of modules with high utility values are superior solutions. Further, by keeping modules with high utility values, the module exploration space can drastically be reduced.
Citation:
Chantana Chantrapornchai, Edwin H.-M. Sha, Xiaobo (Sharon) Hu, "Efficient Algorithms for Finding Highly Acceptable Designs Based on Module-Utility Selections," glsvlsi, pp.128, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.