Rock-hyrax:云计算环境中使用资源集群的高能效作业调度

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Sustainable Computing-Informatics & Systems Pub Date : 2024-04-01 DOI:10.1016/j.suscom.2024.100985
Saurabh Singhal , Shabir Ali , Mohan Awasthy , Dhirendra Kumar Shukla , Rajesh Tiwari
{"title":"Rock-hyrax:云计算环境中使用资源集群的高能效作业调度","authors":"Saurabh Singhal ,&nbsp;Shabir Ali ,&nbsp;Mohan Awasthy ,&nbsp;Dhirendra Kumar Shukla ,&nbsp;Rajesh Tiwari","doi":"10.1016/j.suscom.2024.100985","DOIUrl":null,"url":null,"abstract":"<div><p>In a cloud computing environment, job scheduling allows the service provider to schedule resources based on demand. Job scheduling must also ensure QoS, end-user satisfaction, and the efficient usage of resources. Cloud computing vendors assign virtualized computing resources to end-users based on job requirements that are dynamically scalable and pay-per-use. The assignment of jobs requires proper investigation and mapping of available resources. In this paper, we have proposed a novel job scheduling scheme based on Rock Hyrax. Our Rock Hyrax approach uses objective functions to map jobs to available resources. The objective function considers a variety of QoS parameters like makespan, response time and energy efficiency. Our method employs two key QoS parameters: makespan and energy consumption. The node behavior and characteristics, such as processing power, storage, and network connectivity to cluster similar resources, have also been considered for scheduling. An experimental setup is created for a thorough study of the proposal using CloudSim simulator. For both the jobs and virtual machines, static and dynamic scenarios for performance evaluation have been developed. To compare our work with existing scheduling algorithms like ACO, PSO, BFO, and ABC has been considered and we have found that the proposal reduces makespan by 2–9% as increased in jobs. Furthermore, the proposed method reduces total energy consumption in data centers by 7–23% as jobs request increases. The findings support the claim that the proposed method surpasses the existing methods and significantly shortens the time needed to determine the resource required for the job.</p></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"42 ","pages":"Article 100985"},"PeriodicalIF":3.8000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rock-hyrax: An energy efficient job scheduling using cluster of resources in cloud computing environment\",\"authors\":\"Saurabh Singhal ,&nbsp;Shabir Ali ,&nbsp;Mohan Awasthy ,&nbsp;Dhirendra Kumar Shukla ,&nbsp;Rajesh Tiwari\",\"doi\":\"10.1016/j.suscom.2024.100985\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In a cloud computing environment, job scheduling allows the service provider to schedule resources based on demand. Job scheduling must also ensure QoS, end-user satisfaction, and the efficient usage of resources. Cloud computing vendors assign virtualized computing resources to end-users based on job requirements that are dynamically scalable and pay-per-use. The assignment of jobs requires proper investigation and mapping of available resources. In this paper, we have proposed a novel job scheduling scheme based on Rock Hyrax. Our Rock Hyrax approach uses objective functions to map jobs to available resources. The objective function considers a variety of QoS parameters like makespan, response time and energy efficiency. Our method employs two key QoS parameters: makespan and energy consumption. The node behavior and characteristics, such as processing power, storage, and network connectivity to cluster similar resources, have also been considered for scheduling. An experimental setup is created for a thorough study of the proposal using CloudSim simulator. For both the jobs and virtual machines, static and dynamic scenarios for performance evaluation have been developed. To compare our work with existing scheduling algorithms like ACO, PSO, BFO, and ABC has been considered and we have found that the proposal reduces makespan by 2–9% as increased in jobs. Furthermore, the proposed method reduces total energy consumption in data centers by 7–23% as jobs request increases. The findings support the claim that the proposed method surpasses the existing methods and significantly shortens the time needed to determine the resource required for the job.</p></div>\",\"PeriodicalId\":48686,\"journal\":{\"name\":\"Sustainable Computing-Informatics & Systems\",\"volume\":\"42 \",\"pages\":\"Article 100985\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sustainable Computing-Informatics & Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210537924000301\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537924000301","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

在云计算环境中,作业调度允许服务提供商根据需求调度资源。作业调度还必须确保服务质量、终端用户满意度和资源的有效使用。云计算供应商根据可动态扩展和按使用付费的作业需求向最终用户分配虚拟计算资源。任务分配需要对可用资源进行适当的调查和映射。本文提出了一种基于 Rock Hyrax 的新型作业调度方案。我们的 Rock Hyrax 方法使用目标函数将作业映射到可用资源。目标函数考虑了各种 QoS 参数,如时间跨度、响应时间和能效。我们的方法采用了两个关键的 QoS 参数:时间跨度和能耗。在进行调度时,还考虑了节点的行为和特性,如处理能力、存储和网络连接,以集群类似的资源。我们使用 CloudSim 模拟器创建了一个实验装置,以便对该建议进行深入研究。针对作业和虚拟机,开发了用于性能评估的静态和动态场景。为了将我们的工作与现有的调度算法(如 ACO、PSO、BFO 和 ABC)进行比较,我们发现,随着作业的增加,该建议可将工作时间缩短 2-9%。此外,随着作业请求的增加,建议的方法还能将数据中心的总能耗降低 7-23%。这些研究结果证明,建议的方法超越了现有方法,大大缩短了确定作业所需资源的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Rock-hyrax: An energy efficient job scheduling using cluster of resources in cloud computing environment

In a cloud computing environment, job scheduling allows the service provider to schedule resources based on demand. Job scheduling must also ensure QoS, end-user satisfaction, and the efficient usage of resources. Cloud computing vendors assign virtualized computing resources to end-users based on job requirements that are dynamically scalable and pay-per-use. The assignment of jobs requires proper investigation and mapping of available resources. In this paper, we have proposed a novel job scheduling scheme based on Rock Hyrax. Our Rock Hyrax approach uses objective functions to map jobs to available resources. The objective function considers a variety of QoS parameters like makespan, response time and energy efficiency. Our method employs two key QoS parameters: makespan and energy consumption. The node behavior and characteristics, such as processing power, storage, and network connectivity to cluster similar resources, have also been considered for scheduling. An experimental setup is created for a thorough study of the proposal using CloudSim simulator. For both the jobs and virtual machines, static and dynamic scenarios for performance evaluation have been developed. To compare our work with existing scheduling algorithms like ACO, PSO, BFO, and ABC has been considered and we have found that the proposal reduces makespan by 2–9% as increased in jobs. Furthermore, the proposed method reduces total energy consumption in data centers by 7–23% as jobs request increases. The findings support the claim that the proposed method surpasses the existing methods and significantly shortens the time needed to determine the resource required for the job.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
期刊最新文献
Sustainable cost-energy aware load balancing in cloud environment using intelligent optimization SURETY-Fog: Secure Data Query and Storage Processing in Fog Driven IoT Environment Real-time performance enhancement of battery energy storage system in sustainable microgrids using Harris Hawks Optimization Optimizing power allocation in contemporary IoT systems: A deep reinforcement learning approach Hardware and application aware performance, power and energy models for modern HPC servers with DVFS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1