Fault-Tolerant Scheduling Algorithm With Re-Allocation for Divisible Task

Divisible task fault-tolerant scheduling problems for a heterogeneous system on a general and realistic platform are addressed in this paper, where the communication is in non-blocking message receiving mode, and the processors and communication links may have different speeds and startup overheads....

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2018, Vol.6, p.73147-73157
Main Authors: Xuan, Hejun, Wei, Shiwei, Tong, Wuning, Liu, Daohua, Qi, Chuanda
Format: Article
Language:English
Subjects:
Algorithms
Closed-form solutions
Divisible task
Fault tolerance
Fault tolerant systems
fault-tolerant
Microprocessors
Optimal scheduling
optimal sequence
Processor scheduling
Program processors
Task analysis
task re-allocated
Task scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Divisible task fault-tolerant scheduling problems for a heterogeneous system on a general and realistic platform are addressed in this paper, where the communication is in non-blocking message receiving mode, and the processors and communication links may have different speeds and startup overheads. For this kind of problems, the optimal sequence and the fraction of task for each processor are derived first when the fault checkout overhead and checkout time consumption are considered. Then, to decrease the time consumption and checkout overheads, a checkout strategy, which is more suitable for divisible task, is employed. Moreover, an efficient algorithm with the fault fraction units re-allocated is proposed. Finally, the experiments on some simulation examples are conducted and the experimental results indicate that the proposed algorithm is effective, can minimize the expected execution time, and can save the time on fault-tolerant consumption.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2881268