### Table 1. The amount of the disk space occupied by timestamps by various replication algorithms. The unit is the number of timestamps. N represents the total number of replicas in the system.

"... In PAGE 12: ...4.1 Timestamp overhead Table1 summarizes the amount of space occupied by timestamp-related data structures per replica for various optimistic replication algorithms. The overhead due to timestamps is usually negligible even for timestamp ma- trices, because each timestamp occupies just 32 or 64 bits of disk space.... ..."

### Table 3. Application Execution Times for Various Replication Schemes Algorithm 2S 3S 2T 3T

### Table 1 Algorithm performance on two types of data.

1990

"... In PAGE 8: ...For each of the d and n values shown in Table1 , ten replicate data sets were generated and analyzed. The ranges of observed CPU times and number of iterations are shown.... ..."

Cited by 1

### Table 1 Algorithm performance on two types of data.

in Arati Prabhakar, Director An Algorithm for Computing the Minimum Covering Sphere in Any Dimension

1996

"... In PAGE 8: ...For each of the d and n values shown in Table1 , ten replicate data sets were generated and analyzed. The ranges of observed CPU times and number of iterations are shown.... ..."

### Table 2: Results of applying the CML criterion to a samples of various sizes with true values w = 0:1 and C = 10, the same samples as in Table 1. One hundred replications were used for each sample size. The number of replications for which the algorithm broke down and gave the estimate ^ w = 1 is shown. The means and standard deviations are only worked out from those realizations where the estimate of w is not equal to 1.

1998

Cited by 14

### Table 4 . Comparison of functional replication with other replication algorithms.

1999

Cited by 7

### Table 12. Comparison of functional replication with other replication algorithms.

### Table 1: Results of applying the MML criterion to samples of various sizes with true values w = 0:1 and C = 10. One hundred replications were used for each sample size.

1998

"... In PAGE 5: ... For a number of sample sizes n, one hundred replications were carried out in which n model points i and sample points Yi were generated from the model with these true parameter values, and the estimates obtained by the MML method were found. In Table1 we present the results of the MML approach, implemented using this choice of initial conditions and then iterating the alternating max- imization algorithm to convergence. The consistency of the approach is borne out by the... In PAGE 7: ...7 Table 2: Results of applying the CML criterion to a samples of various sizes with true values w = 0:1 and C = 10, the same samples as in Table1 . One hundred replications were used for each sample size.... ..."

Cited by 14

### Table 4 : Number of unsuccessful replications, by algorithm

1997

"... In PAGE 22: ... Table4 shows that the failure rates for the RE and Ostrich algorithms are similar, except for parameter set A. Table 5 shows that for the vast majority of cases, the RE algorithm converges in less than ten steps.... ..."

Cited by 1