{"id":"https://openalex.org/W2909858526","doi":"https://doi.org/10.1145/3290688.3290711","title":"Window-based Streaming Graph Partitioning Algorithm","display_name":"Window-based Streaming Graph Partitioning Algorithm","publication_year":2019,"publication_date":"2019-01-14","ids":{"openalex":"https://openalex.org/W2909858526","doi":"https://doi.org/10.1145/3290688.3290711","mag":"2909858526"},"language":"en","primary_location":{"id":"doi:10.1145/3290688.3290711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3290688.3290711","pdf_url":null,"source":{"id":"https://openalex.org/S4306524001","display_name":"Proceedings of the Australasian Computer Science Week Multiconference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Australasian Computer Science Week Multiconference","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1902.01543","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Md Anwarul Kaium Patwary","orcid":null},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Md Anwarul Kaium Patwary","raw_affiliation_strings":["University of Tasmania, Hobart, Tasmania"],"affiliations":[{"raw_affiliation_string":"University of Tasmania, Hobart, Tasmania","institution_ids":["https://openalex.org/I129801699"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Saurabh Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Saurabh Garg","raw_affiliation_strings":["University of Tasmania, Hobart, Tasmania"],"affiliations":[{"raw_affiliation_string":"University of Tasmania, Hobart, Tasmania","institution_ids":["https://openalex.org/I129801699"]}]},{"author_position":"last","author":{"id":null,"display_name":"Byeong Kang","orcid":null},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Byeong Kang","raw_affiliation_strings":["University of Tasmania, Hobart, Tasmania"],"affiliations":[{"raw_affiliation_string":"University of Tasmania, Hobart, Tasmania","institution_ids":["https://openalex.org/I129801699"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I129801699"],"apc_list":null,"apc_paid":null,"fwci":1.0216,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.80268613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"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.8574000000953674,"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.8574000000953674,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.11180000007152557,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/graph-partition","display_name":"Graph partition","score":0.7258999943733215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5041000247001648},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.42399999499320984},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.41190001368522644},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.3646000027656555},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3407999873161316},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.3361000120639801},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.3357999920845032}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7426999807357788},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7258999943733215},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5041000247001648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47040000557899475},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.41190001368522644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37869998812675476},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.3646000027656555},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3407999873161316},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.3361000120639801},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.3357999920845032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.29429998993873596},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2912999987602234},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.29109999537467957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.2759999930858612},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2721000015735626},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.25279998779296875}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3290688.3290711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3290688.3290711","pdf_url":null,"source":{"id":"https://openalex.org/S4306524001","display_name":"Proceedings of the Australasian Computer Science Week Multiconference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Australasian Computer Science Week Multiconference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1902.01543","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.01543","pdf_url":"https://arxiv.org/pdf/1902.01543","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:eprints.utas.edu.au:30397","is_oa":false,"landing_page_url":"https://eprints.utas.edu.au/30397/","pdf_url":null,"source":{"id":"https://openalex.org/S4406922975","display_name":"UTAS Research Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Publication"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1902.01543","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.01543","pdf_url":"https://arxiv.org/pdf/1902.01543","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1971630691","https://openalex.org/W2006023152","https://openalex.org/W2031709923","https://openalex.org/W2063644336","https://openalex.org/W2096159022","https://openalex.org/W2096544401","https://openalex.org/W2111925081","https://openalex.org/W2128479026","https://openalex.org/W2133098022","https://openalex.org/W2142535891","https://openalex.org/W2161455936","https://openalex.org/W2170616854","https://openalex.org/W2399614914","https://openalex.org/W2616545289"],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,4,43,48,131,137,150,168],"recent":[2],"years,":[3],"scale":[5],"of":[6,22,69,170,188],"graph":[7,29,36,39,45,81,85,113,145],"datasets":[8],"has":[9],"increased":[10],"to":[11,95,142,158],"such":[12],"a":[13,16,57,96,128,159,177],"degree":[14],"that":[15,93,136],"single":[17],"machine":[18],"is":[19,31,54,100,121,140],"not":[20,55],"capable":[21],"efficiently":[23,147],"processing":[24],"large":[25,35,144],"graphs.":[26],"Thereby,":[27],"efficient":[28,110],"partitioning":[30,40,86,114,124],"necessary":[32],"for":[33],"those":[34],"applications.":[37],"Traditional":[38],"generally":[41],"loads":[42],"whole":[44],"data":[46,146],"into":[47],"memory":[49,65,70],"before":[50],"performing":[51],"partitioning;":[52],"this":[53],"only":[56],"time":[58,74],"consuming":[59],"task":[60],"but":[61],"it":[62,175],"also":[63,101,166],"creates":[64],"bottlenecks.":[66],"These":[67],"issues":[68],"limitation":[71],"and":[72,91,156,174,183],"enormous":[73],"complexity":[75],"can":[76],"be":[77],"resolved":[78],"using":[79],"stream-based":[80],"partitioning.":[82],"A":[83],"streaming":[84,112],"algorithm":[87,115,120,139],"reads":[88],"vertices":[89],"once":[90],"assigns":[92],"vertex":[94,129],"partition":[97,143],"accordingly.":[98],"This":[99,106],"called":[102,116],"an":[103,109,122],"one-pass":[104],"algorithm.":[105],"paper":[107],"proposes":[108],"window-based":[111],"WStream.":[117],"The":[118],"WStream":[119,138],"edge-cut":[123,184],"algorithm,":[125,173],"which":[126],"distributes":[127],"among":[130],"partitions.":[132],"Our":[133],"results":[134,162],"suggest":[135],"able":[141],"while":[148],"keeping":[149],"load":[151,181],"balanced":[152],"across":[153],"different":[154,186],"partitions,":[155],"communication":[157],"minimum.":[160],"Evaluation":[161],"with":[163,185],"real":[164],"workloads":[165],"prove":[167],"effectiveness":[169],"our":[171],"proposed":[172],"achieves":[176],"significant":[178],"reduction":[179],"in":[180],"imbalance":[182],"ranges":[187],"dataset.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2019-01-25T00:00:00"}