ZooFence: Principled Service Partitioning and Application to the ZooKeeper Coordination Service

ZooFence: Principled Service Partitioning and Application to the ZooKeeper Coordination Service
复制标题

DOI:
10.1109/srds.2014.41
复制
发表时间:
2014-10
期刊:
2014 IEEE 33rd International Symposium on Reliable Distributed Systems
影响因子:
--
通讯作者:
Raluca Halalai;P. Sutra;E. Rivière;P. Felber
Raluca Halalai;P. Sutra;E. Rivière;P. Felber
中科院分区:
其他
文献类型:
--
作者:
Raluca Halalai;P. Sutra;E. Rivière;P. Felber

文献摘要

被引文献

相似文献

云计算基础设施利用容错和地理分布式服务来满足现代应用程序的需求。每个服务都要处理大量争夺其提供的资源的客户端。当负载增加时,服务需要扩展。在本文中,我们研究了一个可伸缩性解决方案,该方案包括对服务状态进行分区。我们制定了服务可分区的具体条件。在此基础上,提出了一种构建可靠、一致的分区服务的通用算法。为了评估我们方法的实用性,我们实现并评估了ZooFence协调服务。ZooFence编排了几个ZooKeeper实例,并向其客户端提供完全相同的API和语义。它自动在ZooKeeper实例之间分割协调服务状态,同时对应用程序透明。通过减少车队对操作的影响和利用工作负载局部性,我们的方法允许提出一个比单个ZooKeeper实例具有更大可扩展性的协调服务。ZooFence对两个基准测试进行了评估,一个是并发队列的综合服务,另一个是BookKeeper分布式日志引擎。
Cloud computing infrastructures leverage fault-tolerant and geographically distributed services in order to meet the requirements of modern applications. Each service deals with a large number of clients that compete for the resources it offers. When the load increases, the service needs to scale. In this paper, we investigate a scalability solution which consists in partitioning the service state. We formulate specific conditions under which a service is partitionable. Then, we present a general algorithm to build a dependable and consistent partitioned service. To assess the practicability of our approach, we implement and evaluate the ZooFence coordination service. ZooFence orchestrates several instances of ZooKeeper and presents the exact same API and semantics to its clients. It automatically splits the coordination service state among ZooKeeper instances while being transparent to the application. By reducing the convoy effect on operations and leveraging the workload locality, our approach allows proposing a coordination service with a greater scalability than with a single ZooKeeper instance. The evaluation of ZooFence assesses this claim for two benchmarks, a synthetic service of concurrent queues and the BookKeeper distributed logging engine.