{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:13Z","timestamp":1740169093050,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFB1000302"],"award-info":[{"award-number":["2016YFB1000302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433019","U1435217","U1611261"],"award-info":[{"award-number":["61433019","U1435217","U1611261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Guangdong Introducing Innovative and Enterpreneurial Teams","award":["2016ZT06D211"],"award-info":[{"award-number":["2016ZT06D211"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2869463","type":"journal-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T20:10:58Z","timestamp":1537560658000},"page":"51429-51439","source":"Crossref","is-referenced-by-count":2,"title":["Graph Analytics on Manycore Memory Systems"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1476-7603","authenticated-orcid":false,"given":"Yuxuan","family":"Xing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nong","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.117"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157799"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.30"},{"key":"ref32","first-page":"1","article-title":"PowerLyra: Differentiated graph computation and partitioning on skewed graphs","author":"chen","year":"2015","journal-title":"Proc EuroSys"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/2688500.2688507","article-title":"NUMA-aware graph-structured analytics","author":"zhang","year":"2015","journal-title":"Proc PPOPP"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"ref37","first-page":"235","article-title":"Groute: An asynchronous multi-GPU programming model for irregular computations","author":"ben-nun","year":"2017","journal-title":"Proc PPOPP"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522714"},{"journal-title":"Intel Cilk Plus","year":"2012","key":"ref35"},{"journal-title":"OpenMP Application Programming Interface Version 4 5","year":"2015","key":"ref34"},{"key":"ref10","first-page":"375","article-title":"GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning","author":"zhu","year":"2015","journal-title":"Proc ATC"},{"key":"ref11","first-page":"45","article-title":"FlashGraph: Processing billion-node graphs on an array of commodity SSDs","author":"da zheng","year":"2015","journal-title":"Proc FAST"},{"key":"ref12","first-page":"285","article-title":"Graphene: Fine-grained io management for graph computing","author":"liu","year":"2017","journal-title":"Proc FAST"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/2370816.2370866","article-title":"A Yoke of Oxen and a Thousand Chickens for Heavy Lifting Graph Processing","author":"abdullah gharaibeh","year":"2012","journal-title":"In International Conference on Parallel Architectures and Compilation Techniques (PACT)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915204"},{"key":"ref15","first-page":"207","article-title":"Garaph: Efficient GPU-accelerated graph processing on a single machine with balanced replication","author":"ma","year":"2017","journal-title":"Proc ATC"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2015.7477467"},{"journal-title":"Intel Xeon Phi Processor High Performance Programming Knights Landing Edition","year":"2016","author":"reinders","key":"ref17"},{"journal-title":"What public disclosures has Intel made about Knights Landing","year":"2016","author":"gardner","key":"ref18"},{"journal-title":"Best Practice Guide - Knights Landing","year":"2017","author":"codreanu","key":"ref19"},{"journal-title":"Laboratory for Web Algorithmics","year":"2004","key":"ref28"},{"key":"ref4","first-page":"599","article-title":"GraphX: Graph processing in a distributed dataflow framework","author":"gonzalez","year":"2014","journal-title":"Proc OSDI"},{"journal-title":"Stanford Large Network Dataset Collection","year":"2014","key":"ref27"},{"key":"ref3","first-page":"5","article-title":"Giraph: Large-scale graph processing infrastructure on Hadoop","author":"avery","year":"2011","journal-title":"Hadoop Summit"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"ref29","first-page":"497","article-title":"HPGraph: A high parallel graph processing system based on flash array","author":"xing","year":"2016","journal-title":"Proc HPCC"},{"key":"ref5","first-page":"301","article-title":"Gemini: A computation-centric distributed graph processing system","author":"zhu","year":"2016","journal-title":"Proc OSDI"},{"key":"ref8","first-page":"31","article-title":"GraphChi: Large-scale graph computation on just a PC","author":"kyrola","year":"2012","journal-title":"Proc OSDI"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/2517327.2442530","article-title":"Ligra: A lightweight graph processing framework for shared memory","volume":"48","author":"shun","year":"2013","journal-title":"ACM SIGPLAN Notices"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref20","first-page":"17","article-title":"PowerGraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"Proc OSDI"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the Internet topology","author":"faloutsos","year":"1999","journal-title":"Proc SIGCOMM"},{"journal-title":"Intel memory latency checker v3 0","year":"2013","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","author":"brin","year":"1998","journal-title":"Computer Netw ISDN Syst"},{"article-title":"Learning from labeled and unlabeled data with label propagation","year":"2002","author":"zhu","key":"ref26"},{"key":"ref25","article-title":"Fast computation of empirically tight bounds for the diameter of massive graphs","volume":"13","author":"malewicz","year":"2009","journal-title":"J Exp Algorithmics"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08458129.pdf?arnumber=8458129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:43:47Z","timestamp":1643190227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8458129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2869463","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}