Reliability is the primary goal of driverless vehicle design. Redundant system design is the key to ensure the safety and reliability of driverless vehicles, so some driverless vehicles adopt standby-sparing system. T...
详细信息
Reliability is the primary goal of driverless vehicle design. Redundant system design is the key to ensure the safety and reliability of driverless vehicles, so some driverless vehicles adopt standby-sparing system. The standby-sparing system is a kind of computer systems that solves the fault tolerance problem by using two processors: a primary processor and a spare processor. The primary processor is responsible for executing main tasks. The spare processor is responsible for executing backup tasks. The release time assignment for backup tasks, as a part of task scheduling, is an important technology in real-time standby-sparing systems. The selective scheduling for tasks with (m, k)-constraint (MKSS) is the state-of-the-art scheduling method for real-time tasks in standby-sparing systems. However, this method is inefficient in release time assignment for backup tasks. In this work, we propose an efficient release time assignment method that can reduce the number of inspecting points and terminate the enumeration once there appears a special inspect point. Theoretical analysis results show that the new method can improve the execution efficiency of the release time assignment without sacrificing the energy-saving effect of MKSS. A set of experiments is conducted to evaluate the execution efficiency of the new method, and the results show that, compared with the MKSS method, the new method can reduce about 98.7% time overhead for assigning release time for tasks.
We consider the problem of minimizing the total completion time on a single online machine using restarts. Although restarts can potentially be very beneficial in the context of online scheduling, there has been relat...
详细信息
A single-objective Flexible Job-Shop scheduling Problem (FJSP) solving method based on the Reinforcement Learning-Remora Optimization Algorithm (RL-ROA) is proposed in this paper. The method integrates the characteris...
详细信息
With the development of industrial intelligence and information technology, the industrial network presents a new characteristic of multivariate network. In this paper, a production element scheduling optimisation alg...
详细信息
The efficiency of the Round-Robin (RR) algorithm for CPU scheduling depends on its Time Quantum (TQ) value. The optimal time quantum value can reduce the average waiting time and average turnover time of the processes...
详细信息
Task scheduling is key to multi-platform multi-sensor systems, which faces challenges of complex sensor combination and high computational complexity. To deal with these challenges, this research introduces the concep...
详细信息
As cloud-native applications is more and more popular, job scheduling becomes an important issue. In a cloud-native environment, different jobs have different resource requirements and execution times, causing the eff...
详细信息
Based on relevant research on the scheduling problem of home care appointments and path planning under time window constraints both domestically and internationally, this article considers the current situation of med...
详细信息
This paper discuss about the scheduling problem for flexible manufacturing systems (FMSs) using the genetic algorithm. In FMSs, the operation of a job is performed on more than one machine. Therefore, FMS scheduling i...
详细信息
In a compilation flow of processor-based emulation (PBE), partitioning involves dividing a large netlist into smaller pieces and assigning them to different processors. Furthermore, the scheduling process must adhere ...
详细信息
暂无评论