Task Scheduling Research Articles

Two-level integrated verification evaluation method based on comprehensive weighted assessment in multiple scenarios

The complexity and diversity brought by the distributed architecture of the new generation electric information collection system have deepened the difficulty of constructing evaluation verification index systems and quality evaluation models. Moreover, the presence of differentiated components has made fair and scientific verification challenging. Therefore, leveraging graph neural networks and siamese networks, a integrated construction quality evaluation system based on comprehensive weighted assessment in multiple scenarios was developed. Firstly, a graph neural network was constructed based on terminal data of the branches electricity usage information collection system and the link topology structure. Subsequently, this network was deployed on the headquarters side to directly acquire terminal data and generate mirror network input from the branches data, enabling real-time acquisition of various system operational indicators. Finally, the similarity between the headquarters and branches data was calculated using siamese networks to compute accuracy compensation weights for checking and evaluating various indicators, thereby obtaining comprehensive weighted quality evaluation indicators of the branches new generation electric information collection system. We use three types of services including electricity data collection, load forecasting, and task scheduling as experimental scenarios. The results showed that the multidimensional comprehensive weighted quality assessment combined with accuracy compensation obtained from the siamese network resulted in business construction quality assessment values of 97.92%, 95.95%, and 99.96% in branch. This value is approximately equal to the quality evaluation value of manual work, so the method can effectively verify the construction quality of new systems in the branch.

Design and Implementation of Virtualization Cloud Computing System Intelligent Terminal Application Layer

Cloud task scheduling has become a trend, and the shortcomings of traditional scheduling algorithms can be optimized through mathematical models of other cloud task scheduling scenarios. In order to improve the virtualization data processing effect of intelligent terminal application layer, this paper proposes an improved krill swarm optimization algorithm based on adaptive weight. The optimization of cluster load balancing and task average response time ratio are used to improve the convergence and accuracy of task scheduling algorithm. Moreover, this paper uses CloudSim simulation tool to conduct experiments to verify the effectiveness of the proposed model. In addition, this paper proposes an application-based virtualization method, which virtualizes the application programs inside the host machine into the virtualization software inside the virtual machine, so that the virtual machine can access it. Finally, this paper verifies the reliability of the proposed method with experiments, thus providing a theoretical reference for the subsequent design of intelligent terminal application layer virtualization cloud computing system. Compared with the traditional way of using physical hardware, using virtual machine hardware is more flexible, efficient and safe, which brings great convenience to the development and deployment of applications.

Enhancing Network Security in Distributed Systems Using Middle Roman Dominating Functions

A Middle Roman dominating function (MRDN) on a graph G = (V,E) is a function f:v→{0,1,2,3} satisfying the condition that every vertex u with f(u)=0 is adjacent to at most one vertex v with f(v)=2 or 3. Further if a vertex is assigned 2, then at most two of its vertices can be assigned 0 and if a vertex is assigned 3, then all its neighbours can be assigned 0. The weight of a MRDF is the value f(V(G))=∑_uϵV▒〖f(u〗). The Middle Roman domination number γ_MR (G) is the minimum weight of a MRDF on G. In this paper, we introduce Middle Roman Domination number denoted as γ_MR (G), study the properties of the function, present some characterization and determine γ_MR (G)-value for some graphs. Middle Roman Dominating Functions (MRDFs) present a unique approach within graph theory, with significant implications for various fields in computer science. By assigning values to vertices under specific constraints, MRDFs enable the optimization of resources, enhancing network security, load balancing, and energy efficiency in distributed systems. This paper explores the application of MRDFs in scenarios such as intrusion detection, resilient network design, task scheduling, and sensor activation. By minimizing the overall weight while maintaining functional requirements, MRDFs provide an effective strategy for addressing challenges in network topology, resource allocation, and fault tolerance. The versatility of MRDFs makes them a valuable tool in the development of robust and efficient computing systems.

A multi-objective approach for timber harvest scheduling to include management of at-risk species and spatial configuration objectives.

Sustainable forestry typically involves integration of several economic and ecological objectives which, at times, may not be compatible with one another. Multi-objective prioritization via harvest scheduling programs can be used to elucidate these relationships and explore solutions. One such program is a spatially explicit harvest scheduler that adopts the Metropolis-Hastings algorithm to iteratively find management solutions to achieve multiple objectives (Habplan). Although this program has been used to address forest management scheduling and simulation-based tasks, its utility is constrained by time-intensive data preparation and challenges with incorporating spatial configuration objectives. To address these shortcomings, we introduce an open-source software package, HabplanR, streamlines data preparation, sets parameters, visualizes results, and assesses spatial components of ecological objectives. We developed four example objectives to incorporate into a multi-objective management problem: habitat quality indices for three species "types" (open, closed, and intermediate-canopy-associated species), and harvested pine pulpwood (revenue). We demonstrate the utility of this package to find management schedules that can accommodate potentially conflicting habitat needs of species, while achieving economic targets. We produced 100 software runs and prioritized individual objectives to select four management schedules for further comparisons. We compared outcome differences of the four schedules, including a spatial comparison of two high performing schedules. The software package makes costs and benefits of different schedules explicit and allows for consideration of the spatial configuration of management outcomes in decision-making.

A resource-aware workload scheduling method for unbalanced GEMMs on GPUs

Abstract GEMM (General Matrix Multiplication) serves as a fundamental operator for deep learning computations. Especially in attention-based deep learning models, such as Bert, GPT, and SAM, the sizes of matrices involved in GEMMs exhibit an unbalanced distribution due to the variable input, resulting in the low utilization of hardware resources. To address the issue, this paper proposes inserting a novel GEMM processing layer into the deep learning inference stack and using an adaptive load balancing method to partition and schedule GEMM computation tasks. The method is implemented with hardware runtime resource information, such as the occupancy of computing units, etc. Experiment results show the remarkable performance of our method in unbalanced input GEMM scenarios, achieving an average performance improvement of 2.3x. The method also performs well in attention-based models (GPT-2 and SAM), achieving an average inference speed improvement of 1.1x. These findings highlight the effectiveness of resource-aware algorithm optimization, especially for computation task scheduling.

A Review on Secure Outsourcing and Privacy-Preserving Traffic Monitoring in Fog-Enabled VANETs

New possibilities for fog-based vehicle monitoring have emerged with the expansion of fog computing, but present privacy concerns provide a significant barrier that limits the extent to which vehicles can participate. Because of its potential to improve road network security and vehicle productivity, the field of Vehicle-based Ad hoc Networks (VANETs) is gaining prominence. The security problems with VANETs, such as data confidentiality and message access control are still need better solutions to provide better Quality of Service (QoS). The effectiveness of VANET networks is diminished due to their instability problem. Vehicles continually add requests to the Road Side Unit (RSU) queue whenever they want specific information. For ever-evolving networks like VANETs, better routing is a continual process. Fundamental problems arise in large-scale systems when centralized procedures are used to assign jobs to the nodes along a route. The present centralized system for computing and safety has many needs, including the protection of data storage, user authentication, access control, system availability across multiple network connections, and the provision of a real-time data flow overview. Distributed problem solving and work sharing between multiple agents can improve the system's scalability. This paper provides a brief survey on the secured outsourcing and privacy preservation-based traffic monitoring model with routing and task scheduling models in Fog-enabled VANETS. This survey presents the limitations of the traditional models that help the researchers design new solutions for secure outsourcing in VANETs.

Power Optimized Task Scheduling using Genetic Algorithm (POTS-GA) in Cloud Environment

In a cloud environment, the allocation of tasks has become pivotal on account of rapid growth of user requests. The processing of user requests leads to a significant execution time, and a huge amount of power is also consumed. Consequently, task scheduling for optimizing makes pan and power usage has become critical, particularly in a heterogeneous environment. This research work proposes Power-Optimized Task Scheduling using Genetic Algorithm (POTS-GA) that aims to minimize execution time and power consumption. The proposed strategy employs genetic algorithm to take scheduling decision while taking into consideration the execution time and overall power consumption of resources. The fitness computation considering both objectives and the customized genetic operators ensure to search for a better scheduling solution. The experiments performed on a large number of tasks and virtual machines show that the proposed POTS-GA approach outperforms other task scheduling strategies including Efficient Task Allocation using Genetic Algorithm (ETA-GA), Round Robin algorithm (RRA), and First Come First Serve (FCFS) and Greedy algorithm in terms of makes pan and power consumption.

A multi-level rescheduling approach for a dynamic remote operations scheduling problem

ABSTRACT In this paper, we tackle a dynamic scheduling problem faced by a large international company. The problem involves assigning installation projects arriving over time to specialised technicians who execute them remotely. Each project consists of several tasks having processing times, release dates, and execution deadlines. The company needs to assign projects to technicians and schedule tasks complying with technicians' skills, precedence constraints between tasks, and tasks requiring multiple technicians simultaneously. The problem is dynamic as new projects and tasks become available over time, requiring their allocation to technicians. We formulate the offline problem as a mixed integer linear program that minimises the makespan, and we address the dynamic version solving restricted problems within a rolling horizon framework. The approach systematically implements different levels of schedule adjustment to incorporate new information. To study scalability, we validate our algorithm by using both real-world and synthetic simulations demonstrating its efficiency and effectiveness. Additionally, we provide interesting managerial insights for the company.

GRRIS: A Real-time Intrasite Observation Scheduling Scheme for Distributed Survey Telescope Arrays

The distributed telescope array offers promise for conducting large-sky-area, high-frequency time-domain surveys. Multiple telescopes can be deployed at each observation site, so intrasite observation task scheduling is crucial for enhancing observation efficiency and quality. Efficient use of observable time and rapid response to special situations are critical to maximize scientific discovery in time-domain surveys. Besides, the competing scientific priorities, time-varying observation conditions, and capabilities of observation equipment, lead to a vast search space of the scheduling. So with the increasing number of telescopes and observation fields, balancing computational time with solution quality in observation scheduling poses a significant challenge. Informed by the seminal contributions of earlier studies on a multilevel scheduling model and global scheduler for a time-domain telescope array, this study is devoted to further exploring the site scheduler. Formulating the observation scheduling of multiple telescopes at the site as a cooperative decision-making problem, this paper proposes GRRIS, a real-time intrasite observation scheduling scheme for the telescope array using graph and reinforcement learning (RL). It employs a graph neural network to learn node features that can embed the spatial structure of the observation scheduling. An algorithm based on multi-agent RL is designed to efficiently learn the optimum allocation policy of telescope agents to field nodes. Through numerical simulations with real-world scenarios, GRRIS can achieve up to a 22% solution improvement over the most competitive scheme. It offers better scalability and subsecond decision speed, meeting the needs of observation scheduling control for future distributed telescope arrays.

A synthesis of machine learning and internet of things in developing autonomous fleets of heterogeneous unmanned aerial vehicles for enhancing the regenerative farming cycle

The use of Unmanned Aerial Vehicles (UAVs) for agricultural monitoring and management offers additional advantages over traditional methods, ranging from cost reduction to environmental protection, especially when they utilize Machine Learning (ML) methods, and Internet of Things (IoT). This article presents an autonomous fleet of heterogeneous UAVs for use in regenerative farming the result of a synthesis of Deep Reinforcement Learning (DRL), Ant Colony Optimization (ACO) and IoT. The resulting aerial framework uses DRL for fleet autonomy and ACO for fleet synchronization and task scheduling inflight. A 5G Multiple Input Multiple Output-Long Range (MIMO-LoRa) antenna enhances data rate transmission and link reliability. The aerial framework, which has been originally prototyped as a simulation to test the concept, is now developed into a functional proof-of-concept of autonomous fleets of heterogeneous UAVs. For assessing performance, the paper uses Normalized Difference Vegetation Index (NDVI), Mean Squared Error (MSE) and Received Signal Strength Index (RSSI). The 5G MIMO-LoRa antenna produces improved results with four key performance indicators: Reflection Coefficient (S11), Cumulative Distribution Functions (CDF), Power Spectral Density Ratio (Eb/No), and Bit Error Rate (BER).

Research on Parallel Task Scheduling Algorithm of SaaS Platform Based on Dynamic Adaptive Particle Swarm Optimization in Cloud Service Environment

To efficiently realize the parallel task scheduling of SaaS platform in large-scale cloud service environment, this paper studies the parallel task scheduling algorithm of SaaS platform based on dynamic adaptive particle swarm optimization in cloud service environment. Users access the cloud through the user access interface module, and issue task scheduling instructions or send task scheduling requests. After the service management module provides diversified application service support according to the scheduling requirements, the core service module determines the SaaS platform parallel scheduling objective function, and uses dynamic adaptive particle swarm optimization to solve the objective function to obtain the SaaS platform parallel task scheduling results. The test results show that the algorithm has better multi-objective solving ability and can obtain higher quality objective solutions, and the test results of the total execution time of parallel scheduling tasks and the total transmission time of task data on SaaS platform are all within 30 s. The results of virtual machine resource load balancing degree are all below 15%; the utilization rate of virtual machine resources is above 92.2%.

Fault tolerant & priority basis task offloading and scheduling model for IoT logistics

The Internet of Things (IoT) has connected millions of devices to the internet for communication and computation purposes. Due to constraints such as limited battery power, processing capabilities, and storage capacity, IoT devices often rely on remote fog nodes for task execution, a practice known as task offloading. The NP-hard nature of offloading and scheduling IoT tasks onto fog nodes poses significant challenges. Current IoT task offloading often relies on single parameters like device MIPS, RAM, or battery power. Similarly, task allocation on fog nodes frequently prioritizes VM MIPS. To address energy consumption and task failures in IoT systems, robust fault tolerance, efficient task offloading, and effective scheduling are crucial. This paper introduces a novel Fault-Tolerant, Priority-Based Task Offloading and Scheduling Model (FP-TOSM) for IoT logistics. Utilizing the Analytic Hierarchy Process (AHP) for multi-criteria decision-making, IoT tasks are prioritized. Tasks below a specified threshold are executed locally, while those within a defined range are offloaded to a fog node. Tasks exceeding this range are delegated to the cloud. The Euclidean formula is used to determine the proximity between the IoT logistics vehicle and fog nodes for offloading decisions. Dynamic re-clustering fault tolerance mechanisms are utilized to manage task failures after offloading. Successful offloaded tasks are allocated to suitable VMs in the cloud and fog nodes. The proposed strategy selects the most suitable VM for offloaded tasks using a multi-criteria decision-making process to reduce energy consumption, SLA violations, and execution costs. The model's performance is evaluated through simulations in iFogSim2. Results demonstrate reductions in energy consumption by up to 5.8 % and 10.4 %, decreases in SLA violations by up to 25.2 %, and a 16.28 % improvement in response time compared to an ACO-based model with a response time of 17.8 %. Additionally, the task failure ratio shows a significant reduction of up to 22.1 %. These findings highlight the effectiveness of FP-TOSM in enhancing efficiency and reliability within fog computing environments.

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.

Zero-Shot Learning for Accurate Project Duration Prediction in Crowdsourcing Software Development

Crowdsourcing Software Development (CSD) platforms, i.e., TopCoder, function as intermediaries connecting clients with developers. Despite employing systematic methodologies, these platforms frequently encounter high task abandonment rates, with approximately 19% of projects failing to meet satisfactory outcomes. Although existing research has focused on task scheduling, developer recommendations, and reward mechanisms, there has been insufficient attention to the support of platform moderators, or copilots, who are essential to project success. A critical responsibility of copilots is estimating project duration; however, manual predictions often lead to inconsistencies and delays. This paper introduces an innovative machine learning approach designed to automate the prediction of project duration on CSD platforms. Utilizing historical data from TopCoder, the proposed method extracts pertinent project attributes and preprocesses textual data through Natural Language Processing (NLP). Bidirectional Encoder Representations from Transformers (BERT) are employed to convert textual information into vectors, which are then analyzed using various machine learning algorithms. Zero-shot learning algorithms exhibit superior performance, with an average accuracy of 92.76%, precision of 92.76%, recall of 99.33%, and an f-measure of 95.93%. The implementation of the proposed automated duration prediction model is crucial for enhancing the success rate of crowdsourcing projects, optimizing resource allocation, managing budgets effectively, and improving stakeholder satisfaction.

Enhanced Particle Swarm Optimization for Task Offloading and Scheduling in Cloud-Fog Environment

Enhanced Particle Swarm Optimization for Task Offloading and Scheduling in Cloud-Fog Environment

Feasibility of Employing mHealth in Delivering Preventive Nutrition Interventions Targeting the First 1000 Days of Life: Experiences from a Community-Based Cluster Randomised Trial in Rural Bangladesh.

An Android platform-based customised app and web-linked system was developed to aid in implementing selected nutrition interventions by community health workers (CHWs) in a community-based cluster randomised trial (c-RCT) in rural Bangladesh. Here, we describe the architecture of the intervention delivery system, and explore feasibility of employing mHealth as CHWs' job aid, employing a mixed-method study design covering 17 visits per mother-child dyad. We analysed CHWs' real-time visit information from monitoring and documentation data, and CHWs' qualitative interviews to explore the advantages and barriers of using mHealth as a job aid. Intervention coverage was high across the arms (>90%), except around the narrow perinatal period (51%) due to mothers' cultural practice of moving to their parents' homes and/or hospitals for childbirth. CHWs mentioned technical and functional advantages of the job aid including device portability, easy navigability of content, pictorial demonstration that improved communication, easy information entry, and automated daily scheduling of tasks. Technical challenges included charging tablets, especially in power cut-prone areas, deteriorated battery capacity over continuous device usage, unstable internet network in unsupportive weather conditions, and device safety. Nevertheless, onsite supervision and monitoring by expert supervisors remained important to ensure intervention quality. With appropriate training and supervision, CHWs utilised the tablet-based app proficiently, attaining high coverage of long-term visits. mHealth was thus useful for designing, planning, scheduling, and delivering nutrition interventions through CHWs, and for monitoring and supervision by supervisors. Therefore, this application and job aid can be adopted or replicated into the currently developing national health systems platform for improving coverage and quality of preventive maternal and child nutrition services. In addition, continuous supportive supervision by skilled supervisors must be accompanied to ensure CHWs' task quality. Finally, future studies should rigorously assess undesirable health and environmental effects of mHealth before and after mainstreaming, effective interventions addressing device-induced health hazards should be designed and scaled up, and effective e-waste management must be ensured.

Designing an optimal task scheduling and VM placement in the cloud environment with multi-objective constraints using Hybrid Lemurs and Gannet Optimization Algorithm

ABSTRACT An efficient resource utilization method can greatly reduce expenses and unwanted resources. Typical cloud resource planning approaches lack support for the emerging paradigm regarding asset management speed and optimization. The use of cloud computing relies heavily on task planning and allocation of resources. The task scheduling issue is more crucial in arranging and allotting application jobs supplied by customers on Virtual Machines (VM) in a specific manner. The task planning issue needs to be specifically stated to increase scheduling efficiency. The task scheduling in the cloud environment model is developed using optimization techniques. This model intends to optimize both the task scheduling and VM placement over the cloud environment. In this model, a new hybrid-meta-heuristic optimization algorithm is developed named the Hybrid Lemurs-based Gannet Optimization Algorithm (HL-GOA). The multi-objective function is considered with constraints like cost, time, resource utilization, makespan, and throughput. The proposed model is further validated and compared against existing methodologies. The total time required for scheduling and VM placement is 30.23%, 6.25%, 11.76%, and 10.44% reduced than ESO, RSO, LO, and GOA with 2 VMs. The simulation outcomes revealed that the developed model effectively resolved the scheduling and VL placement issues.

On the degree of parallelism for parallel real-time tasks

The degree of parallelism, which measures how a task can execute concurrently, is an important characterization in scheduling. This paper studies the degree of parallelism in the domain of real-time scheduling of parallel tasks, including the DAG task model and the conditional DAG task model. The definition of the degree of parallelism for DAG tasks is clarified; the definition and computing algorithm of the degree of parallelism for conditional DAG tasks are proposed. By leveraging the degree of parallelism, new response time bounds are derived and simple but effective real-time scheduling approaches are presented. This research is the first work to study the degree of parallelism for conditional DAG tasks and explore its benefits in real-time scheduling. Experimental results demonstrate that the proposed scheduling approaches significantly outperform existing state-of-the-art methods.

Energy efficient dynamic scheduling of dependent tasks for multi‐core real‐time systems using delay techniques

SummaryOptimizing energy consumption and maximizing throughput in multi‐core real‐time architectures through dynamic task scheduling is a critical design challenge. While significant attention has been devoted to addressing this challenge in the domain of real‐time multi‐core scheduling, the focus has primarily centered on considering periodic tasks as independent. However, the existing literature notably lacks comprehensive study of scheduling methodologies on multi‐core systems that consider dependent tasks, though typical real‐time systems execute tasks that share resources. Earlier studies have predominantly examined scenarios involving random new tasks and task instances (jobs), which are executed in different power levels. Each task (and job) has distinct execution time corresponding to each power level. By considering these parameters (power levels and execution times of jobs), various combinations of energy signatures have been found to attain an optimum system state. Building upon this prior research, our paper extends the scope to encompass task scheduling in multi‐core systems with task dependencies. We introduce a novel approach that categorizes dependent tasks into ASAP (as soon as possible) and ALAP (as late as possible) groups, prioritizing task execution based on task mobility—defined as the disparity between the last cycle the task can be scheduled in and the current cycle. Furthermore, our model demonstrates an approach for efficient scheduling of sporadic and aperiodic tasks within this framework. Through experimental validation using randomized task sets, our results indicate that the proposed model achieves a minimum of 5% reduction in normalized total energy consumption compared to existing methodologies.

Enhancing Cloud Task Scheduling with Multi-Objective Optimization Using K-Means Clustering and Dynamic Resource Allocation

The scheduling and resource allocation procedure is an essential component of cloud resource management. Effective resource allocation is severely hampered by the task arrival rates' erratic and unclear behavior. To prevent under or overusing resources, an effective scheduling strategy is necessary. To improve scheduling and allocation performance, a multi-objective optimization technique is presented for the best resource allocation and task scheduling inside scientific workflow datasets in a heterogeneous environment. In the first stage, the system calculates four key metrics: Communication Cost, Computation Cost, Earliest Finished Time on a particular VM, and Total Task Length for a specific scientific workflow dataset. These metrics provide a comprehensive understanding of the resource requirements and help make informed scheduling decisions. In the second stage, tasks are clustered using the K-Means clustering algorithm. This clustering groups similar tasks together, making managing and scheduling them easier. In the third stage, the proposed resource allocation algorithm allocates the clustered tasks to the appropriate VMs. This step ensures that the tasks are assigned to the best-suited resources, optimizing the overall system performance and resource utilization. By following this multi-stage process, the system aims to achieve optimal resource allocation and task scheduling, thereby improving the efficiency and effectiveness of cloud resource management. The proposed method significantly outperforms PSO, CSO, and GWO by consistently achieving lower Makespan—under 400 units at 50 tasks—while maintaining high resource utilization rates above 0.75, demonstrating superior efficiency in task execution and resource management.