skip to main content
10.1145/3447545.3451191acmconferencesArticle/Chapter ViewAbstractPublication PagesicpeConference Proceedingsconference-collections
short-paper

Performance Interference on Key-Value Stores in Multi-tenant Environments: When Block Size and Write Requests Matter

Published: 19 April 2021 Publication History

Abstract

Key-value stores are currently used by major cloud computing vendors, such as Google, Facebook, and LinkedIn, to support large-scale applications with concurrent read and write operations. Based on very simple data access APIs, the key-value stores can deliver outstanding throughput, which have been hooked up to high-performance solid-state drives (SSDs) to boost this performance even further. However, measuring performance interference on SSDs while sharing cloud computing resources is complex and not well covered by current benchmarks and tools. Different applications can access these resources concurrently until becoming overloaded without notice either by the benchmark or the cloud application. In this paper, we define a methodology to measure the problem of performance interference. Depending on the block size and the proportion of concurrent write operations, we show how a key-value store may quickly degrade throughput until becoming almost inoperative while sharing persistent storage resources with other tenants.

References

[1]
M. Armbrust, K. Curtis, and T. Kraska et al. 2011. PIQL: Success-Tolerant Query Processing in the Cloud. Proc. VLDB Endow. 5, 3 (2011), 181--192.
[2]
M. Armbrust, E. Liang, and T. Kraska et al. 2013. Generalized scale independence through incremental precomputation. In SIGMOD 2013.
[3]
T. G. Armstrong, V. Ponnekanti, D. Borthakur, and M. Callaghan. 2013. LinkBench: a database benchmark based on the Facebook social graph. In SIGMOD 2013.
[4]
B. Atikoglu, Y. Xu, E. Frachtenberg, S. Jiang, and M. Paleczny. 2012. Workload analysis of a large-scale key-value store. In SIGMETRICS 2012.
[5]
Z. Cao and S. Dong et al. 2020. Characterizing, Modeling, and Benchmarking RocksDB Key-Value Workloads at Facebook. In USENIX FAST 2020.
[6]
S. Chaudhuri, H. Lee, and V. R. Narasayya. 2010. Variance aware optimization of parameterized queries. In SIGMOD 2010.
[7]
B. F. Cooper. 2020. YCSB. https://github.com/brianfrankcooper/YCSB.
[8]
B. F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears. 2010. Benchmarking cloud serving systems with YCSB. In SoCC 2010.
[9]
J. Dean and L. A. Barroso. 2013. The tail at scale. Commun. ACM 56, 2 (2013), 74--80. https://doi.org/10.1145/2408776.2408794
[10]
B. K. Debnath, S. Sengupta, and J. Li. 2010. FlashStore: High Throughput Persistent Key-Value Store. Proc. VLDB Endow. 3, 2 (2010), 1414--1425.
[11]
B. K. Debnath, S. Sengupta, and J. Li. 2011. SkimpyStash: RAM space skimpy key-value store on flash-based storage. In SIGMOD 2011.
[12]
G. DeCandia, D. Hastorun, and M. Jampani et al. 2007. Dynamo: amazon's highly available key-value store. In SOSP 2007.
[13]
Facebook. 2020. RocksDB. https://rocksdb.org/.
[14]
D. Gouk, M. Kwon, and J. Zhang et al. 2018. Amber*: Enabling precise full-system simulation with detailed modeling of all ssd resources. In MICRO 2018.
[15]
J. Huang and B. Mozafari et al. 2017. A Top-Down Approach to Achieving Performance Predictability in Database Systems. In SIGMOD 2017.
[16]
J. Huang, B. Mozafari, and T. F. Wenisch. 2017. Statistical Analysis of Latency Through Semantic Profiling. In EuroSys 2017.
[17]
A. Lange. 2020. Rocksdb_test. https://github.com/alange0001/rocksdb_test.
[18]
H. Lim, B. Fan, D. G. Andersen, and M. Kaminsky. 2011. SILT: a memory-efficient, high-performance key-value store. In SOSP 2011.
[19]
C. Luo and M. J. Carey. 2019. On Performance Stability in LSM-based Storage Systems. Proc. VLDB Endow. 13, 4 (2019), 449--462.
[20]
M. Silva, M. R. Hines, and D. et al. Gallo. 2013. CloudBench: Experiment Automation for Cloud Environments. In IC2E 2013.
[21]
SPEC. 2018. Cloud IaaS 2018. https://www.spec.org/cloud_iaas2018
[22]
L. Wang, J. Zhan, and C. Luo et al. 2014. BigDataBench: A big data benchmark suite from internet services. In HPCA 2014.
[23]
H. Yoon, J. Yang, and S. F. Kristjansson et al. 2018. Mutant: Balancing Storage Cost and Latency in LSM-Tree Data Stores. In SoCC 2018.

Cited By

View all
  • (2023)ESD: An ECC-assisted and Selective Deduplication for Encrypted Non-Volatile Main Memory2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA56546.2023.10071011(977-990)Online publication date: Feb-2023

Index Terms

  1. Performance Interference on Key-Value Stores in Multi-tenant Environments: When Block Size and Write Requests Matter

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ICPE '21: Companion of the ACM/SPEC International Conference on Performance Engineering
    April 2021
    198 pages
    ISBN:9781450383318
    DOI:10.1145/3447545
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 19 April 2021

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. flash disks
    2. key-value store
    3. multi-tenant
    4. performance interference

    Qualifiers

    • Short-paper

    Conference

    ICPE '21

    Acceptance Rates

    Overall Acceptance Rate 252 of 851 submissions, 30%

    Upcoming Conference

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)ESD: An ECC-assisted and Selective Deduplication for Encrypted Non-Volatile Main Memory2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA56546.2023.10071011(977-990)Online publication date: Feb-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media