{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:59:34Z","timestamp":1742403574113},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310242"},{"type":"electronic","value":"9783540316176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11605300_9","type":"book-chapter","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T13:01:31Z","timestamp":1134046891000},"page":"173-193","source":"Crossref","is-referenced-by-count":28,"title":["Evolving Toward the Perfect Schedule: Co-scheduling Job Assignments and Data Replication in Wide-Area Systems Using a Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Phan","sequence":"first","affiliation":[]},{"given":"Kavitha","family":"Ranganathan","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Sion","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Adamic, L.: Zipf, Power-laws, and Pareto \u2013 a ranking tutorial, http:\/\/www.hpl.hp.com\/research\/idl\/papers\/ranking\/ranking.html"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baeck, T., Fogel, D., Michalewicz, Z. (eds.): Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing (2000)","DOI":"10.1201\/9781482268713"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Braun, T., Siegel, H., Beck, N., Boloni, L., Maheswaran, M., Reuther, A., Robertson, J., Theys, M., Yao, B., Hengsen, D., Freund, R.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing\u00a061(6) (June 2001)","DOI":"10.1006\/jpdc.2000.1714"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Heterogeneous Computing Workshop (May 2000)","DOI":"10.1109\/HCW.2000.843757"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-30474-6_41","volume-title":"High Performance Computing - HiPC 2004","author":"A. Chakrabarti","year":"2004","unstructured":"Chakrabarti, A., Dheepak, R.A., Sengupta, S.: Integration of Scheduling and Replication in Data Grids. In: Boug\u00e9, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol.\u00a03296, pp. 375\u2013385. Springer, Heidelberg (2004)"},{"key":"9_CR6","unstructured":"Davis, L.: Job Shop Scheduling with Genetic Algorithms. In: Proceedings of the International Conference on High Performance Computing (1985)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Deelman, E., Kosar, T., Kesselman, C., Livny, M.: What Makes Workflows Work in an Opportunistic Environment? In: Concurrency and Computation: Practice and Experience (2004)","DOI":"10.1002\/cpe.1001"},{"key":"9_CR8","unstructured":"Feitelson, D.: A Survey of Scheduling in Multiprogrammed Parallel Systems. IBM Research Report RC 19790 (87657) (1994)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11407522_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Feitelson","year":"2005","unstructured":"Feitelson, D., Rudolph, L., Schwiegelshohn, U.: Parallel Job Scheduling \u2013 A Status Report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"9_CR10","unstructured":"The Grid Physics Project, http:\/\/www.griphyn.org"},{"key":"9_CR11","unstructured":"Holtman, K.: CMS Requirements for the Grid. In: Proceedings of the International Conference on Computing in High Energy and Nuclear Physics (2001)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Hu, N., Li, L., Mao, Z., Steenkiste, P., Wang, J.: Locating Internet Bottlenecks: Algorithms, Measurements, and Implications. In: Proceedings of SIGCOMM (2004)","DOI":"10.1145\/1015467.1015474"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kosar, T., Livny, M.: Stork: Making Data Placement a First Class Citizen in the Grid. In: Proceedings of IEEE International Conference on Distributed Computing Systems (2004)","DOI":"10.1109\/ICDCS.2004.1281599"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Lifka","year":"1995","unstructured":"Lifka, D.: The ANL\/IBM SP Scheduling System. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949. Springer, Heidelberg (1995)"},{"key":"9_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04131-4","volume-title":"How to Solve It: Modern Heuristics","author":"Z. Michaelewicz","year":"2000","unstructured":"Michaelewicz, Z., Fogel, D.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2000)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Mohamed, H., Epema, D.: An Evaluation of the Close-to-Files Processor and Data Co-Allocation Policy in Multiclusters. In: Proceedings of the IEEE International Conference on Cluster Computing (2004)","DOI":"10.1109\/CLUSTR.2004.1392626"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Mu\u2019alem, A., Feitelson, D.: Utilization, Predictability, Workloads,and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems (June 2001)","DOI":"10.1109\/71.932708"},{"key":"9_CR18","unstructured":"The Particle Physics Data Grid, http:\/\/www.ppdg.net"},{"key":"9_CR19","volume-title":"Grid Resource Management: State of the Art and Future Trends","author":"K. Ranganathan","year":"2003","unstructured":"Ranganathan, K., Foster, I.: Computation Scheduling and Data Replication Algorithms for Data Grids. In: Nabrzyski, J., Schopf, J., Weglarz, J. (eds.) Grid Resource Management: State of the Art and Future Trends. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ribeiro, V., Riedi, R., Baraniuk, R.: Locating Available Bandwidth Bottlenecks. IEEE Internet Computing (September-October 2004)","DOI":"10.1109\/MIC.2004.45"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11407522_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Santos-Neto","year":"2005","unstructured":"Santos-Neto, E., Cirne, W., Brasileiro, F., Lima, A.: Exploiting Replication and Data Reuse to Efficiently Schedule Data-Intensive Applications on Grids. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 210\u2013232. Springer, Heidelberg (2005)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/10968987_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Schmueli","year":"2003","unstructured":"Schmueli, E., Feitelson, D.: Backfilling with Lookahead to Optimize the Packing of Parallel Jobs. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 228\u2013251. Springer, Heidelberg (2003)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Stockinger, H., Samar, A., Allcock, B., Foster, I., Holtman, K., Tierney, B.: File and Object Replication in Data Grids. In: Proceedings of the 10th International Symposium on High Performance Distributed Computing (2001)","DOI":"10.1109\/HPDC.2001.945178"},{"key":"9_CR24","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: Proceedings of Supercomputing (2001)","DOI":"10.1145\/582034.582092"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605300_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T15:28:44Z","timestamp":1706801324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605300_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310242","9783540316176"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11605300_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}