{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:54:51Z","timestamp":1742399691202},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642297366"},{"type":"electronic","value":"9783642297373"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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":[[2012]]},"DOI":"10.1007\/978-3-642-29737-3_49","type":"book-chapter","created":{"date-parts":[[2012,4,13]],"date-time":"2012-04-13T13:54:33Z","timestamp":1334325273000},"page":"440-449","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Performance Evaluation of List Based Scheduling on Heterogeneous Systems"],"prefix":"10.1007","author":[{"given":"Hamid","family":"Arabnejad","sequence":"first","affiliation":[]},{"given":"Jorge G.","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Cerny, V.: Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 41\u201351 (1985)","key":"49_CR1","DOI":"10.1007\/BF00940812"},{"unstructured":"Coffman, E.G.: Computer and job-shop scheduling theory. Wiley (1976)","key":"49_CR2"},{"issue":"9","key":"49_CR3","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1006\/jpdc.2002.1850","volume":"62","author":"M.K. Dhodhi","year":"2002","unstructured":"Dhodhi, M.K., Ahmad, I., Yatama, A., et al.: An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. Journal of Parallel and Distributed Computing\u00a062(9), 1338\u20131361 (2002)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artifitial Life\u00a05, 137\u2013172 (1999)","journal-title":"Artifitial Life"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H. El-Rewini","year":"1990","unstructured":"El-Rewini, H., Lewis, T.G.: Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing\u00a09(2 ), 138\u2013153 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"49_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part i. ORSA Journal on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part ii. ORSA Journal on Computing\u00a02(1), 4\u201332 (1990)","journal-title":"ORSA Journal on Computing"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/0167-8191(94)90121-X","volume":"20","author":"D. Kim","year":"1994","unstructured":"Kim, D., Yi, B.-G.: A two-pass scheduling algorithm for parallel programs. Parallel Computing\u00a020, 869\u2013885 (1994)","journal-title":"Parallel Computing"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/321796.321808","volume":"2","author":"W.H. Kohler","year":"1974","unstructured":"Kohler, W.H., Steiglitz, K.: Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of ACM\u00a02, 140\u2013156 (1974)","journal-title":"Journal of ACM"},{"issue":"4","key":"49_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y. Kwok","year":"1999","unstructured":"Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys"},{"issue":"5","key":"49_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y.-K. Kwok","year":"1996","unstructured":"Kwok, Y.-K., Ahmad, I.: Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems\u00a07(5), 506\u2013521 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"unstructured":"Liou, J.-C., Palis, M.A.: A comparison of general approaches to multiprocessor scheduling. In: International Parallel Processing Symposium, pp. 152\u2013156 (1997)","key":"49_CR14"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0205005","volume":"5","author":"C. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C., Yannakakis, M.: Scheduling interval ordered tasks. SIAM Journal of Computing\u00a05, 73\u201382 (1976)","journal-title":"SIAM Journal of Computing"},{"unstructured":"DAG\u00a0Generation Program (2010), \n                    \n                      http:\/\/www.loria.fr\/~suter\/dags.html","key":"49_CR16"},{"key":"49_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.parco.2003.09.002","volume":"30","author":"O. Sinnen","year":"2004","unstructured":"Sinnen, O., Sousa, L.: List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing\u00a030, 81\u2013101 (2004)","journal-title":"Parallel Computing"},{"issue":"3","key":"49_CR18","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H. Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems\u00a013(3), 260\u2013274 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29737-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:50:25Z","timestamp":1587329425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29737-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642297366","9783642297373"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29737-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}