{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:16:09Z","timestamp":1742393769742},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437864"},{"type":"electronic","value":"9783540480518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48051-x_42","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:49:55Z","timestamp":1179492595000},"page":"423-432","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids"],"prefix":"10.1007","author":[{"given":"C.","family":"Banino","sequence":"first","affiliation":[]},{"given":"O.","family":"Beaumont","sequence":"additional","affiliation":[]},{"given":"A.","family":"Legrand","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Robert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"42_CR1","volume-title":"Technical Report 2002-12","author":"C. Banino","year":"2002","unstructured":"C. Banino, O. Beaumont, A. Legrand, and Y. Robert. Scheduling strategies for master-slave tasking on heterogeneous processor grids. Technical Report 2002-12, LIP, ENS Lyon, France, March 2002."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Bandwidth-centric allocation of independent tasks on heterogeneous platforms. In International Parallel and Distributed Processing Symposium IPDPS\u20192002. IEEE Computer Society Press, 2002. Extended version available as LIP Research Report 2001-25.","DOI":"10.1109\/IPDPS.2002.1015568"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"O. Beaumont, A. Legrand, and Y. Robert. The master-slave paradigm with heterogeneous processors. In D.S. Katz, T. Sterling, M. Baker, L. Bergman, M. Paprzycki, and R. Buyya, editors, Cluster\u20192001, pages 419\u2013426. IEEE Computer Society Press, 2001. Extended version available as LIP Research Report 2001-13.","DOI":"10.1109\/CLUSTR.2001.960008"},{"key":"42_CR4","volume-title":"Technical Report 2002-07","author":"O. Beaumont","year":"2002","unstructured":"O. Beaumont, A. Legrand, and Y. Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. Technical Report 2002-07, LIP, ENS Lyon, France, February 2002."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"P.B. Bhat, V.K. Prasanna, and C.S. Raghavendra. Efficient collective communication in distributed heterogeneous systems. In 19th IEEE International Conference on Distributed Computing Systems (ICDCS\u201999). IEEE Computer Society Press, 1999.","DOI":"10.1109\/ICDCS.1999.776502"},{"key":"42_CR6","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"42_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/BFb0034863","volume-title":"Advances in Cryptology-Asiacrypt\u2019 96","author":"J. Cowie","year":"1996","unstructured":"James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Joerg Zayer. A world wide number field sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology-Asiacrypt\u2019 96, volume 1163 of LNCS, pages 382\u2013394. Springer Verlag, 1996."},{"key":"42_CR8","unstructured":"Entropia. URL: http:\/\/www.entropia.com ."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"J.P Goux, S. Kulkarni, J. Linderoth, and M. Yoder. An enabling framework for master-worker applications on the computational grid. In Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC\u201900). IEEE Computer Society Press, 2000.","DOI":"10.1109\/HPDC.2000.868633"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"J.-I. Hatta and S. Shibusawa. Scheduling algorithms for efficient gather operations in distributed heterogeneous systems. In 2000 International Conference on Parallel Processing (ICPP\u20192000). IEEE Computer Society Press, 2000.","DOI":"10.1109\/ICPPW.2000.869101"},{"key":"42_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44444-0_20","volume-title":"Grid Computing-GRID 2000","author":"E. Heymann","year":"2000","unstructured":"E. Heymann, M.A. Senar, E. Luque, and M. Livny. Adaptive scheduling for master-worker applications on the computational grid. In R. Buyya and M. Baker, editors, Grid Computing-GRID 2000, pages 214\u2013227. Springer-Verlag LNCS 1971, 2000."},{"issue":"11","key":"42_CR12","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1006\/jpdc.2001.1759","volume":"61","author":"R. Libeskind-Hadas","year":"2001","unstructured":"R. Libeskind-Hadas, J.R.K. Hartline, P. Boothe, G. Rae, and J. Swisher. On multicast algorithms for heterogeneous networks of workstations. Journal of Parallel and Distributed Computing, 61(11):1665\u20131679, 2001.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"42_CR13","unstructured":"Prime. URL: http:\/\/www.mersenne.org ."},{"key":"42_CR14","unstructured":"SETI. URL: http:\/\/setiathome.ssl.berkeley.edu ."},{"key":"42_CR15","unstructured":"G. Shao. Adaptive scheduling of master\/worker applications on distributed computational resources. PhD thesis, Dept. of Computer Science, University Of California at San Diego, 2001."},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"J.B. Weissman. Scheduling multi-component applications in heterogeneous wide-area networks. In Heterogeneous Computing Workshop HCW\u201900. IEEE Computer Society Press, 2000.","DOI":"10.1109\/HCW.2000.843745"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48051-X_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:45:13Z","timestamp":1556412313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48051-X_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437864","9783540480518"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48051-x_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}