Data dependence-based optimistic data consistency maintenance method

Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006

Volumn , Issue , 2006, Pages 120-125

  Zhou, Jing ^a   Wang, Yijie ^a   Li, Sikun ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION MANAGEMENT; ROBUSTNESS (CONTROL SYSTEMS);

BLOOM FILTER TECHNIQUE; NEGOTIATION ALGORITHMS; PSEUDO-CONFLICT UPDATES; UPDATE DEPENDENCY;

INFORMATION TECHNOLOGY;

EID: 34547359866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2006.68     Document Type: Conference Paper

References (7)

1. M. Dahlin, L. Gao, A. Nayate, A. Venkataramani, P. Yalagandula, and J. Zheng. PRACTI Replication for Large-scale Systems. Technical Report, TR-04-28, Austin: University of Texas at Austin, 2004.
2. Yasushi Saito, Christos Karamanoli, Magnus Karlsson and Mallik Mahalingam. Taming Aggressive Replication in the Pangaea Wide-area File System. In: Proceedings of the fifth symposium on Operating systems design and implementation. New York: ACM Press, 2002. 15-30.
3. Brent ByungHoon Kang, S2D2: A framework for scalable and secure optimistic replication [Ph.D. Thesis]. Berkeley: University of California, 2004.
4. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, Vol. 13, No. 7, pp. 422-426, July 1970.
5. D. Eastlake, P. Jones. RFC3174: US Secure Hash Algorithm 1 (SHA-1). Http://www.faqs.org/rfcs/rfc3174.html, 2001.
6. W. H. Bell, D. G. Cameron, L. Capozza, P. Millar, K. Stockinger, and F. Zini. Optorsim: a grid simulator for studying dynamic data replication strategies. International Journal of High Performance Computing Applications, 2003, 17(4): 403-416.
7. K. Petersen, M. J. Spreitzer, D. B. Terry. Flexible update propagation for weakly consistent replication. In: 16th ACM Symposium on Operating Systems Principles. New York: ACM Press, October 1997. 288-301.