Efficient algorithms for finding highly acceptable designs based on module-utility selections

Chantana Chantrapornchai; Edwin H.M. Sha; Xiaobo Hu

Efficient algorithms for finding highly acceptable designs based on module-utility selections

Chantana Chantrapornchai, Edwin H.M. Sha, Xiaobo Hu

University of Notre Dame

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings of the IEEE Great Lakes Symposium on VLSI
Publisher	IEEE
Pages	128-131
Number of pages	4
ISBN (Print)	0769501044
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99) - Ann Arbor, MI, USA Duration: 4 Mar 1999 → 6 Mar 1999

Publication series

Name	Proceedings of the IEEE Great Lakes Symposium on VLSI
ISSN (Print)	1066-1395

Conference

Conference	Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99)
City	Ann Arbor, MI, USA
Period	4/03/99 → 6/03/99

Cite this

@inproceedings{34d3eee288cf4aa6973fbbb48d0257ed,

title = "Efficient algorithms for finding highly acceptable designs based on module-utility selections",

abstract = "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.",

author = "Chantana Chantrapornchai and Sha, \{Edwin H.M.\} and Xiaobo Hu",

year = "1999",

language = "英语",

isbn = "0769501044",

series = "Proceedings of the IEEE Great Lakes Symposium on VLSI",

publisher = "IEEE",

pages = "128--131",

booktitle = "Proceedings of the IEEE Great Lakes Symposium on VLSI",

note = "Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99) ; Conference date: 04-03-1999 Through 06-03-1999",

}

Chantrapornchai, C, Sha, EHM & Hu, X 1999, Efficient algorithms for finding highly acceptable designs based on module-utility selections. in Proceedings of the IEEE Great Lakes Symposium on VLSI. Proceedings of the IEEE Great Lakes Symposium on VLSI, IEEE, pp. 128-131, Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99), Ann Arbor, MI, USA, 4/03/99.

Efficient algorithms for finding highly acceptable designs based on module-utility selections. / Chantrapornchai, Chantana; Sha, Edwin H.M.; Hu, Xiaobo.
Proceedings of the IEEE Great Lakes Symposium on VLSI. IEEE, 1999. p. 128-131 (Proceedings of the IEEE Great Lakes Symposium on VLSI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient algorithms for finding highly acceptable designs based on module-utility selections

AU - Chantrapornchai, Chantana

AU - Sha, Edwin H.M.

AU - Hu, Xiaobo

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0033358351

M3 - 会议稿件

AN - SCOPUS:0033358351

SN - 0769501044

T3 - Proceedings of the IEEE Great Lakes Symposium on VLSI

SP - 128

EP - 131

BT - Proceedings of the IEEE Great Lakes Symposium on VLSI

PB - IEEE

T2 - Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99)

Y2 - 4 March 1999 through 6 March 1999

ER -

Efficient algorithms for finding highly acceptable designs based on module-utility selections

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this