{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T19:08:51Z","timestamp":1758395331940},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,21]],"date-time":"2015-01-21T00:00:00Z","timestamp":1421798400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11227-015-1378-z","type":"journal-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T04:29:06Z","timestamp":1421728146000},"page":"1563-1586","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient graph computation on hybrid CPU and GPU systems"],"prefix":"10.1007","volume":"71","author":[{"given":"Tao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jingjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Shu","sequence":"additional","affiliation":[]},{"given":"Min-You","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xiaoyao","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,21]]},"reference":[{"issue":"7","key":"1378_CR1","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.dam.2008.08.020","volume":"158","author":"L Addario-Berry","year":"2010","unstructured":"Addario-Berry L, Kennedy WS, King AD, Li Z, Reed B (2010) Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret Appl Math 158(7):765\u2013770","journal-title":"Discret Appl Math"},{"issue":"2","key":"1378_CR2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188\u2013192","journal-title":"J Parallel Distrib Comput"},{"key":"1378_CR3","unstructured":"Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. In: Arnold D, Ruiter Bd (eds.) Computer graphics forum, vol. 8. Wiley Online Library, pp 3\u201311"},{"key":"1378_CR4","unstructured":"Avery C (2011) Giraph: large-scale graph processing infrastruction on Hadoop. In: Proceedings of Hadoop Summit"},{"key":"1378_CR5","doi-asserted-by":"crossref","unstructured":"Boldi P, Santini M, Vigna S (2008) A large time-aware web graph. In: ACM SIGIR forum, vol 42. ACM, pp 33\u201338","DOI":"10.1145\/1480506.1480511"},{"key":"1378_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-MAT: a recursive model for graph mining. In: SIAM international conference on data mining (SDM), vol 4. SIAM, pp 442\u2013446","DOI":"10.1137\/1.9781611972740.43"},{"issue":"1","key":"1378_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1177\/1094342005051196","volume":"19","author":"A Chan","year":"2005","unstructured":"Chan A, Dehne F, Taylor R (2005) Cgmgraph\/cgmlib: implementing and testing cgm graph algorithms on PC clusters and shared memory machines. Int J High Perform Comput Appl 19(1):81\u201397","journal-title":"Int J High Perform Comput Appl"},{"key":"1378_CR8","doi-asserted-by":"crossref","unstructured":"Che S, Beckmann B, Reinhardt S, Skadron K (2013) Pannotia: understanding irregular GPGPU graph applications. In: IEEE international symposium on workload characterization (IISWC), pp 185\u2013195","DOI":"10.1109\/IISWC.2013.6704684"},{"key":"1378_CR9","unstructured":"Fackbook (2015) Facebook statistics. http:\/\/www.statisticbrain.com\/facebook-statistics\/"},{"key":"1378_CR10","doi-asserted-by":"crossref","unstructured":"Fang J, Varbanescu AL, Sips H (2011) A comprehensive performance comparison of CUDA and OpenCL. In: 2011 international conference on parallel processing (ICPP). IEEE, pp 216\u2013225","DOI":"10.1109\/ICPP.2011.45"},{"key":"1378_CR11","doi-asserted-by":"crossref","unstructured":"Ferrer R, Planas J, Bellens P, Duran A, Gonzalez M, Martorell X, Badia RM, Ayguade E, Labarta J (2011) Optimizing the exploitation of multicore processors and GPUs with OpenMP and OpenCL. In: Cooper K, Mellor-Crummey J, Sarkar V (eds.) Languages and compilers for parallel computing. Springer, Berlin, pp 215\u2013229","DOI":"10.1007\/978-3-642-19595-2_15"},{"key":"1378_CR12","doi-asserted-by":"crossref","unstructured":"Gharaibeh A, Costa LB, Santos-Neto E, Ripeanu M (2013) On graphs, GPUs, and blind dating: a workload to processor matchmaking quest. In: 2013 IEEE 27th international symposium on parallel and distributed processing (IPDPS). IEEE, pp 851\u2013862","DOI":"10.1109\/IPDPS.2013.37"},{"key":"1378_CR13","unstructured":"Gharaibeh A, Santos-Neto E, Costa LB, Ripeanu M (2013) Efficient large-scale graph processing on hybrid CPU and GPU systems. arXiv:1312.3018"},{"key":"1378_CR14","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX symposium on operating systems design and implementation (OSDI), pp 17\u201330"},{"key":"1378_CR15","unstructured":"Graph 500 Steering Committee and others: Graph 500 benchmark. http:\/\/www.graph500.org\/"},{"key":"1378_CR16","unstructured":"Gregor D, Lumsdaine A (2005) The parallel bgl: a generic library for distributed graph computations. In: Parallel Object-Oriented Scientific Computing (POOSC)"},{"key":"1378_CR17","unstructured":"Harish P, Vineet V, Narayanan P (2009) Large graph algorithms for massively multithreaded architectures. Centre for Visual Information Technology, I. Institute of Information Technology, Hyderabad, India, Tech. Rep. IIIT\/TR\/2009\/74"},{"key":"1378_CR18","unstructured":"ILK Research Group, Tilburg University (2015) The size of the world wide web (the internet). http:\/\/www.worldwidewebsize.com"},{"issue":"3","key":"1378_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/1272998.1273005","volume":"41","author":"M Isard","year":"2007","unstructured":"Isard M, Budiu M, Yu Y, Birrell A, Fetterly D (2007) Dryad: distributed data-parallel programs from sequential building blocks. ACM SIGOPS Oper Syst Rev 41(3):59\u201372","journal-title":"ACM SIGOPS Oper Syst Rev"},{"issue":"5","key":"1378_CR20","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s00778-012-0283-9","volume":"21","author":"U Kang","year":"2012","unstructured":"Kang U, Tong H, Sun J, Lin CY, Faloutsos C (2012) Gbase: an efficient analysis platform for large graphs. VLDB J 21(5):637\u2013650","journal-title":"VLDB J"},{"key":"1378_CR21","doi-asserted-by":"crossref","unstructured":"Kang U, Tsourakakis CE, Faloutsos C (2009) Pegasus: a peta-scale graph mining system implementation and observations. In: Ninth IEEE international conference on data mining (ICDM). IEEE, pp 229\u2013238","DOI":"10.1109\/ICDM.2009.14"},{"issue":"2","key":"1378_CR22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev 41(2):278\u2013300","journal-title":"SIAM Rev"},{"key":"1378_CR23","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media? In: Proceedings of the 19th international conference on World wide web. ACM, pp 591\u2013600"},{"key":"1378_CR24","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) Graphchi: large-scale graph computation on just a PC. In: Proceedings of the 10th USENIX symposium on operating systems design and implementation (OSDI), vol 8, pp 31\u201346"},{"key":"1378_CR25","doi-asserted-by":"crossref","unstructured":"Lee J, Han WS, Kasperovics R, Lee JH (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. In: Proceedings of the 39th international conference on very large data bases. VLDB Endowment, pp 133\u2013144","DOI":"10.14778\/2535568.2448946"},{"key":"1378_CR26","doi-asserted-by":"crossref","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed graphlab: a framework for machine learning and data mining in the cloud. In: Proceedings of the very large data bases (VLDB) endowment, vol 5, issue 8, pp 716\u2013727","DOI":"10.14778\/2212351.2212354"},{"key":"1378_CR27","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM international conference on management of data (SIGMOD). ACM, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"1378_CR28","doi-asserted-by":"crossref","unstructured":"Maserrat H, Pei J (2010) Neighbor query friendly compression of social networks. In: Proceedings of the 16th ACM international conference on Knowledge discovery and data mining (SIGKDD). ACM, pp 533\u2013542","DOI":"10.1145\/1835804.1835873"},{"key":"1378_CR29","doi-asserted-by":"crossref","unstructured":"Merrill D, Garland M, Grimshaw A (2012) Scalable GPU graph traversal. In: ACM SIGPLAN notices, vol 47. ACM, pp 117\u2013128","DOI":"10.1145\/2145816.2145832"},{"key":"1378_CR30","unstructured":"Neo Technology, inc. (2015) Learning neo4j. http:\/\/neo4j.com\/book-learning-neo4j\/"},{"key":"1378_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web"},{"key":"1378_CR32","doi-asserted-by":"crossref","unstructured":"Pearce R, Gokhale M, Amato NM (2010) Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: Proceedings of the 2010 ACM\/IEEE international conference for high performance computing, networking, storage and analysis. IEEE Computer Society, pp 1\u201311","DOI":"10.1109\/SC.2010.34"},{"key":"1378_CR33","doi-asserted-by":"crossref","unstructured":"Salihoglu S, Widom J (2013) Gps: a graph processing system. In: Proceedings of the 25th international conference on scientific and statistical database management. ACM, p 22","DOI":"10.1145\/2484838.2484843"},{"key":"1378_CR34","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the 2013 international conference on Management of data. ACM, pp 505\u2013516","DOI":"10.1145\/2463676.2467799"},{"key":"1378_CR35","doi-asserted-by":"crossref","unstructured":"Shen J, Fang J, Sips H, Varbanescu AL (2012) Performance gaps between OpenMP and OpenCL for multi-core CPUs. In: 2012 41st international conference on parallel processing workshops (ICPPW). IEEE, pp 116\u2013125","DOI":"10.1109\/ICPPW.2012.18"},{"issue":"1","key":"1378_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach Y, Vishkin U (1982) An O(log(n)) parallel connectivity algorithm. J Algorithms 3(1):57\u201367","journal-title":"J Algorithms"},{"key":"1378_CR37","doi-asserted-by":"crossref","unstructured":"Shun J, Blelloch GE (2013) Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM symposium on principles and practice of parallel programming (SIGPLAN). ACM, pp 135\u2013146","DOI":"10.1145\/2442516.2442530"},{"issue":"8","key":"1378_CR38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"1378_CR39","doi-asserted-by":"crossref","unstructured":"Vineet V, Harish P, Patidar S, Narayanan P (2009) Fast minimum spanning tree for large graphs on the GPU. In: Proceedings of the conference on high performance graphics 2009. ACM, pp 167\u2013171","DOI":"10.1145\/1572769.1572796"},{"key":"1378_CR40","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD workshop on mining data semantics. ACM, p 3","DOI":"10.1145\/2350190.2350193"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1378-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1378-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1378-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T17:58:38Z","timestamp":1566237518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1378-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,21]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["1378"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1378-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,21]]}}}