Search

The utilization of cloud computing environments is highly popular for carrying out workflow executions due to its ability to provide clients with immediate access to computing resources. Among the various workflow scheduling problems in the cloud, deadline-constrained workflow scheduling has garnered increasing attention in recent years. This paper introduces a hybrid scheduling algorithm known as Partial Critical Path–Ant Colony Optimization (PCP–ACO), which aims to minimize the execution cost of a workflow while ensuring that it meets the user-defined deadline in cloud environments. PCP–ACO is a list scheduling algorithm that combines the PCP heuristic algorithm with the meta-heuristic ACO to achieve faster convergence. The list scheduling algorithm consists of two phases: task ordering and resource selection. In the case of PCP–ACO, the first step involves calculating a topological sort of the workflow tasks to assign priority to each task. Subsequently, the ACO meta-heuristic is employed to allocate the appropriate resource to each task of the workflow, based on their respective sub-deadlines that are computed using the PCP heuristic. In order to evaluate the effectiveness of the proposed algorithm, several experiments were conducted using five real scientific workflows. The results demonstrate that PCP–ACO outperforms the IC-PCP, L-ACO, and HP-GA algorithms in terms of average execution cost, achieving reductions of 19%, 17.3%, and 21.5%, respectively. [ABSTRACT FROM AUTHOR]

Today, cloud computing technology has attracted the attention of many researchers. According to the needs of users to quickly execute requests and provide quality services, optimal allocation of resources and timing of task execution between virtual machines in cloud computing are of great importance. One of the important challenges that cloud service providers face is the effective management of resources by physical infrastructure. Therefore, in this paper, an autonomous system based on the Clipped Double Deep Q-Learning (CDDQL) Algorithm and the meta-heuristic Particle Swarm Optimization (PSO) for resource allocation is proposed in the Fog-cloud computing infrastructure. The PSO algorithm is used to prioritize the tasks and CDDQL is used as the core of the autonomous system (Auto-CDDQL) to allocate the desired VM resources to the tasks. The proposed Auto-CDDQL is implemented in the Fog and performs this process autonomously. By evaluating the results, it was observed that the amount of Make Span, response time, task completion, resource utilization, and energy consumption rate in the proposed AutoCDDQL on the c-hilo dataset, compared to the FCFS, RR, and PBTS methods, are significantly improved. [ABSTRACT FROM AUTHOR]

Cloud computing has experienced extraordinary development across a wide range of industries by giving customers the flexibility to employ computing resources as needed. The task scheduling problem is one of several major challenges in cloud computing, and it should be scheduled effectively to minimize makespan and maximize resource utilization. Therefore, this paper put forward an improved scheduling efficiency algorithm called Enhanced Marine Predator Algorithm (EMPA). Firstly, task scheduling model with makespan and resource utilization is constructed. Secondly, each individual represents a result of task scheduling, and the purpose of algorithms is to find the optimal scheduling result, therefore the operator of WOA, nonlinear inertia weight coefficient and golden sine strategy are introduced into Marine Predator Algorithm. In the simulation experiment, EMPA is compared with Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) under different number of tasks in synthetic datasets and GoCJ datasets.The experimental results show that the EMPA algorithm has more advantages in terms of makespan, degree of imbalance, and resource utilization. [ABSTRACT FROM AUTHOR]