Efficient synchronization of replicated data in distributed systems
作者： Thorsten Schütt , Florian Schintke , Alexander Reinefeld
关键词:
摘要: We present nsync, a tool for synchronizing large replicated data sets in distributed systems. nsync computes nearly optimal synchronization plans based on hierarchy of gossip algorithms that take the network topology into account. Our primary design goals were maximum performance and scalability. achieved these by exploiting parallelism planning phase, omitting transfer unnecessary metadata, at block level rather than file level, using sophisticated compression methods. With its relaxed consistency semantic, neither needs master copy nor quorum updating replicas. Each replica is kept as an autonomous entity can be modified with usual tools.
core.ac.uk
springer.com
sci-hub.st 参考文章(17)
Matei Ripeanu, Ian T. Foster, A Decentralized, Adaptive, Replica Location Service high performance distributed computing. ,(2002)
Juraj Hromkovič, Ralf Klasing, Burkhard Monien, Regine Peine, Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) Combinatorial Network Theory. pp. 125- 212 ,(1996) , 10.1007/978-1-4757-2491-2_5
Ricardo Jiménez-Peris, Marta Patiño-Martínez, Gustavo Alonso, B Kernme, None, How to select a replication protocol according to scalability, availability and communication overhead symposium on reliable distributed systems. pp. 24- 33 ,(2001) , 10.1109/RELDIS.2001.969732
Richard Guy, Peter Reiher, David Ratner, Michial Gunter, Wilkie Ma, Gerald Popek, Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication Advances in Database Technologies. pp. 254- 265 ,(1999) , 10.1007/978-3-540-49121-7_22
Florian Schintke, Alexander Reinefeld, Modeling Replica Availability in Large Data Grids Journal of Grid Computing. ,vol. 1, pp. 219- 227 ,(2003) , 10.1023/B:GRID.0000024086.50333.0D
Chaitanya Baru, Reagan Moore, Arcot Rajasekar, Michael Wan, The SDSC storage resource broker conference of the centre for advanced studies on collaborative research. pp. 189- 200 ,(2010) , 10.1145/1925805.1925816
Brenda Baker, Robert Shostak, Gossips and telephones Discrete Mathematics. ,vol. 2, pp. 191- 193 ,(1972) , 10.1016/0012-365X(72)90001-5
David W. Krumme, George Cybenko, K. N. Venkataraman, Gossiping in minimal time SIAM Journal on Computing. ,vol. 21, pp. 111- 139 ,(1992) , 10.1137/0221010
Pierre Fraigniaud, Emmanuel Lazard, Methods and problems of communication in usual networks Discrete Applied Mathematics. ,vol. 53, pp. 79- 133 ,(1994) , 10.1016/0166-218X(94)90180-5
Wolfgang Hoschek, Ewa Deelman, Peter Kunszt, Matei Ripeanu, Adriana Iamnitchi, Ian Foster, Brian Tierney, Carl Kesselman, Ann Chervenak, Heinz Stockinger, Leanne Guy, Bob Schwartzkopf, Kurt Stockinger, Giggle: A Framework for Constructing Scalable Replica Location Services conference on high performance computing (supercomputing). pp. 1- 17 ,(2002) , 10.5555/762761.762798