{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:28Z","timestamp":1764996988377,"version":"3.40.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T00:00:00Z","timestamp":1383091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10766-013-0289-y","type":"journal-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T10:37:45Z","timestamp":1383043065000},"page":"755-775","source":"Crossref","is-referenced-by-count":14,"title":["A Cluster-Based Data-Centric Model for Network-Aware Task Scheduling in Distributed Systems"],"prefix":"10.1007","volume":"42","author":[{"given":"Ugo","family":"Fiore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Palmieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniello","family":"Castiglione","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,30]]},"reference":[{"key":"289_CR1","unstructured":"Eli Dart, B.T.: HEP (High Energy Physics) Network requirements workshop\u2014final report LBNL-3397E. In: ESnet Network Requirements Workshop, pp. 1\u201361 (2009)"},{"key":"289_CR2","unstructured":"Eli Dart, B.T.: BER (Biological and Environmental Research) Network requirements workshop\u2014final report LBNL-4089E. In: ESnet Network Requirements Workshop, pp. 1\u2013104 (2010)"},{"key":"289_CR3","unstructured":"Gantz, J., Reinsel, D.: Extracting value from chaos, IDC Technical Document 1142, International Data Corporation, Framingham, MA (2011)"},{"key":"289_CR4","doi-asserted-by":"crossref","unstructured":"Chang, H.J., Wu, J.J., Liu, P.: Job scheduling techniques for distributed systems with heterogeneous processor cardinality. In: 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), pp. 57\u201362 (2009). doi: 10.1109\/I-SPAN.2009.68","DOI":"10.1109\/I-SPAN.2009.68"},{"issue":"3","key":"289_CR5","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J Ullman","year":"1975","unstructured":"Ullman, J.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975). doi: 10.1016\/S0022-0000(75)80008-0","journal-title":"J. Comput. Syst. Sci."},{"key":"289_CR6","doi-asserted-by":"crossref","unstructured":"Amin, A., Ammar, R., El Dessouly, A.: Scheduling real time parallel structures on cluster computing with possible processor failures. In: Proceedings, Ninth International Symposium on Computers and Communications (ISCC 2004), vol. 1, pp. 62\u201367 (2004)","DOI":"10.1109\/ISCC.2004.1358382"},{"key":"289_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, New York (1979)"},{"issue":"4","key":"289_CR8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/2043164.2018448","volume":"41","author":"M Chowdhury","year":"2011","unstructured":"Chowdhury, M., Zaharia, M., Ma, J., Jordan, M., Stoica, I.: Managing data transfers in computer clusters with orchestra. SIGCOMM-Comput. Commun. Rev. 41(4), 98\u2013109 (2011)","journal-title":"SIGCOMM-Comput. Commun. Rev."},{"issue":"4","key":"289_CR9","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/JCN.2007.6182871","volume":"9","author":"F Palmieri","year":"2007","unstructured":"Palmieri, F., Fiore, U., Ricciardi, S.: SPARK: a smart parametric online RWA algorithm. J. Commun. Netw. 9(4), 368\u2013376 (2007)","journal-title":"J. Commun. Netw."},{"issue":"2","key":"289_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). doi: 10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"289_CR11","doi-asserted-by":"crossref","unstructured":"Arthur, D., Manthey, B., Roglin, H.: k-Means has polynomial smoothed complexity. In: 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201909), pp. 405\u2013414 (2009)","DOI":"10.1109\/FOCS.2009.14"},{"key":"289_CR12","doi-asserted-by":"crossref","unstructured":"Subramani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, S.: Distributed job scheduling on computational grids using multiple simultaneous requests. In: Proceedings, 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), pp. 359\u2013366 (2002)","DOI":"10.1109\/HPDC.2002.1029936"},{"key":"289_CR13","unstructured":"James, H.A., Hawick, K.A., Coddington, P.D., et al.: Scheduling independent tasks on metacomputing systems. In: Proceedings of Parallel and Distributed Computing Systems (PDCS \u201999), Fort Lauderdale, Florida (1999)"},{"key":"289_CR14","first-page":"191","volume":"2000","author":"V Hamscher","year":"2000","unstructured":"Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of job-scheduling strategies for grid computing. Grid Computing GRID 2000, 191\u2013202 (2000)","journal-title":"Grid Computing GRID"},{"issue":"4","key":"289_CR15","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1504\/IJAC.2010.037511","volume":"1","author":"F Pop","year":"2010","unstructured":"Pop, F., Dobre, C., Stratan, C., Costan, A., Cristea, V.: Dynamic meta-scheduling architecture based on monitoring in distributed systems. Int. J. Auton. Comput. 1(4), 328\u2013349 (2010). doi: 10.1504\/IJAC.2010.037511","journal-title":"Int. J. Auton. Comput."},{"issue":"7","key":"289_CR16","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1016\/j.future.2008.11.006","volume":"25","author":"F Palmieri","year":"2009","unstructured":"Palmieri, F.: Network-aware scheduling for real-time execution support in data-intensive optical grids. Future Gener. Comput. Syst. 25(7), 794\u2013803 (2009)","journal-title":"Future Gener. Comput. Syst."},{"key":"289_CR17","doi-asserted-by":"crossref","unstructured":"Casanova, H., Berman, F., Obertelli, G., Wolski, R.: The AppLeS parameter sweep template: User-level middleware for the grid. In: ACM\/IEEE 2000 Supercomputing Conference, pp. 60\u201360 (2000)","DOI":"10.1109\/SC.2000.10061"},{"issue":"1","key":"289_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/A:1024035627870","volume":"1","author":"K Ranganathan","year":"2003","unstructured":"Ranganathan, K., Foster, I.: Simulation studies of computation and data scheduling algorithms for data grids. J. Grid Comput. 1(1), 53\u201362 (2003)","journal-title":"J. Grid Comput."},{"key":"289_CR19","doi-asserted-by":"crossref","unstructured":"Ranganathan, K., Foster, I.: Decoupling computation and data scheduling in distributed data-intensive applications. In: Proceedings, 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), pp. 352\u2013358 (2002)","DOI":"10.1109\/HPDC.2002.1029935"},{"key":"289_CR20","doi-asserted-by":"crossref","unstructured":"Cameron, D.G., Carvajal-Schiaffino, R., Millar, A.P., Nicholson, C., Stockinger, K., Zini, F.: Evaluating scheduling and replica optimisation strategies in OptorSim. In: Proceedings of the 4th International Workshop on Grid Computing, p. 52. IEEE Computer Society (2003)","DOI":"10.1109\/GRID.2003.1261698"},{"key":"289_CR21","unstructured":"Basney, J., Livny, M., Mazzanti, P.: Harnessing the capacity of computational grids for high energy physics. In: Conference on Computing in High Energy and Nuclear Physics (2000)"},{"key":"289_CR22","doi-asserted-by":"crossref","unstructured":"Alhusaini, A.H., Prasanna, V.K., Raghavendra, C.S.: A unified resource scheduling framework for heterogeneous computing environments. In: Proceedings, Eighth Heterogeneous Computing Workshop (HCW\u201999), pp. 156\u2013165 (1999)","DOI":"10.1109\/HCW.1999.765123"},{"key":"289_CR23","doi-asserted-by":"crossref","unstructured":"Thain, D., Bent, J., Arpaci-Dusseau, A., Arpaci-Dusseau, R., Livny, M.: Gathering at the well: creating communities for grid I\/O. In: Supercomputing, ACM\/IEEE 2001 Conference, pp. 21\u201321 (2001)","DOI":"10.1145\/582034.582092"},{"key":"289_CR24","doi-asserted-by":"crossref","unstructured":"Kosar, T., Livny, M.: Stork: Making data placement a first class citizen in the grid. In: Proceedings, 24th International Conference on Distributed Computing Systems, pp. 342\u2013349 (2004)","DOI":"10.1109\/ICDCS.2004.1281599"},{"key":"289_CR25","first-page":"50","volume":"40","author":"T Kosar","year":"2006","unstructured":"Kosar, T.: A new paradigm in data intensive computing: Stork and the data-aware schedulers. Genome 40, 50 (2006)","journal-title":"Genome"},{"issue":"1","key":"289_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10723-006-9059-z","volume":"5","author":"R McClatchey","year":"2007","unstructured":"McClatchey, R., Anjum, A., Stockinger, H., Ali, A., Willers, I., Thomas, M.: Data intensive and network aware (DIANA) grid scheduling. J. Grid Comput. 5(1), 43\u201364 (2007)","journal-title":"J. Grid Comput."},{"key":"289_CR27","doi-asserted-by":"crossref","unstructured":"Schintke, F., Schutt, T., Reinefeld, A.: A framework for self-optimizing Grids using P2P components. In: Proceedings, 14th International Workshop on Database and Expert Systems Applications, pp. 689\u2013693 (2003)","DOI":"10.1109\/DEXA.2003.1232101"},{"key":"289_CR28","doi-asserted-by":"crossref","unstructured":"Liu, H., Orban, D.: Gridbatch: Cloud computing for large-scale data-intensive batch applications. In: 8th IEEE International Symposium on Cluster Computing and the Grid (CCGRID\u201908), pp. 295\u2013305 (2008)","DOI":"10.1109\/CCGRID.2008.30"},{"issue":"1","key":"289_CR29","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF02936064","volume":"17","author":"F Manea","year":"2005","unstructured":"Manea, F., Ploscaru, C.: Solving a combinatorial problem with network flows. J. Appl. Math. Comput. 17(1), 391\u2013399 (2005)","journal-title":"J. Appl. Math. Comput."},{"issue":"2","key":"289_CR30","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F Shahrokhi","year":"1990","unstructured":"Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM (JACM) 37(2), 318\u2013334 (1990)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"289_CR31","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/j.comnet.2007.12.005","volume":"52","author":"K Rajah","year":"2008","unstructured":"Rajah, K., Ranka, S., Xia, Y.: Scheduling bulk file transfers with start and end times. Comput. Netw. 52(5), 1105\u20131122 (2008)","journal-title":"Comput. Netw."},{"issue":"3","key":"289_CR32","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"EG Coffman Jr","year":"1985","unstructured":"Coffman Jr, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744\u2013780 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0289-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-013-0289-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0289-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T18:40:26Z","timestamp":1746038426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-013-0289-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,30]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1007\/s10766-013-0289-y","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2013,10,30]]}}}