A dynamically tunable memory hierarchy
The widespread use of repeaters in long wires creates the possibility of dynamically sizing regular on-chip structures. We present a tunable cache and translation lookaside buffer (TLB) hierarchy that leverages repeater insertion to dynamically trade off size for speed and power consumption on a per...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on computers 2003-10, Vol.52 (10), p.1243-1258 |
---|---|
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 | 1258 |
---|---|
container_issue | 10 |
container_start_page | 1243 |
container_title | IEEE transactions on computers |
container_volume | 52 |
creator | Balasubramonian, R. Albonesi, D.H. Buyuktosunoglu, A. Dwarkadas, S. |
description | The widespread use of repeaters in long wires creates the possibility of dynamically sizing regular on-chip structures. We present a tunable cache and translation lookaside buffer (TLB) hierarchy that leverages repeater insertion to dynamically trade off size for speed and power consumption on a per-application phase basis using a novel configuration management algorithm. In comparison to a conventional design that is fixed at a single design point targeted to the average application, the dynamically tunable cache and TLB hierarchy can be tailored to the needs of each application phase. The configuration algorithm dynamically detects phase changes and selects a configuration based on the application's ability to tolerate different hit and miss latencies in order to improve the memory energy-delay product. We evaluate the performance and energy consumption of our approach and project the effects of technology scaling trends on our design. |
doi_str_mv | 10.1109/TC.2003.1234523 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_884354145</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1234523</ieee_id><sourcerecordid>901702727</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-9a7995bcc2a2d56795a9a7e97f7dbace9e91eaa2c3a0df12588ef97e49dcf7583</originalsourceid><addsrcrecordid>eNp9kLtrwzAQh0VpoWnauUMX0yGdnJxeljQGkz4g0CWdhSKfiYMfqRQP_u_rkEChQ6eDu-93x32EPFKYUwpmscnnDIDPKeNCMn5FJlRKlRojs2syAaA6NVzALbmLcQ8AGQMzIbNlUgytayrv6npIjn3rtjUmDTZdGJJdhcEFvxvuyU3p6ogPlzolX6-rTf6erj_fPvLlOvVcmGNqnBrvbb1njhUyU0a6sYVGlarYOo8GDUXnmOcOipIyqTWWRqEwhS-V1HxKXs57D6H77jEebVNFj3XtWuz6aA1QBUwxNZKzf0mmWSa0FCP4_Afcd31oxy-s1oJLQYUcocUZ8qGLMWBpD6FqXBgsBXvSaze5Pem1F71j4umcqBDxl75MfwBBsHR1</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884354145</pqid></control><display><type>article</type><title>A dynamically tunable memory hierarchy</title><source>IEEE Electronic Library (IEL)</source><creator>Balasubramonian, R. ; Albonesi, D.H. ; Buyuktosunoglu, A. ; Dwarkadas, S.</creator><creatorcontrib>Balasubramonian, R. ; Albonesi, D.H. ; Buyuktosunoglu, A. ; Dwarkadas, S.</creatorcontrib><description>The widespread use of repeaters in long wires creates the possibility of dynamically sizing regular on-chip structures. We present a tunable cache and translation lookaside buffer (TLB) hierarchy that leverages repeater insertion to dynamically trade off size for speed and power consumption on a per-application phase basis using a novel configuration management algorithm. In comparison to a conventional design that is fixed at a single design point targeted to the average application, the dynamically tunable cache and TLB hierarchy can be tailored to the needs of each application phase. The configuration algorithm dynamically detects phase changes and selects a configuration based on the application's ability to tolerate different hit and miss latencies in order to improve the memory energy-delay product. We evaluate the performance and energy consumption of our approach and project the effects of technology scaling trends on our design.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2003.1234523</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Buffers ; Cache memories ; Hierarchies ; Insertion ; Power consumption ; Reconfigurable architectures ; Repeaters ; Translations ; Wire</subject><ispartof>IEEE transactions on computers, 2003-10, Vol.52 (10), p.1243-1258</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-9a7995bcc2a2d56795a9a7e97f7dbace9e91eaa2c3a0df12588ef97e49dcf7583</citedby><cites>FETCH-LOGICAL-c349t-9a7995bcc2a2d56795a9a7e97f7dbace9e91eaa2c3a0df12588ef97e49dcf7583</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1234523$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1234523$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Balasubramonian, R.</creatorcontrib><creatorcontrib>Albonesi, D.H.</creatorcontrib><creatorcontrib>Buyuktosunoglu, A.</creatorcontrib><creatorcontrib>Dwarkadas, S.</creatorcontrib><title>A dynamically tunable memory hierarchy</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>The widespread use of repeaters in long wires creates the possibility of dynamically sizing regular on-chip structures. We present a tunable cache and translation lookaside buffer (TLB) hierarchy that leverages repeater insertion to dynamically trade off size for speed and power consumption on a per-application phase basis using a novel configuration management algorithm. In comparison to a conventional design that is fixed at a single design point targeted to the average application, the dynamically tunable cache and TLB hierarchy can be tailored to the needs of each application phase. The configuration algorithm dynamically detects phase changes and selects a configuration based on the application's ability to tolerate different hit and miss latencies in order to improve the memory energy-delay product. We evaluate the performance and energy consumption of our approach and project the effects of technology scaling trends on our design.</description><subject>Algorithms</subject><subject>Buffers</subject><subject>Cache memories</subject><subject>Hierarchies</subject><subject>Insertion</subject><subject>Power consumption</subject><subject>Reconfigurable architectures</subject><subject>Repeaters</subject><subject>Translations</subject><subject>Wire</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kLtrwzAQh0VpoWnauUMX0yGdnJxeljQGkz4g0CWdhSKfiYMfqRQP_u_rkEChQ6eDu-93x32EPFKYUwpmscnnDIDPKeNCMn5FJlRKlRojs2syAaA6NVzALbmLcQ8AGQMzIbNlUgytayrv6npIjn3rtjUmDTZdGJJdhcEFvxvuyU3p6ogPlzolX6-rTf6erj_fPvLlOvVcmGNqnBrvbb1njhUyU0a6sYVGlarYOo8GDUXnmOcOipIyqTWWRqEwhS-V1HxKXs57D6H77jEebVNFj3XtWuz6aA1QBUwxNZKzf0mmWSa0FCP4_Afcd31oxy-s1oJLQYUcocUZ8qGLMWBpD6FqXBgsBXvSaze5Pem1F71j4umcqBDxl75MfwBBsHR1</recordid><startdate>20031001</startdate><enddate>20031001</enddate><creator>Balasubramonian, R.</creator><creator>Albonesi, D.H.</creator><creator>Buyuktosunoglu, A.</creator><creator>Dwarkadas, 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></search><sort><creationdate>20031001</creationdate><title>A dynamically tunable memory hierarchy</title><author>Balasubramonian, R. ; Albonesi, D.H. ; Buyuktosunoglu, A. ; Dwarkadas, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-9a7995bcc2a2d56795a9a7e97f7dbace9e91eaa2c3a0df12588ef97e49dcf7583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithms</topic><topic>Buffers</topic><topic>Cache memories</topic><topic>Hierarchies</topic><topic>Insertion</topic><topic>Power consumption</topic><topic>Reconfigurable architectures</topic><topic>Repeaters</topic><topic>Translations</topic><topic>Wire</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Balasubramonian, R.</creatorcontrib><creatorcontrib>Albonesi, D.H.</creatorcontrib><creatorcontrib>Buyuktosunoglu, A.</creatorcontrib><creatorcontrib>Dwarkadas, 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><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Balasubramonian, R.</au><au>Albonesi, D.H.</au><au>Buyuktosunoglu, A.</au><au>Dwarkadas, S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A dynamically tunable memory hierarchy</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2003-10-01</date><risdate>2003</risdate><volume>52</volume><issue>10</issue><spage>1243</spage><epage>1258</epage><pages>1243-1258</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>The widespread use of repeaters in long wires creates the possibility of dynamically sizing regular on-chip structures. We present a tunable cache and translation lookaside buffer (TLB) hierarchy that leverages repeater insertion to dynamically trade off size for speed and power consumption on a per-application phase basis using a novel configuration management algorithm. In comparison to a conventional design that is fixed at a single design point targeted to the average application, the dynamically tunable cache and TLB hierarchy can be tailored to the needs of each application phase. The configuration algorithm dynamically detects phase changes and selects a configuration based on the application's ability to tolerate different hit and miss latencies in order to improve the memory energy-delay product. We evaluate the performance and energy consumption of our approach and project the effects of technology scaling trends on our design.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2003.1234523</doi><tpages>16</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0018-9340 |
ispartof | IEEE transactions on computers, 2003-10, Vol.52 (10), p.1243-1258 |
issn | 0018-9340 1557-9956 |
language | eng |
recordid | cdi_proquest_journals_884354145 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Buffers Cache memories Hierarchies Insertion Power consumption Reconfigurable architectures Repeaters Translations Wire |
title | A dynamically tunable memory hierarchy |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T09%3A58%3A31IST&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=A%20dynamically%20tunable%20memory%20hierarchy&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Balasubramonian,%20R.&rft.date=2003-10-01&rft.volume=52&rft.issue=10&rft.spage=1243&rft.epage=1258&rft.pages=1243-1258&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2003.1234523&rft_dat=%3Cproquest_RIE%3E901702727%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=884354145&rft_id=info:pmid/&rft_ieee_id=1234523&rfr_iscdi=true |