{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:16Z","timestamp":1750309216581,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T00:00:00Z","timestamp":1154217600000},"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":[[2006,7,30]]},"DOI":"10.1145\/1148109.1148140","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"190-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Power-aware scheduling for makespan and flow"],"prefix":"10.1145","author":[{"given":"David P.","family":"Bunde","sequence":"first","affiliation":[{"name":"Univ. Illinois at Urbana-Champaign, Urbana, IL"}]}],"member":"320","published-online":{"date-parts":[[2006,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Advanced Micro Devices Inc. AMD Athlon 64 processor power and thermal data sheet (ver. 3.43) Oct 2004. http:\/\/www.amd.com\/us-en\/assets\/content_type\/white_papers_and_tech_docs\/30430.pdf.]]  Advanced Micro Devices Inc. AMD Athlon 64 processor power and thermal data sheet (ver. 3.43) Oct 2004. http:\/\/www.amd.com\/us-en\/assets\/content_type\/white_papers_and_tech_docs\/30430.pdf.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_51"},{"key":"e_1_3_2_1_3_1","first-page":"493","volume-title":"Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms","author":"Alon N.","year":"1997","unstructured":"N. Alon , Y. Azar , G.J. Woeginger , and T. Yadid . Approximation schemes for scheduling . In Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms , pages 493 -- 500 , 1997 .]] N. Alon, Y. Azar, G.J. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms, pages 493--500, 1997.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187906"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.24"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_38"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.888701"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1184"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_30"},{"key":"e_1_3_2_1_10_1","first-page":"581","volume-title":"Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms","author":"Chudak F.A.","year":"1997","unstructured":"F.A. Chudak and D.B. Shmoys . Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds . In Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms , pages 581 -- 590 , 1997 .]] F.A. Chudak and D.B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. In Proc. 8th Annual ACM-SIAM Symp. Discrete Algorithms, pages 581--590, 1997.]]"},{"key":"e_1_3_2_1_11_1","volume-title":"Abstract Algebra","author":"Dummit D.S.","year":"1991","unstructured":"D.S. Dummit and R.M. Foote . Abstract Algebra . Prentice-Hall, Inc. , Englewood Cliffs, NJ , 1991 .]] D.S. Dummit and R.M. Foote. Abstract Algebra. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1991.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019431"},{"key":"e_1_3_2_1_13_1","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson . Computers and intractability: A guide to the theory of NP-completeness . W.H. Freeman and Company , 1979 .]] M.R. Garey and D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067309.1067324"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.917539"},{"key":"e_1_3_2_1_16_1","series-title":"Springer Series in Operations Research","volume-title":"Planning and scheduling in manufacturing and services","author":"Pinedo M.L.","year":"2005","unstructured":"M.L. Pinedo . Planning and scheduling in manufacturing and services . Springer Series in Operations Research . Springer Science +Business Media, Inc., 2005 .]] M.L. Pinedo. Planning and scheduling in manufacturing and services. Springer Series in Operations Research. Springer Science+Business Media, Inc., 2005.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_24"},{"key":"e_1_3_2_1_19_1","unstructured":"The GAP Group. Gap system for computational discrete algebra. http:\/\/turnbull.mcs.st-and.ac.uk\/~gap\/.]]  The GAP Group. Gap system for computational discrete algebra. http:\/\/turnbull.mcs.st-and.ac.uk\/~gap\/.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277227"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801419"},{"key":"e_1_3_2_1_22_1","first-page":"13","volume-title":"Proc. 1st Symp. on Operating Systems Design and Implementation","author":"Weiser M.","year":"1994","unstructured":"M. Weiser , B. Welch , A. Demers , and S. Shenker . Scheduling for reduced cpu energy . In Proc. 1st Symp. on Operating Systems Design and Implementation , pages 13 -- 23 , 1994 .]] M. Weiser, B. Welch, A. Demers, and S. Shenker. Scheduling for reduced cpu energy. In Proc. 1st Symp. on Operating Systems Design and Implementation, pages 13--23, 1994.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781138"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"}],"event":{"name":"SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006","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":"Cambridge Massachusetts USA","acronym":"SPAA06"},"container-title":["Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148109.1148140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:53Z","timestamp":1750290233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,30]]},"references-count":24,"alternative-id":["10.1145\/1148109.1148140","10.1145\/1148109"],"URL":"https:\/\/doi.org\/10.1145\/1148109.1148140","relation":{},"subject":[],"published":{"date-parts":[[2006,7,30]]},"assertion":[{"value":"2006-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}