Power and Performance Analysis of Persistent Key-Value Stores

08/31/2020
by   Stella Mikrou, et al.
0

With the current rate of data growth, processing needs are becoming difficult to fulfill due to CPU power and energy limitations. Data serving systems and especially persistent key-value stores have become a substantial part of data processing stacks in the data center, providing access to massive amounts of data for applications and services. Key-value stores exhibit high CPU and I/O overheads because of their constant need to reorganize data on the devices. In this paper, we examine the efficiency of two key-value stores on four servers of different generations and with different CPU architectures. We use RocksDB, a key-value that is deployed widely, e.g. in Facebook, and Kreon, a research key-value store that has been designed to reduce CPU overhead. We evaluate their behavior and overheads on an ARM-based microserver and three different generations of x86 servers. Our findings show that microservers have better power efficiency in the range of 0.68-3.6x with a comparable tail latency.

READ FULL TEXT

page 5

page 7

research
05/29/2018

LaKe: An Energy Efficient, Low Latency, Accelerated Key-Value Store

Key-value store is a popular type of cloud computing applications. The p...
research
11/19/2017

Cyclone: High Availability for Persistent Key Value Stores

Persistent key value stores are an important component of many distribut...
research
04/07/2020

LUDA: Boost LSM Key Value Store Compactions with GPUs

Log-Structured-Merge (LSM) tree-based key value stores are facing critic...
research
09/19/2022

DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (Extended Version)

We present Dinomo, a novel key-value store for disaggregated persistent ...
research
03/13/2019

Power-Performance Tradeoffs in Data Center Servers: DVFS, CPU pinning, Horizontal, and Vertical Scaling

Dynamic Voltage and Frequency Scaling (DVFS), CPU pinning, horizontal, a...
research
10/19/2021

Using RDMA for Efficient Index Replication in LSM Key-Value Stores

Log-Structured Merge tree (LSM tree) Key-Value (KV) stores have become a...
research
01/07/2019

Building Atomic, Crash-Consistent Data Stores with Disaggregated Persistent Memory

Byte-addressable persistent memories (PM) has finally made their way int...

Please sign up or login with your details

Forgot password? Click here to reset