Buchumschlag

A Novel, Self-Adaptive, Multiclass Priority Algorithm with VM Clustering for Efficient Cloud Resource Allocation

Gespeichert in:
Veröffentlicht in:Computers vol. 14, no. 3 (2025), p. 81
1. Verfasser: Hicham Ben Alla
Weitere Verfasser: Said Ben Alla, Ezzati, Abdellah, Touhafi, Abdellah
Veröffentlicht:
MDPI AG
Schlagworte:
Scheduling
Computer centers
Task scheduling
Performance measurement
Clustering
Cloud computing
Optimization
Resource allocation
Resource scheduling
Queuing
Energy efficiency
Quality of service
Algorithms
Resource utilization
Energy consumption
Performance evaluation
Workloads
Load balancing
Business metrics
Adaptive algorithms
Priority scheduling
Online-Zugang:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!
Abstract:Priority in task scheduling and resource allocation for cloud computing has attracted significant attention from the research community. However, traditional scheduling algorithms often lack the ability to differentiate between tasks with varying levels of importance. This limitation presents a challenge when cloud servers must handle diverse tasks with distinct priority classes and strict quality of service requirements. To address these challenges in cloud computing environments, particularly within the infrastructure of service models, we propose a novel, self-adaptive, multiclass priority algorithm with VM clustering for resource allocation. This algorithm implements a four-tiered prioritization system to optimize key objectives, including makespan and energy consumption, while simultaneously optimizing resource utilization, degree of imbalance, and waiting time. Additionally, we propose a resource prioritization and load-balancing model based on the clustering technique. The proposed work was validated through multiple simulations using the CloudSim simulator, comparing its performance against well-known task scheduling algorithms. The simulation results and analysis demonstrate that the proposed algorithm effectively optimizes makespan and energy consumption. Specifically, our work achieved percentage improvements ranging from +0.97% to +26.80% in makespan and +3.68% to +49.49% in energy consumption while also improving other performance metrics, including throughput, resource utilization, and load balancing. This novel model demonstrably enhances task scheduling and resource allocation efficiency, particularly in complex scenarios with tight deadlines and multiclass priorities.
ISSN:2073-431X
DOI:10.3390/computers14030081
Quelle:Advanced Technologies & Aerospace Database