A Hybrid Real-time Fault-tolerant Scheduling Algorithm for Partial Reconfigurable System

Yin, Jinyong; Zheng, Boxiang; Sun, Zhongyi

doi:10.4304/jcp.7.11.2773-2780

Cited by 8 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, a Primary/Backup scheme is proposed in [35] in which two versions of a task run with minimum time overlap. In [36], a real-time fault-tolerant scheduling algorithm is proposed which, schedules hybrid tasks able to tolerate f i faults during task execution. Our previous study [6] showed that, by using optimization methods and choosing, for each task, the proper FT technique from the Pareto-set (referred to as Pareto-based FT techniques), it is possible to increase the reliability of task graphs without deteriorating their makespan.…”

Section: Related Workmentioning

confidence: 99%

Reliability Improvement of Hardware Task Graphs via Configuration Early Fetch

Ramezani

Sedaghat

Clemente

2017

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-This study presents a technique to improve the reliability and the Mean Time to Failure (MTTF) of hardware task graphs running on reconfigurable computers. This technique, which has been named Task Early-fetch, can be applied to a sequence of one or several applications, represented as task graphs. It consists in carrying out the reconfiguration of some tasks within the execution of the previous task graph, plus increasing the redundancy level of the early-fetched tasks. Experimental results on actual task graphs show the positive impacts of the proposed technique. Thus, without deteriorating the execution time (makespan), on average, a 114% MTTF improvement is achieved for no-fault-tolerant task graphs, and the improvement is more significant when applying to faulttolerant task graphs. Finally, this paper presents a hardware implementation of a manager that applies these techniques at run-time and steers the execution of the running task graphs. It demonstrates that, with 0.03% consumption of FFs and LUTs and also 1.22% occupancy of BRAMs available on a Xilinx Virtex UltraScale XCVU095-2FFVA2104E FPGA, the required run-time computations can be carried out in negligible delays.

show abstract

Section: Related Workmentioning

confidence: 99%

Reliability Improvement of Hardware Task Graphs via Configuration Early Fetch

Ramezani

Sedaghat

Clemente

2017

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

show abstract

“…Several hybrid algorithms, which combine EDF with conventional disk scheduling algorithms, are proposed in recent years [17] [18] [19]. FD-EDF (Feasible Deadline EDF) serves requests using the EDF algorithm if there are requests with feasible deadlines in the waiting queue; otherwise, it serves the queue using FCFS.…”

Section: The Traditional I/o Scheduling Algorithmsmentioning

confidence: 99%

“…Through the above analysis of the simulation experiment results we can conclude that HB-SCHED algorithm has a better real-time performance than SCAN and a better throughput performance than EDF. And take "a = 0.6" for example, figure 6 shows the experiment results of J(X) defined in (17) , which is the single objective optimization target of HB-SCHED. We can see that HB-SCHED is higher than EDF and SCAN.…”

Section: Simulation and Analysismentioning

confidence: 99%

An I/O Scheduling Algorithm for Soft Real-time Services Oriented iSCSI Storage System

Zha¹,

Wu²,

Zeng³

et al. 2013

JSW

View full text Add to dashboard Cite

iSCSI storage system is the most widely used network storage system, and soft real-time services are the most common type of business. However, the traditional I/O scheduling algorithms can't work very well for iSCSI storage system oriented soft real-time services. In this paper, the mathematical model of I/O scheduling in iSCSI storage system for soft real-time services is analyzed and discussed, and it proves that this is a multi-objective optimization problem. HB-SCHED is proposed in this paper, which is a heuristic I/O scheduling algorithm for soft real-time services oriented iSCSI storage system. The simulation results show that HB-SCHED not only has better quality in terms of real time than SCAN and can gain higher disk throughput than EDF, but also can adjust the weights between real time and disk throughput by changing the parameter value. HB-SCHED can be well adopted in soft real-time services oriented iSCSI storage system.

show abstract

“…(12) and Eq. (17) have been used to obtain the MTTF and the makespan of the task graph, respectively.…”

Section: Motivational Examplementioning

confidence: 99%

“…For instance, a Primary/Backup scheme is proposed in [16] in order to support FT while scheduling. In [17], a realtime fault-tolerant scheduling algorithm is presented so that, by using a sufficient schedulability test condition, it schedules hybrid hardware/software tasks that are able to tolerate f i faults during task execution. Recently, we have investigated the application of different FT strategies on different real-time scheduling algorithms in reconfigurable platforms [18].…”

mentioning

confidence: 99%

Reliability and Makespan Optimization of Hardware Task Graphs in Partially Reconfigurable Platforms

Ramezani

Sedaghat

Naghibzadeh

et al. 2017

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of reliability and makespan optimization of hardware task graphs in reconfigurable platforms by applying fault tolerance (FT) techniques to the running tasks based on the exploration of the Pareto set of solutions. In the presented solution, in contrast to existing approaches in the literature, task graph scheduling, tasks parallelism, reconfiguration delay, and FT requirements are taken into account altogether. This paper firstly presents a model for hardware task graphs, task prefetch and scheduling, reconfigurable computer and a fault model for reliability. Then, a mathematical model of an integer nonlinear multi-objective optimization problem is presented for improving the FT of hardware task graphs, scheduled in partially reconfigurable platforms. Experimental results show the positive impacts of choosing the FT techniques selected by the proposed solution, which is named Pareto-based. Thus, in comparison to non-fault-tolerant designs or other stateof-the-art FT approaches, without increasing makespan, about 850% Mean Time To Failure (MTTF) improvement is achieved and, without degrading reliability, makespan is improved by 25%. In addition, experiments in fault-varying environments have demonstrated that the presented approach outperforms existing state-of-the-art adaptive FT techniques in terms of both MTTF and makespan.

show abstract

A Hybrid Real-time Fault-tolerant Scheduling Algorithm for Partial Reconfigurable System

Cited by 8 publications

References 11 publications

Reliability Improvement of Hardware Task Graphs via Configuration Early Fetch

Reliability Improvement of Hardware Task Graphs via Configuration Early Fetch

An I/O Scheduling Algorithm for Soft Real-time Services Oriented iSCSI Storage System

Reliability and Makespan Optimization of Hardware Task Graphs in Partially Reconfigurable Platforms

Contact Info

Product

Resources

About