{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:03Z","timestamp":1763467983530,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810479.1810482","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Scheduling jobs with varying parallelizability to reduce variance"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungjin","family":"Im","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravishankar","family":"Krishnaswamy","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Better scalable algorithms for broadcast scheduling. Technical report","author":"Bansal Nikhil","year":"2009","unstructured":"Nikhil Bansal , Ravishankar Krishnaswamy , and Viswanath Nagarajan . Better scalable algorithms for broadcast scheduling. Technical report , Carnegie Mellon University , 2009 . Nikhil Bansal, Ravishankar Krishnaswamy, and Viswanath Nagarajan. Better scalable algorithms for broadcast scheduling. Technical report, Carnegie Mellon University, 2009."},{"key":"e_1_3_2_1_2_1","volume-title":"Better scalable algorithms for broadcast scheduling. Technical report","author":"Bansal Nikhil","year":"2009","unstructured":"Nikhil Bansal , Ravishankar Krishnaswamy , and Viswanath Nagarajan . Better scalable algorithms for broadcast scheduling. Technical report , Carnegie Mellon University , 2009 . Nikhil Bansal, Ravishankar Krishnaswamy, and Viswanath Nagarajan. Better scalable algorithms for broadcast scheduling. Technical report, Carnegie Mellon University, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008732"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1583994"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00186-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022952324290"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1018-5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496845"},{"key":"e_1_3_2_1_9_1","first-page":"2010","volume-title":"ACM--SIAM Symposium on Discrete Algorithms","author":"Im Sungjin","unstructured":"Sungjin Im and Benjamin Moseley . An online scalable algorithm for average flow time in broadcast scheduling . In ACM--SIAM Symposium on Discrete Algorithms , page To Appear, 2010 . Sungjin Im and Benjamin Moseley. An online scalable algorithm for average flow time in broadcast scheduling. In ACM--SIAM Symposium on Discrete Algorithms, page To Appear, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792545"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90151-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243401.1243411"},{"key":"e_1_3_2_1_14_1","volume-title":"Handbook on Scheduling","author":"Pruhs Kirk","year":"2004","unstructured":"Kirk Pruhs , Jiri Sgall , and Eric Torng . Online scheduling . In Handbook on Scheduling . CRC Press , 2004 . Kirk Pruhs, Jiri Sgall, and Eric Torng. Online scheduling. In Handbook on Scheduling. CRC Press, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778648"},{"key":"e_1_3_2_1_16_1","first-page":"491","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"Robert Julien","year":"2008","unstructured":"Julien Robert and Nicolas Schabanel . Non-clairvoyant scheduling with precedence constraints . In ACM-SIAM Symposium on Discrete Algorithms , pages 491 -- 500 , 2008 . Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In ACM-SIAM Symposium on Discrete Algorithms, pages 491--500, 2008."},{"key":"e_1_3_2_1_17_1","volume-title":"Operating System Concepts","author":"Silberschatz Abraham","year":"1994","unstructured":"Abraham Silberschatz and Peter Galvin . Operating System Concepts , 4 th edition. Addison-Wesley , 1994 . Abraham Silberschatz and Peter Galvin. Operating System Concepts, 4th edition. Addison-Wesley, 1994.","edition":"4"}],"event":{"name":"SPAA 10: 22nd 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":"Thira Santorini Greece","acronym":"SPAA 10"},"container-title":["Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810479.1810482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:24Z","timestamp":1750246764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":17,"alternative-id":["10.1145\/1810479.1810482","10.1145\/1810479"],"URL":"https:\/\/doi.org\/10.1145\/1810479.1810482","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}