Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs
Literature is plentiful in works exploiting cache locality for GPUs. A majority of them explore replacement or bypassing policies. In this paper, however, we surpass this exploration by fabricating a formal proof for a no-overhead quasi-optimal caching technique for caching textures in graphics work...
Uloženo v:
| Vydáno v: | 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) s. 124 - 136 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
21.10.2023
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Literature is plentiful in works exploiting cache locality for GPUs. A majority of them explore replacement or bypassing policies. In this paper, however, we surpass this exploration by fabricating a formal proof for a no-overhead quasi-optimal caching technique for caching textures in graphics workloads. Textures make up a significant part of main memory traffic in mobile GPUs, which contributes to the total GPU energy consumption. Since texture accesses use a shared L2 cache, improving the L2 texture caching efficiency would decrease main memory traffic, thus improving energy efficiency, which is crucial for mobile GPUs. Our proposal reaches quasi-optimality by exploiting the frame-to-frame reuse of textures in graphics. We do this by traversing frames in a boustrophedonic 1 1 Boustrophedon is a style of writing in which alternate lines of writing are reversed in order. This is in contrast to most modern languages, where the order of lines is the same, usually left-to-right. manner w.r.t. the frame-to-frame tile order. We first approximate the texture access trace to a circular trace and then forge a formal proof for our proposal being optimal for such traces. We also complement the proof with empirical data that demonstrates the quasi-optimality of our no-cost proposal. |
|---|---|
| AbstractList | Literature is plentiful in works exploiting cache locality for GPUs. A majority of them explore replacement or bypassing policies. In this paper, however, we surpass this exploration by fabricating a formal proof for a no-overhead quasi-optimal caching technique for caching textures in graphics workloads. Textures make up a significant part of main memory traffic in mobile GPUs, which contributes to the total GPU energy consumption. Since texture accesses use a shared L2 cache, improving the L2 texture caching efficiency would decrease main memory traffic, thus improving energy efficiency, which is crucial for mobile GPUs. Our proposal reaches quasi-optimality by exploiting the frame-to-frame reuse of textures in graphics. We do this by traversing frames in a boustrophedonic 1 1 Boustrophedon is a style of writing in which alternate lines of writing are reversed in order. This is in contrast to most modern languages, where the order of lines is the same, usually left-to-right. manner w.r.t. the frame-to-frame tile order. We first approximate the texture access trace to a circular trace and then forge a formal proof for our proposal being optimal for such traces. We also complement the proof with empirical data that demonstrates the quasi-optimality of our no-cost proposal. |
| Author | Parcerisa, Joan-Manuel Gonzalez, Antonio Joseph, Diya Aragon, Juan L. |
| Author_xml | – sequence: 1 givenname: Diya surname: Joseph fullname: Joseph, Diya organization: Universitat Politècnica de Catalunya,Barcelona,Spain – sequence: 2 givenname: Juan L. surname: Aragon fullname: Aragon, Juan L. organization: Universidad de Murcia,Murcia,Spain – sequence: 3 givenname: Joan-Manuel surname: Parcerisa fullname: Parcerisa, Joan-Manuel – sequence: 4 givenname: Antonio surname: Gonzalez fullname: Gonzalez, Antonio organization: Universitat Politècnica de Catalunya,Barcelona,Spain |
| BookMark | eNotzt1KwzAYgOEICursHewgN9CaLz9N49ks2xQKm9Adj69p6gJbW5IW9O4duKP37OV5Jvf90DtClsAyAGZe96uyVgWAzjjjImOMgbkjidGmEIoJyZUUjySJ0TdMaS00N-KJrN-HOU5hGE-uHXpv6SbgxcU3-jVj9OlunPwFz7TitER78v037YZAa_czzcFF6nu63R_iC3no8BxdcuuCHDbruvxIq932s1xVKQrBp9QBysY02FkOum2chrwznSoUogWpdZtrUPqqUw20WtqiRZsjs0YiygJRLMjy_-udc8cxXG3h9whM5DJnUvwByglMgw |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/PACT58117.2023.00019 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798350342543 |
| EndPage | 136 |
| ExternalDocumentID | 10364604 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK LHSKQ RIE RIL |
| ID | FETCH-LOGICAL-a332t-e1a4b9bafc217dbe716f9f585aac1477d671570575b1d74c8dac6a0c94aa48aa3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001165646800011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:24:17 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a332t-e1a4b9bafc217dbe716f9f585aac1477d671570575b1d74c8dac6a0c94aa48aa3 |
| OpenAccessLink | http://hdl.handle.net/2117/403438 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_10364604 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Oct.-21 |
| PublicationDateYYYYMMDD | 2023-10-21 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-Oct.-21 day: 21 |
| PublicationDecade | 2020 |
| PublicationTitle | 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) |
| PublicationTitleAbbrev | PACT |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib057737293 |
| Score | 2.2422588 |
| Snippet | Literature is plentiful in works exploiting cache locality for GPUs. A majority of them explore replacement or bypassing policies. In this paper, however, we... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 124 |
| SubjectTerms | Benchmark testing Caches Energy consumption Energy efficiency GPU Graphics Graphics processing units Low-power Memory management Switches Texture Writing |
| Title | Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs |
| URI | https://ieeexplore.ieee.org/document/10364604 |
| WOSCitedRecordID | wos001165646800011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhECXaePCkxhq1ajh4pZaF5cObNq0emrombdJbAwybNNGt6Xb9_QJtNR48eCNcCDMw8wbmzSB0m0PPaSV80IAEwql3xNJMEPDaqdJpK30iCo_keKxmM11syeqJC-O9T8lnvhuH6S8flq6JT2XhhjPBRaz-uS-l3JC1docnl7HhimZbehzt6bvioT_JI5GyG3uEdxOc-dVEJfmQ4dE_Vz9G7R82Hi6-_cwJ2vPVKRo8LuMrRawKALG6LR7GLKv6Hr82pl6Ql2AJ3s0bHmW4v0mXxAGd4kkwxU0IsPGiwk_FtG6j6XAw6T-TbUsEYhjL1sRTw622pnQhlADrQ7RT6jJAfmMc5VKCkDSXEYNZCpI7BcYJE9TBjeHKGHaGWtWy8ucIl7KULut5ABYgEQXrQHEAwbjiytr8ArWjDOYfm6oX8932L_-Y76DDKOZo1zN6hVrrVeOv0YH7XC_q1U3S1RfkypX4 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhECVGTfSkxhq_5eB1a1nYBbxp01rjWtdkm_TWAMMmTXRrul1_v0BbjQcP3ggXwgzMvIF5MwhdJ9AxUqTWaYBDxIg1kSZxGoGVRpRGam4DUTjjw6EYj2W-IqsHLoy1NiSf2bYfhr98mJnGP5W5G05Tlvrqn1sJYzFZ0rXWxyfhvuWKpCuCHOnIm_yuWySeStn2XcLbAdD8aqMSvEh_75_r76PWDx8P59-e5gBt2OoQ9e5n_p3C1wUAX98W932eVX2LXxtVT6MXZwve1RvOYtxdJkxih09x4Yxx40JsPK3wQz6qW2jU7xXdQbRqihApSuNFZIliWmpVGhdMgLYu3ill6UC_UoYwziHlJOEehWkCnBkByqTKKYQpxYRS9AhtVrPKHiNc8pKbuGMBqANFBLQBwQBSygQTWicnqOVlMPlY1r2YrLd_-sf8FdoZFM_ZJHscPp2hXS9yb-Vjco42F_PGXqBt87mY1vPLoLcv5ESZPw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+32nd+International+Conference+on+Parallel+Architectures+and+Compilation+Techniques+%28PACT%29&rft.atitle=Boustrophedonic+Frames%3A+Quasi-Optimal+L2+Caching+for+Textures+in+GPUs&rft.au=Joseph%2C+Diya&rft.au=Aragon%2C+Juan+L.&rft.au=Parcerisa%2C+Joan-Manuel&rft.au=Gonzalez%2C+Antonio&rft.date=2023-10-21&rft.pub=IEEE&rft.spage=124&rft.epage=136&rft_id=info:doi/10.1109%2FPACT58117.2023.00019&rft.externalDocID=10364604 |