Dremel
Authors:
Open Access
- 26 May 2022
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 6 (2) , 1-30
Abstract
LSM-tree-based key-value stores like RocksDB are widely used to support many applications. However, configuring a RocksDB instance is challenging for the following reasons: 1) RocksDB has a massive parameter space to configure; 2) there are inherent trade-offs and dependencies between parameters; 3) right configurations are dependent on workload and hardware; and 4) evaluating configurations is time-consuming. Prior works struggle with handling the curse of dimensionality, capturing relationships between parameters, adapting configurations to workload and hardware, and evaluating quickly. In this work, we present a system, Dremel, to adaptively and quickly configure RocksDB with strategies based on the Multi-Armed Bandit model. To handle the massive parameter space, we propose using fused features, which encode domain-specific knowledge, to work as a compact and powerful representation for configurations. To adapt to the workload and hardware, we build an online bandit model to identify the best configuration. To evaluate quickly, we enable multi-fidelity evaluation and upper-confidence-bound sampling to speed up identifying the best configuration. Dremel not only achieves up to ×2.61 higher IOPS and 57% less latency than default configurations but also achieves up to 63% improvements over prior works on 18 different settings with the same or less time budget.Keywords
Funding Information
- Cisco Systems
This publication has 32 references indexed in Scilit:
- Automatic Database Management System Tuning Through Large-scale Machine Learning2017
- Monkey2017
- BOAT2017
- WiscKeyACM Transactions on Storage, 2017
- dCompaction: Delayed Compaction for the LSM-TreeInternational Journal of Parallel Programming, 2016
- Benchmarking cloud serving systems with YCSB2010
- CassandraACM SIGOPS Operating Systems Review, 2010
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970
- Some aspects of the sequential design of experimentsBulletin of the American Mathematical Society, 1952