Dynamic Task Scheduling Research Articles

Mathematical modeling for further improving task scheduling on Big Data systems

In the big data era which we have entered, the development of smart scheduler has become a necessity. A Distributed Stream Processing System (DSPS) has the role of assigning processing tasks to the available resources (dynamically or not) and route streaming data between them. Smart and efficient task scheduling can reduce latencies and eliminate network congestions. The most commonly used scheduler is the default Storm scheduler, which has proven to have certain disadvantages, like the inability to handle system changes in a dynamic environment. In such cases, rescheduling is necessary. This paper is an extension of a previous work on dynamic task scheduling. In such a scenario, some type of rescheduling is necessary to have the system working in the most efficient way. In this paper, we extend our previous works Souravlas and Anastasiadou (Appl Sci 10(14):4796, 2020); Souravlas et al. (Appl Sci 11(1):61, 2021) and present a mathematical model that offers better balance and produces fewer communication steps. The scheduler is based on the idea of generating larger sets of communication steps among the system nodes, which we call superclasses. Our experiments have shown that this scheme achieves better balancing and reduces the overall latency.

A Bio-inspired Energy Efficient Dynamic Task Scheduling (BEDTS) scheme and classification for virtualization CDC

Cloud Data Centers (CDCs) have evolved into an essential computing infrastructure for businesses. These applications generate a variety of data traffic with varying needs that must be examined and processed on CDCs. Every CDC is made up of multiple servers, virtual infrastructures, and physical connections that manage the internet's informative traffic. CDCs make use of a number of critical technologies, such as virtualization and Service Level Agreements (SLA). Virtualization makes it easier to share cloud computing resources (for example, by separating a powerful Physical Machine (PM) into a series of Virtual Machines (VM)) whose power is comparatively less. Even though virtualization increases the use of PMs by establishing a set of VMs for offering customised services to satisfy the needs of end-users, it also introduces another difficulty to cloud computing: map the VMs to the appropriate PMs. This is referred to as the VM deployment problem, and it is a Nondeterministic Polynomial time problem (NP-problem). CDC task scheduling is appropriate to augment the energy efficiency and resource usage in cloud computing. In the case of real-time tasks in virtualized CDC, the Bio-Inspired Energy Efficient Dynamic Task Scheduling (BEDTS) method is proposed. The Adaptive Elephant Herding Optimization (AEHO) technique is introduced in the BEDTS algorithm for optimal selection of VMs with resource restrictions and jobs. Initially, heterogeneous jobs and VMs are identified using a previous scheduling record. The Bayes classifier and Historical Scheduling Record (HSR), which allow for the identification of both the task type and VM type, serve as the foundation for task categorization. Then, related tasks are combined and then scheduled to make the best use of the host's operational status. When compared to previous approaches, experimental results reveal that BEDTS considerably enhances the scheduling performance on the whole, attains improved CDC resource utilisation, boosts task guarantee ratio, lowers average response time, and decreases the energy usage.

Cloud-Based Dynamic Task Scheduling and Load Balancing Using a Variety of Intelligent Schemes

One of the main problems with cloud computing is load balancing, which divides tasks into virtual machines (VMs) with varying lengths and completion times. As a result, keeping VMs loaded up during job scheduling and allocation is difficult. In this research, we suggested secure load balancing in a cloud context and resource-aware dynamic job scheduling utilizing intelligent algorithms. The process for the planned work is as follows: (1). The Human Mental Search (HMS) method is used to cluster Real-Time and Non-Real Time jobs into four categories: Real-Time and Short, Real-Time and Long, Non-Real Time and Short, and Non-Real Time and Long. (2). Knowledge of Energy and Delay Combined Tasks Tasks are planned based on task clustering, and the fuzzy VIKOR method is used to schedule them in the order of priority. (3). Security Risks aware VM Clustering, which employs the Hierarchical Agglomerative Clustering algorithm, consists of three distinct entities: a VM's information collector, which compiles data about VMs; a load monitor, which oversees the entire datacenter; and a decision maker, which assigns tasks by choosing the best VM. (4). Co-Resident assaults were stopped by the continuous-Actor-Critical-Algorithm (C- ACAL), which is used to pick the best VM. Using CloudSim, which measures performance in terms of response time, latency, resource utilization, throughput, energy consumption, and task execution success rate, the simulation is carried out.

Task Scheduling Mechanism Based on Reinforcement Learning in Cloud Computing

The explosive growth of users and applications in IoT environments has promoted the development of cloud computing. In the cloud computing environment, task scheduling plays a crucial role in optimizing resource utilization and improving overall performance. However, effective task scheduling remains a key challenge. Traditional task scheduling algorithms often rely on static heuristics or manual configuration, limiting their adaptability and efficiency. To overcome these limitations, there is increasing interest in applying reinforcement learning techniques for dynamic and intelligent task scheduling in cloud computing. How can reinforcement learning be applied to task scheduling in cloud computing? What are the benefits of using reinforcement learning-based methods compared to traditional scheduling mechanisms? How does reinforcement learning optimize resource allocation and improve overall efficiency? Addressing these questions, in this paper, we propose a Q-learning-based Multi-Task Scheduling Framework (QMTSF). This framework consists of two stages: First, tasks are dynamically allocated to suitable servers in the cloud environment based on the type of servers. Second, an improved Q-learning algorithm called UCB-based Q-Reinforcement Learning (UQRL) is used on each server to assign tasks to a Virtual Machine (VM). The agent makes intelligent decisions based on past experiences and interactions with the environment. In addition, the agent learns from rewards and punishments to formulate the optimal task allocation strategy and schedule tasks on different VMs. The goal is to minimize the total makespan and average processing time of tasks while ensuring task deadlines. We conducted simulation experiments to evaluate the performance of the proposed mechanism compared to traditional scheduling methods such as Particle Swarm Optimization (PSO), random, and Round-Robin (RR). The experimental results demonstrate that the proposed QMTSF scheduling framework outperforms other scheduling mechanisms in terms of the makespan and average task processing time.

Event-Triggered Deep Reinforcement Learning for Dynamic Task Scheduling in Multisatellite Resource Allocation

Event-Triggered Deep Reinforcement Learning for Dynamic Task Scheduling in Multisatellite Resource Allocation

Research on Dynamic Task Scheduling of Transmission and Generation of Schedule Based on Improved Genetic Algorithm

In order to realize the intelligence of the radio and television transmission station automatic control system, the intelligent algorithm is used for the dynamic task scheduling of transmission (DTST) and the intelligent generation of the real-time transmission schedule. On the basis of the static task allocation at the same time, the time dimension is introduced to build a dynamic task scheduling mathematical model. Based on the characteristics of simple operation and strong convergence of the genetic algorithm, an improved genetic algorithm (IGA) is proposed to solve DTST. The algorithm is improved for specific problems. The first is to improve the selection operator based on the elitist retention strategy to improve the convergence of the algorithm; the second is to determine the discontinuous crossover genes frag based on the concept of cyclic replacement sequence to improve the crossover operator, so as to retain the complete excellent gene fragments and improve the computational efficiency of the crossover operator; the third is to design the relative swap mutation operator to increase the diversity of the population and avoid the convergence of the algorithm calculation results to the local optimal solution. Through the analysis of the experimental data of traversing parameters, the optimal parameter configuration of the IGA is obtained. Finally, the correctness of the IGA is verified by comparing it with the enumeration algorithm, and the effectiveness of the IGA is verified by comparing it with the greedy algorithm.

Dynamic Cost-Optimized Resources Management and Task Scheduling with Deadline Constraint for Mobile Crowd Sensing Environment

Dynamic Cost-Optimized Resources Management and Task Scheduling with Deadline Constraint for Mobile Crowd Sensing Environment

Deadline and Cost Aware Dynamic Task Scheduling in Cloud Computing Based on Stackelberg Game

Deadline and Cost Aware Dynamic Task Scheduling in Cloud Computing Based on Stackelberg Game

Multi agent deep reinforcement learning for resource allocation in container‐based clouds environments

AbstractVirtualization enables the deployment of several virtual servers on the same physical layer, critical component of the cloud. As cloud services advance, more apps that use repositories are developed, which adds to the overburden. Containers have evolved into the most reliable and lightweight virtualization technology for cloud services thanks to their flexible sorting, mobility, and scalability. In container‐based clouds, containers can potentially cut data centre energy usage more than virtual machines (VMs) do. Containers are less energy intensive than VMs. Resource allocation is the most prevalent method in cloud systems. However, resource allocation in container‐based clouds (RAC) is innovative and complicated due to its two‐level architecture. This includes the pairing of virtual machines and physical computers with containers. In cloud container services, planner components are essential. This lowers expenses while improving the performance and variety of workloads using cloud resources. The cloud infrastructure resource allocation framework is gaining popularity since it is energy‐efficient and focuses on cloud data management to maximize income and minimize costs. In this paper, we proposed a deep learning‐based architecture capable of achieving high data centre energy efficiency and preventing Service Level Agreement (SLA) violations from deploying green cloud resources. This research describes a hybrid optimum and multi‐agent deep reinforcement learning (MADRL) technique for dynamic task scheduling (DTS) in a container cloud environment. The MADRL‐DTS model for the RAC problem considers VM overheads, VM types, and an affinity restriction. Then, to address the RAC issue, we develop a DTS hyper‐heuristic technique. MADRL‐RAC may give allocation rules by recognizing workload trends and VM types from previous workload traces. Compared to modern procedures, the results demonstrate a significant reduction in energy consumption. The evaluation for energy‐efficient resource allocation is tested in several virtualized environments to get a high power usage effectiveness and CPU usage.

An efficient dynamic decision-based task optimization and scheduling approach for microservice-based cost management in mobile cloud computing applications

The use of smartphones and mobile devices has increased significantly, as have Mobile Cloud Applications based on cloud computing. These applications are used in various fields, including Augmented Reality, E-Transportation, 2D/3-D Games, E-Healthcare, and Education. While existing cloud-based frameworks provide such services on Virtual Machines, they incur problems such as overhead, lengthy boot time, and high costs. To address these issues, the paper proposes a Dynamic Decision-Based Task Scheduling Approach for Microservice-based Mobile Cloud Computing Applications (MSCMCC) that can run delay-sensitive applications and mobility with less cost than existing approaches. The study focuses on Task Offloading problems on heterogeneous Mobile Cloud servers. It proposes a Task Offloading and Microservices based Computational Offloading (TSMCO) framework to solve Task Scheduling in steps such as Resource Matching, Task Sequencing, and Task Offloading. Experimental results show that the proposed MSCMCC and TSMCO enhance Mobile Server Utilization while minimizing costs and improving boot time, resource utilization, and task arrival time for various applications. Specifically, the proposed system effectively reduces the cost of healthcare applications by 25%, augmented reality by 23%, E-Transport tasks by 21%, and 3-D games tasks by 19%, the average boot-time of microservices applications by 17%, resource utilization by 36%, and tasks arrival time by 16%.

A Discrete Particle Swarm Optimization Algorithm for Dynamic Scheduling of Transmission Tasks

The dynamic-scheduling problem of transmission tasks (DSTT) is an important problem in the daily work of radio and television transmission stations. The transmission effect obtained by the greedy algorithm for task allocation is poor. In the case of more tasks and equipment and smaller time division, the precise algorithm cannot complete the calculation within an effective timeframe. In order to solve this problem, this paper proposes a discrete particle swarm optimization algorithm (DPSO), builds a DSTT mathematical model suitable for the DPSO, solves the problem that particle swarm operations are not easy to describe in discrete problems, and redefines the particle motion strategy and adds random disturbance operation in its probabilistic selection model to ensure the effectiveness of the algorithm. In the comparison experiment, the DPSO achieved much higher success rates than the greedy algorithm (GR) and the improved genetic algorithm (IGA). Finally, in the simulation experiment, the result data show that the accuracy of the DPSO outperforms that of the GR and IGA by up to 3.012295% and 0.11115%, respectively, and the efficiency of the DPSO outperforms that of the IGA by up to 69.246%.

A Survey on Parallelism and Determinism

Parallelism is often required for performance. In these situations an excess of non-determinism is harmful as it means the program can have several different behaviours or even different results. Even in domains such as high-performance computing where parallelism is crucial for performance, the computed value should be deterministic. Unfortunately, non-determinism in programs also allows dynamic scheduling of tasks, reacting to the first task that succeeds, cancelling tasks that cannot lead to a result, and so on. Non-determinism is thus both a desired asset or an undesired property depending on the situation. In practice, it is often necessary to limit non-determinism and to identify precisely the sources of non-determinism to control what parts of a program are deterministic or not. This survey takes the perspective of programming languages, and studies how programming models can ensure the determinism of parallel programs. This survey studies not only deterministic languages but also programming models that prevent one particularly demanding source of non-determinism: data races. Our objective is to compare existing solutions to the following questions: How programming languages can help programmers write programs that run in a parallel manner without visible non-determinism? What programming paradigms ensure this kind of properties? We study these questions and discuss the merits and limitations of different approaches.

Dynamic Super Round-Based Distributed Task Scheduling for UAV Networks

Networks of Unmanned Aerial Vehicles (UAVs) are emerging in many application domains, e.g., military surveillance. To perform collaborative tasks, the involved UAVs exchange several types of information, e.g., sensor data and commands. The major question here is how to schedule the tasks under dynamic traffic flows to provide network services. Existing solutions use the Round-Robin Strategy (RRS), where the tasks are scheduled statistically by dividing the time into fixed-length rounds. However, the RRS wastes significant network and device resources due to task scheduling in each round. This paper proposes DROVE– a novel clustering approach that allows the UAVs for dynamic task scheduling. However, determining the task scheduling is crucial, as it significantly affects several network parameters, e.g., throughput. Therefore, we devise the problem of distributed task scheduling under dynamic traffic flow scenarios to optimize the throughput. We propose a clustering task scheduling algorithm to serve dynamic traffic flows. Particularly, we integrate the dynamic traffic flows into the Lyapunov drift analysis framework, and determine the throughput optimality of our proposed scheduling algorithm. We perform extensive simulations to validate the effectiveness of DROVE. The results show that DROVE outperforms the state-of-the-art solutions in terms of energy consumption, clustering overhead, throughput, end-to-end delay, flow success rate and packet drop rate.

Neural-Hill: A Novel Algorithm for Efficient Scheduling IoT-Cloud Resource to Maintain Scalability

The age of the Fourth Industrial Revolution (4IR) is the era of smart technologies and services. The Internet of Things (IoT) is at the heart of these smart services. The IoTs are resource-constrain devices. They act as middleware in intelligent systems and maintain communications between cloud servers and smart services. Processing related to intelligent decision-making, including data processing, cleaning, feature extraction, and analysis, is performed on the cloud servers. The IoT devices respond according to the decisions the applications run on the cloud servers make. The massive number of internet-connected devices is increasing by 8% per year. The cloud infrastructure backing these enormous numbers of IoT devices must be scheduled efficiently to maintain Quality of Service (QoS). An optimized scheduling scheme is essential to minimize the cost and enhance scalability. This paper proposes an innovative and novel algorithm, Neural-Hill, which combines the Deep Neural Network (DNN) and Random Restart variant of the Hill Climbing algorithm to schedule IoT-Cloud resources efficiently and ensure scalability. It is a preemptive scheduling algorithm designed to operate in dynamic task scheduling. The performance of the Neural-Hill algorithm has been evaluated in terms of optimal solution-finding time, execution time, routing overhead, and throughput. The experimental results demonstrate the significant quality of service improvement with the assurance of better scalability.

Communication-Efficient Federated Multitask Learning Over Wireless Networks

This article investigates the scheduling framework of the federated multitask learning (FMTL) problem with a hard-cooperation structure over wireless networks, in which the scheduling becomes more challenging due to the different convergence behaviors of different tasks. Based on the special model structure, we propose a dynamic user and task scheduling scheme with a block-wise incremental gradient aggregation algorithm, in which the neural network model is decomposed into a common feature-extraction module and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> task-specific modules. Different block gradients with respect to different modules can be scheduled separately. We further propose a Lyapunov-drift-based scheduling scheme that minimizes the overall communication latency by utilizing both the instantaneous data importance and the channel state information. We prove that the proposed scheme can converge almost surely to a KKT solution of the training problem such that the data-distortion issue is resolved. Simulation results illustrate that the proposed scheme significantly reduces the communication latency compared to the state-of-the-art baseline schemes.

Flower pollination algorithm for dynamic task scheduling in edge-cloud continuum

Flower pollination algorithm for dynamic task scheduling in edge-cloud continuum

HFTO: Hybrid Firebug Tunicate Optimizer for Fault Tolerance and Dynamic Task Scheduling in Cloud Computing

HFTO: Hybrid Firebug Tunicate Optimizer for Fault Tolerance and Dynamic Task Scheduling in Cloud Computing

Federated Learning Over Wireless Channels: Dynamic Resource Allocation and Task Scheduling

With the development of federated learning (FL), mobile devices (MDs) are able to train their local models with private data and send them to a central server for aggregation, thereby preventing leakage of sensitive raw data. In this paper, we aim to improve the training performance of FL systems in the context of wireless channels and stochastic energy arrivals of each MD. To this purpose, we dynamically optimize MDs’ transmission power and training task scheduling. We first model this dynamic programming problem as a constrained Markov decision process (CMDP). Due to high dimensions of the proposed CMDP problem, we propose online stochastic learning methods to simplify the CMDP and design online algorithms to obtain an efficient policy for all MDs. Since there are long-term constraints in our CMDP, we utilize a Lagrange multipliers approach to tackle this issue. Furthermore, we prove the convergence of the proposed online stochastic learning algorithm. Numerical results indicate that the proposed algorithms can achieve better performance than the benchmark algorithms.

Dynamic Task Scheduling in Remote Sensing Data Acquisition from Open-Access Data Using CloudSim

With the rapid development of cloud computing and network technologies, large-scale remote sensing data collection tasks are receiving more interest from individuals and small and medium-sized enterprises. Large-scale remote sensing data collection has its challenges, including less available node resources, short collection time, and lower collection efficiency. Moreover, public remote data sources have restrictions on user settings, such as access to IP, frequency, and bandwidth. In order to satisfy users’ demand for accessing public remote sensing data collection nodes and effectively increase the data collection speed, this paper proposes a TSCD-TSA dynamic task scheduling algorithm that combines the BP neural network prediction algorithm with PSO-based task scheduling algorithms. Comparative experiments were carried out using the proposed task scheduling algorithms on an acquisition task using data from Sentinel2. The experimental results show that the MAX-MAX-PSO dynamic task scheduling algorithm has a smaller fitness value and a faster convergence speed.

Dynamic Task Scheduling for Human-Robot Collaboration

In human-robot collaboration systems, the human-robot team works together to complete all tasks of the assigned job. Tasks’ precedence order is a factor that determines which task should be completed first. A human agent has an expected performance on each task, but the actual performance of the human agent on a task may differ from the expected performance at different times. Therefore, it is also necessary to monitor the human agent so that the task can be transferred to or from the robot when the actual performance of the human agent is worse or better than the expected performance. We propose an architecture for dynamic task allocation and scheduling in a collaborative system. The method is to first identify the group of tasks that should be executed first based on the precedence order of tasks. After obtaining this group of prioritized tasks, we use the quality metric (a numerical value that indicates which agent is better at completing the task) to determine which agent should be assigned each of the tasks. Finally, real-time human agent monitoring is used to detect performance changes in the human agent so that tasks can be transferred from one agent to another. All of these processes are performed automatically without the need for a human agent to schedule or reschedule. We have validated the effectiveness of the architecture through several experiments.