{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:22Z","timestamp":1742913562942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031105388"},{"type":"electronic","value":"9783031105395"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10539-5_26","type":"book-chapter","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T13:05:22Z","timestamp":1657890322000},"page":"360-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Data Distribution Strategy for Distributed Graph Processing System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8787-9086","authenticated-orcid":false,"given":"Aradhita","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Rituparna","family":"Chaki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3242-680X","authenticated-orcid":false,"given":"Nabendu","family":"Chaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,16]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.engappai.2017.02.013","volume":"61","author":"M Akbari","year":"2017","unstructured":"Akbari, M., Rashidi, H., Alizadeh, S.H.: An enhanced genetic algorithm with new operators for task scheduling in heterogeneous computing systems. Eng. Appl. Artif. Intell. 61, 35\u201346 (2017)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1\u20132","key":"26_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"VE Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theoret. Comput. Sci. 389(1\u20132), 219\u2013236 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Commun. ACM 23(4), 214\u2013229 (1980)","journal-title":"Commun. ACM"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/060666238","volume":"21","author":"K Cameron","year":"2008","unstructured":"Cameron, K., Eschen, E.M., Ho\u00e0ng, C.T., Sritharan, R.: The complexity of the list partition problem for graphs. SIAM J. Discret. Math. 21(4), 900\u2013929 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"WH Day","year":"1984","unstructured":"Day, W.H., Edelsbrunner, H.: Efficient algorithms for agglomerative hierarchical clustering methods. J. Classif. 1(1), 7\u201324 (1984)","journal-title":"J. Classif."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Golab, L., Hadjieleftheriou, M., Karloff, H., Saha, B.: Distributed data placement to minimize communication costs via graph partitioning. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management, pp. 1\u201312 (2014)","DOI":"10.1145\/2618243.2618258"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0031-3203(78)90018-3","volume":"10","author":"KC Gowda","year":"1978","unstructured":"Gowda, K.C., Krishna, G.: Agglomerative clustering using the concept of mutual nearest neighbourhood. Pattern Recogn. 10(2), 105\u2013112 (1978)","journal-title":"Pattern Recogn."},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2017.2762294","volume":"30","author":"V Kalavri","year":"2017","unstructured":"Kalavri, V., Vlassov, V., Haridi, S.: High-level programming abstractions for distributed graph processing. IEEE Trans. Knowl. Data Eng. 30(2), 305\u2013324 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"26_CR9","unstructured":"Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. Adv. Neural Inf. Process. Syst. 25 (2012)"},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TKDE.2018.2843361","volume":"31","author":"W Lu","year":"2018","unstructured":"Lu, W., Shen, Y., Wang, T., Zhang, M., Jagadish, H.V., Du, X.: Fast failure recovery in vertex-centric distributed graph processing systems. IEEE Trans. Knowl. Data Eng. 31(4), 733\u2013746 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.14778\/2824032.2824046","volume":"8","author":"D Margo","year":"2015","unstructured":"Margo, D., Seltzer, M.: A scalable distributed graph partitioner. Proc. VLDB Endow. 8(12), 1478\u20131489 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Murtagh, F., Contreras, P.: Algorithms for hierarchical clustering: an overview, II. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 7(6), e1219 (2017)","DOI":"10.1002\/widm.1219"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the tenth ACM International Conference on Web Search and Data Mining, pp. 601\u2013610 (2017)","DOI":"10.1145\/3018661.3018731"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11605300_9","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"T Phan","year":"2005","unstructured":"Phan, T., Ranganathan, K., Sion, R.: Evolving toward the perfect schedule: co-scheduling job assignments and data replication in wide-area systems using a genetic algorithm. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 173\u2013193. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11605300_9"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/cpe.3216","volume":"27","author":"S Prakash","year":"2015","unstructured":"Prakash, S., Vidyarthi, D.P.: Maximizing availability for task scheduling in computational grid using genetic algorithm. Concurr. Comput.: Pract. Exp. 27(1), 193\u2013210 (2015)","journal-title":"Concurr. Comput.: Pract. Exp."},{"issue":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2714568","volume":"10","author":"F Rahimian","year":"2015","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Jelasity, M., Haridi, S.: A distributed algorithm for large-scale graph partitioning. ACM Trans. Auton. Adapt. Syst. (TAAS) 10(2), 1\u201324 (2015)","journal-title":"ACM Trans. Auton. Adapt. Syst. (TAAS)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Sajjad, H.P., Rahimian, F., Vlassov, V.: Smart partitioning of geo-distributed resources to improve cloud network performance. In: 2015 IEEE 4th International Conference on Cloud Networking (CloudNet), pp. 112\u2013118. IEEE (2015)","DOI":"10.1109\/CloudNet.2015.7335292"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Shahapure, K.R., Nicholas, C.: Cluster quality analysis using silhouette score. In: 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA), pp. 747\u2013748. IEEE (2020)","DOI":"10.1109\/DSAA49011.2020.00096"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Sun, J., Dong, X., Zhang, X., Wang, Y.: An availability approached task scheduling algorithm in heterogeneous fault-tolerant system. In: 2014 9th IEEE International Conference on Networking, Architecture, and Storage, pp. 275\u2013280. IEEE (2014)","DOI":"10.1109\/NAS.2014.47"},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994)","journal-title":"Stat. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10539-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T21:14:58Z","timestamp":1668546898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10539-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031105388","9783031105395"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10539-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barranquilla","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cisim2022.wi.pb.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}