Efficient Task Scheduling Research Articles

Mobility and Deadline-Aware Task Scheduling Mechanism for Vehicular Edge Computing

Vehicular Edge Computing (VEC) is a promising paradigm that provides cloud computing services closer to vehicular users. In VEC, vehicles and communication infrastructures can form pools with computational resources to meet vehicular services with low-latency constraints. These resource pools are known as Vehicular Cloud (VC). The usage of VC resources requires a task scheduling process. In this case, depending on its complexity, a vehicular service can be divided into different tasks. An efficient task scheduling needs to orchestrate where and for how long such tasks will run, considering the available pools, the mobility of nodes, and the tasks deadline constraints. Thus, this article proposes an efficient VC task scheduler based on an approximation heuristic and resources prediction to select the best VC for each task, called MARINA. MARINA aims to analyze the behavior of vehicles that share their computational resources with the VC and make scheduling decisions based on the mobility (VC availability) of these vehicles. Simulation results under a realistic scenario demonstrate the efficiency of MARINA compared to existing state-of-the-art mechanisms in terms of the number of tasks scheduled, monetary cost, system latency, and Central Processing Unit (CPU) utilization.

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.

Quality of service aware improved coati optimization algorithm for efficient task scheduling in cloud computing environment

The task scheduling has a potential impact on overall system performance and resource utilization in the domain of Cloud Computing. Cloud computing adopts a cloud service provider (CSP) for facilitating access and delivering services to the shared resources. Task scheduling in clouds can be attained some symmetry form which helps in achieving predominant resource optimization that includes energy efficiency and load balancing. This task scheduling process of cloud computing pertains to the problem of Non-deterministic Polynomial (NP) which can be significantly solved using the techniques of metaheuristic optimization for enhancing the job scheduling effectiveness. In this paper, an Improved Coati Optimization Algorithm-based Task Scheduling (ICOATS) is presented for addressing the issues of lengthier scheduling time, high consumptions of cost and maximized load on Virtual Machine (VM) in cloud computing environment. In this proposed ICOATS, a model for distribution and scheduling of tasks is constructed using the factors of VMs, cost and time. It further included a multi-objective fitness function which targets on minimizing makespan, and at the same time maximizing the rate of resource utilization. It established possible plan for every coati with respect to task scheduling process that aids in determining the best solution (optimal assignment of incoming tasks to VMs). It is proposed with the capability of handing the problem of premature convergence by incorporating an exploitation strategy which improving the local search potential with well-balanced trade-off amid exploration and exploitation. The simulation results of this ICOATS approach under its evaluation with the existing metaheuristic task scheduling approaches confirmed better improvement in reducing makespan, and simultaneously enhances the turnaround efficiency, success rate and availability.

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.

Optimizing Single DGX-A100 System: Overcoming GPU Limitations via Efficient Parallelism and Scheduling for Large Language Models

In this study, we introduce a novel training algorithm specifically designed to overcome the limitations of GPU memory on a single DGX-A100 system. By utilizing the CPU and main memory in the training process and applying a strategy of division and parallelization, our algorithm enhances the size of the trainable language model and the batch size. In addition, we developed a comprehensive management system to effectively manage the execution of the algorithm. This system systematically controls the training process and resource usage, while also enabling the asynchronous deployment of tasks. Finally, we proposed a scheduling technique integrated into the management system, promoting efficient task scheduling in a complex, heterogeneous training environment. These advancements equip researchers with the ability to work with larger models and batch sizes, even when faced with limited GPU memory.

PLC-based home automation system for maintaining efficient task scheduling and security

A Programmable Logic Controller (PLC) based smart task scheduling system for home automation is presented in this paper. This system is automatically controlled, energy-efficient, and scalable to smart homes with basic features that save energy and increase comfort for residents. The work demonstrates how PLCs can be used in the home to control and monitor lights, sensors, and other electronic equipment. As an added benefit, the proposed technology ensures home safety. The aim of this study is to develop an affordable system that can be installed in every household to improve security and energy efficiency by making home appliances more user-friendly and effectively performing every activity as per a schedule that is defined by user demands.

Multiobjective Prioritized Workflow Scheduling in Cloud Computing Using Cuckoo Search Algorithm

Effective workflow scheduling in cloud computing is still a challenging problem as incoming workflows to cloud console having variable task processing capacities and dependencies as they will arise from various heterogeneous resources. Ineffective scheduling of workflows to virtual resources in cloud environment leads to violations in service level agreements and high energy consumption, which impacts the quality of service of cloud provider. Many existing authors developed workflow scheduling algorithms addressing operational costs and makespan, but still, there is a provision to improve the scheduling process in cloud paradigm as it is an nondeterministic polynomial-hard problem. Therefore, in this research, a task-prioritized multiobjective workflow scheduling algorithm was developed by using cuckoo search algorithm to precisely map incoming workflows onto corresponding virtual resources. Extensive simulations were carried out on workflowsim using randomly generated workflows from simulator. For evaluating the efficacy of our proposed approach, we compared our proposed scheduling algorithm with existing approaches, i.e., Max–Min, first come first serve, minimum completion time, Min–Min, resource allocation security with efficient task scheduling in cloud computing-hybrid machine learning, and Round Robin. Our proposed approach is outperformed by minimizing energy consumption by 15% and reducing service level agreement violations by 22%.

Joint Trajectory Planning, Service Function Deploying, and DAG Task Scheduling in UAV-Empowered Edge Computing

Efficient task scheduling plays a key role in unmanned aerial vehicle (UAV)-empowered edge computing due to the limitation in energy supply and computation resource on the UAV platforms. This problem becomes much more complicated when the processing-dependent tasks that can be described as directed acyclic graphs (DAGs) and each of their components can only be processed on a virtual machine or container that deploys the desired service function (SF). In this paper, we first build an optimization problem that aims to minimize the completion time of all DAG tasks subject to constraints including task dependency, computation resource occupied by the UAVs, etc. To tackle this problem, a genetic algorithm-based joint deployment and scheduling algorithm, named GA-JoDeS, is put forward, since solving the established 0–1 integer programming problem in polynomial time is infeasible. Subtask offloading decision and UAV position are encoded into the chromosome in the GA-JoDeS algorithm, and the fitness value of an individual is decided by the maximum completion time of all DAG tasks. Through selection, crossover, and mutation, the GA-JoDeS algorithm evolves until it determines the individual with the optimal fitness value as the suboptimal solution to the problem. To evaluate the performance of the proposal, a series of simulations is conducted, and three traditional methods are chosen as comparison benchmarks. The results show that the GA-JoDeS algorithm can convergence quickly, and it can effectively reduce the completion time of DAG tasks with different parameter settings.

Performance Evaluation of Hybrid Meta-Heuristics-Based Task Scheduling Algorithm for Energy Efficiency in Fog Computing

Task scheduling in fog computing is one of the areas where researchers are having challenges as the demand grows for the use of internet of things (IoT) to access cloud computing resources. Many resource scheduling and optimization algorithms were used by many researchers in fog computing; some used single techniques while others used combined schemes to achieve dynamic scheduling in fog computing, many optimization techniques were assessed based on deterministic and meta-heuristic to find out solution to task scheduling problem in fog computing but could not achieve excellent results as required. This article proposes hybrid meta-heuristic optimization algorithm (HMOA) for energy efficient task scheduling in fog computing, the study combined modified particle swarm optimization (MPSO) meta-heuristic and deterministic spanning tree (SPT) to achieve task scheduling with the intention of eliminating the drawbacks of the two algorithms when used separately, the MPSO was used to schedule user task requests among fog devices, while hybrid MPSO-SPT was used to perform resource allocation and resource management in the fog computing environment. The study implemented the proposed algorithm using iFogSim; the performance of the algorithm was evaluated, assessed, and compared with other state-of-the-art task scheduling and resource management algorithms, the proposed method performs better in terms of energy consumption, resource utilization and response time, and the study proposed future research on evaluating the execution time using the hybrid algorithm.

EETSQ: Energy Efficient Task Scheduling based on QoS Parameters in Cloud Computing Environment

Now a day, energy consumption is the big challenge in heterogeneous cloud computing environment that needs to be considered. Cloud service provider also needs to satisfy customer’s Quality of Service (QoS) for better utilization. An energy efficient task scheduling based on QoS parameter has been proposed to address above said challenge. Firsty, all the incoming tasks are categorized into four classes based on some special attributes and prioritize according to importance of the classes. Secondly, Physical Machines (PMs) type confirmation list is selected based on the number of resource blocks and then select one PM that has maximum QoS value. All the Virtual Machines (VMs) on selected PM are prioritized according to their weight. Experimental evaluation done on CloudSim shows the effectiveness and efficiency of proposed approach.

남극 환경에서 다중 로봇 시스템을 위한 최근접 이웃 알고리즘 기반 효율적 다중 작업 스케줄링

This paper addresses the problem of multi-robot task scheduling in Antarctic environments. It is difficult to operate multiple robots in Antarctic environments due to the icy ground condition and the lack of powers. In our previous work, the multi-robot task scheduling in Antarctic environments has been solved using ant colony optimization. Although it worked successfully, it caused much computation time. This paper proposes an efficient multi-robot task scheduling approach using nearest neighbor algorithm in Antarctic environments. The proposed method was tested in both simulated environments and Antarctic environments. The proposed method showed better performance in terms of computation time and cost than ant colony optimization and genetic algorithm.

LVUCB: an efficient vehicle network task scheduling system

LVUCB: an efficient vehicle network task scheduling system

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%.

Cloud Task Scheduling Using Modified Penguins Search Optimization Algorithm

The cloud computing has emerged as a novel distributed computing system in past few years. It provides computation and resources over the Internet via dynamic provisioning of services. There are quite a few challenges and issues connected with implementation of cloud computing. This paper considers one of its major problems, i.e. task scheduling. The function of an efficient task scheduling algorithm is that it concentrates not only on attaining the requirements of the user but also in enhancing the efficiency of the cloud computing system. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. This paper proposes a modified Penguins Search Optimization Algorithm (MPeSOA) for efficient cloud task scheduling. The main contribution of our work is to schedule all tasks to available virtual machines so that the makespan is minimized, resource utilization is increased and the degree of imbalance is reduced. The proposed scheduling algorithm was simulated using the CloudSim 4.0 simulator. Experimental results showed that the proposed MPeSOA outperformed three existing meta-heuristics, namely Penguins Search Optimization Algorithm (PeSOA), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).

Parallel Optimization for Large Scale Interferometric Synthetic Aperture Radar Data Processing

Interferometric synthetic aperture radar (InSAR) has developed rapidly over the past years and is considered as an important method for surface deformation monitoring, benefiting from growing data quantities and improving data quality. However, the handing of SAR big data poses significant challenges for related algorithms and pipeline, particularly in large-scale SAR data processing. In addition, InSAR algorithms are highly complex, and their task dependencies are intricate. There is a lack of efficient optimization models and task scheduling for InSAR pipeline. In this paper, we design parallel time-series InSAR processing models based on multi-thread technology for high efficiency in processing InSAR big data. These models concentrate on parallelizing critical algorithms that have high complexity, with a focus on deconstructing two computationally intensive algorithms through loop unrolling. Our parallel models have shown a significant improvement of 10–20 times in performance. We have also developed a parallel optimization tool, Simultaneous Task Automatic Runtime (STAR), which utilizes a data flow optimization strategy with thread pool technology to address the problem of low CPU utilization resulting from multiple modules and task dependencies in the InSAR processing pipeline. STAR provides a data-driven pipeline and enables concurrent execution of multiple tasks, with greater flexibility to keep the CPU busy and further improve CPU utilization through predetermined task flow. Additionally, a supercomputing-based system has been constructed for processing massive InSAR scientific big data and providing technical support for nationwide surface deformation measurement, in accordance with the framework of time series InSAR data processing. Using this system, we processed InSAR data with the volumes of 500 TB and 700 TB in 5 and 7 days, respectively. Finally we generated two maps of land surface deformation all over China.

An Intelligent Task Scheduling Model for Hybrid Internet of Things and Cloud Environment for Big Data Applications

One of the most significant issues in Internet of Things (IoT) cloud computing is scheduling tasks. Recent developments in IoT-based technologies have led to a meteoric rise in the demand for cloud storage. In order to load the IoT services onto cloud resources efficiently even while satisfying the requirements of the applications, sophisticated planning methodologies are required. This is important because several processes must be well prepared on different virtual machines to maximize resource usage and minimize waiting times. Different IoT application tasks can be difficult to schedule in a cloud-based computing architecture due to the heterogeneous features of IoT. With the rise in IoT sensors and the need to access information quickly and reliably, fog cloud computing is proposed for the integration of fog and cloud networks to meet these demands. One of the most important necessities in a fog cloud setting is efficient task scheduling, as this can help to lessen the time it takes for data to be processed and improve QoS (quality of service). The overall processing time of IoT programs should be kept as short as possible by effectively planning and managing their workloads, taking into account limitations such as task scheduling. Finding the ideal approach is challenging, especially for big data systems, because task scheduling is a complex issue. This research provides a Deep Learning Algorithm for Big data Task Scheduling System (DLA-BDTSS) for the Internet of Things (IoT) and cloud computing applications. When it comes to reducing energy costs and end-to-end delay, an optimized scheduling model based on deep learning is used to analyze and process various tasks. The method employs a multi-objective strategy to shorten the makespan and maximize resource consumption. A regional exploration search technique improves the optimization algorithm’s capacity to exploit data and avoid becoming stuck in local optimization. DLA-BDTSS was compared to other well-known task allocation methods in accurate trace information and the CloudSim tools. The investigation showed that DLA-BDTSS performed better than other well-known algorithms. It converged faster than different approaches, making it beneficial for big data task scheduling scenarios, and it obtained an 8.43 percent improvement in the outcomes. DLA-BDTSS obtained an 8.43% improvement in the outcomes with an execution time of 34 s and fitness value evaluation of 76.8%.

HGPSO: An efficient scientific workflow scheduling in cloud environment using a hybrid optimization algorithm

Cloud technology has raised significant prominence providing a unique market economic approach for resolving large-scale challenges in heterogeneous distributed systems. Through the use of the network, it delivers secure, quick, and profitable information storage with computational capability. Cloud applications are available on-demand to meet a variety of user QoS standards. Due to a large number of users and tasks, it is important to achieve efficient scheduling of tasks submitted by users. One of the most important and difficult non-deterministic polynomial-hard challenges in cloud technology is task scheduling. Therefore, in this paper, an efficient task scheduling approach is developed. To achieve this objective, a hybrid genetic algorithm with particle swarm optimization (HGPSO) algorithm is presented. The scheduling is performed based on the multi-objective function; the function is designed based on three parameters such as makespan, cost, and resource utilization. The proper scheduling system should minimize the makespan and cost while maximizing resource utilization. The proposed algorithm is implemented using WorkflowSim and tested with arbitrary task graphs in a simulated setting. The results obtained reveal that the proposed HGPSO algorithm outperformed all available scheduling algorithms that are compared across a range of experimental setups.

Utilization and criticality based fault-tolerant scheduling in multicore mixed critical systems

PurposeThe main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.Design/methodology/approachThe paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.FindingsBoth partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.Research limitations/implicationsThe simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.Practical implicationsThe rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.Originality/valueThis paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.

Security-Aware and Time-Guaranteed Service Placement in Edge Clouds

Most of the emerging applications such as the Deep Neural Networks (DNN) based smart Internet of Things (IoT) systems need intensive and high-performance computing, which is contradictory to the limited resources of IoT/terminal devices. It is a big challenge to offload all tasks to the cloud due to the bandwidth limitation, processing overhead, and transmission costs. Edge computing as an extension of cloud computing that can provide abundant computing resources near the edge of the network and thereby can potentially improve the QoS of applications. However, offloading tasks to the edge servers is liable to external security threats. How to balance the response time and the security of application services is a big challenge for realizing good application service placement. This paper proposes a time and security efficient task scheduling framework in the edge-cloud environment. The corresponding computing models are established, such as the security-related model, time model, and the risk probability model. Then, a time-guaranteed and security-aware task scheduling algorithm is proposed including the domain construction, the security-aware task ranking, and the task dispatching. Extensive simulation experiments have been conducted. Results show that the proposed method has better performance than the other four compared methods in general.

EEOA: Cost and Energy Efficient Task Scheduling in a Cloud-Fog Framework.

Cloud-fog computing is a wide range of service environments created to provide quick, flexible services to customers, and the phenomenal growth of the Internet of Things (IoT) has produced an immense amount of data on a daily basis. To complete tasks and meet service-level agreement (SLA) commitments, the provider assigns appropriate resources and employs scheduling techniques to efficiently manage the execution of received IoT tasks in fog or cloud systems. The effectiveness of cloud services is directly impacted by some other important criteria, such as energy usage and cost, which are not taken into account by many of the existing methodologies. To resolve the aforementioned problems, an effective scheduling algorithm is required to schedule the heterogeneous workload and enhance the quality of service (QoS). Therefore, a nature-inspired multi-objective task scheduling algorithm called the electric earthworm optimization algorithm (EEOA) is proposed in this paper for IoT requests in a cloud-fog framework. This method was created using the combination of the earthworm optimization algorithm (EOA) and the electric fish optimization algorithm (EFO) to improve EFO's potential to be exploited while looking for the best solution to the problem at hand. Concerning execution time, cost, makespan, and energy consumption, the suggested scheduling technique's performance was assessed using significant instances of real-world workloads such as CEA-CURIE and HPC2N. Based on simulation results, our proposed approach improves efficiency by 89%, energy consumption by 94%, and total cost by 87% over existing algorithms for the scenarios considered using different benchmarks. Detailed simulations demonstrate that the suggested approach provides a superior scheduling scheme with better results than the existing scheduling techniques.