{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:46:06Z","timestamp":1761896766814,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Key R&D Program of China","award":["SQ2018YFB020061","2015AA015305"],"award-info":[{"award-number":["SQ2018YFB020061","2015AA015305"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61702170","61602350","61602170","61370098","61672219"],"award-info":[{"award-number":["61702170","61602350","61602170","61370098","61672219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Program of National Natural Science Foundation of China","award":["61432005"],"award-info":[{"award-number":["61432005"]}]},{"name":"National Outstanding Youth Science Program"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61625202"],"award-info":[{"award-number":["61625202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"Chinese Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2016M602409"],"award-info":[{"award-number":["2016M602409"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2018,11,1]]},"DOI":"10.1109\/tpds.2018.2836452","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T20:20:51Z","timestamp":1526415651000},"page":"2503-2513","source":"Crossref","is-referenced-by-count":30,"title":["Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2372-6715","authenticated-orcid":false,"given":"Chubo","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5224-4048","authenticated-orcid":false,"given":"Keqin","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2657643"},{"key":"ref30","first-page":"230","article-title":"Efficient inverse maintenance and faster algorithms for linear programming","author":"lee","year":"2015","journal-title":"Proc IEEE 56th Annu Symp Found Comput Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.12.005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2495120"},{"key":"ref12","article-title":"Server consolidation improves its capacity utilization","author":"parent","year":"2005","journal-title":"Court Square Data Group"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1071021.1071047"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2398435"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2612186"},{"key":"ref16","first-page":"14","article-title":"Minimum cost resource allocation for meeting job requirements","author":"chakaravarthy","year":"2011","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref17","first-page":"106","article-title":"Strengthening integrality gaps for capacitated network design and covering problems","author":"carr","year":"2000","journal-title":"Proc 11th ACM-SIAM Ann Symp Discret Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"ref19","first-page":"401","article-title":"Improved approximation algorithms for resource allocation","author":"calinescu","year":"2002","journal-title":"Proc Int Conf Integer Program Combinat Optim"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/SFCS.2001.959928","article-title":"Tight approximation results for general covering integer programs","author":"kolliopoulos","year":"2001","journal-title":"Proc 42nd IEEE Symp Foundations Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2701793"},{"key":"ref27","first-page":"256","article-title":"LP-based algorithms for capacitated facility location","author":"an","year":"2014","journal-title":"Proc IEEE 55th Annu Symp Found Comput Sci"},{"key":"ref3","first-page":"13","article-title":"An extensible framework for predictive analytics on cost and performance in the cloud","author":"li","year":"2015","journal-title":"Proc Int Conf Cloud Comput Big Data"},{"key":"ref6","first-page":"1","article-title":"Efficient and robust allocation algorithms in clouds under memory constraints","author":"beaumont","year":"2014","journal-title":"Proc Int Conf High-Perform Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497323194"},{"key":"ref5","first-page":"79","article-title":"Optimizing resource allocation while handling SLA violations in cloud computing platforms","author":"eyraud-dubois","year":"2013","journal-title":"Proc IEEE 27th Int Symp Parallel Distrib Process"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2014.2360399"},{"key":"ref7","first-page":"433","article-title":"Utility maximizing thread assignment and resource allocation","author":"lai","year":"2016","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref2","first-page":"633","article-title":"Improving storage availability in cloud-of-clouds with hybrid redundant data distribution","author":"mao","year":"2015","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.25"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2594174"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273343"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1210-5"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/1.9781611973068.77","article-title":"A logarithmic approximation for unsplittable flow on line graphs","author":"bansal","year":"2009","journal-title":"Proc Annual ACM-SIAM Symp on Discrete algorithms"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68891-4_20"},{"key":"ref23","first-page":"1","article-title":"Varying bandwidth resource allocation problem with bag constraints","author":"chakaravarthy","year":"2010","journal-title":"Proc IEEE Int Symp Parallel Distrib Process"},{"key":"ref26","first-page":"454","article-title":"Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities","author":"levi","year":"2007","journal-title":"Proc Int Conf Integer Program Combinat Optim"},{"key":"ref25","first-page":"581","article-title":"Brokering algorithms for optimizing the availability and cost of cloud storage services","author":"mansouri","year":"2013","journal-title":"Proc IEEE 5th Int Conf Cloud Comput Technol Sci"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8486815\/08359091.pdf?arnumber=8359091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:10:12Z","timestamp":1642003812000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8359091\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":31,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2018.2836452","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2018,11,1]]}}}