{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:00Z","timestamp":1750306500473,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:00:00Z","timestamp":1449532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council","doi-asserted-by":"crossref","award":["NSC101-2221-E-008-137-MY3"],"award-info":[{"award-number":["NSC101-2221-E-008-137-MY3"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2015,12,8]]},"abstract":"<jats:p>Multiprocessors have become the main architecture trend in modern systems due to the superior performance; nevertheless, the power consumption remains a critical challenge. Global power management (GPM) aims at dynamically finding the power state combination that satisfies the power budget constraint while maximizing the overall performance (or vice versa). Due to the increasing number of cores in a multiprocessor system, the scalability of GPM policies has become critical when searching satisfactory state combinations within acceptable time. This article proposes a highly scalable policy based on combinatorial optimization with theoretical proofs, whereas previous works take exhaustive search or heuristic methods. The proposed policy first applies an optimum algorithm to construct a state combination table in pseudo--polynomial time using dynamic programming. Then, the state combination is assigned to cores with minimum transition cost in linear time by mapping to the network flow problem. Simulation results show that the proposed policy achieves better system performance for any given power budget when compared to the state-of-the-art heuristic. Furthermore, the proposed policy demonstrates its prominent scalability with 125 times faster policy runtime for 512 cores.<\/jats:p>","DOI":"10.1145\/2811404","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T14:22:10Z","timestamp":1449757330000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable Global Power Management Policy Based on Combinatorial Optimization for Multiprocessors"],"prefix":"10.1145","volume":"14","author":[{"given":"Gung-Yu","family":"Pan","sequence":"first","affiliation":[{"name":"National Chiao Tung University, Hsinchu City, Taiwan"}]},{"given":"Jed","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}]},{"given":"Jing-Yang","family":"Jou","sequence":"additional","affiliation":[{"name":"National Central University and National Chiao Tung University"}]},{"given":"Bo-Cheng Charles","family":"Lai","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu City, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"ACPI. 2011. ACPI\u2014Advanced Configuration and Power Interface Specification. Available at http:\/\/www.acpi.info\/"},{"key":"e_1_2_1_2_1","unstructured":"AMD. 2013. AMD PowerNow&excl; Technology. Available at http:\/\/www.amd.com\/us\/products\/technologies\/amd-powernow-technology\/Pages\/amd-powernow-technology.aspx"},{"key":"e_1_2_1_3_1","unstructured":"ARM. 2005. ARM Intelligent Energy Controller Technical Overview. http:\/\/www.arm.com\/"},{"key":"e_1_2_1_4_1","unstructured":"ARM. 2008. Cortex-A9 MPCore Technical Reference Manual. ARM."},{"volume-title":"Retrieved","year":"2013","key":"e_1_2_1_5_1","unstructured":"Intel. 2013. Enhanced Intel SpeedStep Technology. Retrieved August 13, 2015, from http:\/\/www3.intel.com\/cd\/channel\/reseller\/asmo-na\/eng\/203838.htm"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.845896"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/EUC.2010.35"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.49"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390191.2390198"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837417"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2161308"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186736.1186737"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1283780.1283790"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2009.4798265"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.8"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/603095.603147"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077603.1077637"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the IEEE 14th International Symposium on High Performance Computer Architecture. 123--134","author":"Kim Wonyoung","year":"2008","unstructured":"Wonyoung Kim, Meeta S. Gupta, Gu-Yeon Wei, and David Brooks. 2008. System level analysis of fast, per-core DVFS using on-chip switching regulators. In Proceedings of the IEEE 14th International Symposium on High Performance Computer Architecture. 123--134."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Embedded World Conference.","author":"Knoth Matthias","year":"2009","unstructured":"Matthias Knoth. 2009. Power management in an embedded multiprocessor cluster. In Proceedings of the Embedded World Conference."},{"volume-title":"The Hungarian method for the assignment problem. In 50 Years of Integer Programming 1958--2008","author":"Kuhn Harold W.","key":"e_1_2_1_22_1","unstructured":"Harold W. Kuhn. 2010. The Hungarian method for the assignment problem. In 50 Years of Integer Programming 1958--2008, J. Junger, Th. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pullyblank, G. Reinelt, G. Rinaldi, and L. A. Wolsey (Eds.). Springer, 29--47."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594233.1594283"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1113841.1113844"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669172"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024723.2000117"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2011.6081373"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382570.2382572"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165573.1165586"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454141"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.15"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/225871.225877"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302728"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555793"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1874620.1874992"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1283780.1283791"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442087.2442095"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390191.2390194"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.844305"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.40"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2007.17"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.39"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854283"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390191.2390197"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2811404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:49Z","timestamp":1750225729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,8]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12,8]]}},"alternative-id":["10.1145\/2811404"],"URL":"https:\/\/doi.org\/10.1145\/2811404","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2015,12,8]]},"assertion":[{"value":"2013-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-08-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}