利用动态聚类算法和 SM-CDC 调度模型改善云资源调度的 QoS

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Tayebeh Varmeziar, Mohamad Ebrahim Shiri, Parisa Rahmani
{"title":"利用动态聚类算法和 SM-CDC 调度模型改善云资源调度的 QoS","authors":"Tayebeh Varmeziar,&nbsp;Mohamad Ebrahim Shiri,&nbsp;Parisa Rahmani","doi":"10.1002/cpe.8279","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Quality of Service (QoS) regulates and controls network resources by setting priorities for specific data types. Many clustering algorithms are used to cluster cloud workloads, most of which are static. However, the lack of dynamic algorithms is seen in the face of huge databases that are real-time and according to the existing clustering conditions. Additionally, fair allocation of tasks on servers and efficient resource utilization pose challenges. In this research, two solutions are proposed to improve the quality of service: the first solution uses the chameleon dynamic algorithm, a method to improve service quality. The chameleon algorithm has been able to show significant performance due to its high accuracy in detecting the smallest distance between clusters. This dynamic algorithm outperforms static algorithms with classification accuracy and response speed, which are the most important parameters of service quality. The second part of the proposed solution is to use the Scheduling Model using Cloud Data Centers (SM-CDC) system to select the best service provider based on the clustering done in the previous step. A SM-CDC technique is developed to handle cloud storage center tasks that are stored in electronic devices. According to the comparison with existing scheduling policies, SM-CDC offered 36% decrease on response time, 50% reduction on cost of resources, and 40% improvement on QoS Satisfaction.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model\",\"authors\":\"Tayebeh Varmeziar,&nbsp;Mohamad Ebrahim Shiri,&nbsp;Parisa Rahmani\",\"doi\":\"10.1002/cpe.8279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Quality of Service (QoS) regulates and controls network resources by setting priorities for specific data types. Many clustering algorithms are used to cluster cloud workloads, most of which are static. However, the lack of dynamic algorithms is seen in the face of huge databases that are real-time and according to the existing clustering conditions. Additionally, fair allocation of tasks on servers and efficient resource utilization pose challenges. In this research, two solutions are proposed to improve the quality of service: the first solution uses the chameleon dynamic algorithm, a method to improve service quality. The chameleon algorithm has been able to show significant performance due to its high accuracy in detecting the smallest distance between clusters. This dynamic algorithm outperforms static algorithms with classification accuracy and response speed, which are the most important parameters of service quality. The second part of the proposed solution is to use the Scheduling Model using Cloud Data Centers (SM-CDC) system to select the best service provider based on the clustering done in the previous step. A SM-CDC technique is developed to handle cloud storage center tasks that are stored in electronic devices. According to the comparison with existing scheduling policies, SM-CDC offered 36% decrease on response time, 50% reduction on cost of resources, and 40% improvement on QoS Satisfaction.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 27\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8279\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8279","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

服务质量(QoS)通过为特定数据类型设置优先级来调节和控制网络资源。许多聚类算法被用于对云工作负载进行聚类,其中大部分都是静态的。然而,面对实时且符合现有聚类条件的庞大数据库,动态算法却显得不足。此外,服务器上任务的公平分配和资源的高效利用也提出了挑战。本研究提出了两种解决方案来提高服务质量:第一种解决方案采用变色龙动态算法,这是一种提高服务质量的方法。变色龙算法在检测簇间最小距离方面具有很高的准确性,因此能够显示出显著的性能。这种动态算法在分类准确性和响应速度方面优于静态算法,而这正是服务质量最重要的参数。拟议解决方案的第二部分是使用云数据中心调度模型(SM-CDC)系统,根据上一步完成的聚类选择最佳服务提供商。我们开发了一种 SM-CDC 技术,用于处理存储在电子设备中的云存储中心任务。根据与现有调度策略的比较,SM-CDC 的响应时间缩短了 36%,资源成本降低了 50%,服务质量满意度提高了 40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model

Quality of Service (QoS) regulates and controls network resources by setting priorities for specific data types. Many clustering algorithms are used to cluster cloud workloads, most of which are static. However, the lack of dynamic algorithms is seen in the face of huge databases that are real-time and according to the existing clustering conditions. Additionally, fair allocation of tasks on servers and efficient resource utilization pose challenges. In this research, two solutions are proposed to improve the quality of service: the first solution uses the chameleon dynamic algorithm, a method to improve service quality. The chameleon algorithm has been able to show significant performance due to its high accuracy in detecting the smallest distance between clusters. This dynamic algorithm outperforms static algorithms with classification accuracy and response speed, which are the most important parameters of service quality. The second part of the proposed solution is to use the Scheduling Model using Cloud Data Centers (SM-CDC) system to select the best service provider based on the clustering done in the previous step. A SM-CDC technique is developed to handle cloud storage center tasks that are stored in electronic devices. According to the comparison with existing scheduling policies, SM-CDC offered 36% decrease on response time, 50% reduction on cost of resources, and 40% improvement on QoS Satisfaction.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信