{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:30:42Z","timestamp":1740144642880,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Arch. Lett."],"published-print":{"date-parts":[[2020,7,1]]},"DOI":"10.1109\/lca.2020.3005895","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T20:59:10Z","timestamp":1593550750000},"page":"101-104","source":"Crossref","is-referenced-by-count":2,"title":["The Case for Domain-Specialized Branch Predictors for Graph-Processing"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8031-2850","authenticated-orcid":false,"given":"Ahmed","family":"Samara","sequence":"first","affiliation":[]},{"given":"James","family":"Tuck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"91","article-title":"Sniper: Scalable and accurate parallel multi-core simulation","author":"heirman","year":"2012","journal-title":"Proc 8th Int Summer School Adv Comput Archit Compilation High-Perform Embedded Syst Abstracts"},{"year":"2017","author":"beamer","article-title":"The GAP benchmark suite","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ISPASS.2009.4919652"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2155620.2155635"},{"year":"2020","author":"samara","article-title":"AhmedSamara\/GABPS-branch-analysis","key":"ref14"},{"year":"0","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ISPASS.2010.5452016"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/3-540-39999-2_8"},{"year":"0","author":"beamer","article-title":"Searching for a parent instead of fighting over children: A fast breadth-first search implementation for Graph500","key":"ref18"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/MICRO.2001.991128"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/2488388.2488433"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.14778\/2824032.2824077"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/MIC.2018.032501520"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.14778\/3007263.3007267"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/HiPC.2017.00039"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/HPCA.2019.00051"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/1807167.1807184"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/2463676.2467799"},{"year":"2014","author":"green","article-title":"Branch-avoiding graph algorithms","key":"ref9"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/HPCA.2003.1183536"}],"container-title":["IEEE Computer Architecture Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10208\/9146252\/09130080.pdf?arnumber=9130080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:01:08Z","timestamp":1651078868000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9130080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":20,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lca.2020.3005895","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":[[2020,7,1]]}}}