{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T17:58:54Z","timestamp":1775671134022,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"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":[],"published-print":{"date-parts":[[2019,1,29]]},"DOI":"10.1145\/3290688.3290711","type":"proceedings-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T13:15:25Z","timestamp":1547471725000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Window-based Streaming Graph Partitioning Algorithm"],"prefix":"10.1145","author":[{"given":"Md Anwarul Kaium","family":"Patwary","sequence":"first","affiliation":[{"name":"University of Tasmania, Hobart, Tasmania"}]},{"given":"Saurabh","family":"Garg","sequence":"additional","affiliation":[{"name":"University of Tasmania, Hobart, Tasmania"}]},{"given":"Byeong","family":"Kang","sequence":"additional","affiliation":[{"name":"University of Tasmania, Hobart, Tasmania"}]}],"member":"320","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. Nectar Cloud - Nectar. https:\/\/nectar.org.au\/research-cloud\/. (Accessed on 15\/12\/2017).  2017. Nectar Cloud - Nectar. https:\/\/nectar.org.au\/research-cloud\/. (Accessed on 15\/12\/2017)."},{"key":"e_1_3_2_1_2_1","volume-title":"Continual and Cost-Effective Partitioning of Dynamic Graphs for Optimizing Big Graph Processing Systems. In 2016 IEEE International Congress on Big Data (BigData Congress). 18--25","author":"Abdolrashidi A.","unstructured":"A. Abdolrashidi and L. Ramaswamy . 2016 . Continual and Cost-Effective Partitioning of Dynamic Graphs for Optimizing Big Graph Processing Systems. In 2016 IEEE International Congress on Big Data (BigData Congress). 18--25 . A. Abdolrashidi and L. Ramaswamy. 2016. Continual and Cost-Effective Partitioning of Dynamic Graphs for Optimizing Big Graph Processing Systems. In 2016 IEEE International Congress on Big Data (BigData Congress). 18--25."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488393"},{"key":"e_1_3_2_1_4_1","volume-title":"2008 IEEE International Symposium on Parallel and Distributed Processing. 1--12","author":"Bader D. A.","unstructured":"D. A. Bader and K. Madduri . 2008. SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks . In 2008 IEEE International Symposium on Parallel and Distributed Processing. 1--12 . D. A. Bader and K. Madduri. 2008. SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In 2008 IEEE International Symposium on Parallel and Distributed Processing. 1--12."},{"key":"e_1_3_2_1_5_1","unstructured":"Hugo Firth and Paolo Missier. {n. d.}. Workload-aware Streaming Graph Partitioning.  Hugo Firth and Paolo Missier. {n. d.}. Workload-aware Streaming Graph Partitioning."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12)","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . 2012 . PowerGraph: Distributed Graph-parallel Computation on Natural Graphs . In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12) . USENIX Association, Berkeley, CA, USA, 17--30. http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883 Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12). USENIX Association, Berkeley, CA, USA, 17--30. http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_8_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_11_1","volume-title":"Statistical, nonlinear, and soft matter physics 68 3 Pt 2","author":"Newman M. E. J.","year":"2003","unstructured":"M. E. J. Newman and Juyong Park . 2003. Why social networks are different from other types of networks. Physical review. E , Statistical, nonlinear, and soft matter physics 68 3 Pt 2 ( 2003 ), 036122. M. E. J. Newman and Juyong Park. 2003. Why social networks are different from other types of networks. Physical review. E, Statistical, nonlinear, and soft matter physics 68 3 Pt 2 (2003), 036122."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487696"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806424"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2425676.2425689"},{"key":"e_1_3_2_1_16_1","volume-title":"Boosting Vertex-Cut Partitioning for Streaming Graphs. In 2016 IEEE International Congress on Big Data (BigData Congress). 1--8.","author":"Sajjad H. P.","unstructured":"H. P. Sajjad , A. H. Payberah , F. Rahimian , V. Vlassov , and S. Haridi . 2016 . Boosting Vertex-Cut Partitioning for Streaming Graphs. In 2016 IEEE International Congress on Big Data (BigData Congress). 1--8. H. P. Sajjad, A. H. Payberah, F. Rahimian, V. Vlassov, and S. Haridi. 2016. Boosting Vertex-Cut Partitioning for Streaming Graphs. In 2016 IEEE International Congress on Big Data (BigData Congress). 1--8."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634169"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2817946.2817950"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_1_21_1","unstructured":"Christopher Walshaw. 2016. The Graph Partitioning Archive. http:\/\/http:\/\/chriswalshaw.co.uk\/partition\/.  Christopher Walshaw. 2016. The Graph Partitioning Archive. http:\/\/http:\/\/chriswalshaw.co.uk\/partition\/."},{"key":"e_1_3_2_1_22_1","volume-title":"2013 IEEE International Conference on Big Data. 537--542","author":"Wang R.","unstructured":"R. Wang and K. Chiu . 2013. A stream partitioning approach to processing large scale distributed graph datasets . In 2013 IEEE International Conference on Big Data. 537--542 . R. Wang and K. Chiu. 2013. A stream partitioning approach to processing large scale distributed graph datasets. In 2013 IEEE International Conference on Big Data. 537--542."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330030502"},{"key":"e_1_3_2_1_24_1","volume-title":"S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut. CoRR abs\/1511.02586","author":"Xie Cong","year":"2015","unstructured":"Cong Xie , Wu-Jun Li , and Zhihua Zhang . 2015. S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut. CoRR abs\/1511.02586 ( 2015 ). http:\/\/arxiv.org\/abs\/1511.02586 Cong Xie, Wu-Jun Li, and Zhihua Zhang. 2015. S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut. CoRR abs\/1511.02586 (2015). http:\/\/arxiv.org\/abs\/1511.02586"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 2Nd USENIX Conference on Hot Topics in Cloud Computing (HotCloud '10)","author":"Zaharia Matei","year":"2010","unstructured":"Matei Zaharia , Mosharaf Chowdhury , Michael J. Franklin , Scott Shenker , and Ion Stoica . 2010 . Spark: Cluster Computing with Working Sets . In Proceedings of the 2Nd USENIX Conference on Hot Topics in Cloud Computing (HotCloud '10) . USENIX Association, Berkeley, CA, USA, 10--10. http:\/\/dl.acm.org\/citation.cfm?id= 1863103.1863113 Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: Cluster Computing with Working Sets. In Proceedings of the 2Nd USENIX Conference on Hot Topics in Cloud Computing (HotCloud '10). USENIX Association, Berkeley, CA, USA, 10--10. http:\/\/dl.acm.org\/citation.cfm?id=1863103.1863113"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2703848"}],"event":{"name":"ACSW 2019: Australasian Computer Science Week 2019","location":"Sydney NSW Australia","acronym":"ACSW 2019","sponsor":["CORE - Computing Research and Education","Macquarie University-Sydney"]},"container-title":["Proceedings of the Australasian Computer Science Week Multiconference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290688.3290711","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3290688.3290711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:17Z","timestamp":1750204397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290688.3290711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":26,"alternative-id":["10.1145\/3290688.3290711","10.1145\/3290688"],"URL":"https:\/\/doi.org\/10.1145\/3290688.3290711","relation":{},"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"2019-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}