{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:50:19Z","timestamp":1783036219083,"version":"3.54.6"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"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":[],"published-print":{"date-parts":[[2020,9,22]]},"DOI":"10.1109\/hpec43674.2020.9286216","type":"proceedings-article","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T21:07:15Z","timestamp":1608671235000},"page":"1-4","source":"Crossref","is-referenced-by-count":4,"title":["Computing PageRank Scores of Web Crawl Data Using DGX A100 Clusters"],"prefix":"10.1109","author":[{"given":"Seunghwa","family":"Kang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Fender","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Eaton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brad","family":"Rees","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","article-title":"The anatomy of a large-scale hyper-textual web search engine","author":"brin","year":"1998","journal-title":"Computer Networks"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503293"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref5","article-title":"Distributed-memory breadth-first search on massive graphs","author":"buluc","year":"2017","journal-title":"ArxXiv absI1705 04590"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00059"},{"key":"ref7","article-title":"Optimizing sparse matrix operations on GPU s using merge path","author":"dalton","year":"2015","journal-title":"Proc IEEE Int'l Parallel and Distributed Processing Symp (IPDPS)"},{"key":"ref2","article-title":"Nathan Bell and Michael Garland. Efficient sparse matrix-vector multiplication on cuda","year":"2008","journal-title":"Technical Report NVIDIA"},{"key":"ref1","year":"0","journal-title":"WDC - Hyperlink Graphs"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380035"}],"event":{"name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA, USA","start":{"date-parts":[[2020,9,22]]},"end":{"date-parts":[[2020,9,24]]}},"container-title":["2020 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9285977\/9286137\/09286216.pdf?arnumber=9286216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:54:48Z","timestamp":1656345288000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9286216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/hpec43674.2020.9286216","relation":{},"subject":[],"published":{"date-parts":[[2020,9,22]]}}}