{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T16:07:11Z","timestamp":1784390831258,"version":"3.55.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY18F020002"],"award-info":[{"award-number":["LY18F020002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00607-022-01132-y","type":"journal-article","created":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T11:30:13Z","timestamp":1669548613000},"page":"455-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["HaSGP: an effective graph partition method for heterogeneous-aware"],"prefix":"10.1007","volume":"105","author":[{"given":"Ying","family":"Zhong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenze","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingbiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,27]]},"reference":[{"issue":"11","key":"1132_CR1","first-page":"1590","volume":"11","author":"Z Abbas","year":"2018","unstructured":"Abbas Z, Kalavri V, Carbone P, Vlassov V (2018) Streaming graph partitioning: an experimental study. Very Large Data Bases 11(11):1590\u20131603","journal-title":"Very Large Data Bases"},{"key":"1132_CR2","unstructured":"Buluc A, Meyerhenke H, Safro I, Sanders P, Schulz C (2013) Recent advances in graph partitioning. arXiv: Data Structures and Algorithms"},{"issue":"3","key":"1132_CR3","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.2140\/gt.2007.11.1315","volume":"11","author":"JW Cannon","year":"2007","unstructured":"Cannon JW, Thurston WP (2007) Group invariant peano curves. Geom Topol 11(3):1315\u20131355","journal-title":"Geom Topol"},{"issue":"1","key":"1132_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/TCC.2016.2603509","volume":"7","author":"Q Chen","year":"2019","unstructured":"Chen Q, Yao J, Li B, Xiao Z (2019) Pisces: optimizing multi-job application execution in mapreduce. IEEE Trans Cloud Comput 7(1):273\u2013286","journal-title":"IEEE Trans Cloud Comput"},{"key":"1132_CR5","first-page":"1","volume":"5","author":"R Chen","year":"2015","unstructured":"Chen R, Shi J, Chen Y, Chen H (2015) Powerlyra: differentiated graph computation and partitioning on skewed graphs. ACM Trans Parallel Comput (TOPC) 5:1\u201339","journal-title":"ACM Trans Parallel Comput (TOPC)"},{"key":"1132_CR6","doi-asserted-by":"crossref","unstructured":"Chen R, Yang M, Weng X, Choi B, He BJ, Li X (2012) Improving large graph processing on partitioned graphs in the cloud, p\u00a03","DOI":"10.1145\/2391229.2391232"},{"key":"1132_CR7","doi-asserted-by":"publisher","first-page":"65254","DOI":"10.1109\/ACCESS.2021.3075457","volume":"9","author":"D Choi","year":"2021","unstructured":"Choi D, Han J, Lim J, Han J, Bok K, Yoo J (2021) Dynamic graph partitioning scheme for supporting load balancing in distributed graph environments. IEEE Access 9:65254\u201365265","journal-title":"IEEE Access"},{"key":"1132_CR8","doi-asserted-by":"crossref","unstructured":"Dathathri R, Gill G, Hoang L, Dang HV, Pingali K (2018) Gluon: a communication-optimizing substrate for distributed heterogeneous graph analytics. In: Acm Sigplan conference","DOI":"10.1145\/3192366.3192404"},{"issue":"2","key":"1132_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.26421\/JDI2.2-2","volume":"2","author":"A El Moussawi","year":"2021","unstructured":"El Moussawi A, Seghouani NB, Bugiotti F (2021) B-grap: balanced graph partitioning algorithm for large graphs. J Data Intell 2(2):116\u2013135","journal-title":"J Data Intell"},{"key":"1132_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.3389\/fninf.2019.00019","volume":"13","author":"C Fernandezmusoles","year":"2019","unstructured":"Fernandezmusoles C, Coca D, Richmond P (2019) Communication sparsity in distributed spiking neural network simulations to improve scalability. Front Neuroinform 13:19","journal-title":"Front Neuroinform"},{"issue":"7","key":"1132_CR11","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1109\/TPDS.2018.2890515","volume":"30","author":"Q Hua","year":"2019","unstructured":"Hua Q, Li Y, Yu D, Jin H (2019) Quasi-streaming graph partitioning: a game theoretical approach. IEEE Trans Parallel Distrib Syst 30(7):1643\u20131656","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"1132_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3466685","volume":"12","author":"S Ji","year":"2021","unstructured":"Ji S, Bu C, Li L, Wu X (2021) Local graph edge partitioning. ACM Trans Intell Syst Technol (TIST) 12(5):1\u201325","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"issue":"2","key":"1132_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2017.2762294","volume":"30","author":"V Kalavri","year":"2018","unstructured":"Kalavri V, Vlassov V, Haridi S (2018) High-level programming abstractions for distributed graph processing. IEEE Trans Knowl Data Eng 30(2):305\u2013324","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1132_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"1132_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59861-1_6","volume-title":"Solving graph partitioning problems with parallel metaheuristics","author":"Z Kokosi\u0144ski","year":"2018","unstructured":"Kokosi\u0144ski Z, Ba\u0142a M (2018) Solving graph partitioning problems with parallel metaheuristics. Springer, Berlin"},{"key":"1132_CR16","doi-asserted-by":"crossref","unstructured":"Kumar D, Raj A, Dharanipragada J (2017) Graphsteal: dynamic re-partitioning for efficient graph processing in heterogeneous clusters, pp 439\u2013446","DOI":"10.1109\/CLOUD.2017.63"},{"issue":"7","key":"1132_CR17","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSP.2018.2793878","volume":"66","author":"S Liu","year":"2018","unstructured":"Liu S, Chen P, Hero AO (2018) Accelerated distributed dual averaging over evolving networks of growing connectivity. IEEE Trans Signal Process 66(7):1845\u20131859","journal-title":"IEEE Trans Signal Process"},{"issue":"12","key":"1132_CR18","doi-asserted-by":"publisher","first-page":"5094","DOI":"10.1109\/TITS.2019.2948596","volume":"21","author":"WL Liu","year":"2019","unstructured":"Liu WL, Gong YJ, Chen WN, Liu Z, Wang H, Zhang J (2019) Coordinated charging scheduling of electric vehicles: a mixed-variable differential evolution approach. IEEE Trans Intell Transp Syst 21(12):5094\u20135109","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1132_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jnca.2016.05.008","volume":"70","author":"X Liu","year":"2016","unstructured":"Liu X, Zhou Y, Hu C, Guan X (2016) Miracle: a multiple independent random walks community parallel detection algorithm for big graphs. J Netw Comput Appl 70:89\u2013101","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"1132_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1049\/iet-ipr.2017.0273","volume":"12","author":"S Masood","year":"2018","unstructured":"Masood S, Sheng B, Li P, Shen R, Fang R, Wu Q (2018) Automatic choroid layer segmentation using normalized graph cut. IET Image Proc 12(1):53\u201359","journal-title":"IET Image Proc"},{"issue":"7","key":"1132_CR21","first-page":"29","volume":"6","author":"AS Muttipati","year":"2015","unstructured":"Muttipati AS, Padmaja P (2015) Analysis of large graph partitioning and frequent subgraph mining on graph data. Int J Adv Res Comput Sci 6(7):29\u201340","journal-title":"Int J Adv Res Comput Sci"},{"key":"1132_CR22","doi-asserted-by":"crossref","unstructured":"Nishimura J, Ugander J (2013) Restreaming graph partitioning: simple versatile algorithms for advanced balancing, pp 1106\u20131114 (2013)","DOI":"10.1145\/2487575.2487696"},{"key":"1132_CR23","doi-asserted-by":"crossref","unstructured":"Rahimian F, Payberah AH, Girdzijauskas S, Jelasity M, Haridi S (2013) Ja-be-ja: a distributed algorithm for balanced graph partitioning, pp 51\u201360","DOI":"10.1109\/SASO.2013.13"},{"key":"1132_CR24","doi-asserted-by":"crossref","unstructured":"Sajjad HP, Payberah AH, Rahimian F, Vlassov V, Haridi S (2016) Boosting vertex-cut partitioning for streaming graphs, pp 1\u20138","DOI":"10.1109\/BigDataCongress.2016.10"},{"key":"1132_CR25","doi-asserted-by":"crossref","unstructured":"Schulz C, Strash D (2018) Graph partitioning: formulations and applications to big data[M]. In: Encyclopedia of big data technologies. Springer, Cham, pp 1\u20137","DOI":"10.1007\/978-3-319-63962-8_312-2"},{"key":"1132_CR26","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.future.2017.01.014","volume":"71","author":"Z Shi","year":"2017","unstructured":"Shi Z, Li J, Guo P, Li S, Feng D, Su Y (2017) Partitioning dynamic graph asynchronously with distributed fennel. Future Gener Comput Syst 71:32\u201342","journal-title":"Future Gener Comput Syst"},{"key":"1132_CR27","doi-asserted-by":"crossref","unstructured":"Stanton I, Kliot G (2012) Streaming graph partitioning for large distributed graphs, pp 1222\u20131230","DOI":"10.1145\/2339530.2339722"},{"key":"1132_CR28","doi-asserted-by":"crossref","unstructured":"Stanton I, Kliot G (2012) Streaming graph partitioning for large distributed graphs. In: KDD","DOI":"10.1145\/2339530.2339722"},{"key":"1132_CR29","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1109\/TAC.2019.2920812","volume":"65","author":"A Testa","year":"2018","unstructured":"Testa A, Rucco A, Notarstefano G (2018) Distributed mixed-integer linear programming via cut generation and constraint exchange. IEEE Trans Autom Control 65:1456\u20131467","journal-title":"IEEE Trans Autom Control"},{"key":"1132_CR30","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Gkantsidis C, Radunovic B, Vojnovic M (2014) Fennel: streaming graph partitioning for massive scale graphs, pp 333\u2013342","DOI":"10.1145\/2556195.2556213"},{"key":"1132_CR31","doi-asserted-by":"crossref","unstructured":"Wang G, Ng TSE (2010) The impact of virtualization on network performance of amazon ec2 data center, pp 1163\u20131171","DOI":"10.1109\/INFCOM.2010.5461931"},{"issue":"5","key":"1132_CR32","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1111\/tgis.12124","volume":"19","author":"W Wang","year":"2015","unstructured":"Wang W, Du S, Guo Z, Luo L (2015) Polygonal clustering analysis using multilevel graph-partition. Trans GIS 19(5):716\u2013736","journal-title":"Trans GIS"},{"issue":"2","key":"1132_CR33","doi-asserted-by":"publisher","DOI":"10.1002\/ecm.1353","volume":"89","author":"AD Washburne","year":"2019","unstructured":"Washburne AD, Silverman JD, Morton JT, Becker DJ, Crowley DE, Mukherjee S, David LA, Plowright RK (2019) Phylofactorization: a graph partitioning algorithm to identify phylogenetic scales of ecological data. Ecol Monogr 89(2):e01353","journal-title":"Ecol Monogr"},{"key":"1132_CR34","doi-asserted-by":"crossref","unstructured":"Xiaofeng Y, Yumei Z, Yang W (2013) The innovation of e-commerce financial service product based on cloud computing-taking alibaba finance as an example, pp 259\u2013261","DOI":"10.1109\/ICSSSM.2013.6602646"},{"key":"1132_CR35","doi-asserted-by":"crossref","unstructured":"Xu H, Li B (2014) Repflow: minimizing flow completion times with replicated flows in data centers. In: International conference on computer communications, pp 1581\u20131589","DOI":"10.1109\/INFOCOM.2014.6848094"},{"issue":"6","key":"1132_CR36","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TKDE.2014.2377743","volume":"27","author":"N Xu","year":"2014","unstructured":"Xu N, Cui B, Chen L, Huang Z, Shao Y (2014) Heterogeneous environment aware streaming graph partitioning. IEEE Trans Knowl Data Eng 27(6):1560\u20131572","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1132_CR37","doi-asserted-by":"crossref","unstructured":"Yi S, Kondo D, Andrzejak A (2010) Reducing costs of spot instances via checkpointing in the amazon elastic compute cloud, pp 236\u2013243","DOI":"10.1109\/CLOUD.2010.35"},{"issue":"4","key":"1132_CR38","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1007\/s10586-016-0625-2","volume":"19","author":"X Zhang","year":"2016","unstructured":"Zhang X, Wu Y, Zhao C (2016) Mrheter: improving mapreduce performance in heterogeneous environments. Clust Comput 19(4):1691\u20131701","journal-title":"Clust Comput"},{"issue":"11","key":"1132_CR39","doi-asserted-by":"publisher","first-page":"5291","DOI":"10.1109\/TCYB.2020.3025662","volume":"51","author":"F Zhao","year":"2020","unstructured":"Zhao F, He X, Wang L (2020) A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem. IEEE Trans Cybern 51(11):5291\u20135303","journal-title":"IEEE Trans Cybern"},{"key":"1132_CR40","doi-asserted-by":"crossref","unstructured":"Zhao F, Ma R, Wang L (2022) A self-learning discrete jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system. In: IEEE transactions on cybernetics, vol 52, no 12, pp 12675\u201312686","DOI":"10.1109\/TCYB.2021.3086181"},{"key":"1132_CR41","doi-asserted-by":"crossref","unstructured":"Zheng A, Labrinidis A, Chrysanthis PK (2016) Planar: parallel lightweight architecture-aware adaptive graph repartitioning, pp 121\u2013132","DOI":"10.1109\/ICDE.2016.7498234"},{"issue":"3","key":"1132_CR42","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1109\/TCYB.2019.2939219","volume":"51","author":"S Zhou","year":"2019","unstructured":"Zhou S, Xing L, Zheng X, Du N, Wang L, Zhang Q (2019) A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times. IEEE Trans Cybern 51(3):1430\u20131442","journal-title":"IEEE Trans Cybern"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01132-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01132-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01132-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T16:16:47Z","timestamp":1675181807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01132-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,27]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1132"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01132-y","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,27]]},"assertion":[{"value":"9 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}