期刊文献+

Redis可扩展与高效复制方案的设计与实现 被引量:3

On Design of Extendable and High Efficient Replication Schema on Redis
下载PDF
导出
摘要 为了解决Redis数据库复制性能差和扩展性差的问题,该文设计了一个Redis可扩展与高效复制方案,即基于文件共享的主从复制和基于一致性哈希的集群(RSCCH-Redis,Replication on Share and Clusters on Consistent Hash of Redis)方案.该方案在Redis应用中引入了一致性哈希以实现可扩展性及引入了基于文件共享的主从复制功能来提高复制性能;采用一致性哈希作为映射方式,并在其中引入了虚拟节点,这样不但保证了映射关系的单调性与分散性,还保证了映射的负载均衡性;采用文件共享的主从复制方式,可以避免初次复制时大量的数据传输,减轻网络压力,加快复制速度,从而减少故障恢复时间.实验数据表明,该文设计的Redis高可用方案RSCCH-Redis不但解决了Redis数据库复制性能差的问题,而且有着良好的可扩展性. In order to solve the problem of replication and expand,a extendable and high efficiency replication Redis schema has been proposed in this paper,named RSCCH-Redis(Replication on Share and Clusters on Consistent Hash of Redis).The schema adopts consistent hash to implement the extendable Redis and adopts the master slave replication function based on shared files to deal with the single node faulty.With the consistent hash and the virtual node in it,the system not only makes sure that the mapping pattern is monotonous and decentralizes,but also makes that load balancing.With the master slave replication function,it can avoid transporting mass data and decrease the network pressure and improve the replication speed,thus decreasing the recovery time.The experiment result demonstrates that the high available Redis schema named RSCCH-Redis not only solve replication problem,but also extendable.
作者 李法平 王成良 LI Fa-ping;WANG Cheng-liang(Chongqing College of Electronic Engineering,Chongqing 401331,China;School of Soft Engineering,Chongqing University,Chongqing 401331,China)
出处 《西南师范大学学报(自然科学版)》 CAS 北大核心 2018年第3期83-90,共8页 Journal of Southwest China Normal University(Natural Science Edition)
基金 重庆市教委课题(KJ1729408)
关键词 REDIS 可扩展性 主从复制 一致性哈希 文件共享 Redis extendable master-slave replication consistent hash share
  • 相关文献

参考文献3

二级参考文献32

  • 1DECANDIA G, HASTORUN D,JANPANI M, et al. Dynamo: Amazon's highly available key-value store[C]11 SOSP '07: Pro?ceedings of Twenty-first ACM SIGOPS Symposium on Operating Sys?tems Principles. New York: ACM, 2007: 205 - 220.
  • 2Hadoop: Open source implementation of MapReduce[EB/OL].[2013 -05 -01] . http: Illucene. apache.orglhadoop.
  • 3TANENBAUM A S, STEEN M V. Distributed systems: principles and paradigms[M]. 2nd ed. Upper Saddle River, NewJersey: Pearson Prentice-Hall, 2006.
  • 4KARGER D, LEHMAN E, LEIGHTON T, et al. Consistent has?hing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web[C]II STOC '97: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing. New York: ACM, 1997: 654 -663.
  • 5SINGHAL M. Deadlock detection in distributed systems[J]. Com?puter, 1989, 22( 11): 37 -48.
  • 6GLIGOR V D, SHATTUCK S H. On deadlock detection in distribu?ted systems[J]. IEEE Transactions on Software Engineering, 1980, 6(5): 435 -440.
  • 7MENACSE D A, MUNTZ R R. Locking and deadlock detection in distributed data bases[J]. IEEE Transactions on Software Engineer?ing, 1979,5(3): 195 -202.
  • 8YANG S, de VECIANA G. Size-based adaptive bandwidth alloca?tion: Optimizing the average QoS for elastic flows[C] II INFOCOM 2002: Proceedings of the Twenty-first AnnualJoint Conference of the IEEE Computer and Communications Societies. Washington, DC: IEEE Computer and Communications Societies, 2002, 2: 657 - 666.
  • 9GARCIA-LUNA-ACEVESJ J, BEHRENSJ. Distributed, scalable routing based on vectors of link states[J]. IEEEJournal on Selected Areas in Communications, 1995,13(8): 1383 -1395.
  • 10LUJ, TUMERJ. Efficient mapping of virtual networks onto a shared substrate, WUCSE-2006-35[R]. SI. Louis: Washington University in SI. Louis, Department of Computer Science And Engineering, 2006.

共引文献4

同被引文献30

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部