{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:30:37Z","timestamp":1740144637203,"version":"3.37.3"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1117042"],"award-info":[{"award-number":["CCF-1117042"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-13-2-0005."],"award-info":[{"award-number":["HR0011-13-2-0005."]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Arch. Lett."],"published-print":{"date-parts":[[2017,7,1]]},"DOI":"10.1109\/lca.2017.2695178","type":"journal-article","created":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T18:29:02Z","timestamp":1492540142000},"page":"119-122","source":"Crossref","is-referenced-by-count":4,"title":["Guiding Locality Optimizations for Graph Computations via Reuse Distance Analysis"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8027-1449","authenticated-orcid":false,"given":"Abdel-Hameed A.","family":"Badawy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0341-2644","authenticated-orcid":false,"given":"Donald","family":"Yeung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485965"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693482"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377906"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2851503"},{"key":"ref11","first-page":"1","article-title":"The efficacy of software prefetching and\n locality optimizations on future memory systems","volume":"6","author":"badawy","year":"2004","journal-title":"J Instruction-Level Parallelism"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2427631.2427632"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.20303"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2247684.2247687"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.21287"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1104"}],"container-title":["IEEE Computer Architecture Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10208\/8240814\/07903666.pdf?arnumber=7903666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:04Z","timestamp":1642004704000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7903666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,1]]},"references-count":11,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lca.2017.2695178","relation":{},"ISSN":["1556-6056"],"issn-type":[{"type":"print","value":"1556-6056"}],"subject":[],"published":{"date-parts":[[2017,7,1]]}}}