Innovative quantum techniques for improving system performance in cloud computing

IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Naher M. Alsafri , Ahmed Y. Hamed , A. Mindil , M.R. Hassan
{"title":"Innovative quantum techniques for improving system performance in cloud computing","authors":"Naher M. Alsafri ,&nbsp;Ahmed Y. Hamed ,&nbsp;A. Mindil ,&nbsp;M.R. Hassan","doi":"10.1016/j.eij.2025.100710","DOIUrl":null,"url":null,"abstract":"<div><div>Effective task scheduling is pivotal for optimizing the performance of cloud computing services, particularly to minimize execution time and enhance resource utilization. Traditional approaches often focus on single-objective metrics, such as task completion time, or fail to address the intricate interdependencies between multiple objectives. To overcome these limitations, we introduce QISPF, a novel multi-objective task scheduling algorithm that combines genetic algorithms with innovative quantum techniques. QISPF is designed to achieve an optimal task distribution by addressing key performance metrics makespan, scheduling length, throughput, resource utilization, energy consumption, and load balancing, through a unified measure known as system performance. QISPF leverages quantum techniques to enhance the traditional genetic algorithm framework by incorporating principles from quantum mechanics, such as probabilistic quantum encoding and superposition. The simulations were conducted for two cases. The first had 100 tasks and anything from 10 to 50 virtual machines. Furthermore, in the second case, there were a certain number of virtual machines (VMs), with the number of tasks ranging from 500 to 1000. The simulation results demonstrated the scheduling efficiency of QISPF compared to the G-MOTSA, ETVMC, TSACS, and ACO algorithms. QISPF offers a more powerful approach to exploring and exploiting the solution space. This novel method allows for a richer representation of potential solutions and improves the algorithm’s ability to find high-quality solutions in complex problem landscapes.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"30 ","pages":"Article 100710"},"PeriodicalIF":4.3000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866525001033","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Effective task scheduling is pivotal for optimizing the performance of cloud computing services, particularly to minimize execution time and enhance resource utilization. Traditional approaches often focus on single-objective metrics, such as task completion time, or fail to address the intricate interdependencies between multiple objectives. To overcome these limitations, we introduce QISPF, a novel multi-objective task scheduling algorithm that combines genetic algorithms with innovative quantum techniques. QISPF is designed to achieve an optimal task distribution by addressing key performance metrics makespan, scheduling length, throughput, resource utilization, energy consumption, and load balancing, through a unified measure known as system performance. QISPF leverages quantum techniques to enhance the traditional genetic algorithm framework by incorporating principles from quantum mechanics, such as probabilistic quantum encoding and superposition. The simulations were conducted for two cases. The first had 100 tasks and anything from 10 to 50 virtual machines. Furthermore, in the second case, there were a certain number of virtual machines (VMs), with the number of tasks ranging from 500 to 1000. The simulation results demonstrated the scheduling efficiency of QISPF compared to the G-MOTSA, ETVMC, TSACS, and ACO algorithms. QISPF offers a more powerful approach to exploring and exploiting the solution space. This novel method allows for a richer representation of potential solutions and improves the algorithm’s ability to find high-quality solutions in complex problem landscapes.
改进云计算系统性能的创新量子技术
有效的任务调度对于优化云计算服务的性能至关重要,特别是对于最小化执行时间和提高资源利用率而言。传统方法通常关注单目标度量,例如任务完成时间,或者无法处理多个目标之间复杂的相互依赖关系。为了克服这些限制,我们引入了一种新的多目标任务调度算法QISPF,它结合了遗传算法和创新的量子技术。QISPF的设计目的是通过一种称为系统性能的统一度量来处理关键性能指标——最大时间跨度、调度长度、吞吐量、资源利用率、能耗和负载平衡,从而实现最佳任务分配。QISPF利用量子技术,结合量子力学的原理,如概率量子编码和叠加,来增强传统的遗传算法框架。对两种情况进行了模拟。第一个有100个任务和10到50个虚拟机。此外,在第二种情况下,有一定数量的虚拟机(vm),任务数量从500到1000不等。仿真结果表明,与G-MOTSA、ETVMC、TSACS和ACO算法相比,QISPF算法的调度效率更高。QISPF提供了一种更强大的方法来探索和利用解决方案空间。这种新颖的方法允许更丰富的潜在解决方案的表示,并提高了算法在复杂问题环境中找到高质量解决方案的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Egyptian Informatics Journal
Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research
CiteScore
11.10
自引率
1.90%
发文量
59
审稿时长
110 days
期刊介绍: The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.
×
引用
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学术官方微信