{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:54Z","timestamp":1759638594784,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"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":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378580","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"256-264","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Competitive non-migratory scheduling for flow time and energy"],"prefix":"10.1145","author":[{"given":"Tak-Wah","family":"Lam","sequence":"first","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Lap-Kei","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Isaac K. K.","family":"To","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290686"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248424"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.50"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777415"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970037446X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_34"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.24"},{"key":"e_1_3_2_1_8_1","first-page":"805","volume-title":"Proc. SODA","author":"Bansal N.","year":"2007","unstructured":"N. Bansal , K. Pruhs and C. Stein . Speed scaling for weighted flow time . In Proc. SODA , pages 805 -- 813 , 2007 . N. Bansal, K. Pruhs and C. Stein. Speed scaling for weighted flow time. In Proc. SODA, pages 805--813, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.888701"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148140"},{"key":"e_1_3_2_1_11_1","first-page":"795","volume-title":"Proc. SODA","author":"Chan H. L.","year":"2007","unstructured":"H. L. Chan , W. T. Chan , T. W. Lam , L. K. Lee , K. S. Mak , and P. W. H. Wong . Energy efficient online deadline scheduling . In Proc. SODA , pages 795 -- 804 , 2007 . H. L. Chan, W. T. Chan, T. W. Lam, L. K. Lee, K. S. Mak, and P. W. H. Wong. Energy efficient online deadline scheduling. In Proc. SODA, pages 795--804, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435765"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380778"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007411"},{"key":"e_1_3_2_1_15_1","first-page":"73","volume-title":"Proc. OSDI","author":"Grunwald D.","year":"2000","unstructured":"D. Grunwald , P. Levis , K. I. Farkas , C. B. Morrey , and M. Neufeld . Policies for dynamic clock scheduling . In Proc. OSDI , pages 73 -- 86 , 2000 . D. Grunwald, P. Levis, K. I. Farkas, C. B. Morrey, and M. Neufeld. Policies for dynamic clock scheduling. In Proc. OSDI, pages 73--86, 2000."},{"key":"e_1_3_2_1_16_1","first-page":"37","volume-title":"Proc. SODA","author":"Irani S.","year":"2003","unstructured":"S. Irani , R. K. Gupta , and S. Shukla . Algorithms for power savings . In Proc. SODA , pages 37 -- 46 , 2003 . S. Irani, R. K. Gupta, and S. Shukla. Algorithms for power savings. In Proc. SODA, pages 37--46, 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067309.1067324"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1128"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258562"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958217"},{"key":"e_1_3_2_1_21_1","first-page":"350","volume-title":"Proc. SODA","author":"McCullough J.","year":"2004","unstructured":"J. McCullough and E. Torng . SRPT optimally utilizes faster machines to minimize flow time . In Proc. SODA , pages 350 -- 358 , 2004 . J. McCullough and E. Torng. SRPT optimally utilizes faster machines to minimize flow time. In Proc. SODA, pages 350--358, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.917539"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258570"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502044"},{"key":"e_1_3_2_1_25_1","first-page":"15","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"Pruhs K.","year":"2004","unstructured":"K. Pruhs , J. Sgall , and E. Torng . Online scheduling . In J. Leung, editor, Handbook of Scheduling: Algorithms, Models and Performance Analysis , pages 15 -- 11 --15-41. CRC Press , 2004 . K. Pruhs, J. Sgall, and E. Torng. Online scheduling. In J. Leung, editor, Handbook of Scheduling: Algorithms, Models and Performance Analysis, pages 15--1--15-41. CRC Press, 2004."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_24"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_3"},{"key":"e_1_3_2_1_28_1","first-page":"13","volume-title":"Proc. OSDI","author":"Weiser M.","year":"1994","unstructured":"M. Weiser , B. Welch , A. Demers , and S. Shenker . Scheduling for reduced CPU energy . In Proc. OSDI , pages 13 -- 23 , 1994 . M. Weiser, B. Welch, A. Demers, and S. Shenker. Scheduling for reduced CPU energy. In Proc. OSDI, pages 13--23, 1994."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"}],"event":{"name":"SPAA08: 20th ACM Symposium on Parallelism in Algorithms and Architectures","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":"Munich Germany","acronym":"SPAA08"},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:53Z","timestamp":1750258673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":29,"alternative-id":["10.1145\/1378533.1378580","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378580","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}