{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:30:17Z","timestamp":1781368217467,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1074019","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"299-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Value-maximizing deadline scheduling and its application to animation rendering"],"prefix":"10.1145","author":[{"given":"Eric","family":"Anderson","sequence":"first","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dirk","family":"Beyer","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamalika","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Terence","family":"Kelly","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Norman","family":"Salazar","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cipriano","family":"Santos","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ram","family":"Swaminathan","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Tarjan","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janet","family":"Wiener","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunhong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/361604.361619"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301974"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_6_1","volume-title":"September","author":"Bose Abhijit","year":"2004","unstructured":"Abhijit Bose . Personal communication , September 2004 .]] Abhijit Bose. Personal communication, September 2004.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"Brucker Peter","year":"2001","unstructured":"Peter Brucker . Scheduling Algorithms . Springer , 3 rd edition, 2001 .]] Peter Brucker. Scheduling Algorithms. Springer, 3rd edition, 2001.]]","edition":"3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_29"},{"key":"e_1_3_2_1_10_1","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Chekuri Chandra","year":"2004","unstructured":"Chandra Chekuri and Sanjeev Khanna . Approximation algorithms for minimizing average weighted completion time . In Joseph Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis . CRC Press , 2004 .]] Chandra Chekuri and Sanjeev Khanna. Approximation algorithms for minimizing average weighted completion time. In Joseph Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, 2004.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0987"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288685"},{"key":"e_1_3_2_1_13_1","unstructured":"Directed acyclic graph manager (DAGMan) for Condor scheduler. http:\/\/www.cs.wisc.edu\/condor\/dagman\/.]]  Directed acyclic graph manager (DAGMan) for Condor scheduler. http:\/\/www.cs.wisc.edu\/condor\/dagman\/.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"OSDI","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . MapReduce : Simplified data processing on large clusters . In OSDI , December 2004 .]] Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, December 2004.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276878"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646378.689517"},{"key":"e_1_3_2_1_17_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman , 1979 .]] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585870"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.609829"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.328993"},{"key":"e_1_3_2_1_23_1","first-page":"214","volume-title":"Proceedings of the First IEEE\/ACM International Workshop on Grid Computing (GRID 2000), LNCS 1971","author":"Heymann Elisa","year":"2000","unstructured":"Elisa Heymann , Miquel A. Senar , Emilio Luque , and Miron Livny . Adaptive scheduling for master-worker applications on the computational grid. In Mark Baker Rajkumar Buyya, editor , Proceedings of the First IEEE\/ACM International Workshop on Grid Computing (GRID 2000), LNCS 1971 , pages 214 -- 227 . Springer , 2000 .]] Elisa Heymann, Miquel A. Senar, Emilio Luque, and Miron Livny. Adaptive scheduling for master-worker applications on the computational grid. In Mark Baker Rajkumar Buyya, editor, Proceedings of the First IEEE\/ACM International Workshop on Grid Computing (GRID 2000), LNCS 1971, pages 214--227. Springer, 2000.]]"},{"key":"e_1_3_2_1_24_1","unstructured":"ILOG Corporation. CPLEX and related software documentation. http:\/\/www.ilog.com.]]  ILOG Corporation. CPLEX and related software documentation. http:\/\/www.ilog.com.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90037-7"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings are published in Springer LNCS series: http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/lncs.html.]]","author":"Job Scheduling Workshops","unstructured":"Workshops on Job Scheduling Strategies for Parallel Processing (JSSPP). http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/index.html. Proceedings are published in Springer LNCS series: http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/lncs.html.]] Workshops on Job Scheduling Strategies for Parallel Processing (JSSPP). http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/index.html. Proceedings are published in Springer LNCS series: http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/lncs.html.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"Kellerer Hans","year":"2004","unstructured":"Hans Kellerer , Ulrich Pferschy , and David Pisinger . Knapsack Problems . Springer , 2004 .]] Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems. Springer, 2004.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199363908"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/646380.689544"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.246075"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_35_1","first-page":"295","volume-title":"Proceedings of JSSPP {26}:JSSPP LNCS 949","author":"Lifka David A.","year":"1995","unstructured":"David A. Lifka . The ANL\/IBM SP scheduling system . In Proceedings of JSSPP {26}:JSSPP LNCS 949 , pages 295 -- 303 , 1995 .]] David A. Lifka. The ANL\/IBM SP scheduling system. In Proceedings of JSSPP {26}:JSSPP LNCS 949, pages 295--303, 1995.]]"},{"issue":"3","key":"e_1_3_2_1_36_1","first-page":"784","article-title":"Optimal sequence of two equivalent processors","volume":"17","author":"Fuju T. Kasami M.","year":"1971","unstructured":"T. Kasami M. Fuju and N. Ninomiya . Optimal sequence of two equivalent processors . SIAM J Appl Math , 17 ( 3 ): 784 -- 789 , 1971 .]] T. Kasami M. Fuju and N. Ninomiya. Optimal sequence of two equivalent processors. SIAM J Appl Math, 17(3):784--789, 1971.]]","journal-title":"SIAM J Appl Math"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/998674.999355"},{"key":"e_1_3_2_1_38_1","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo Michael","year":"2002","unstructured":"Michael Pinedo . Scheduling: Theory, Algorithms, and Systems . Prentice-Hall , 2 nd edition, 2002 .]] Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, 2nd edition, 2002.]]","edition":"2"},{"key":"e_1_3_2_1_39_1","unstructured":"Platform Computing. LSF Scheduler. http:\/\/www.platform.com\/products\/LSFfamily\/.]]  Platform Computing. LSF Scheduler. http:\/\/www.platform.com\/products\/LSFfamily\/.]]"},{"key":"e_1_3_2_1_40_1","volume-title":"February","author":"Computing Platform","year":"2003","unstructured":"Platform Computing . Administering Platform LSF , February 2003 . Chapter 14.]] Platform Computing. Administering Platform LSF, February 2003. Chapter 14.]]"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585871"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms: The State of the Art, number 1442 in LNCS","author":"Sgall Jiri","year":"1998","unstructured":"Jiri Sgall . On-line scheduling---a survey . In A. Fiat and G.J. Woeginger, editors, Online Algorithms: The State of the Art, number 1442 in LNCS , pages 196 -- 231 . Springer , 1998 .]] Jiri Sgall. On-line scheduling---a survey. In A. Fiat and G.J. Woeginger, editors, Online Algorithms: The State of the Art, number 1442 in LNCS, pages 196--231. Springer, 1998.]]"},{"key":"e_1_3_2_1_43_1","first-page":"175","volume-title":"Proc. of the Int. Symposium on Computers and Communications (ISCC)","author":"Tan Ling","year":"2002","unstructured":"Ling Tan and Zahir Tari . Dynamic task assignment in server farms: Better performance by task grouping . In Proc. of the Int. Symposium on Computers and Communications (ISCC) , pages 175 -- 180 , July 2002 .]] Ling Tan and Zahir Tari. Dynamic task assignment in server farms: Better performance by task grouping. In Proc. of the Int. Symposium on Computers and Communications (ISCC), pages 175--180, July 2002.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/885651.781057"},{"key":"e_1_3_2_1_45_1","volume-title":"Parallel Processing in Engineering Applications","author":"Wray Francis","year":"1990","unstructured":"Francis Wray . The parallel implementation of closely coupled numerical algorithms . In A. Adey, editor, Parallel Processing in Engineering Applications . Springer , 1990 .]] Francis Wray. The parallel implementation of closely coupled numerical algorithms. In A. Adey, editor, Parallel Processing in Engineering Applications. Springer, 1990.]]"},{"key":"e_1_3_2_1_46_1","volume-title":"Scientific Computing on Supercomputers","author":"Wray Francis","year":"1991","unstructured":"Francis Wray . High performance numerically intensive applications on distributed memory parallel computers . In J. T. Devreese and P. E. Van Camp, editors, Scientific Computing on Supercomputers , volume III . Plenum , 1991 .]] Francis Wray. High performance numerically intensive applications on distributed memory parallel computers. In J. T. Devreese and P. E. Van Camp, editors, Scientific Computing on Supercomputers, volume III. Plenum, 1991.]]"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/11605300_6"}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","location":"Las Vegas Nevada USA","acronym":"SPAA05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1074019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:24:14Z","timestamp":1673144654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1074019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":46,"alternative-id":["10.1145\/1073970.1074019","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1074019","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}