{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:31Z","timestamp":1763468191812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1008065","CCF-1115575"],"award-info":[{"award-number":["CCF-1008065","CCF-1115575"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1253218"],"award-info":[{"award-number":["CNS-1253218"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612682","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"22-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Competitively scheduling tasks with intermediate parallelizability"],"prefix":"10.1145","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[{"name":"University of California Merced, Merced, CA, USA"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute, Chicago, IL, USA"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, PA, USA"}]},{"given":"Eric","family":"Torng","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.tilera.com\/.  http:\/\/www.tilera.com\/."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/projects.csail.mit.edu\/angstrom\/.  http:\/\/projects.csail.mit.edu\/angstrom\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9349-0"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00186-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00738-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229172"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627885"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998037.1998058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.018"},{"key":"e_1_3_2_1_11_1","volume-title":"New York Times","author":"Markoff John","year":"2004","unstructured":"John Markoff . Intel's big shift after hitting technical wall . New York Times , May 2004 . John Markoff. Intel's big shift after hitting technical wall. New York Times, May 2004."},{"key":"e_1_3_2_1_12_1","volume-title":"EE Times","author":"Merritt Rick","year":"2008","unstructured":"Rick Merritt . CPU designers debate multi-core future . EE Times , February 2008 . Rick Merritt. CPU designers debate multi-core future. EE Times, February 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0068-9"},{"key":"e_1_3_2_1_14_1","first-page":"237","volume-title":"WAOA","author":"Pruhs Kirk","year":"2010","unstructured":"Kirk Pruhs , Julien Robert , and Nicolas Schabanel . Minimizing maximum flowtime of jobs with arbitrary parallelizability . In WAOA , pages 237 -- 248 , 2010 . Kirk Pruhs, Julien Robert, and Nicolas Schabanel. Minimizing maximum flowtime of jobs with arbitrary parallelizability. In WAOA, pages 237--248, 2010."},{"key":"e_1_3_2_1_15_1","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Pruhs Kirk","year":"2004","unstructured":"Kirk Pruhs , Jiri Sgall , and Eric Torng . Handbook of Scheduling: Algorithms, Models, and Performance Analysis , chapter Online Scheduling. 2004 . Kirk Pruhs, Jiri Sgall, and Eric Torng. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter Online Scheduling. 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778648"},{"key":"e_1_3_2_1_17_1","first-page":"491","volume-title":"SODA","author":"Robert Julien","year":"2008","unstructured":"Julien Robert and Nicolas Schabanel . Non-clairvoyant scheduling with precedence constraints . In SODA , pages 491 -- 500 , 2008 . Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In SODA, pages 491--500, 2008."}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612682","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":17,"alternative-id":["10.1145\/2612669.2612682","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612682","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}