时变作业请求下云环境下的动态资源分配

D. Tammaro, E. Doumith, S. A. Zahr, Jean-Paul Smets-Solanes, M. Gagnaire
{"title":"时变作业请求下云环境下的动态资源分配","authors":"D. Tammaro, E. Doumith, S. A. Zahr, Jean-Paul Smets-Solanes, M. Gagnaire","doi":"10.1109/CloudCom.2011.91","DOIUrl":null,"url":null,"abstract":"In Cloud environments, efficient resource provisioning and management present today a challenging issue because of the dynamic nature of the Cloud on one hand, and the need to satisfy heterogeneous resource requirements on the other hand. In such dynamic environments where end-users can arrive and leave the Cloud at any time, a Cloud service provider (CSP) should be able to make accurate decisions for scaling up or down its data-centers while taking into account several utility criteria, e.g., the delay of virtual resources setup, the migration of existing processes, the resource utilization, etc. In order to satisfy both parties (the CSP and the end-users), an efficient and dynamic resource allocation strategy is mandatory. In this paper, we propose an original approach for dynamic resource allocation in a Cloud environment. Our proposal considers computing job requests that are characterized by their arrival and teardown times, as well as a predictive profile of their computing requirements during their activity period. Assuming a prior knowledge of the predicted computing resources required by end-users, we propose and investigate several algorithms with different optimization criteria. However, prediction errors may occur resulting in some cases in the drop of one or several computing requests. Our proposed algorithms are compared in terms of various performance parameters including the rejection ratio, the dropping ratio, as well as the satisfaction of the endusers and the CSP.","PeriodicalId":427190,"journal":{"name":"2011 IEEE Third International Conference on Cloud Computing Technology and Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Dynamic Resource Allocation in Cloud Environment Under Time-variant Job Requests\",\"authors\":\"D. Tammaro, E. Doumith, S. A. Zahr, Jean-Paul Smets-Solanes, M. Gagnaire\",\"doi\":\"10.1109/CloudCom.2011.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Cloud environments, efficient resource provisioning and management present today a challenging issue because of the dynamic nature of the Cloud on one hand, and the need to satisfy heterogeneous resource requirements on the other hand. In such dynamic environments where end-users can arrive and leave the Cloud at any time, a Cloud service provider (CSP) should be able to make accurate decisions for scaling up or down its data-centers while taking into account several utility criteria, e.g., the delay of virtual resources setup, the migration of existing processes, the resource utilization, etc. In order to satisfy both parties (the CSP and the end-users), an efficient and dynamic resource allocation strategy is mandatory. In this paper, we propose an original approach for dynamic resource allocation in a Cloud environment. Our proposal considers computing job requests that are characterized by their arrival and teardown times, as well as a predictive profile of their computing requirements during their activity period. Assuming a prior knowledge of the predicted computing resources required by end-users, we propose and investigate several algorithms with different optimization criteria. However, prediction errors may occur resulting in some cases in the drop of one or several computing requests. Our proposed algorithms are compared in terms of various performance parameters including the rejection ratio, the dropping ratio, as well as the satisfaction of the endusers and the CSP.\",\"PeriodicalId\":427190,\"journal\":{\"name\":\"2011 IEEE Third International Conference on Cloud Computing Technology and Science\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Third International Conference on Cloud Computing Technology and Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CloudCom.2011.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Third International Conference on Cloud Computing Technology and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudCom.2011.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

在云环境中,高效的资源供应和管理目前是一个具有挑战性的问题,一方面是因为云的动态性,另一方面是因为需要满足异构资源需求。在这种最终用户可以随时到达和离开云的动态环境中,云服务提供商(CSP)应该能够在考虑几个实用标准(例如,虚拟资源设置的延迟、现有流程的迁移、资源利用率等)的同时,为扩大或缩小其数据中心做出准确的决策。为了使双方(CSP和最终用户)都满意,必须采用有效的动态资源分配策略。在本文中,我们提出了一种在云环境中进行动态资源分配的新颖方法。我们的建议考虑计算作业请求的特征是它们的到达和拆除时间,以及它们在活动期间的计算需求的预测概要。假设对最终用户所需的预测计算资源具有先验知识,我们提出并研究了几种具有不同优化标准的算法。但是,在某些情况下,可能会出现预测错误,导致一个或多个计算请求丢失。我们提出的算法在各种性能参数方面进行了比较,包括拒绝率,下降率,以及最终用户和CSP的满意度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Resource Allocation in Cloud Environment Under Time-variant Job Requests
In Cloud environments, efficient resource provisioning and management present today a challenging issue because of the dynamic nature of the Cloud on one hand, and the need to satisfy heterogeneous resource requirements on the other hand. In such dynamic environments where end-users can arrive and leave the Cloud at any time, a Cloud service provider (CSP) should be able to make accurate decisions for scaling up or down its data-centers while taking into account several utility criteria, e.g., the delay of virtual resources setup, the migration of existing processes, the resource utilization, etc. In order to satisfy both parties (the CSP and the end-users), an efficient and dynamic resource allocation strategy is mandatory. In this paper, we propose an original approach for dynamic resource allocation in a Cloud environment. Our proposal considers computing job requests that are characterized by their arrival and teardown times, as well as a predictive profile of their computing requirements during their activity period. Assuming a prior knowledge of the predicted computing resources required by end-users, we propose and investigate several algorithms with different optimization criteria. However, prediction errors may occur resulting in some cases in the drop of one or several computing requests. Our proposed algorithms are compared in terms of various performance parameters including the rejection ratio, the dropping ratio, as well as the satisfaction of the endusers and the CSP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信