首页> 外文会议>IEEE International Conference on Distributed Computing Systems >Kill Two Birds with One Stone: Auto-tuning RocksDB for High Bandwidth and Low Latency
【24h】

Kill Two Birds with One Stone: Auto-tuning RocksDB for High Bandwidth and Low Latency

机译:用一块石头杀死两只鸟:高带宽和低延迟的自动调整RocksDB

获取原文

摘要

Log-Structured Merge (LSM) tree based key-value stores are widely deployed in data centers. Due to its complex internal structures, appropriately configuring a modern key-value data store system, which can have more than 50 parameters with various hardware and system settings, is a highly challenging task. Currently, the industry still heavily relies on a traditional, experience-based, hand-tuning approach for performance tuning. Many simply adopt the default setting out of the box with no changes. Auto-tuning, as a self-adaptive solution, is thus highly appealing for achieving optimal or near-optimal performance in real-world deployment.In this paper, we quantitatively study and compare five optimization methods for auto-tuning the performance of LSM-tree based key-value stores. In order to evaluate the auto-tuning processes, we have conducted an exhaustive set of experiments over RocksDB, a representative LSM-tree data store. We have collected over 12,000 experimental records in 6 months, with about 2,000 software configurations of 6 parameters on different hardware setups. We have compared five representative algorithms, in terms of throughput, the 99th percentile tail latency, convergence time, real-time system throughput, and the iteration process, etc. We find that multi-objective optimization (MOO) methods can achieve a good balance among multiple targets, which satisfies the unique needs of key-value services. The more specific Quality of Service (QoS) requirements users can provide, the better performance these algorithms can achieve. We also find that the number of concurrent threads and the write buffer size are the two most impactful parameters determining the throughput and the 99th percentile tail latency across different hardware and workloads. Finally, we provide system-level explanations for the auto-tuning results and also discuss the associated implications for system designers and practitioners. We hope this work will pave the way towards a practical, high-speed auto-tuning solution for key-value data store systems.
机译:基于日志结构的合并(LSM)树的键值存储在数据中心中广泛部署。由于其复杂的内部结构,适当配置现代密钥值数据存储系统,该系统可以具有超过50个具有各种硬件和系统设置的参数,是一个非常具有挑战性的任务。目前,该行业仍依靠传统,经验,手工调整方法进行性能调整。许多人只是通过没有更改的框中采用默认设置。因此,自适应解决方案自适应,是对实际部署中的最佳或接近最佳性能的高吸引力。在本文中,我们定量地研究并比较了五种优化方法来自动调整LSM的性能基于树的键值存储。为了评估自动调整过程,我们在代表性LSM树数据存储的RocksDB上进行了详尽的一组实验。我们在6个月内收集了超过12,000个实验记录,在不同的硬件设置上有大约2,000个软件配置6个参数。我们在吞吐量,第99百分位数,收敛时间,实时系统吞吐量和迭代过程等方面比较了五个代表性算法等。我们发现我们发现多目标优化(Moo)方法可以实现良好的平衡在多个目标中,满足关键价值服务的独特需求。更具体的服务质量(QoS)要求用户可以提供,这些算法可以实现更好的性能。我们还发现并发线程的数量和写缓冲区大小是确定吞吐量的两个最有影响力的参数和不同硬件和工作负载的吞吐量和第99百分位数。最后,我们为自动调整结果提供了系统级解释,并讨论了系统设计师和从业者的相关影响。我们希望这项工作能够为键值数据存储系统提供朝向实际的高速自动调整解决方案的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号