Work

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

Year: 2018

Type: article

Abstract: 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.

Source: IEEE Access

DOI: 10.1109/access.2018.2881268

Authors: Hejun Xuan, Shiwei Wei, Wuning Tong, Daohua Liu, Chuanda Qi

Institutions: Xinyang Normal University, Guilin University of Aerospace Technology, Shaanxi University of Chinese Medicine

Language: English

Topic: Distributed and Parallel Computing Systems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,075

Funders: National Natural Science Foundation of China, Natural Science Foundation of Guangxi Province, Science and Technology Department of Henan Province, Nanhu Scholars Program for Young Scholars of Xinyang Normal University