{"title":"IaaS云系统运行时管理的渐退地平线方法","authors":"D. Ardagna, M. Ciavotta, R. Lancellotti","doi":"10.1109/SYNASC.2014.66","DOIUrl":null,"url":null,"abstract":"Cloud Computing is emerging as a major trend in ICT industry. However, as with any new technology it raises new major challenges and one of them concerns the resource provisioning. Indeed, modern Cloud applications deal with a dynamic context and have to constantly adapt themselves in order to meet Quality of Service (QoS) requirements. This situation calls for advanced solutions designed to dynamically provide cloud resource with the aim of guaranteeing the QoS levels. This work presents a capacity allocation algorithm whose goal is to minimize the total execution cost, while satisfying some constraints on the average response time of Cloud based applications. We propose a receding horizon control technique, which can be employed to handle multiple classes of requests. We compare our solution with an oracle with perfect knowledge of the future and with a well-known heuristic described in the literature. The experimental results demonstrate that our solution outperforms the existing heuristic producing results very close to the optimal ones. Furthermore, a sensitivity analysis over two different time scales indicates that finer grained time scales are more appropriate for spiky workloads, whereas smooth traffic conditions are better handled by coarser grained time scales. Our analytical results are also validated through simulation, which shows also the impact on our solution of Cloud environment random perturbations.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A Receding Horizon Approach for the Runtime Management of IaaS Cloud Systems\",\"authors\":\"D. Ardagna, M. Ciavotta, R. Lancellotti\",\"doi\":\"10.1109/SYNASC.2014.66\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing is emerging as a major trend in ICT industry. However, as with any new technology it raises new major challenges and one of them concerns the resource provisioning. Indeed, modern Cloud applications deal with a dynamic context and have to constantly adapt themselves in order to meet Quality of Service (QoS) requirements. This situation calls for advanced solutions designed to dynamically provide cloud resource with the aim of guaranteeing the QoS levels. This work presents a capacity allocation algorithm whose goal is to minimize the total execution cost, while satisfying some constraints on the average response time of Cloud based applications. We propose a receding horizon control technique, which can be employed to handle multiple classes of requests. We compare our solution with an oracle with perfect knowledge of the future and with a well-known heuristic described in the literature. The experimental results demonstrate that our solution outperforms the existing heuristic producing results very close to the optimal ones. Furthermore, a sensitivity analysis over two different time scales indicates that finer grained time scales are more appropriate for spiky workloads, whereas smooth traffic conditions are better handled by coarser grained time scales. Our analytical results are also validated through simulation, which shows also the impact on our solution of Cloud environment random perturbations.\",\"PeriodicalId\":150575,\"journal\":{\"name\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2014.66\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Receding Horizon Approach for the Runtime Management of IaaS Cloud Systems
Cloud Computing is emerging as a major trend in ICT industry. However, as with any new technology it raises new major challenges and one of them concerns the resource provisioning. Indeed, modern Cloud applications deal with a dynamic context and have to constantly adapt themselves in order to meet Quality of Service (QoS) requirements. This situation calls for advanced solutions designed to dynamically provide cloud resource with the aim of guaranteeing the QoS levels. This work presents a capacity allocation algorithm whose goal is to minimize the total execution cost, while satisfying some constraints on the average response time of Cloud based applications. We propose a receding horizon control technique, which can be employed to handle multiple classes of requests. We compare our solution with an oracle with perfect knowledge of the future and with a well-known heuristic described in the literature. The experimental results demonstrate that our solution outperforms the existing heuristic producing results very close to the optimal ones. Furthermore, a sensitivity analysis over two different time scales indicates that finer grained time scales are more appropriate for spiky workloads, whereas smooth traffic conditions are better handled by coarser grained time scales. Our analytical results are also validated through simulation, which shows also the impact on our solution of Cloud environment random perturbations.