Making pointer-based data structures cache conscious
To narrow the widening gap between processor and memory performance, the authors propose improving the cache locality of pointer-manipulating programs and bolstering performance by careful placement of structure elements. It is concluded that considering past trends and future technology, it seems c...
Gespeichert in:
| Veröffentlicht in: | Computer (Long Beach, Calif.) Calif.), 2000-12, Vol.33 (12), p.67-74 |
|---|---|
| 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 | 74 |
|---|---|
| container_issue | 12 |
| container_start_page | 67 |
| container_title | Computer (Long Beach, Calif.) |
| container_volume | 33 |
| creator | Chilimbi, T.M. Hill, M.D. Larus, J.R. |
| description | To narrow the widening gap between processor and memory performance, the authors propose improving the cache locality of pointer-manipulating programs and bolstering performance by careful placement of structure elements. It is concluded that considering past trends and future technology, it seems clear that the processor-memory performance gap will continue to increase and software will continue to grow larger and more complex. Although cache-conscious algorithms and data structures are the first and perhaps best place to attack this performance problem, the complexity of software design and an increasing tendency to build large software systems by assembling smaller components does not favor a focused, integrated approach. We propose another, more incremental approach of cache-conscious data layout, which uses techniques such as clustering, coloring, and compression to enhance data locality by placing structure elements more carefully in the cache. |
| doi_str_mv | 10.1109/2.889095 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_197414371</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>889095</ieee_id><sourcerecordid>27578784</sourcerecordid><originalsourceid>FETCH-LOGICAL-c400t-3af9acc37f08b91d9740daa39fd093ec56564fb1d1fcbb73025a3ba7f1cf30673</originalsourceid><addsrcrecordid>eNqFkc1LxDAQxYMouK6CZ0_Fg3ipzjRJkxxl8QtWvOg5TNNEu-62a9Ie_O-t7KLgQU_DY368mcdj7BjhAhHMZXGhtQEjd9gEpdQ5aBS7bAKAOjdYFvvsIKXFKIWWfMLEA7017Uu27pq29zGvKPk6q6mnLPVxcP0QfcocuVefua5NrumGdMj2Ai2TP9rOKXu-uX6a3eXzx9v72dU8dwKgzzkFQ85xFUBXBmujBNRE3IQaDPdOlrIUocIag6sqxaGQxCtSAV3gUCo-ZWcb33Xs3gefertqkvPLJbV-fMMWWiljuPkfVFJppcUInv8JYqmwKMGor-Onv9BFN8R2zGtxTIKCK_zxc7FLKfpg17FZUfywCParD1vYTR8jerJBG-_9N7ZdfgKqPoO0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>197414371</pqid></control><display><type>article</type><title>Making pointer-based data structures cache conscious</title><source>IEEE Electronic Library (IEL)</source><creator>Chilimbi, T.M. ; Hill, M.D. ; Larus, J.R.</creator><creatorcontrib>Chilimbi, T.M. ; Hill, M.D. ; Larus, J.R.</creatorcontrib><description>To narrow the widening gap between processor and memory performance, the authors propose improving the cache locality of pointer-manipulating programs and bolstering performance by careful placement of structure elements. It is concluded that considering past trends and future technology, it seems clear that the processor-memory performance gap will continue to increase and software will continue to grow larger and more complex. Although cache-conscious algorithms and data structures are the first and perhaps best place to attack this performance problem, the complexity of software design and an increasing tendency to build large software systems by assembling smaller components does not favor a focused, integrated approach. We propose another, more incremental approach of cache-conscious data layout, which uses techniques such as clustering, coloring, and compression to enhance data locality by placing structure elements more carefully in the cache.</description><identifier>ISSN: 0018-9162</identifier><identifier>EISSN: 1558-0814</identifier><identifier>DOI: 10.1109/2.889095</identifier><identifier>CODEN: CPTRB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Arithmetic ; Assembling ; Compressing ; Computer memory ; Computer programs ; Computer science ; Costs ; Data structures ; Delay ; Design engineering ; Hardware ; Microprocessors ; Multithreading ; Placing ; Prefetching ; Programming profession ; Random access memory ; Scheduling ; Software</subject><ispartof>Computer (Long Beach, Calif.), 2000-12, Vol.33 (12), p.67-74</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2000</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c400t-3af9acc37f08b91d9740daa39fd093ec56564fb1d1fcbb73025a3ba7f1cf30673</citedby><cites>FETCH-LOGICAL-c400t-3af9acc37f08b91d9740daa39fd093ec56564fb1d1fcbb73025a3ba7f1cf30673</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/889095$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/889095$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chilimbi, T.M.</creatorcontrib><creatorcontrib>Hill, M.D.</creatorcontrib><creatorcontrib>Larus, J.R.</creatorcontrib><title>Making pointer-based data structures cache conscious</title><title>Computer (Long Beach, Calif.)</title><addtitle>MC</addtitle><description>To narrow the widening gap between processor and memory performance, the authors propose improving the cache locality of pointer-manipulating programs and bolstering performance by careful placement of structure elements. It is concluded that considering past trends and future technology, it seems clear that the processor-memory performance gap will continue to increase and software will continue to grow larger and more complex. Although cache-conscious algorithms and data structures are the first and perhaps best place to attack this performance problem, the complexity of software design and an increasing tendency to build large software systems by assembling smaller components does not favor a focused, integrated approach. We propose another, more incremental approach of cache-conscious data layout, which uses techniques such as clustering, coloring, and compression to enhance data locality by placing structure elements more carefully in the cache.</description><subject>Arithmetic</subject><subject>Assembling</subject><subject>Compressing</subject><subject>Computer memory</subject><subject>Computer programs</subject><subject>Computer science</subject><subject>Costs</subject><subject>Data structures</subject><subject>Delay</subject><subject>Design engineering</subject><subject>Hardware</subject><subject>Microprocessors</subject><subject>Multithreading</subject><subject>Placing</subject><subject>Prefetching</subject><subject>Programming profession</subject><subject>Random access memory</subject><subject>Scheduling</subject><subject>Software</subject><issn>0018-9162</issn><issn>1558-0814</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkc1LxDAQxYMouK6CZ0_Fg3ipzjRJkxxl8QtWvOg5TNNEu-62a9Ie_O-t7KLgQU_DY368mcdj7BjhAhHMZXGhtQEjd9gEpdQ5aBS7bAKAOjdYFvvsIKXFKIWWfMLEA7017Uu27pq29zGvKPk6q6mnLPVxcP0QfcocuVefua5NrumGdMj2Ai2TP9rOKXu-uX6a3eXzx9v72dU8dwKgzzkFQ85xFUBXBmujBNRE3IQaDPdOlrIUocIag6sqxaGQxCtSAV3gUCo-ZWcb33Xs3gefertqkvPLJbV-fMMWWiljuPkfVFJppcUInv8JYqmwKMGor-Onv9BFN8R2zGtxTIKCK_zxc7FLKfpg17FZUfywCParD1vYTR8jerJBG-_9N7ZdfgKqPoO0</recordid><startdate>20001201</startdate><enddate>20001201</enddate><creator>Chilimbi, T.M.</creator><creator>Hill, M.D.</creator><creator>Larus, J.R.</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>20001201</creationdate><title>Making pointer-based data structures cache conscious</title><author>Chilimbi, T.M. ; Hill, M.D. ; Larus, J.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c400t-3af9acc37f08b91d9740daa39fd093ec56564fb1d1fcbb73025a3ba7f1cf30673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Arithmetic</topic><topic>Assembling</topic><topic>Compressing</topic><topic>Computer memory</topic><topic>Computer programs</topic><topic>Computer science</topic><topic>Costs</topic><topic>Data structures</topic><topic>Delay</topic><topic>Design engineering</topic><topic>Hardware</topic><topic>Microprocessors</topic><topic>Multithreading</topic><topic>Placing</topic><topic>Prefetching</topic><topic>Programming profession</topic><topic>Random access memory</topic><topic>Scheduling</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chilimbi, T.M.</creatorcontrib><creatorcontrib>Hill, M.D.</creatorcontrib><creatorcontrib>Larus, J.R.</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>Computer (Long Beach, Calif.)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chilimbi, T.M.</au><au>Hill, M.D.</au><au>Larus, J.R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Making pointer-based data structures cache conscious</atitle><jtitle>Computer (Long Beach, Calif.)</jtitle><stitle>MC</stitle><date>2000-12-01</date><risdate>2000</risdate><volume>33</volume><issue>12</issue><spage>67</spage><epage>74</epage><pages>67-74</pages><issn>0018-9162</issn><eissn>1558-0814</eissn><coden>CPTRB4</coden><abstract>To narrow the widening gap between processor and memory performance, the authors propose improving the cache locality of pointer-manipulating programs and bolstering performance by careful placement of structure elements. It is concluded that considering past trends and future technology, it seems clear that the processor-memory performance gap will continue to increase and software will continue to grow larger and more complex. Although cache-conscious algorithms and data structures are the first and perhaps best place to attack this performance problem, the complexity of software design and an increasing tendency to build large software systems by assembling smaller components does not favor a focused, integrated approach. We propose another, more incremental approach of cache-conscious data layout, which uses techniques such as clustering, coloring, and compression to enhance data locality by placing structure elements more carefully in the cache.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/2.889095</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9162 |
| ispartof | Computer (Long Beach, Calif.), 2000-12, Vol.33 (12), p.67-74 |
| issn | 0018-9162 1558-0814 |
| language | eng |
| recordid | cdi_proquest_journals_197414371 |
| source | IEEE Electronic Library (IEL) |
| subjects | Arithmetic Assembling Compressing Computer memory Computer programs Computer science Costs Data structures Delay Design engineering Hardware Microprocessors Multithreading Placing Prefetching Programming profession Random access memory Scheduling Software |
| title | Making pointer-based data structures cache conscious |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T11%3A52%3A43IST&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=Making%20pointer-based%20data%20structures%20cache%20conscious&rft.jtitle=Computer%20(Long%20Beach,%20Calif.)&rft.au=Chilimbi,%20T.M.&rft.date=2000-12-01&rft.volume=33&rft.issue=12&rft.spage=67&rft.epage=74&rft.pages=67-74&rft.issn=0018-9162&rft.eissn=1558-0814&rft.coden=CPTRB4&rft_id=info:doi/10.1109/2.889095&rft_dat=%3Cproquest_RIE%3E27578784%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=197414371&rft_id=info:pmid/&rft_ieee_id=889095&rfr_iscdi=true |