{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T01:45:54Z","timestamp":1789695954448,"version":"4.0.1"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> Graphics Processing Units (GPU) are application specific accelerators which provide high performance to cost ratio and are widely available and used, hence places them as a ubiquitous accelerator. A computing paradigm based on the same is the general purpose computing on the GPU (GPGPU) model. The GPU due to its graphics lineage is better suited for the data-parallel, data-regular algorithms. The hardware architecture of the GPU is not suitable for the data parallel but data irregular algorithms such as graph connected components and list ranking. <\/jats:p><jats:p> In this paper, we present results that show how to use GPUs efficiently for graph algorithms which are known to have irregular data access patterns. We consider two fundamental graph problems: finding the connected components and finding a spanning tree. These two problems find applications in several graph theoretical problems. In this paper we arrive at efficient GPU implementations for the above two problems. The algorithms focus on minimising irregularity at both algorithmic and implementation level. Our implementation achieves a speedup of 11-16 times over a corresponding best sequential implementation. <\/jats:p>","DOI":"10.1142\/s0129626410000272","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T00:43:19Z","timestamp":1294101799000},"page":"325-339","source":"Crossref","is-referenced-by-count":18,"title":["SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE"],"prefix":"10.1142","volume":"20","author":[{"given":"JYOTHISH","family":"SOMAN","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Gachibowli, Hyderabad, 500032, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"KISHORE","family":"KOTHAPALLI","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Gachibowli, Hyderabad, 500032, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P J","family":"NARAYANAN","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Gachibowli, Hyderabad, 500032, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.011"},{"key":"rf6","volume":"6","author":"CHAKRABARTI D.","journal-title":"SIAM Data Mining"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"rf16","volume-title":"An Introduction to Parallel Algorithms","author":"JAJA J.","year":"1992"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70811"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626410000272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:08:26Z","timestamp":1565114906000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626410000272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":6,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S0129626410000272"],"URL":"https:\/\/doi.org\/10.1142\/s0129626410000272","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}