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 , Ahmed Y. Hamed , A. Mindil , 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.
期刊介绍:
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.