{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:27:40Z","timestamp":1735583260852},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,4]],"date-time":"2014-05-04T00:00:00Z","timestamp":1399161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10586-014-0378-8","type":"journal-article","created":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T10:15:26Z","timestamp":1399112126000},"page":"1295-1307","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Using priced timed automaton to analyse the energy consumption in cloud computing environment"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhigang","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guosun","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunjie","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,4]]},"reference":[{"key":"378_CR1","unstructured":"J. Glanz. Google details, and defends, its use of electricity. NewYork Times[Online], http:\/\/www.nytimes.com\/2011\/09\/09\/technology\/google-details-and-defends-its-use-of-electricity.html . Sept 2011"},{"issue":"10","key":"378_CR2","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1109\/TCAD.2012.2212898","volume":"31","author":"M Pedram","year":"2012","unstructured":"Pedram, M.: Energy-efficient datacenters. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 31(10), 1465\u20131484 (2012)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"378_CR3","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3724\/SP.J.1016.2011.00593","volume":"34","author":"Lin Chuang","year":"2011","unstructured":"Chuang, Lin, Yuan, Tian, Min, Yao: Green network and green evaluation: Mechanism, modeling and evaluation. Chin. J. Comput. 34(4), 593\u2013612 (2011)","journal-title":"Chin. J. Comput."},{"issue":"3","key":"378_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/1108956.1108957","volume":"37","author":"V Venkatachalam","year":"2005","unstructured":"Venkatachalam, V., Franz, M.: Power reduction techniques for microprocessor Systems. ACM Comput. Surv. 37(3), 195\u2013237 (2005)","journal-title":"ACM Comput. Surv."},{"key":"378_CR5","doi-asserted-by":"crossref","unstructured":"K. H. Kim, R. Buyya, J. Kim. Power aware scheduling of bag-of-tasks applications with deadline constraints on DVS-enabled clusters. In: Seventh IEEE International Symposium on Cluster Computing and the Grid, 2007, pp. 541\u2013548","DOI":"10.1109\/CCGRID.2007.85"},{"issue":"1","key":"378_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TPDS.2008.55","volume":"20","author":"LK Goh","year":"2009","unstructured":"Goh, L.K., Veeravalli, B., Viswanathan, S.: Design of fast and efficient energy-aware gradient-based scheduling algorithms. IEEE Trans. Parallel Distrib. Syst. 20(1), 1\u201312 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"378_CR7","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/TPDS.2010.208","volume":"22","author":"YC Lee","year":"2011","unstructured":"Lee, Y.C., Zomaya, A.Y.: Energy conscious scheduling for distributed computing systems under different operating conditions. IEEE Trans. Parallel Distrib. Syst. 22(8), 1374\u20131381 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"378_CR8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.3724\/SP.J.1001.2012.04143","volume":"23","author":"Tan Yi-Ming","year":"2012","unstructured":"Yi-Ming, Tan, Guo-Sun, Zeng, Wei, Wang: Policy of energy optimal management for cloud computing platform with stochastic tasks. J. Softw. 23(2), 266\u2013278 (2012)","journal-title":"J. Softw."},{"issue":"1","key":"378_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10703-006-0014-1","volume":"29","author":"JI Rasmussen","year":"2006","unstructured":"Rasmussen, J.I., Larsen, K.G., Subramani, K.: On using priced timed automata to achieve optimal. Form. Methods Syst. Des. 29(1), 97\u2013114 (2006)","journal-title":"Form. Methods Syst. Des."},{"key":"378_CR10","unstructured":"A. Lungu, P. Bose, et al. Multicore power management: Ensuring robustness via early-stage formal verification. In:Proceeding of the Seventh IEEE\/ACM Internatinal Conference on Formal Methods Models Codesign, 2009, pp. 78\u201387"},{"issue":"12","key":"378_CR11","doi-asserted-by":"crossref","first-page":"2027","DOI":"10.1109\/TCAD.2010.2061631","volume":"29","author":"S Nocco","year":"2010","unstructured":"Nocco, S., Quer, S.: A novel SAT-based approach to the task graph cost-optimal scheduling problem. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 29(12), 2027\u20132040 (2010)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"378_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"378_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume":"2034","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., et al.: Minimum-cost reachability for priced timed automata. Lect. Notes Comput. Sci. 2034, 147\u2013161 (2001)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"4","key":"378_CR14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406\u2013471 (1999)","journal-title":"ACM Comput. Surv."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-014-0378-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-014-0378-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-014-0378-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:40:20Z","timestamp":1559227220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-014-0378-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s10586-014-0378-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,4]]}}}