降低复杂度:基于资源熵的qos感知云调度的本地活动排序

Huankai Chen, Frank Z. Wang, Matteo Migliavacca, L. Chua, N. Helian
{"title":"降低复杂度:基于资源熵的qos感知云调度的本地活动排序","authors":"Huankai Chen, Frank Z. Wang, Matteo Migliavacca, L. Chua, N. Helian","doi":"10.1109/SCC.2016.82","DOIUrl":null,"url":null,"abstract":"The principle of local activity originated from electronic circuits, but can easily translate into other non-electrical homogeneous/heterogeneous media. Cloud resource is an example of a locally-active device, which is the origin of complexity in cloud scheduling system. However, most of the researchers implicitly assume the cloud resource to be locally passive when constructing new scheduling strategies. As a result, their research solutions perform poorly in the complex cloud environment. In this paper, we first study several complexity factors caused by the locally-active cloud resource. And then we extended the ”Local Activity Principle” concept with a quantitative measurement based on Entropy Theory. Furthermore, we classify the scheduling system into ”Order” or ”Chaos” state with simulating complexity in the cloud. Finally, we propose a new approach to controlling the chaos based on resource's Local Activity Ranking for QoS-aware cloud scheduling and implement such idea in Spark. Experiments demonstrate that our approach outperforms the native Spark Fair Scheduler with server cost reduced by 23%, average response time improved by 15% - 20% and standard deviation of response time minimized by 30% - 45%.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Complexity Reduction: Local Activity Ranking by Resource Entropy for QoS-Aware Cloud Scheduling\",\"authors\":\"Huankai Chen, Frank Z. Wang, Matteo Migliavacca, L. Chua, N. Helian\",\"doi\":\"10.1109/SCC.2016.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The principle of local activity originated from electronic circuits, but can easily translate into other non-electrical homogeneous/heterogeneous media. Cloud resource is an example of a locally-active device, which is the origin of complexity in cloud scheduling system. However, most of the researchers implicitly assume the cloud resource to be locally passive when constructing new scheduling strategies. As a result, their research solutions perform poorly in the complex cloud environment. In this paper, we first study several complexity factors caused by the locally-active cloud resource. And then we extended the ”Local Activity Principle” concept with a quantitative measurement based on Entropy Theory. Furthermore, we classify the scheduling system into ”Order” or ”Chaos” state with simulating complexity in the cloud. Finally, we propose a new approach to controlling the chaos based on resource's Local Activity Ranking for QoS-aware cloud scheduling and implement such idea in Spark. Experiments demonstrate that our approach outperforms the native Spark Fair Scheduler with server cost reduced by 23%, average response time improved by 15% - 20% and standard deviation of response time minimized by 30% - 45%.\",\"PeriodicalId\":115693,\"journal\":{\"name\":\"2016 IEEE International Conference on Services Computing (SCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Services Computing (SCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC.2016.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2016.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

局部活动原理起源于电子电路,但可以很容易地转化为其他非电均质/异质介质。云资源是本地活动设备的一个例子,这是云调度系统复杂性的根源。然而,在构建新的调度策略时,大多数研究人员都隐含地假设云资源是局部被动的。因此,他们的研究解决方案在复杂的云环境中表现不佳。在本文中,我们首先研究了由本地活跃的云资源引起的几个复杂性因素。然后将“局部活动原理”的概念扩展为基于熵理论的定量测量。此外,我们将调度系统分为“有序”和“混沌”两种状态,模拟了云中的复杂性。最后,我们提出了一种基于资源本地活动排序的qos感知云调度混沌控制方法,并在Spark中实现。实验表明,我们的方法比本地Spark Fair Scheduler降低了23%的服务器成本,平均响应时间提高了15% - 20%,响应时间的标准差降低了30% - 45%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Complexity Reduction: Local Activity Ranking by Resource Entropy for QoS-Aware Cloud Scheduling
The principle of local activity originated from electronic circuits, but can easily translate into other non-electrical homogeneous/heterogeneous media. Cloud resource is an example of a locally-active device, which is the origin of complexity in cloud scheduling system. However, most of the researchers implicitly assume the cloud resource to be locally passive when constructing new scheduling strategies. As a result, their research solutions perform poorly in the complex cloud environment. In this paper, we first study several complexity factors caused by the locally-active cloud resource. And then we extended the ”Local Activity Principle” concept with a quantitative measurement based on Entropy Theory. Furthermore, we classify the scheduling system into ”Order” or ”Chaos” state with simulating complexity in the cloud. Finally, we propose a new approach to controlling the chaos based on resource's Local Activity Ranking for QoS-aware cloud scheduling and implement such idea in Spark. Experiments demonstrate that our approach outperforms the native Spark Fair Scheduler with server cost reduced by 23%, average response time improved by 15% - 20% and standard deviation of response time minimized by 30% - 45%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信