{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:28:55Z","timestamp":1768908535385,"version":"3.49.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,8,28]]},"abstract":"<jats:p>This paper demonstrates Medusa, a programming framework for parallel graph processing on graphics processors (GPUs). Medusa enables developers to leverage the massive parallelism and other hardware features of GPUs by writing sequential C\/C++ code for a small set of APIs. This simplifies the implementation of parallel graph processing on the GPU. The runtime system of Medusa automatically executes the user-defined APIs in parallel on the GPU, with a series of graph-centric optimizations based on the architecture features of GPUs. We will demonstrate the steps of developing GPU-based graph processing algorithms with Medusa, and the superior performance of Medusa with both real-world and synthetic datasets.<\/jats:p>","DOI":"10.14778\/2536274.2536293","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1270-1273","source":"Crossref","is-referenced-by-count":12,"title":["Parallel graph processing on graphics processors made easy"],"prefix":"10.14778","volume":"6","author":[{"given":"Jianlong","family":"Zhong","sequence":"first","affiliation":[{"name":"Nanyang Technological University"}]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"GTGraph generator. http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph\/index.html accessed on Feb 17th 2013.  GTGraph generator. http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph\/index.html accessed on Feb 17th 2013."},{"key":"e_1_2_1_2_1","unstructured":"Stanford large network dataset collections. http:\/\/snap.stanford.edu\/data\/index.html accessed on Feb 17th 2013.  Stanford large network dataset collections. http:\/\/snap.stanford.edu\/data\/index.html accessed on Feb 17th 2013."},{"key":"e_1_2_1_3_1","volume-title":"IPDPS","author":"Berry J.","year":"2007"},{"issue":"1","key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"MapReduce: simplified data processing on large clusters","volume":"51","author":"Dean J.","year":"2008","journal-title":"Communications of the ACM"},{"key":"e_1_2_1_5_1","volume-title":"HiPC","author":"Harish P.","year":"2007"},{"key":"e_1_2_1_6_1","volume-title":"PACT","author":"He B.","year":"2008"},{"key":"e_1_2_1_7_1","volume-title":"SIGKDD","author":"He G.","year":"2010"},{"key":"e_1_2_1_8_1","volume-title":"PPoPP","author":"Hong S.","year":"2011"},{"key":"e_1_2_1_9_1","volume-title":"MLG","author":"Lin J.","year":"2010"},{"key":"e_1_2_1_10_1","volume-title":"UAI","author":"Low Y.","year":"2010"},{"key":"e_1_2_1_11_1","volume-title":"SIGMOD","author":"Malewicz G.","year":"2010"},{"key":"e_1_2_1_13_1","volume-title":"CF","author":"Shebanow M. C.","year":"2009"},{"key":"e_1_2_1_14_1","first-page":"304","volume-title":"SocInfo","author":"Zhong J.","year":"2011"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"J. Zhong and B. He. Kernelet: High-throughput GPU kernel executions with dynamic slicing and scheduling 2013.  J. Zhong and B. He. Kernelet: High-throughput GPU kernel executions with dynamic slicing and scheduling 2013.","DOI":"10.1109\/TPDS.2013.257"},{"key":"e_1_2_1_16_1","unstructured":"J. Zhong and B. He. Medusa: Simplified graph processing on GPUs. IEEE TPDS 99(PrePrints):1 2013.  J. Zhong and B. He. Medusa: Simplified graph processing on GPUs. IEEE TPDS 99(PrePrints):1 2013."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536274.2536293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:49:31Z","timestamp":1672224571000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536274.2536293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,8,28]]}},"alternative-id":["10.14778\/2536274.2536293"],"URL":"https:\/\/doi.org\/10.14778\/2536274.2536293","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}