PTBO: Energy and Makespan-Aware Scheduling in Cloud Computing Using Meta-Heuristic Algorithm
Polisetty Santhi Priya, Santhosh Kumar Medishetti, Rameshwaraiah Kurupati, Ramagiri Brahmini, T Gokul, Shaik Aziz Baji
Dr. Reddy's Laboratories (India)
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Efficient task scheduling in cloud computing environments is essential to optimize resource utilization, minimize execution time, and reduce operational costs. Traditional scheduling algorithms often struggle with balancing multi-objective constraints such as makespan, energy consumption, and load distribution, especially under dynamic workloads. To address these challenges, this paper presents a novel Painting Training Based Optimization (PTBO) algorithm for efficient task scheduling in cloud computing, aiming to minimize makespan and energy consumption while enhancing resource utilization. Inspired by the structured and iterative learning process of artists, PTBO integrates exploration and exploitation strategies to achieve optimal task-to-VM mapping. The algorithm is evaluated using the HPC2N workload dataset in a CloudSim simulation environment and compared against widely used metaheuristic algorithms GA, PSO, and ACO. Experimental results reveal that PTBO reduces makespan by 24.2 % and energy consumption by 29.6 % on average across varying task volumes. These improvements highlight PTBO's capability to outperform existing techniques in dynamic cloud environments, making it a promising solution for scalable, energy-efficient, and time-sensitive task scheduling.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AICloud Computing and Resource Management
Distributed and Parallel Computing Systems · IoT and Edge/Fog Computing
参考文献 12
此处列出前 3 条
引用本文 49
按被引量排序,此处列出前 3 条