Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores

Z Wang, J Zhao, K Agrawal, H Liu, M Xu… - Proceedings of the 28th …, 2023 - dl.acm.org
Distributed storage systems are used widely in clouds, databases, and file systems. These
systems store a large amount of data across multiple servers. When a request to access data …

Compact, popularity-aware and adaptive hybrid data placement schemes for heterogeneous cloud storage

Y Gao, K Li, Y Jin - IEEE Access, 2017 - ieeexplore.ieee.org
Cloud storage systems frequently have a large user base that requires huge cloud
resources. Sometimes, cloud devices become overloaded because of an imbalance in …

{In-Memory}{Key-Value} Store Live Migration with {NetMigrate}

Z Zhu, Y Zhao, Z Liu - 22nd USENIX Conference on File and Storage …, 2024 - usenix.org
Distributed key-value stores today require frequent key-value shard migration between
nodes to react to dynamic workload changes for load balancing, data locality, and service …

Optimal data placement for heterogeneous cache, memory, and storage systems

L Zhang, R Karimi, I Ahmad, Y Vigfusson - Proceedings of the ACM on …, 2020 - dl.acm.org
New memory technologies are blurring the previously distinctive performance characteristics
of adjacent layers in the memory hierarchy. No longer are such layers orders of magnitude …

Syncmesh: improving data locality for function-as-a-service in meshed edge networks

D Habenicht, K Kreutz, S Becker, J Bader… - Proceedings of the 5th …, 2022 - dl.acm.org
The increasing use of Internet of Things devices coincides with more communication and
data movement in networks, which can exceed existing network capabilities. These devices …

Violinn: Proximity-aware edge placementwith dynamic and elastic resource provisioning

K Toczé, AJ Fahs, G Pierre… - ACM Transactions on …, 2023 - dl.acm.org
Deciding where to handle services and tasks, as well as provisioning an adequate amount
of computing resources for this handling, is a main challenge of edge computing systems …

A learning-based data placement framework for low latency in data center networks

K Liu, J Peng, J Wang, B Yu, Z Liao… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Low-latency data service is an increasingly critical challenge for data center applications. In
modern distributed storage systems, proper data placement helps reduce the data …

A correlation-aware data placement strategy for key-value stores

R Vilaça, R Oliveira, J Pereira - … and Interoperable Systems: 11th IFIP WG …, 2011 - Springer
Key-value stores hold the unprecedented bulk of the data produced by applications such as
social networks. Their scalability and availability requirements often outweigh sacrificing …

Learning-based adaptive data placement for low latency in data center networks

K Liu, J Wang, Z Liao, B Yu… - 2018 IEEE 43rd …, 2018 - ieeexplore.ieee.org
Low-latency data access is an important challenge for data center networks. Proper
placement of the data items can reduce the data travel time in the distributed storage …

C-hint: An effective and reliable cache management for rdma-accelerated key-value stores

Y Wang, X Meng, L Zhang, J Tan - … of the ACM Symposium on Cloud …, 2014 - dl.acm.org
Recently, many in-memory key-value stores have started using a High-Performance network
protocol, Remote Direct Memory Access (RDMA), to provision ultra-low latency access …