A Fault-tolerant Task Scheduling Algorithm Supporting the Minimum Schedule Length


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 4, pp. 1201-1210, Apr. 2000
10.3745/KIPSTE.2000.7.4.1201,   PDF Download:

Abstract

In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. J. Min, "A Fault-tolerant Task Scheduling Algorithm Supporting the Minimum Schedule Length," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 4, pp. 1201-1210, 2000. DOI: 10.3745/KIPSTE.2000.7.4.1201.

[ACM Style]
Byoung Joon Min. 2000. A Fault-tolerant Task Scheduling Algorithm Supporting the Minimum Schedule Length. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 4, (2000), 1201-1210. DOI: 10.3745/KIPSTE.2000.7.4.1201.