分布式同步系统Zookeeper的优化

针对分布式同步系统Zookeeper在大规模计算机集群上运行效率低下的问题,在研究手动设定响应节点方法的基础上,提出一种基于成员节点选举的自动设定响应节点算法。在一个大规模Zookeeper系统中,采用选举因子可配置的选举算法(包括计算能力、磁盘读写速度、请求率、失效率和网络延迟的测试),挑选出适合完成Zookeeper响应工作的一个或数个节点,进行数据更新请求的应答,降低系统的响应时间,提高系统的性能。实验结果证明,与目前手动设定响应节点相比,自动选举算法能够选举出最合适的节点,并且效率高,性能稳定。在对系统访问延迟的测试中,自动选举算法比手动设定响应节点的平均值减少了11%,且比手动设定响应节点的最大值减少了17%。

Optimization of Distributed Synchronous System Zookeeper

Aiming at distributed synchronous system Zookeeper＇s low-efficiency problem in a large-scale computer cluster, this paper puts forward an automatic response-node set algorithm based on the method of member node election. In a large-scale Zookeeper system, using a factor configurable election algorithm（includes computing capacity, disk reads and writes rate, request rate, failure rate and network latency test）, it picks out one or several of the most suitable nodes for completing the Zookeeper＇s response work, responding to the data updating request, it reduces the system＇s response time, and improves the performance of the system. Experimental results show that, compared with the manual setting response node algorithm, the automatic election algorithm can always elect the most suitable nodes, and it has high efficiency, stable performance. In the tests of system＇s access latency, automatic election algorithm has a response latency decrease of 11% than manual setting node in average, and a decrease of 17% than manually set＇s maximum response latency.