{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:16:17Z","timestamp":1759133777596},"reference-count":25,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0167-8191(03)00095-4","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T13:11:36Z","timestamp":1063372296000},"page":"1121-1152","source":"Crossref","is-referenced-by-count":49,"title":["Scheduling divisible workloads on heterogeneous platforms"],"prefix":"10.1016","volume":"29","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Legrand","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00095-4_BIB1","series-title":"Scheduling Divisible Loads in Parallel and Distributed Systems","author":"Bharadwaj","year":"1996"},{"issue":"3","key":"10.1016\/S0167-8191(03)00095-4_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/71.674315","article-title":"Optimizing computing costs using divisible load analysis","volume":"9","author":"Sohn","year":"1998","journal-title":"IEEE Transactions on parallel and distributed systems"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-8191(94)00068-L","article-title":"Parallel image processing applications on a network of workstations","volume":"21","author":"Lee","year":"1995","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB4","series-title":"IEEE Int. Conference on Multimedia Computing and Systems","article-title":"An optimal scheduling algorithm for parallel video processing","author":"Altilar","year":"1998"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB5","series-title":"Euro-Par 2002, LNCS 2400","first-page":"197","article-title":"Optimal scheduling algorithms for communication constrained parallel processing","author":"Altilar","year":"2002"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB6","unstructured":"M. Drozdowski, Selected problems of scheduling tasks in multiprocessor computing systems, Ph.D. Thesis, Instytut Informatyki Politechnika Poznanska, Poznan, 1997"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0167-8191(98)00104-5","article-title":"Divisible task scheduling\u2013\u2013concept and verification","volume":"25","author":"Blazewicz","year":"1999","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB8","series-title":"Measurement and Modeling of Computer Systems (SIGMETRICS\u201998)","first-page":"22","article-title":"Modeling communication pipeline latency","author":"Wang","year":"1998"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB9","series-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey","year":"1991"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB10","series-title":"Task Scheduling in Parallel and Distributed Systems","author":"El-Rewini","year":"1994"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB11","series-title":"Scheduling Theory and its Applications","year":"1995"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB12","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB13","series-title":"Parallel Computer Architecture: A Hardware\/Software Approach","author":"Culler","year":"1999"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB14","unstructured":"Y. Yang, H. Casanova, Multi-round algorithm for scheduling divisible workload applications: analysis and experimental evaluation, Tech. Rep. CS2002-0721, Department of Computer Science and Engineering, University of California, San Diego, 2002"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB15","series-title":"Parameter Sweeps on the Grid with APST","article-title":"Grid\u20192002","author":"Casanova","year":"2002"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB16","series-title":"Cluster Computing 2001","first-page":"124","article-title":"Sharing partitionable workloads in heterogeneous NOWs: greedier is not better","author":"Rosenberg","year":"2001"},{"issue":"8","key":"10.1016\/S0167-8191(03)00095-4_BIB17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/135226.135232","article-title":"Factoring: a method for scheduling parallel loops","volume":"35","author":"Hummel","year":"1992","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0167-8191(03)00095-4_BIB18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jpdc.1997.1411","article-title":"Allocating independent tasks to parallel processors: an experimental study","volume":"47","author":"Hagerup","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"10","key":"10.1016\/S0167-8191(03)00095-4_BIB19","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1109\/12.324544","article-title":"Closed form solutions for bus and tree networks of processors load sharing a divisible job","volume":"43","author":"Bataineh","year":"1994","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"10.1016\/S0167-8191(03)00095-4_BIB20","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1109\/12.869332","article-title":"Optimizing computing costs using divisible load analysis","volume":"49","author":"Charcranoon","year":"2000","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB21","unstructured":"B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, S.M. Watt, Maple Reference Manual, 1988"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB22","series-title":"International Parallel and Distributed Processing Symposium IPDPS\u20192002","article-title":"Bandwidth-centric allocation of independent tasks on heterogeneous platforms","author":"Beaumont","year":"2002"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB23","series-title":"Proceedings of the IEEE Symposium on Cluster Computing and the Grid (CCGrid\u201901)","article-title":"Simgrid: a toolkit for the simulation of application scheduling","author":"Casanova","year":"2001"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB24","unstructured":"J. Lerouge, A. Legrand, Towards realistic scheduling simulation of distributed applications, Tech. Rep. 2002-28, LIP, ENS Lyon, France, July 2002"},{"key":"10.1016\/S0167-8191(03)00095-4_BIB25","series-title":"International Conference on Parallel and Distributed Processing Techniques and Applications","article-title":"Using effective network views to promote distributed application performance","author":"Shao","year":"1999"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000954?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T06:21:44Z","timestamp":1550989304000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0167819103000954"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00095-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}