Fog computing (FC) with a distributed architecture plays an essential role in Internet-of-Things (IoT). This paradigm utilises the processing abilities of Fog devices (FDs) and decreases latency. The large volume of d...
详细信息
Fog computing (FC) with a distributed architecture plays an essential role in Internet-of-Things (IoT). This paradigm utilises the processing abilities of Fog devices (FDs) and decreases latency. The large volume of data and its process in IoT can cause network failures. Researchers tend to consider communication reliability to reduce fault effects and achieve high performance. fault tolerance becomes a necessary matter to enhance the reliability of the Fog. Notably, fault tolerance studies have been performed mostly on the Cloud system. To counter this issue, the authors propose a novel fault-tolerant scheduling algorithm of modules in FC and optimise it. The main idea of this approach is a classification method for different modules alongside of computing the energy consumption of all FDs and finding minimal FDs' energy consumption. To distribute modules between FDs, they present an energy-efficient checkpointing and load balancing technique based on the Bayesian classification and call it by ECLB. The performance of the proposed method is evaluated by comparing it with the state-of-the-art algorithms in terms of delay, energy consumption, execution cost, network usage, and total executed modules. Analysis and simulation results indicate that the authors' methods are efficient and superior to others.
Partial reconfigurable system is an architecture consisting general purpose processors and FPGAs, in which FPGA can be reconfigured in run-time. Based on the architecture, software tasks and hardware tasks that are ex...
详细信息
Partial reconfigurable system is an architecture consisting general purpose processors and FPGAs, in which FPGA can be reconfigured in run-time. Based on the architecture, software tasks and hardware tasks that are executed on processor and FPGA respectively co-exist. In this paper, a real-time fault-tolerant scheduling algorithm is proposed to schedule software/hardware hybrid tasks. In the algorithm, the sufficient condition for schedulable hybrid tasks is derived from analyzing system operation conditions when the first deadline is missed, and rollback/recovery and TMR approaches are used respectively to schedule software subtasks and hardware subtasks for fault tolerance. The experimental results demonstrate that all deadlines of accepted hybrid tasks are met and processor's utilization ratio is increased greatly compared with that of the exiting approaches when multiple faults occur.
For periodic real-time task in Distributed control system, a novel fault-tolerant scheduling algorithm is presented based on duplication technique. The algorithm fuses active backup-copy technique and passive backup-c...
详细信息
ISBN:
(纸本)9781424427239
For periodic real-time task in Distributed control system, a novel fault-tolerant scheduling algorithm is presented based on duplication technique. The algorithm fuses active backup-copy technique and passive backup-copy technique and overlapping backup-copy technique in order to adapt task demand in different case. The method for judging the schedulability of task set is given. The heuristic task assigning algorithm based on first-fit method and minimizing "worst case completion time" is given. Finally, simulation experiments are carried out to prove the feasibility and effectiveness of the algorithm.
For periodic real-time task in Distributed control system, a novel fault-tolerant scheduling algorithm is presented based on duplication technique. The algorithm fuses active backup-copy technique and passive backup-c...
详细信息
For periodic real-time task in Distributed control system, a novel fault-tolerant scheduling algorithm is presented based on duplication technique. The algorithm fuses active backup-copy technique and passive backup-copy technique and overlapping backup-copy technique in order to adapt task demand in different case. The method for judging the schedulability of task set is given. The heuristic task assigning algorithm based on first-fit method and minimizing “worst case completion time” is given. Finally, simulation experiments are carried out to prove the feasibility and effectiveness of the algorithm.
In this paper, we consider preemptive scheduling of a set of fixed-priority, sporadic tasks on multiprocessors from both real-time and fault-tolerant perspectives. We propose a fault-tolerant multiprocessor scheduling...
详细信息
ISBN:
(纸本)9780769546001
In this paper, we consider preemptive scheduling of a set of fixed-priority, sporadic tasks on multiprocessors from both real-time and fault-tolerant perspectives. We propose a fault-tolerant multiprocessor schedulingalgorithm, called FTGS, exploiting time redundancy to tolerate both task errors and processor failures. The main contribution of this paper is the derivation of a feasibility test for our proposed FTGS algorithm. This feasibility test when satisfied guarantees that all the deadlines of the real-time tasks are met even in the presence of task errors and processor failures. The major strength of FTGS algorithm is the fault model it assumes;we consider a variety of software and hardware faults that may lead to task errors or processor failures. The novelty of our proposed feasibility test is that the resilience of resource constrained embedded real-time systems can be determined for different combinations of task errors and processor failures.
Messages and tasks in networked control systems must be executed in certain order and finished before their deadline, and they run on different resources. Therefore, a novel fault-tolerant scheduling algorithm is pres...
详细信息
ISBN:
(纸本)9781424417339
Messages and tasks in networked control systems must be executed in certain order and finished before their deadline, and they run on different resources. Therefore, a novel fault-tolerant scheduling algorithm is presented in this paper. Firstly, a scheduling sequence (including messages, primary copies and backup copies) is designed in a sampling period. Then heuristic static algorithm for assigning primary copies and backup copies of tasks to processors is adopted and the primary copy and backup copy of a task are assigned to different processors. The tasks assigned to the same resource are executed according to their orders in scheduling sequence. Because the sampling period and end-to-end delay of control loop influence on the performance of control system, genetic algorithm based on integer coding is applied to optimized scheduling sequence. Simulation result show the schedulingalgorithm can guarantee that tasks are fault-tolerant schedulable and improve the performance of control system.
暂无评论