Comparing File Copies with at Most Three Disagreeing Pages

Metzner (1991) discussed a parallel algorithm to identify two disagreeing pages when comparing two replicated file copies. We show that this algorithm can also identify three disagreeing pages, if one additional comparison is allowed to resolve some possible ambiguity. We also discuss the relation between the file-copy problem and the group testing problem which has been widely studied.

[1]  Hector Garcia-Molina,et al.  Exploiting symmetries for low-cost comparison of file copies , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[2]  John J. Metzner,et al.  Efficient Replicated Remote File Comparison , 1991, IEEE Trans. Computers.

[3]  John J. Metzner,et al.  A general decoding technique applicable to replicated file disagreement location and concatenated code decoding , 1990, IEEE Trans. Inf. Theory.

[4]  Kun-Lung Wu,et al.  Low-Cost Comparison and Diagnosis of Large Remotely Located Files , 1986, Symposium on Reliability in Distributed Software and Database Systems.

[5]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[6]  John J. Metzner,et al.  A Parity Structure for Large Remotely Located Replicated Data Files , 1983, IEEE Transactions on Computers.