Efficient algorithms for acceptable design exploration

Authors:
Chantana Chantrapornchai;Edwin H.-M. Sha;Xiaobo Hu
Affiliations:
Department of Mathematics, Silpakorn University, Nakorn Pathom 73000, Thailand;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Venue:
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
Year:
2000

Citing 5
Cited 0

Fuzzy Logic

Computer
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Efficient Algorithms for Finding Highly Acceptable Designs Based on Module-Utility Selections

GLS '99 Proceedings of the Ninth Great Lakes Symposium on VLSI
Performing Scheduling and Storage Optimization Simultaneously Using Genetic Algorithms

MWSCAS '98 Proceedings of the 1998 Midwest Symposium on Systems and Circuits
Efficient Scheduling for Imprecise Timing Based on Fuzzy Theory

MWSCAS '98 Proceedings of the 1998 Midwest Symposium on Systems and Circuits

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an efficient approach to find effective module selections under resource, latency, and power constraints. The framework contains two phases: choosing a resource configuration, and determining a module binding for each resource. The first phase applies inclusion scheduling to estimate generic resources required. In the second phase, module utility measurement is used to determine module selections. A heuristic which perturbs module utility values until they lead to superior selections according to design objectives are also proposed. The experiments on well-known benchmarks show the effectiveness of the approach when comparing the obtained module selections with the results from enumerating all module selections, as well as MSSR and PSGA.