OPTIMAL STRATEGIES FOR SCHEDULING CHECKPOINTS AND PREVENTIVE MAINTENANCE

被引：25

作者：

COFFMAN, EG

GILBERT, EN

机构：

[1] AT&T Bell Laboratories, Murray Hill, New Jersey 07974-2070

[2] AT&T Bell Laboratories, Murray Hill, New Jersey 07974-2070

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1990年 / 39卷 / 01期

关键词：

Optimization; Preventive maintenance; Scheduling;

D O I：

10.1109/24.52636

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

At checkpoints during the operation of a computer, the state of the system is saved. Whenever a machine fails, it is repaired and then reset to the state saved at the latest checkpoint. In this paper, save times are known constants and repair times are random variables; failures are the epochs of a given renewal process. In scheduling the checkpoints, the cost of saves must be traded off against the cost of work lost when the computer fails. We show how to schedule checkpoints to minimize the mean total-time to finish a given job. We obtain similar optimization results for the tails of the distribution of the finishing time, and certain variants of the basic model. © 1990, IEEE.

引用

页码：9 / 18

页数：10

共 7 条

[1] SELECTION OF A CHECKPOINT INTERVAL IN A CRITICAL-TASK ENVIRONMENT [J].