Performance Analysis of Fault-Tolerant Scheduling in a Uniprocessor Computer


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 6, pp. 1639-1651, Jun. 1998
10.3745/KIPSTE.1998.5.6.1639,   PDF Download:

Abstract

In this paper, we present analytical and simulation models for evaluating the operation of a uniprocessor computer which utilizes a time redundant approach (such as recomputation by shifted operands) for fault-tolerant computing. In the proposed approach, all incoming jobs to the uniprocessor are duplicated, thus two versions of each job must be processed. Three methods for appropriately scheduling the primary and secondary versions of the jobs are proposed and analyzed. The proposed scheduling methods take into account the load and the fault rate of the uniprocessor to evaluate two figures of merit for cost and profit with respect to a delay in response time due to faults and fault tolerance. Our model utilizes a fault-tolerant schedule according to which it is possible to find an optimal delay (given by k) based on empiric parameters such as cost, the load and the fault rate of the uniprocessor.


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]
K. S. Soo, "Performance Analysis of Fault-Tolerant Scheduling in a Uniprocessor Computer," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 6, pp. 1639-1651, 1998. DOI: 10.3745/KIPSTE.1998.5.6.1639.

[ACM Style]
Kim Sung Soo. 1998. Performance Analysis of Fault-Tolerant Scheduling in a Uniprocessor Computer. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 6, (1998), 1639-1651. DOI: 10.3745/KIPSTE.1998.5.6.1639.