Nowadays, Cloud Computing (CC) has emerged as a new paradigm for hosting and delivering services over the Internet. However, the wider deployment of Cloud and the rapid increase in the capacity, as well as the size of data centers, induces a tremendous rise in electricity consumption, escalating data center ownership costs and increasing carbon footprints. This expanding scale of data centers has made energy consumption an imperative issue. Besides, users’ requirements regarding execution time, deadline, QoS have become more sophisticated and demanding. These requirements often conflict with the objectives of cloud providers, especially in a high-stress environment in which the tasks have very critical deadlines. To address these issues, this paper proposes an efficient Energy-Aware Tasks Scheduling with Deadline-constrained in Cloud Computing (EATSD). The main goal of the proposed solution is to reduce the energy consumption of the cloud resources, consider different users’ priorities and optimize the makespan under the deadlines constraints. Further, the proposed algorithm has been simulated using the CloudSim simulator. The experimental results validate that the proposed approach can effectively achieve good performance by minimizing the makespan, reducing energy consumption and improving resource utilization while meeting deadline constraints.

Cloud computing is an emerging high performance computing paradigm for managing and delivering services using a large collection of heterogeneous autonomous systems with flexible computational architecture. Task scheduling is one of the most challenging aspects to improve the overall performance of the cloud computing such as response time, cost, makespan, throughput etc. Task scheduling is also essential to reduce power consumption, processing time and improve the profit of service providers by decreasing operating costs and improving the system reliability. This paper focuses on Task Scheduling using a novel architecture with Dynamic Queues based on hybrid algorithm using Fuzzy Logic and Particle Swarm Optimization algorithm (TSDQ-FLPSO) to optimize makespan and waiting time. The experimental result based on an open source simulator (CloudSim) show that the proposed TSDQ-FLPSO provides an optimal balance results, minimizing the waiting time, reducing the makespan and improving the resource utilization compared to existing scheduling algorithms.

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.