{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:30:39Z","timestamp":1740144639569,"version":"3.37.3"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"US National Science Foundation","award":["1730309\/1719160\/1500848"],"award-info":[{"award-number":["1730309\/1719160\/1500848"]}]},{"name":"CRISP"},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Arch. Lett."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1109\/lca.2018.2864964","type":"journal-article","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T19:19:56Z","timestamp":1535051996000},"page":"197-200","source":"Crossref","is-referenced-by-count":6,"title":["Exploring Core and Cache Hierarchy Bottlenecks in Graph Processing Workloads"],"prefix":"10.1109","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5275-4558","authenticated-orcid":false,"given":"Abanti","family":"Basak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangchen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7119-6934","authenticated-orcid":false,"given":"Sang Min","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"SNAP datasets: Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815971"},{"key":"ref12","first-page":"52","article-title":"Data\n prefetching by dependence graph precomputation","author":"annavaram","year":"2001","journal-title":"Proc Int Symp Comput Archit"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.46"},{"key":"ref4","first-page":"463","article-title":"Graph analytics through fine-grained parallelism","author":"shang","year":"2016","journal-title":"Proc Int Conf Manage Data"},{"key":"ref3","first-page":"1105","article-title":"Ringo:\n Interactive graph analytics on big-memory machines","author":"perez","year":"2015","journal-title":"Proc Int Conf Manage Data"},{"key":"ref6","first-page":"49","article-title":"Parallel graph processing on modern multi-core servers: New\n findings and remaining challenges","author":"eisenman","year":"2016","journal-title":"Proc Int Symp Model Anal Simul Comput Telecommun Syst"},{"key":"ref5","first-page":"56","article-title":"Locality\n exists in graph processing: Workload characterization on an Ivy bridge server","author":"beamer","year":"2015","journal-title":"Proc Int Symp Workload Characterization"},{"article-title":"CACTI 6.0","year":"2009","author":"muralimanohar","key":"ref8"},{"key":"ref7","first-page":"52:1","article-title":"Sniper:\n Exploring the level of abstraction for scalable and accurate parallel multi-core simulation","author":"carlson","year":"2011","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"key":"ref2","first-page":"31","article-title":"GraphChi: Large-scale graph computation on just a PC","author":"kyrola","year":"2012","journal-title":"Proc USENIX Conf Operating System Design and Implementations"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"ref9","article-title":"The GAP benchmark suite","volume":"abs 1508 3619","author":"beamer","year":"2015","journal-title":"CoRR"}],"container-title":["IEEE Computer Architecture Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/10208\/8318337\/8444676-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10208\/8318337\/08444676.pdf?arnumber=8444676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:59Z","timestamp":1649443919000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8444676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":13,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lca.2018.2864964","relation":{},"ISSN":["1556-6056","1556-6064","2473-2575"],"issn-type":[{"type":"print","value":"1556-6056"},{"type":"electronic","value":"1556-6064"},{"type":"electronic","value":"2473-2575"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}