Efficient design exploration based on module utility selection
In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configur...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on computer-aided design of integrated circuits and systems 2000-01, Vol.19 (1), p.19-29 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 29 |
---|---|
container_issue | 1 |
container_start_page | 19 |
container_title | IEEE transactions on computer-aided design of integrated circuits and systems |
container_volume | 19 |
creator | Chantrapornchai, C. Sha, E.H.-M. Hu, X.S. |
description | In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function. Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA. |
doi_str_mv | 10.1109/43.822617 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_885038776</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>822617</ieee_id><sourcerecordid>27513240</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-446c4000dcb729ba2de2daab82d25ee61e257f7683ef7dab6e236f61d12a9b133</originalsourceid><addsrcrecordid>eNqF0U1LxDAQBuAgCq4fB6-eigfRQ9fMJE3SiyDL-gELXvQc0mYqWbrt2rTg_nu77OLBg55mYB5eGF7GLoBPAXh-J8XUICrQB2wCudCphAwO2YSjNinnmh-zkxiXnIPMMJ-w-3lVhTJQ0yeeYvhoEvpa123n-tA2SeEi-WRcVq0fakqGPtSh3ySRaiq34owdVa6OdL6fp-z9cf42e04Xr08vs4dFWgpl-lRKVUrOuS8LjXnh0BN65wqDHjMiBYSZrrQygirtXaEIhaoUeECXFyDEKbve5a679nOg2NtViCXVtWuoHaJFgwZ4lv0PdQYCJR_hzZ8QlAY0QoEZ6dUvumyHrhn_tcZkXBit1Yhud6js2hg7quy6CyvXbSxwu63GSmF31Yz2cmcDEf24_fEborGHnQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>885038776</pqid></control><display><type>article</type><title>Efficient design exploration based on module utility selection</title><source>IEEE Electronic Library (IEL)</source><creator>Chantrapornchai, C. ; Sha, E.H.-M. ; Hu, X.S.</creator><creatorcontrib>Chantrapornchai, C. ; Sha, E.H.-M. ; Hu, X.S.</creatorcontrib><description>In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function. Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA.</description><identifier>ISSN: 0278-0070</identifier><identifier>EISSN: 1937-4151</identifier><identifier>DOI: 10.1109/43.822617</identifier><identifier>CODEN: ITCSDI</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Acceptability ; Computer science ; Costs ; Delay ; Design engineering ; Exploration ; Fuzzy logic ; High level synthesis ; Mathematical analysis ; Mathematical models ; Mathematics ; Modules ; Processor scheduling ; Resource management ; Scheduling ; Scheduling algorithm ; Space exploration ; Studies ; Utilities</subject><ispartof>IEEE transactions on computer-aided design of integrated circuits and systems, 2000-01, Vol.19 (1), p.19-29</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-446c4000dcb729ba2de2daab82d25ee61e257f7683ef7dab6e236f61d12a9b133</citedby><cites>FETCH-LOGICAL-c368t-446c4000dcb729ba2de2daab82d25ee61e257f7683ef7dab6e236f61d12a9b133</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/822617$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/822617$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chantrapornchai, C.</creatorcontrib><creatorcontrib>Sha, E.H.-M.</creatorcontrib><creatorcontrib>Hu, X.S.</creatorcontrib><title>Efficient design exploration based on module utility selection</title><title>IEEE transactions on computer-aided design of integrated circuits and systems</title><addtitle>TCAD</addtitle><description>In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function. Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA.</description><subject>Acceptability</subject><subject>Computer science</subject><subject>Costs</subject><subject>Delay</subject><subject>Design engineering</subject><subject>Exploration</subject><subject>Fuzzy logic</subject><subject>High level synthesis</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Modules</subject><subject>Processor scheduling</subject><subject>Resource management</subject><subject>Scheduling</subject><subject>Scheduling algorithm</subject><subject>Space exploration</subject><subject>Studies</subject><subject>Utilities</subject><issn>0278-0070</issn><issn>1937-4151</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0U1LxDAQBuAgCq4fB6-eigfRQ9fMJE3SiyDL-gELXvQc0mYqWbrt2rTg_nu77OLBg55mYB5eGF7GLoBPAXh-J8XUICrQB2wCudCphAwO2YSjNinnmh-zkxiXnIPMMJ-w-3lVhTJQ0yeeYvhoEvpa123n-tA2SeEi-WRcVq0fakqGPtSh3ySRaiq34owdVa6OdL6fp-z9cf42e04Xr08vs4dFWgpl-lRKVUrOuS8LjXnh0BN65wqDHjMiBYSZrrQygirtXaEIhaoUeECXFyDEKbve5a679nOg2NtViCXVtWuoHaJFgwZ4lv0PdQYCJR_hzZ8QlAY0QoEZ6dUvumyHrhn_tcZkXBit1Yhud6js2hg7quy6CyvXbSxwu63GSmF31Yz2cmcDEf24_fEborGHnQ</recordid><startdate>200001</startdate><enddate>200001</enddate><creator>Chantrapornchai, C.</creator><creator>Sha, E.H.-M.</creator><creator>Hu, X.S.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope><scope>7U5</scope><scope>7TB</scope></search><sort><creationdate>200001</creationdate><title>Efficient design exploration based on module utility selection</title><author>Chantrapornchai, C. ; Sha, E.H.-M. ; Hu, X.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-446c4000dcb729ba2de2daab82d25ee61e257f7683ef7dab6e236f61d12a9b133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Acceptability</topic><topic>Computer science</topic><topic>Costs</topic><topic>Delay</topic><topic>Design engineering</topic><topic>Exploration</topic><topic>Fuzzy logic</topic><topic>High level synthesis</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Modules</topic><topic>Processor scheduling</topic><topic>Resource management</topic><topic>Scheduling</topic><topic>Scheduling algorithm</topic><topic>Space exploration</topic><topic>Studies</topic><topic>Utilities</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chantrapornchai, C.</creatorcontrib><creatorcontrib>Sha, E.H.-M.</creatorcontrib><creatorcontrib>Hu, X.S.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chantrapornchai, C.</au><au>Sha, E.H.-M.</au><au>Hu, X.S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient design exploration based on module utility selection</atitle><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle><stitle>TCAD</stitle><date>2000-01</date><risdate>2000</risdate><volume>19</volume><issue>1</issue><spage>19</spage><epage>29</epage><pages>19-29</pages><issn>0278-0070</issn><eissn>1937-4151</eissn><coden>ITCSDI</coden><abstract>In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function. Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/43.822617</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0278-0070 |
ispartof | IEEE transactions on computer-aided design of integrated circuits and systems, 2000-01, Vol.19 (1), p.19-29 |
issn | 0278-0070 1937-4151 |
language | eng |
recordid | cdi_proquest_journals_885038776 |
source | IEEE Electronic Library (IEL) |
subjects | Acceptability Computer science Costs Delay Design engineering Exploration Fuzzy logic High level synthesis Mathematical analysis Mathematical models Mathematics Modules Processor scheduling Resource management Scheduling Scheduling algorithm Space exploration Studies Utilities |
title | Efficient design exploration based on module utility selection |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T20%3A47%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20design%20exploration%20based%20on%20module%20utility%20selection&rft.jtitle=IEEE%20transactions%20on%20computer-aided%20design%20of%20integrated%20circuits%20and%20systems&rft.au=Chantrapornchai,%20C.&rft.date=2000-01&rft.volume=19&rft.issue=1&rft.spage=19&rft.epage=29&rft.pages=19-29&rft.issn=0278-0070&rft.eissn=1937-4151&rft.coden=ITCSDI&rft_id=info:doi/10.1109/43.822617&rft_dat=%3Cproquest_RIE%3E27513240%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=885038776&rft_id=info:pmid/&rft_ieee_id=822617&rfr_iscdi=true |