{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:43:05Z","timestamp":1767973385131,"version":"3.49.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","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":"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multi-Scale Comp. Syst."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1109\/tmscs.2018.2795543","type":"journal-article","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T14:23:17Z","timestamp":1516371797000},"page":"190-203","source":"Crossref","is-referenced-by-count":10,"title":["Scalable and Performant Graph Processing on GPUs Using Approximate Computing"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7648-9979","authenticated-orcid":false,"given":"Somesh","family":"Singh","sequence":"first","affiliation":[{"name":"Chennai, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[{"name":"Chennai, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.34"},{"key":"ref32","first-page":"13:1","article-title":"Breaking the speed and scalability barriers for graph exploration on distributed-memory machines","author":"checconi","year":"2012","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"key":"ref31","first-page":"65:1","article-title":"Parallel breadth-first search on distributed memory systems","author":"bulu\u00e7","year":"2011","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"ref35","first-page":"110","article-title":"Parallel breadth first search on GPU clusters","author":"fu","year":"2014","journal-title":"Proc IEEE Int Conf Big Data"},{"key":"ref34","first-page":"197","article-title":"Accelerating large graph algorithms on the GPU using CUDA","author":"harish","year":"2007","journal-title":"Proc Int Conf High-Perform Comput"},{"key":"ref10","first-page":"892","article-title":"Parallel graph coloring for manycore architectures","author":"deveci","year":"2016","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref11","first-page":"820","article-title":"Reducing pagerank communication via propagation blocking","author":"beamer","year":"2017","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref12","first-page":"76","article-title":"Betweenness centrality on GPUs and heterogeneous architectures","author":"sariy\u00fcce","year":"2013","journal-title":"Proc 6th Workshop Gen Purpose Processor Using Graph Process Units"},{"key":"ref13","first-page":"463","article-title":"Data-driven versus topology-driven irregular computations on GPUs","author":"nasre","year":"2013","journal-title":"Proc 27th IEEE Int Parallel Distrib Process Symp"},{"key":"ref14","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":"gharaibeh","year":"2012","journal-title":"Proc Int Conf Parallel Archit Compilation Tech"},{"key":"ref15","article-title":"SNAP: A general purpose network analysis and graph mining library in C++","author":"leskovec","year":"2014"},{"key":"ref16","article-title":"GTgraph: A suite of synthetic random graph generators","author":"madduri","year":"2006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2893356"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"ref19","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref28","first-page":"92:1","article-title":"On fast parallel detection of strongly connected components (SCC) in small-world graphs","author":"hong","year":"2013","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/1810479.1810534","article-title":"A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)","author":"leiserson","year":"2010","journal-title":"Proc 22nd Annu ACM Symp Parallelism Algorithms Archit"},{"key":"ref27","first-page":"205","article-title":"Scalable parallel minimum spanning forest computation","author":"nobari","year":"2012","journal-title":"Proc 17th ACM SIGPLAN Symp Principles Practice Parallel Program"},{"key":"ref3","first-page":"267","article-title":"Accelerating CUDA graph algorithms at maximum warp","author":"hong","year":"2011","journal-title":"Proc ACM Symp Principles Practice Parallel Program"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2927964.2927975"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250759"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.05.007"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572796"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"ref2","first-page":"52","article-title":"An effective GPU implementation of breadth-first search","author":"luo","year":"2010","journal-title":"Proc 47th Des Autom Conf"},{"key":"ref9","first-page":"2","article-title":"GPU centric extensions for parallel strongly connected components computation","author":"devshatwar","year":"2016","journal-title":"Proc 9th Annu Workshop Gen Purpose Process Using Graph Process Unit"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"ref20","first-page":"37","article-title":"Shortest paths in less than a millisecond","author":"agarwal","year":"2012","journal-title":"Proc ACM Workshop Online Social Netw"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"ref21","first-page":"297","article-title":"Evaluating graph coloring on GPUs","author":"grosset","year":"2011","journal-title":"Proc 16th ACM Symp Principles Practice Parallel Program"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1145\/2939672.2939770","article-title":"ABRA: Approximating betweenness centrality in static and dynamic graphs with rademacher averages","author":"riondato","year":"2016","journal-title":"Proc ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref23","first-page":"47","article-title":"Approximating s-t minimum cuts in Õ(n2) time","author":"bencz\u00far","year":"1996","journal-title":"Proc 28th Annu ACM Symp Theory Comput"},{"key":"ref26","first-page":"147","article-title":"Morph algorithms on GPUs","author":"nasre","year":"2013","journal-title":"Proc ACM SIGPLAN Symp Principles Practice Parallel Program"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/2688500.2688526","article-title":"GStream: A graph streaming processing method for large-scale graphs on GPUs","author":"seo","year":"2015","journal-title":"Proc 20th ACM SIGPLAN Symp Principles Practice Parallel Program"}],"container-title":["IEEE Transactions on Multi-Scale Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687315\/8466693\/08264799.pdf?arnumber=8264799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T18:44:48Z","timestamp":1753296288000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8264799\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":35,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tmscs.2018.2795543","relation":{},"ISSN":["2332-7766","2372-207X"],"issn-type":[{"value":"2332-7766","type":"electronic"},{"value":"2372-207X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}