{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:28:21Z","timestamp":1768030101301,"version":"3.49.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/ipdps.2013.37","type":"proceedings-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T21:15:06Z","timestamp":1375478106000},"page":"851-862","source":"Crossref","is-referenced-by-count":44,"title":["On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest"],"prefix":"10.1109","author":[{"given":"Abdullah","family":"Gharaibeh","sequence":"first","affiliation":[]},{"given":"Lauro Beltrao","family":"Costa","sequence":"additional","affiliation":[]},{"given":"Elizeu","family":"Santos-Neto","sequence":"additional","affiliation":[]},{"given":"Matei","family":"Ripeanu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jedc.2007.01.032"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370866"},{"key":"14","year":"2012"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_34"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"21","author":"kernighan","year":"1970","journal-title":"An Efficient Heuristic Procedure for Partitioning Graphs"},{"key":"20","article-title":"All-pairs shortest-paths for large graphs on the GPU","author":"katz","year":"2008","journal-title":"SIGGRAPH\/EUROGRAPHICS"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"24","author":"erdos","year":"0","journal-title":"On the Evolution of Random Graphs"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog2901_3"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"28","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","article-title":"Complex networks: Small-world, scale-free and beyond","volume":"3","author":"wang","year":"2003","journal-title":"IEEE Circuits and Systems Magazine"},{"key":"29","year":"2012","journal-title":"Apache Giraph"},{"key":"3","article-title":"Linked: How Everything Is Connected to Everything Else and What It Means","volume":"67","author":"barabasi","year":"2003","journal-title":"La Recherche"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the Internet topology","volume":"29","author":"faloutsos","year":"1999","journal-title":"Computer Communication Review"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/362588.362602"},{"key":"6","author":"chamberlain","year":"0","journal-title":"Graph partitioning algorithms for distributing workloads of parallel computations"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.04.217"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.43"}],"event":{"name":"2013 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","location":"Cambridge, MA, USA","start":{"date-parts":[[2013,5,20]]},"end":{"date-parts":[[2013,5,24]]}},"container-title":["2013 IEEE 27th International Symposium on Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6569024\/6569783\/06569867.pdf?arnumber=6569867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T17:19:12Z","timestamp":1498065552000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6569867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2013.37","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}