Compiler transformations for effectively exploiting a zero overhead loop buffer

A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times without incurring any loop overhead. Unlike loop u...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Software, practice & experience practice & experience, 2005-04, Vol.35 (4), p.393-412
Hauptverfasser: Uh, Gang-Ryung, Wang, Yuhong, Whalley, David, Jinturkar, Sanjay, Paek, Yunheung, Cao, Vincent, Burns, Chris
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 412
container_issue 4
container_start_page 393
container_title Software, practice & experience
container_volume 35
creator Uh, Gang-Ryung
Wang, Yuhong
Whalley, David
Jinturkar, Sanjay
Paek, Yunheung
Cao, Vincent
Burns, Chris
description A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times without incurring any loop overhead. Unlike loop unrolling, a loop buffer can be used to minimize loop overhead without the penalty of increasing code size. In addition, a ZOLB requires relatively little space and power, which are both important considerations for most DSP applications. This paper describes strategies for generating code to effectively use a ZOLB. We have found that many common code improving transformations used by optimizing compilers on conventional architectures can be easily used to (1) allow more loops to be placed in a ZOLB, (2) further reduce loop overhead of the loops placed in a ZOLB, and (3) avoid redundant loading of ZOLB loops. The results given in this paper demonstrate that this architectural feature can often be exploited with substantial improvements in execution time and slight reductions in code size for various signal processing applications. Copyright © 2004 John Wiley & Sons, Ltd.
doi_str_mv 10.1002/spe.642
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28528990</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28528990</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3302-196acf338551014630dbcee8272647566efa8137ab7c06e2f9c38ca0849171663</originalsourceid><addsrcrecordid>eNp10DFPwzAQhmELgUQpiL_gCQaUcrYTJxlRKQVR0aqAYLNc9wKBJA52Wlp-PUFBbEx3w6NveAk5ZjBgAPzc1ziQId8hPQZpHAAPn3dJD0AkAcgw3CcH3r8BMBZx2SPToS3rvEBHG6crn1lX6ia3laftSzHL0DT5GostxU1d2LzJqxeq6Rc6S-0a3SvqJS2sreli1WJ3SPYyXXg8-r198ng1ehheB5Pp-GZ4MQmMEMADlkptMiGSKGLAQilguTCICY-5DONISsx0wkSsF7EBiTxLjUiMhiRMWcykFH1y0u3Wzn6s0DeqzL3BotAV2pVXPIl4kqbQwtMOGme9d5ip2uWldlvFQP0EU20w1QZr5VknP9se2_-Yup-NOh10OvcNbv60du9KxiKO1NPdWM3lrbyU85mai2-PhXtB</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28528990</pqid></control><display><type>article</type><title>Compiler transformations for effectively exploiting a zero overhead loop buffer</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Uh, Gang-Ryung ; Wang, Yuhong ; Whalley, David ; Jinturkar, Sanjay ; Paek, Yunheung ; Cao, Vincent ; Burns, Chris</creator><creatorcontrib>Uh, Gang-Ryung ; Wang, Yuhong ; Whalley, David ; Jinturkar, Sanjay ; Paek, Yunheung ; Cao, Vincent ; Burns, Chris</creatorcontrib><description>A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times without incurring any loop overhead. Unlike loop unrolling, a loop buffer can be used to minimize loop overhead without the penalty of increasing code size. In addition, a ZOLB requires relatively little space and power, which are both important considerations for most DSP applications. This paper describes strategies for generating code to effectively use a ZOLB. We have found that many common code improving transformations used by optimizing compilers on conventional architectures can be easily used to (1) allow more loops to be placed in a ZOLB, (2) further reduce loop overhead of the loops placed in a ZOLB, and (3) avoid redundant loading of ZOLB loops. The results given in this paper demonstrate that this architectural feature can often be exploited with substantial improvements in execution time and slight reductions in code size for various signal processing applications. Copyright © 2004 John Wiley &amp; Sons, Ltd.</description><identifier>ISSN: 0038-0644</identifier><identifier>EISSN: 1097-024X</identifier><identifier>DOI: 10.1002/spe.642</identifier><language>eng</language><publisher>Chichester, UK: John Wiley &amp; Sons, Ltd</publisher><subject>compiler ; DSP ; optimization ; ZOLB</subject><ispartof>Software, practice &amp; experience, 2005-04, Vol.35 (4), p.393-412</ispartof><rights>Copyright © 2004 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3302-196acf338551014630dbcee8272647566efa8137ab7c06e2f9c38ca0849171663</citedby><cites>FETCH-LOGICAL-c3302-196acf338551014630dbcee8272647566efa8137ab7c06e2f9c38ca0849171663</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fspe.642$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fspe.642$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1416,27915,27916,45565,45566</link.rule.ids></links><search><creatorcontrib>Uh, Gang-Ryung</creatorcontrib><creatorcontrib>Wang, Yuhong</creatorcontrib><creatorcontrib>Whalley, David</creatorcontrib><creatorcontrib>Jinturkar, Sanjay</creatorcontrib><creatorcontrib>Paek, Yunheung</creatorcontrib><creatorcontrib>Cao, Vincent</creatorcontrib><creatorcontrib>Burns, Chris</creatorcontrib><title>Compiler transformations for effectively exploiting a zero overhead loop buffer</title><title>Software, practice &amp; experience</title><addtitle>Softw: Pract. Exper</addtitle><description>A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times without incurring any loop overhead. Unlike loop unrolling, a loop buffer can be used to minimize loop overhead without the penalty of increasing code size. In addition, a ZOLB requires relatively little space and power, which are both important considerations for most DSP applications. This paper describes strategies for generating code to effectively use a ZOLB. We have found that many common code improving transformations used by optimizing compilers on conventional architectures can be easily used to (1) allow more loops to be placed in a ZOLB, (2) further reduce loop overhead of the loops placed in a ZOLB, and (3) avoid redundant loading of ZOLB loops. The results given in this paper demonstrate that this architectural feature can often be exploited with substantial improvements in execution time and slight reductions in code size for various signal processing applications. Copyright © 2004 John Wiley &amp; Sons, Ltd.</description><subject>compiler</subject><subject>DSP</subject><subject>optimization</subject><subject>ZOLB</subject><issn>0038-0644</issn><issn>1097-024X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp10DFPwzAQhmELgUQpiL_gCQaUcrYTJxlRKQVR0aqAYLNc9wKBJA52Wlp-PUFBbEx3w6NveAk5ZjBgAPzc1ziQId8hPQZpHAAPn3dJD0AkAcgw3CcH3r8BMBZx2SPToS3rvEBHG6crn1lX6ia3laftSzHL0DT5GostxU1d2LzJqxeq6Rc6S-0a3SvqJS2sreli1WJ3SPYyXXg8-r198ng1ehheB5Pp-GZ4MQmMEMADlkptMiGSKGLAQilguTCICY-5DONISsx0wkSsF7EBiTxLjUiMhiRMWcykFH1y0u3Wzn6s0DeqzL3BotAV2pVXPIl4kqbQwtMOGme9d5ip2uWldlvFQP0EU20w1QZr5VknP9se2_-Yup-NOh10OvcNbv60du9KxiKO1NPdWM3lrbyU85mai2-PhXtB</recordid><startdate>20050410</startdate><enddate>20050410</enddate><creator>Uh, Gang-Ryung</creator><creator>Wang, Yuhong</creator><creator>Whalley, David</creator><creator>Jinturkar, Sanjay</creator><creator>Paek, Yunheung</creator><creator>Cao, Vincent</creator><creator>Burns, Chris</creator><general>John Wiley &amp; Sons, Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20050410</creationdate><title>Compiler transformations for effectively exploiting a zero overhead loop buffer</title><author>Uh, Gang-Ryung ; Wang, Yuhong ; Whalley, David ; Jinturkar, Sanjay ; Paek, Yunheung ; Cao, Vincent ; Burns, Chris</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3302-196acf338551014630dbcee8272647566efa8137ab7c06e2f9c38ca0849171663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>compiler</topic><topic>DSP</topic><topic>optimization</topic><topic>ZOLB</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Uh, Gang-Ryung</creatorcontrib><creatorcontrib>Wang, Yuhong</creatorcontrib><creatorcontrib>Whalley, David</creatorcontrib><creatorcontrib>Jinturkar, Sanjay</creatorcontrib><creatorcontrib>Paek, Yunheung</creatorcontrib><creatorcontrib>Cao, Vincent</creatorcontrib><creatorcontrib>Burns, Chris</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>Software, practice &amp; experience</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Uh, Gang-Ryung</au><au>Wang, Yuhong</au><au>Whalley, David</au><au>Jinturkar, Sanjay</au><au>Paek, Yunheung</au><au>Cao, Vincent</au><au>Burns, Chris</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Compiler transformations for effectively exploiting a zero overhead loop buffer</atitle><jtitle>Software, practice &amp; experience</jtitle><addtitle>Softw: Pract. Exper</addtitle><date>2005-04-10</date><risdate>2005</risdate><volume>35</volume><issue>4</issue><spage>393</spage><epage>412</epage><pages>393-412</pages><issn>0038-0644</issn><eissn>1097-024X</eissn><abstract>A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times without incurring any loop overhead. Unlike loop unrolling, a loop buffer can be used to minimize loop overhead without the penalty of increasing code size. In addition, a ZOLB requires relatively little space and power, which are both important considerations for most DSP applications. This paper describes strategies for generating code to effectively use a ZOLB. We have found that many common code improving transformations used by optimizing compilers on conventional architectures can be easily used to (1) allow more loops to be placed in a ZOLB, (2) further reduce loop overhead of the loops placed in a ZOLB, and (3) avoid redundant loading of ZOLB loops. The results given in this paper demonstrate that this architectural feature can often be exploited with substantial improvements in execution time and slight reductions in code size for various signal processing applications. Copyright © 2004 John Wiley &amp; Sons, Ltd.</abstract><cop>Chichester, UK</cop><pub>John Wiley &amp; Sons, Ltd</pub><doi>10.1002/spe.642</doi><tpages>20</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0038-0644
ispartof Software, practice & experience, 2005-04, Vol.35 (4), p.393-412
issn 0038-0644
1097-024X
language eng
recordid cdi_proquest_miscellaneous_28528990
source Wiley Online Library Journals Frontfile Complete
subjects compiler
DSP
optimization
ZOLB
title Compiler transformations for effectively exploiting a zero overhead loop buffer
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T06%3A17%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Compiler%20transformations%20for%20effectively%20exploiting%20a%20zero%20overhead%20loop%20buffer&rft.jtitle=Software,%20practice%20&%20experience&rft.au=Uh,%20Gang-Ryung&rft.date=2005-04-10&rft.volume=35&rft.issue=4&rft.spage=393&rft.epage=412&rft.pages=393-412&rft.issn=0038-0644&rft.eissn=1097-024X&rft_id=info:doi/10.1002/spe.642&rft_dat=%3Cproquest_cross%3E28528990%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28528990&rft_id=info:pmid/&rfr_iscdi=true