{"id":"https://openalex.org/W2619040869","doi":"https://doi.org/10.1145/3079079.3079097","title":"GraphGrind","display_name":"GraphGrind","publication_year":2017,"publication_date":"2017-05-31","ids":{"openalex":"https://openalex.org/W2619040869","doi":"https://doi.org/10.1145/3079079.3079097","mag":"2619040869"},"language":"en","primary_location":{"id":"doi:10.1145/3079079.3079097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3079079.3079097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Supercomputing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.qub.ac.uk/en/publications/48c97449-0737-43b4-b9b1-9ad04014a6f2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026234588","display_name":"Jiawen Sun","orcid":"https://orcid.org/0000-0002-1458-3484"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jiawen Sun","raw_affiliation_strings":["The Queen's University of Belfast"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Queen's University of Belfast","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086758775","display_name":"Hans Vandierendonck","orcid":"https://orcid.org/0000-0001-5868-9259"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hans Vandierendonck","raw_affiliation_strings":["The Queen's University of Belfast"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Queen's University of Belfast","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005410613","display_name":"Dimitrios S. Nikolopoulos","orcid":"https://orcid.org/0000-0003-0217-8307"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dimitrios S. Nikolopoulos","raw_affiliation_strings":["The Queen's University of Belfast"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Queen's University of Belfast","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8110936880111694},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6152030229568481},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.506391167640686},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4719369113445282},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45228007435798645}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8110936880111694},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6152030229568481},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.506391167640686},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4719369113445282},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45228007435798645}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3079079.3079097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3079079.3079097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Supercomputing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/48c97449-0737-43b4-b9b1-9ad04014a6f2","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/48c97449-0737-43b4-b9b1-9ad04014a6f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun , J , Vandierendonck , H & Nikolopoulos , D S 2017 , GraphGrind: addressing load imbalance of graph partitioning . in Proceedings of the International Conference on Supercomputing . , 16 , International Conference on Supercomputing 2017 , Chicago , United States , 14/06/2017 . https://doi.org/10.1145/3079079.3079097","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/48c97449-0737-43b4-b9b1-9ad04014a6f2","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/48c97449-0737-43b4-b9b1-9ad04014a6f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sun , J , Vandierendonck , H & Nikolopoulos , D S 2017 , GraphGrind: addressing load imbalance of graph partitioning . in Proceedings of the International Conference on Supercomputing . , 16 , International Conference on Supercomputing 2017 , Chicago , United States , 14/06/2017 . https://doi.org/10.1145/3079079.3079097","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4700275503","display_name":null,"funder_award_id":"EP/M01147X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5190803585","display_name":"Hybrid Static/Dynamic Scheduling for Task Dataflow Parallel Programs","funder_award_id":"EP/L027402/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5983112715","display_name":null,"funder_award_id":"EP/L027402/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W41295900","https://openalex.org/W78077100","https://openalex.org/W1448681276","https://openalex.org/W1543897857","https://openalex.org/W1788180225","https://openalex.org/W1854214752","https://openalex.org/W2000041758","https://openalex.org/W2004951603","https://openalex.org/W2016559894","https://openalex.org/W2021685712","https://openalex.org/W2022704179","https://openalex.org/W2034102265","https://openalex.org/W2039787998","https://openalex.org/W2053076698","https://openalex.org/W2055497547","https://openalex.org/W2072725684","https://openalex.org/W2074805288","https://openalex.org/W2095875205","https://openalex.org/W2101196063","https://openalex.org/W2115022330","https://openalex.org/W2119407198","https://openalex.org/W2126085027","https://openalex.org/W2144085134","https://openalex.org/W2154590891","https://openalex.org/W2165606466","https://openalex.org/W2166469213","https://openalex.org/W2172013743","https://openalex.org/W2244188037","https://openalex.org/W2620315948"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"We":[0,12,118,144],"investigate":[1],"how":[2],"graph":[3,10,15,21,25,64,78,107,116,150],"partitioning":[4,16],"adversely":[5],"affects":[6],"the":[7,32,38,57,68,91,112,125],"performance":[8,51],"of":[9,40,70,77,95],"analytics.":[11],"demonstrate":[13,145],"that":[14,24,56,110,146],"induces":[17],"extra":[18],"work":[19],"during":[20],"traversal":[22],"and":[23,129,159],"partitions":[26,41,65],"have":[27],"markedly":[28],"different":[29],"connectivity":[30],"than":[31],"original":[33],"graph.":[34],"By":[35],"consequence,":[36],"increasing":[37],"number":[39,69],"reaches":[42],"a":[43,75,105,121,131],"tipping":[44],"point":[45],"after":[46],"which":[47,138],"overheads":[48],"quickly":[49],"dominate":[50],"gains.":[52],"Moreover,":[53],"we":[54,102],"show":[55],"heuristic":[58],"to":[59,90,124],"balance":[60],"CPU":[61],"load":[62],"between":[63],"by":[66,115],"balancing":[67],"edges":[71],"is":[72,84,87],"inappropriate":[73],"for":[74,153],"range":[76],"analyses.":[79],"However,":[80],"even":[81],"when":[82],"it":[83,86],"appropriate,":[85],"sub-optimal":[88],"due":[89],"skewed":[92],"degree":[93],"distribution":[94],"social":[96],"networks.":[97],"Based":[98],"on":[99],"these":[100],"observations,":[101],"propose":[103,120],"GraphGrind,":[104],"new":[106],"analytics":[108,151],"system":[109],"addresses":[111],"limitations":[113],"incurred":[114],"partitioning.":[117],"moreover":[119],"NUMA-aware":[122,134,140],"extension":[123],"Cilk":[126],"programming":[127,136],"language":[128],"obtain":[130],"scale-free":[132],"yet":[133],"parallel":[135],"environment":[137],"underpins":[139],"scheduling":[141],"in":[142],"GraphGrind.":[143],"Graph-Grind":[147],"outperforms":[148],"state-of-the-art":[149],"systems":[152],"shared":[154],"memory":[155],"including":[156],"Ligra,":[157],"Polymer":[158],"Galois.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2017-06-05T00:00:00"}