{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:05:39Z","timestamp":1752667539645,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,27]]},"DOI":"10.1145\/1007912.1007932","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"125-132","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Bi-criteria algorithm for scheduling jobs on cluster platforms"],"prefix":"10.1145","author":[{"given":"Pierre-Fran\u00e7ois","family":"Dutot","sequence":"first","affiliation":[{"name":"ID-IMAG, Saint-Martin, France"}]},{"given":"Lionel","family":"Eyraud","sequence":"additional","affiliation":[{"name":"ID-IMAG, Saint-Martin, France"}]},{"given":"Gr\u00e9gory","family":"Mouni\u00e9","sequence":"additional","affiliation":[{"name":"ID-IMAG, Saint-Martin, France"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[{"name":"ID-IMAG, Saint-Martin, France"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The top500 organization website. http:\/\/www.top500.org.]]  The top500 organization website. http:\/\/www.top500.org.]]"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","volume-title":"Scheduling to minimize the average completion time of dedicated tasks","author":"Afrati F.","year":"2000","unstructured":"F. Afrati , E. Bampis , A. V. Fishkin , K. Jansen , and C. Kenyon . Scheduling to minimize the average completion time of dedicated tasks . Lecture Notes in Computer Science , vol. 1974 , 2000 .]] F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen, and C. Kenyon. Scheduling to minimize the average completion time of dedicated tasks. Lecture Notes in Computer Science, vol. 1974, 2000.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(97)00037-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/370049.370499"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645609.662946"},{"key":"e_1_3_2_1_6_1","volume-title":"Parallel Computer Architecture: A Hardware\/Software Approach","author":"Culler D. E.","year":"1999","unstructured":"D. E. Culler , J. P. Singh , and A. Gupta . Parallel Computer Architecture: A Hardware\/Software Approach . Morgan Kaufmann Publishers , inc., San Francisco, CA, 1999 .]] D. E. Culler, J. P. Singh, and A. Gupta. Parallel Computer Architecture: A Hardware\/Software Approach. Morgan Kaufmann Publishers, inc., San Francisco, CA, 1999.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"Handbook of Scheduling","author":"Dutot P.-F.","year":"2004","unstructured":"P.-F. Dutot , G. Mouni\u00e9 , and D. Trystram . Handbook of Scheduling , chapter Scheduling Parallel Tasks - Approximation Algorithms. CRC Press , 2004 . chapter 28 of this book.]] P.-F. Dutot, G. Mouni\u00e9, and D. Trystram. Handbook of Scheduling, chapter Scheduling Parallel Tasks - Approximation Algorithms. CRC Press, 2004. chapter 28 of this book.]]"},{"key":"e_1_3_2_1_8_1","first-page":"519","volume-title":"High Performance Cluster Computing","author":"Feitelson D. G.","year":"1999","unstructured":"D. G. Feitelson . Scheduling parallel jobs on clusters . In R. Buyya, editor, High Performance Cluster Computing , volume 1 , Architectures and Systems, pages 519 -- 533 . Prentice Hall PTR , Upper Saddle River, NJ, 1999 . Chap. 21.]] D. G. Feitelson. Scheduling parallel jobs on clusters. In R. Buyya, editor, High Performance Cluster Computing, volume 1, Architectures and Systems, pages 519--533. Prentice Hall PTR, Upper Saddle River, NJ, 1999. Chap. 21.]]"},{"issue":"949","key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Parallel job scheduling: Issues and approaches","volume":"0","author":"Feitelson D. G.","year":"1995","unstructured":"D. G. Feitelson and L. Rudolph . Parallel job scheduling: Issues and approaches . Lecture Notes in Computer Science , 0 ( 949 ): 1 -- 18 , 1995 .]] D. G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. Lecture Notes in Computer Science, 0(949):1--18, 1995.]]","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_3_2_1_10_1","volume-title":"The grid: blueprint for a new computing infrastructure","author":"Foster I.","year":"1999","unstructured":"I. Foster and C. Kesselman . The grid: blueprint for a new computing infrastructure . Morgan Kaufmann Publishers Inc ., 1999 .]] I. Foster and C. Kesselman. The grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers Inc., 1999.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204015"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789945.2789946"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-60153-8_34","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Henderson R. L.","year":"1995","unstructured":"R. L. Henderson . Job scheduling under the portable batch system . In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing , volume 949 of LNCS , pages 279 -- 294 , 1995 .]] R. L. Henderson. Job scheduling under the portable batch system. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 949 of LNCS, pages 279--294, 1995.]]"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Jackson D.","year":"2001","unstructured":"D. Jackson , Q. Snell , and M. J. Clement . Core algorithms of the maui schedule . In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing , volume 2221 of LNCS , pages 87 -- 102 , 2001 .]] D. Jackson, Q. Snell, and M. J. Clement. Core algorithms of the maui schedule. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 2221 of LNCS, pages 87--102, 2001.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"The art of computer systems performance analysis","author":"Jain R.","year":"1991","unstructured":"R. Jain . The art of computer systems performance analysis . John Wiley , New York , 1991 .]] R. Jain. The art of computer systems performance analysis. John Wiley, New York, 1991.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCS.1988.12507"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/305619.305622"},{"key":"e_1_3_2_1_18_1","volume-title":"3rd International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'2004)","author":"Romagnoli E.","year":"2004","unstructured":"E. Romagnoli , Y. Denneulin , and D. Trystram . A synthetic workload generator for cluster computing . In 3rd International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'2004) in conjunction with IPDPS'04, Santa Fe, New Mexico , 2004 .]] E. Romagnoli, Y. Denneulin, and D. Trystram. A synthetic workload generator for cluster computing. In 3rd International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'2004) in conjunction with IPDPS'04, Santa Fe, New Mexico, 2004.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795286831"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00030-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793248317"}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Barcelona Spain","acronym":"SPAA04"},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:15Z","timestamp":1750264275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":21,"alternative-id":["10.1145\/1007912.1007932","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007932","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}