Task Scheduling Algorithms Research Articles

ERTH scheduler: enhanced red-tailed hawk algorithm for multi-cost optimization in cloud task scheduling

Effective task scheduling has become the key to optimizing resource allocation, reducing operation costs, and enhancing the user experience. The complexity and dynamics of cloud computing environments require task scheduling algorithms that can flexibly respond to multiple computing demands and changing resource states. Therefore, we propose an enhanced Red-tailed Hawk algorithm (named ERTH) based on multiple elite policies and chaotic mapping, while applying this approach in conjunction with the proposed scheduling model to optimize the efficiency of task scheduling in cloud computing environments. We apply the ERTH algorithm to a real cloud computing environment and conduct a comparison with the original RTH and other conventional algorithms. The proposed ERTH algorithm has better convergence speed and stability in most cases of small and large-scale tasks and performs better in minimizing the task completion time and system load cost. Specifically, our experiments show that the ERTH algorithm reduces the total system cost by 34.8% and 36.4% relative to the traditional algorithm for tasks of different sizes. Further, evaluations in the IEEE Congress on Evolutionary Computation (CEC) benchmark test sets show that the ERTH algorithm outperforms the traditional or emerging algorithms in several performance metrics such as mean, standard deviation, etc. The proposal and validation of the ERTH algorithm are of great significance in promoting the application of intelligent optimization algorithms in cloud computing.

Fuzzy Reinforcement Learning Algorithm for Efficient Task Scheduling in Fog-Cloud IoT-Based Systems

Fuzzy Reinforcement Learning Algorithm for Efficient Task Scheduling in Fog-Cloud IoT-Based Systems

Efficient deep reinforcement learning based task scheduler in multi cloud environment

Task scheduling problem (TSP) is huge challenge in cloud computing paradigm as number of tasks comes to cloud application platform vary from time to time and all the tasks consists of variable length, runtime capacities. All these tasks may generated from various heterogeneous resources which comes onto cloud console directly effects the performance of cloud paradigm with increase in makespan, energy consumption, resource costs. Traditional task scheduling algorithms cannot handle these type of complex workloads in cloud paradigm. Many authors developed Task Scheduling algorithms by using metaheuristic techniques, hybrid approaches but all these algorithms give near optimal solutions but still TSP is a highly challenging and dynamic scenario as it resembles NP hard problem. Therefore, to tackle the TSP in cloud computing paradigm and schedule the tasks in an effective way in cloud paradigm, we formulated Adaptive Task scheduler which segments all the tasks comes to cloud console as sub tasks and fed these to the scheduler which is modeled by Improved Asynchronous Advantage Actor Critic Algorithm(IA3C) to generate schedules. This scheduling process is carried out in two stages. In first stage, all incoming tasks are segmented as sub tasks. After segmentation, all these sub tasks according to their size, execution time, communication time are grouped together and fed to the (ATSIA3C) scheduler. In the second stage, it checks for the above said constraints and disperse them onto the corresponding suitable processing capacity VMs resided in datacenters. Proposed ATSIA3C is simulated on Cloudsim. Extensive simulations are conducted using both fabricated worklogs and as well as realtime supercomputing worklogs. Our proposed mechanism evaluated over baseline algorithms i.e. RATS-HM, AINN-BPSO, MOABCQ. From results it is evident that our proposed ATSIA3C outperforms existing task schedulers by improving makespan by 70.49%. Resource cost is improved by 77.42%. Energy Consumption is improved over compared algorithms 74.24% in multi cloud environment by proposed ATSIA3C.

Task Scheduling Optimization in the Cloud Using Improved Heuristic Algorithm

Cloud Computing has become the most efficient and reliable technology in today’s era. Almost every organization and individual depend upon this technology to perform their task and even for storage purpose. As the number of users is growing, the complexity of this technology has also increased massively. Thus, for reliable and efficient use of cloud technology, the tasks, infrastructures, and load must be balanced in the system. Among different methods, one of the ways to efficiently manage the complexity of the system is task scheduling. Task scheduling helps to optimize CPU utilization and make the tasks done with minimum loss. Also, there are many task-scheduling algorithms which have been proposed and implemented to date. Every algorithm has its pros and cons too. Thus, this project aims to implement the proposed improved heuristic (B-Sufferage) Algorithm to schedule tasks in a cloud environment and compare the result with the existing PSO and Min-Min Task Scheduling Algorithm. The B-Sufferage Algorithm depends upon the sufferage value to schedule a particular task on a particular VM. The required infrastructure has been set up using CloudSim 3.0.3 and the implementation has been carried out by configuring respective algorithms. As a result, it has been found that the B-Sufferage algorithm in task scheduling works better than the existing one. Thus, the result has been compared based on metrics like makespan, resource utilization, turn-around time, and waiting time where there is a significant difference for scheduling tasks using this B-Sufferage; an improved heuristic algorithm.

Efficient Scheduling of Energy-Constrained Tasks in Internet of Things Edge Computing Networks

We offer task scheduling algorithms that are economical in terms of energy consumption for edge computing networks that are supported by the Internet of Things (IoT). The challenges of spectrum utilization and energy-efficient work scheduling that lead to novel design are not addressed in this study, despite the fact that it provides encouraging results for task offloading. There is a possibility that the larger homogeneous fog computing architecture will include all homogeneous nodes, in addition to additional spectrum for node-to-node and device-to-device communications and work scheduling. We create a fog computing architecture that is efficient in terms of energy consumption for edge computing networks that are supported by the Internet of Things. By utilizing this approach, user-device nodes are able to collaborate while simultaneously reaping the benefits of diverse computing and network resources. In addition to this, we provide a solution to the problem of task scheduling that maximizes energy efficiency across all of the help nodes.

DNA computing and meta-heuristic-based algorithm for big data task scheduling in cloud computing

With the advent of cloud computing, there is a need to enhance both the methods and algorithms of big data workloads for task scheduling. Due to the global spread of services with changing task load circumstances and different cloud client demands, big data task scheduling in cloud systems is a time-consuming process. The proposed approach emphasises the necessity for efficient big data task scheduling in the cloud computing, which exacerbate data processing. Virtual machines frequently utilise all three types of physical resources: CPU, memory, and storage. Big data task scheduling is one of the most important implications of cloud computing application resource management, and this research work meticulously offers a task scheduling technique for advancing cloud computing.

GIJA:Enhanced geyser‐inspired Jaya algorithm for task scheduling optimization in cloud computing

AbstractTask scheduling optimization plays a pivotal role in enhancing the efficiency and performance of cloud computing systems. In this article, we introduce GIJA (Geyser‐inspired Jaya Algorithm), a novel optimization approach tailored for task scheduling in cloud computing environments. GIJA integrates the principles of the Geyser‐inspired algorithm with the Jaya algorithm, augmented by a Levy Flight mechanism, to address the complexities of task scheduling optimization. The motivation for this research stems from the increasing demand for efficient resource utilization and task management in cloud computing, driven by the proliferation of Internet of Things (IoT) devices and the growing reliance on cloud‐based services. Traditional task scheduling algorithms often face challenges in handling dynamic workloads, heterogeneous resources, and varying performance objectives, necessitating innovative optimization techniques. GIJA leverages the eruptive dynamics of geysers, inspired by nature's efficiency in channeling resources, to guide task scheduling decisions. By combining this Geyser‐inspired approach with the simplicity and effectiveness of the Jaya algorithm, GIJA offers a robust optimization framework capable of adapting to diverse cloud computing environments. Additionally, the integration of the Levy Flight mechanism introduces stochasticity into the optimization process, enabling the exploration of solution spaces and accelerating convergence. To evaluate the efficacy of GIJA, extensive experiments are conducted using synthetic and real‐world datasets representative of cloud computing workloads. Comparative analyses against existing task scheduling algorithms, including AOA, RSA, DMOA, PDOA, LPO, SCO, GIA, and GIAA, demonstrate the superior performance of GIJA in terms of solution quality, convergence rate, diversity, and robustness. The findings of GIJA provide a promising solution quality for addressing the complexities of task scheduling in cloud environments (95%), with implications for enhancing system performance, scalability, and resource utilization.

An Implementation on Energy Efficient Task Scheduling in Cloud Environment

Abstract: Cloud computing has revolutionized the way computing resources are utilized by providing scalable, on-demand access to a shared pool of resources over the internet. It offers significant advantages such as cost savings, flexibility, and accessibility, making it an essential technology for businesses and individuals alike. However, the increasing energy consumption associated with cloud data centres has become a critical concern, necessitating the development of energy-efficient task scheduling algorithms. This paper explores various algorithms designed to optimize task scheduling in cloud environments to reduce energy consumption. Among these, heuristic algorithms like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are popular for their ability to find near-optimal solutions in large search spaces. Additionally, machine learning-based approaches, such as Reinforcement Learning (RL), have shown promise in dynamically adapting to workload variations and improving energy efficiency. Other notable algorithms include Ant Colony Optimization (ACO) and Dynamic Voltage and Frequency Scaling (DVFS), each offering unique mechanisms to balance performance and energy usage. The focus of this paper is on the implementation and comparative analysis of these task scheduling algorithms in a cloud environment. We present a comprehensive evaluation of their performance, highlighting their strengths and limitations in achieving energy efficiency. The results demonstrate that while no single algorithm is universally optimal, tailored combinations of these approaches can significantly enhance energy savings in cloud data centres.

Enhanced Wireless Communication Optimization with Neural Networks, Proximal Policy Optimization and Edge Computing for Latency and Energy Efficiency

This research proposes a novel approach for efficient resource allocation in wireless communication systems. It combines dynamic neural networks, Proximal Policy Optimization (PPO), and Edge Computing Orchestrator (ECO) for latency-aware and energy-efficient resource allocation. The proposed system integrates multiple components, including a dynamic neural network, PPO, ECO, and a Mobile Edge Computing (MEC) server. The experimental methodology involves utilizing the NS-3 simulation platform to assess latency and energy efficiency in resource allocation within a wireless communication network, incorporating an ECO, MEC server, and dynamic task scheduling algorithms. It demonstrates a holistic and adaptable approach to resource allocation in dynamic environments, showcasing a notable reduction in latency for devices and tasks. Latency values range from 5 to 20 milliseconds, with corresponding resource utilization percentages varying between 80% and 95%. Additionally, energy-efficient resource allocation demonstrates a commendable reduction in energy consumption, with measured values ranging from 10 to 30 watts, coupled with efficient resource usage percentages ranging from 70% to 85%. These outcomes validate the efficacy of achieving both latency-aware and energy-efficient resource allocation for enhanced wireless communication systems. The proposed system has broad applications in healthcare, smart cities, IoT, real-time analytics, autonomous vehicles, and augmented reality, offering a valuable solution to optimize energy consumption, reduce latency, and enhance system efficiency in these industries.

Adaptive scheduling-based fine-grained greybox fuzzing for cloud-native applications

Coverage-guided fuzzing is one of the most popular approaches to detect bugs in programs. Existing work has shown that coverage metrics are a crucial factor in guiding fuzzing exploration of targets. A fine-grained coverage metric can help fuzzing to detect more bugs and trigger more execution states. Cloud-native applications that written by Golang play an important role in the modern computing paradigm. However, existing fuzzers for Golang still employ coarse-grained block coverage metrics, and there is no fuzzer specifically for cloud-native applications, which hinders the bug detection in cloud-native applications. Using fine-grained coverage metrics introduces more seeds and even leads to seed explosion, especially in large targets such as cloud-native applications. Therefore, we employ an accurate edge coverage metric in fuzzer for Golang, which achieves finer test granularity and more accurate coverage information than block coverage metrics. To mitigate the seed explosion problem caused by fine-grained coverage metrics and large target sizes, we propose smart seed selection and adaptive task scheduling algorithms based on a variant of the classical adversarial multi-armed bandit (AMAB) algorithm. Extensive evaluation of our prototype on 16 targets in real-world cloud-native infrastructures shows that our approach detects 233% more bugs than go-fuzz, achieving an average coverage improvement of 100.7%. Our approach effectively mitigates seed explosion by reducing the number of seeds generated by 41% and introduces only 14% performance overhead.

BD-TTS: A blockchain and DRL-based framework for trusted task scheduling in edge computing

Edge computing migrates tasks to the edge of the network for execution, which can provide users with lower latency and better quality of service (QoS). However, due to the complexity and dynamism of edge environments, many task scheduling algorithms in edge computing face challenges in achieving real-time scheduling, while there are also trust issues in heterogeneous and dynamic edge environments. To tackle these issues, we introduce a novel framework for trusted task scheduling in edge computing, leveraging blockchain and deep reinforcement learning (DRL) technologies, named BD-TTS. Specifically, we design a blockchain-based trust management scheme tailored for task scheduling in edge computing. The scheme uses blockchain to store, propagate, and update trust information in a decentralized manner to evaluate the trustworthiness of edge servers. In addition, to assign tasks to edge servers with higher trust values for execution, we introduce a DRL-driven task scheduling algorithm. The algorithm dynamically schedules tasks in real-time based on fluctuations in the trust values of edge servers. The experimental results show that compared to other baseline approaches, BD-TTS effectively reduces the number of tasks assigned to malicious edge servers by over 64.4%, reduces the average task response time by at least 13.9%, and improves the success rate by more than 14.7%.

Virtual robots based on multi task scheduling algorithms in visual graphic design and digital art applications

With the application of virtual robots and computer entertainment interaction, the design process of digital art has undergone new development. In the process of art design, AI image technology provides users with more interactive experiences. This article investigates the application of virtual robots based on multi task scheduling algorithms in visual graphic design and digital art. This article proposes a new approach that uses a multi task scheduling algorithm to unify graphic design and image edge detection tasks. Graphic design involves creating and editing graphic elements, and image edge detection extracts useful features by analyzing edge information in the image. Use multi task scheduling algorithms to schedule and optimize tasks, in order to allocate computing resources reasonably and maximize the overall efficiency of tasks. The results show that the multitask scheduling algorithm dynamically determines the execution order and time allocation of tasks based on their priority and resource availability. It can adjust task scheduling according to real-time situations to adapt to different computing environments and task requirements. Through comparative experiments, it has been proven that the method based on multi task scheduling algorithm achieves better results in graphic design and image edge detection tasks, and can significantly improve computational efficiency.

Swiss Round Selection Algorithm for Multi-Robot Task Scheduling

Efficient and stable control and task assignment optimization in electronic commerce logistics and warehousing systems involving multiple robots executing multiple tasks is highly challenging. Hence, this paper proposes a Swiss round selection algorithm for multi-robot task allocation to address the challenges mentioned. Firstly, based on the shipping process of electronic commerce logistics and warehousing systems, the tasks are divided into packaging and sorting stages, and a grid model for the electronic commerce warehousing system is established. Secondly, by increasing the probabilities of crossover and mutation in the population and adopting a full crossover and full mutation approach, the search scope of the population is expanded. Then, a Swiss round selection mechanism with burst probability is proposed, which ensures the smooth inheritance of high-quality individuals while improving the diversity of the population. Finally, 12 comparative experiments are designed with different numbers of robots and tasks. The experimental results demonstrate that the Swiss round selection algorithm outperforms the genetic algorithm in terms of maximum task completion time and convergence time to reach the optimal value. Thus, the effectiveness of the Swiss round selection algorithm in solving the multi-robot task allocation problem is verified.

HKCHB: Meta-heuristic Algorithm for Task Scheduling and Load Balancing in Cloud-fog Computing

HKCHB: Meta-heuristic Algorithm for Task Scheduling and Load Balancing in Cloud-fog Computing

Research on Task Scheduling for Internet of Things Cloud Computing Based on Improved Chicken Swarm Optimization Algorithm

Aiming at the shortcomings of long completion time and high consumption cost of cloud computing batch task scheduling in IoT, an Improved Chicken Swarm Optimization Algorithm (ICSO) for task scheduling in cloud computing scenarios is proposed. Specifically, in order to solve the problems of slow convergence and falling into local optimum of the chicken swarm optimization algorithm, we adopt the nonlinear decreasing technique of the rooster and the weighting technique of the hen, optimize the following coefficients of the chicks, and apply ICSO to cloud computing task scheduling. In simulation experiments, we conducted a large number of experiments using four standard benchmark functions with different number of tasks and the results show that ICSO algorithm reduces 25.8%, 9.3%, 8.8%, 7.5% in small task time compared to CSO, DCSO, GCSO, ABCSO in large task time by 30.8%, 8.3%, 7.8%, 6.3%, 11.8%, 10.3%, 8.8%, 7.5% savings in small task cost and 25.8%, 11.2%, 10.8%, 9.3% savings in large task cost. This method effectively reduces task scheduling time and cost consumption. Meanwhile, we tested it in combination with an IoT-based cloud platform and achieved very satisfying Results.

Enhanced Whale Optimization Algorithm for task scheduling in cloud computing environments

The escalation of cloud services, driven by their accessibility, improved performance, and cost-effectiveness, has led cloud service providers to consistently seek methods to expedite job completion, thereby boosting profits and reducing energy consumption expenses. Despite developing numerous scheduling algorithms, many of these techniques address only a specific objective within the scheduling process. To efficiently achieve better optimization results for the cloud task scheduling problem, a novel approach, the Enhanced Whale Optimization Algorithm (EWOA), is proposed. EWOA integrates the WOA with the Lévy flight. The incorporation of Lévy flight is tailored to broaden the search space of WOA, expediting convergence with adaptive crossover. The EWOA model is simulated using the Cloudsim tool and evaluated under diverse test conditions. The effectiveness of EWOA is assessed by employing various parameters and comparing them with existing algorithms. The results demonstrate that EWOA outperforms other algorithms in resource utilization, energy consumption, and execution cost, establishing its superiority in addressing the complexities of multi-objective cloud task scheduling.

A hybrid optimization algorithm for energy-aware multi-objective task scheduling in heterogeneous multiprocessor systems

A hybrid optimization algorithm for energy-aware multi-objective task scheduling in heterogeneous multiprocessor systems

Task Scheduling in a Cloud Environment: A comparative Study

In this study, we explore the application of Monarch Butterfly Optimization (MBO) algorithms for task scheduling in cloud computing, comparing its performance against widely used optimization techniques, namely Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO).Task scheduling in the cloud is a critical aspect influencing resource utilization, turnaround time, and overall system efficiency. MBO, known for its effective exploration- exploitation balance, is examined for its suitability in addressing the complexities of cloud computing environments. The study investigates MBO's advantages, such as enhanced adaptability to dynamic conditions, effective handling of multi-objective optimization, and its consideration of bandwidth as a critical resource. Comparative analyses with ACO and PSO highlight MBO's superior performance in achieving near-optimal task schedules, emphasizing its potential to offer innovative solutions to the challenges posed by task scheduling in dynamic and resource-constrained cloud environments. This research contributes valuable insights into the strengths of MBO, paving the way for advancements in optimization methodologies tailored for cloud computing systems.

Multi Objective Prairie Dog Optimization Algorithm for Task Scheduling and Load Balancing

Multi Objective Prairie Dog Optimization Algorithm for Task Scheduling and Load Balancing

Multi-objective and multi constrained task scheduling framework for computational grids

Grid computing emerged as a powerful computing domain for running large-scale parallel applications. Scheduling computationally intensive parallel applications such as scientific, commercial etc., computational grids is a NP-complete problem. Many researchers have proposed several task scheduling algorithms on grids based on formulating and solving it as an optimization problem with different objective functions such as makespan, cost, energy etc. Further to address the requirements/demands/needs of the users (lesser cost, lower latency etc.) and grid service providers (high utilization and high profitability), a task scheduler needs to be designed based on solving a multi-objective optimization problem due to several trade-offs among the objective functions. In this direction, we propose an efficient multi-objective task scheduling framework to schedule computationally intensive tasks on heterogeneous grid networks. This framework minimizes turnaround time, communication, and execution costs while maximizing grid utilization. We evaluated the performance of our proposed algorithm through experiments conducted on standard, random, and scientific task graphs using the GridSim simulator.