{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:38Z","timestamp":1773481898694,"version":"3.50.1"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,12,4]],"date-time":"2014-12-04T00:00:00Z","timestamp":1417651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2014,12,4]]},"abstract":"<jats:p>Medusa is a parallel graph processing system on graphics processors (GPUs). The core design of Medusa is to enable 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 optimizations based on the architecture features of GPUs and characteristics of graph applications. In this paper, we present an overview of the Medusa system and a case study of adopting Medusa to a research project on social network simulations. With Medusa, users without GPU programming experiencecan quickly implement their graph operations on the GPU, which accelerates the discovery and findings of domain-specific applications.<\/jats:p>","DOI":"10.1145\/2694413.2694421","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T16:17:14Z","timestamp":1418055434000},"page":"35-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Medusa"],"prefix":"10.1145","volume":"43","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":[[2014,12,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"10th DIMACS implementation challenge. http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml.  10th DIMACS implementation challenge. http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_2_1_6_1","first-page":"1420","volume-title":"Threshold models of collective behavior. American journal of sociology","author":"Granovetter M.","year":"1978","unstructured":"M. Granovetter . Threshold models of collective behavior. American journal of sociology , pages 1420 -- 1443 , 1978 . M. Granovetter. Threshold models of collective behavior. American journal of sociology, pages 1420--1443, 1978."},{"key":"e_1_2_1_7_1","unstructured":"GTGraph Generator. http:\/\/www.cc.gatech.edu\/ kamesh\/GTgraph\/.  GTGraph Generator. http:\/\/www.cc.gatech.edu\/ kamesh\/GTgraph\/."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782174.1782200"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454152"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2012.04.031"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/DS-RT.2013.27"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2675983.2676182"},{"key":"e_1_2_1_14_1","volume-title":"UAI","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . GraphLab: A new parallel framework for machine learning . In UAI , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A new parallel framework for machine learning. In UAI, 2010."},{"key":"e_1_2_1_15_1","volume-title":"Efficient parallel scan algorithms for GPUs. NVIDIA. Technical report","author":"Sengupta S.","year":"2008","unstructured":"S. Sengupta , M. Harris , and M. Garland . Efficient parallel scan algorithms for GPUs. NVIDIA. Technical report , 2008 . S. Sengupta, M. Harris, and M. Garland. Efficient parallel scan algorithms for GPUs. NVIDIA. Technical report, 2008."},{"key":"e_1_2_1_16_1","unstructured":"Stanford Large Network Dataset Collections. http:\/\/snap.stanford.edu\/data\/index.html.  Stanford Large Network Dataset Collections. http:\/\/snap.stanford.edu\/data\/index.html."},{"key":"e_1_2_1_17_1","volume-title":"The Definitive Guide: The Definitive Guide","author":"White T.","year":"2009","unstructured":"T. White . Hadoop : The Definitive Guide: The Definitive Guide . O'Reilly Media , 2009 . T. White. Hadoop: The Definitive Guide: The Definitive Guide. O'Reilly Media, 2009."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536274.2536293"},{"issue":"6","key":"e_1_2_1_19_1","first-page":"1522","article-title":"High-throughput gpu kernel executions with dynamic slicing and scheduling. Parallel and Distributed Systems","volume":"25","author":"Zhong J.","year":"2014","unstructured":"J. Zhong and B. He. Kernelet : High-throughput gpu kernel executions with dynamic slicing and scheduling. Parallel and Distributed Systems , IEEE Transactions on , 25 ( 6 ): 1522 -- 1532 , 2014 . J. Zhong and B. He. Kernelet: High-throughput gpu kernel executions with dynamic slicing and scheduling. Parallel and Distributed Systems, IEEE Transactions on, 25(6):1522--1532, 2014.","journal-title":"IEEE Transactions on"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2013.111"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2694413.2694421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2694413.2694421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:20Z","timestamp":1750227140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2694413.2694421"}},"subtitle":["A Parallel Graph Processing System on Graphics Processors"],"short-title":[],"issued":{"date-parts":[[2014,12,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,12,4]]}},"alternative-id":["10.1145\/2694413.2694421"],"URL":"https:\/\/doi.org\/10.1145\/2694413.2694421","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2014,12,4]]},"assertion":[{"value":"2014-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}