{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:17:28Z","timestamp":1742977048529,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_25","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"241-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A New Genetic Algorithm for Scheduling for Large Communication Delays"],"prefix":"10.1007","author":[{"given":"Johnatan E.","family":"Pecero","sequence":"first","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0470121173","volume-title":"Task Scheduling for Parallel Systems","author":"O. Sinnen","year":"2007","unstructured":"Sinnen, O.: Task Scheduling for Parallel Systems. Wiley-Interscience, NJ (2007)"},{"key":"25_CR2","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge (1989)"},{"issue":"7","key":"25_CR3","first-page":"667","volume":"17","author":"V. Kianzad","year":"2006","unstructured":"Kianzad, V., Bhattacharyya, S.S.: Efficient techniques for clustering and scheduling onto embedded multiprocessors. IEEE TPDS\u00a017(7), 667\u2013680 (2006)","journal-title":"IEEE TPDS"},{"key":"25_CR4","unstructured":"Lep\u00e8re, R., Trystram, D.: A new clustering algorithm for large communication delays. In: Proc. 11th IPDPS 2002, Fort Lauderdale, Florida, April 2002, pp. 68\u201373 (2002)"},{"key":"25_CR5","unstructured":"Mahjoub, A., Pecero, J.E., Trystram, D.: Scheduling with uncertainties on new computing platforms. Journal Comput. Optim. Appl. (to appear)"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","volume":"18","author":"V.J. Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.J.: Uet scheduling with unit interprocessor communication delays. Discrete Applied Mathematics\u00a018(1), 55\u201371 (1987)","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"25_CR7","first-page":"951","volume":"5","author":"T. Yang","year":"1994","unstructured":"Yang, T., Gerasoulis, A.: Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE TPDS\u00a05(9), 951\u2013967 (1994)","journal-title":"IEEE TPDS"},{"issue":"9","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1145\/66451.66454","volume":"32","author":"C. McCreary","year":"1989","unstructured":"McCreary, C., Gill, H.: Automatic determination of grain size for efficient parallel processing. Comm. of ACM\u00a032(9), 1073\u20131078 (1989)","journal-title":"Comm. of ACM"},{"key":"25_CR9","volume-title":"Genetic algorithms in search, optimization, machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, machine learning. Addison-Wesley, Boston (1989)"},{"volume-title":"Solutions to parallel and distributed computing problems : Lessons from biological sciences","year":"2001","key":"25_CR10","unstructured":"Zomaya, A.Y., Ercal, F., Olariou, S. (eds.): Solutions to parallel and distributed computing problems: Lessons from biological sciences. Wiley, NY (2001)"},{"key":"25_CR11","unstructured":"Zomaya, A.Y., Chan, G.: Efficient clustering for parallel tasks execution in distributed systems. In: Proc. NIDISC 2004, IPDPS (April 2004)"},{"key":"25_CR12","volume-title":"Genetic algorithms and grouping problems","author":"E. Falkenauer","year":"1999","unstructured":"Falkenauer, E.: Genetic algorithms and grouping problems. John Wiley and Sons Ltd., England (1999)"},{"issue":"3","key":"25_CR13","first-page":"381","volume":"59","author":"Y.K. Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. JPDC\u00a059(3), 381\u2013422 (1999)","journal-title":"JPDC"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J.J. Hwang","year":"1989","unstructured":"Hwang, J.J., Chow, Y.C., Angers, F.D., Lee, C.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing\u00a018(2), 244\u2013257 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"25_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S1383-7621(96)00022-7","volume":"42","author":"J.P. Kitajima","year":"1996","unstructured":"Kitajima, J.P., Plateau, B., Bouvry, P., Trystram, D.: Andes: Evaluating mapping strategies with synthetic programs. J. of Syst. Arch.\u00a042(5), 351\u2013365 (1996)","journal-title":"J. of Syst. Arch."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00582738","volume":"1","author":"P. Winkler","year":"1985","unstructured":"Winkler, P.: Random orders. Order\u00a01, 317\u2013331 (1985)","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T13:37:57Z","timestamp":1589895477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}