### Table 1: Avoidance of PC Process Abortion

1997

"... In PAGE 8: ...99970 Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table1 , which lists the probabilities for the avoidance of process abortion, and Table 2, which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

Cited by 20

### Table 1: Avoidance of PC Process Abortion

1997

"... In PAGE 9: ...99970 Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table1 , which lists the probabilities for the avoidance of process abortion, and Table 2, which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

### Table 1: Avoidance of PC Process Abortion

"... In PAGE 9: ...99970 Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table1 , which lists the probabilities for the avoidance of process abortion, and Table 2, which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

### Table 7 lists spare utilization U for the RFCS scheme. Observe that the average spare utilization is quite low and decreases as the number of checkpoints (n) increases or 24

1994

"... In PAGE 28: ... Such a situation may be avoided by taking checkpoints more frequently. Table7 : Spare utilization by a single duplex system with task 1 n U(rfcs) 10?3 4 0.02549 8 0.... ..."

Cited by 23

### Table 2: Avoidance of Queue Over ow

1997

"... In PAGE 8: ...Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table 1, which lists the probabilities for the avoidance of process abortion, and Table2 , which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

Cited by 20

### Table 2: Avoidance of Queue Over ow

1997

"... In PAGE 9: ...Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table 1, which lists the probabilities for the avoidance of process abortion, and Table2 , which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

### Table 2: Avoidance of Queue Over ow

"... In PAGE 9: ...Table 2: Avoidance of Queue Over ow used the TPWB to compute the likelihood of these con- ditions being satis ed by the models within certain time bounds. Our results are given in Table 1, which lists the probabilities for the avoidance of process abortion, and Table2 , which lists the probabilities for the avoidance of queue over ow. The information in the tables should be interpreted as follows.... ..."

### Table 6: Length of spare use in various situations Situation Spare Use

1994

"... In PAGE 27: ... The earlier analysis for n and vn is valid if average spare utilization U is small. Table6 enumerates the length of time for which the spare is used in various situations described in earlier sections. Table 6: Length of spare use in various situations Situation Spare Use... ..."

Cited by 23

### Table 2. Total spare capacity

2000

"... In PAGE 12: ...In Table2 , the total spare network capacity for 100% restoration for any single link failure as determined by the four algorithms using a hop count limit at 7 is given. The lower bound on the spare capacity requirements is found by solving the LP relaxation of the Path IP model is also shown.... In PAGE 12: ... The lower bound on the spare capacity requirements is found by solving the LP relaxation of the Path IP model is also shown. The % redundancy as measured by the ratio of spare capacity to the working capacity is also given in Table2 . For the Link IP and Path IP approaches the objective is to minimize the total spare capacity in the network.... ..."

Cited by 6

### Table 3: Spare Server Performance

2003

"... In PAGE 10: ... Using the constraint expressed in Equa- tion 8, the load profile, the value for the startup delay D (30s), and the value for the capacity C (140 connections), we can compute Naverage for any value of S for both the workloads. Table3 shows the TS and energy savings, Savings, for both the workloads. We see that Financial does not benefit from having spare servers at all, while Olympics does best with 3 spare servers.... ..."

Cited by 27