Joint latency and cost optimization for erasurecoded data center storage

Abstract

Abstract-Modern distributed storage systems offer large capacity to satisfy the exponentially increasing need of storage space. They often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. This paper provides an insightful upper bound on the average service delay of such erasure-coded storage with arbitrary service time distribution and consisting of multiple heterogeneous files. Not only does the result supersede known delay bounds that only work for a single file or homogeneous files, it also enables a novel problem of joint latency and storage cost minimization over three dimensions: selecting the erasure code, placement of encoded chunks, and optimizing scheduling policy. The problem is efficiently solved via the computation of a sequence of convex approximations with provable convergence. We further prototype our solution in an open-source, cloud storage deployment over three geographically distributed data centers. Experimental results validate our theoretical delay analysis and show significant latency reduction, providing valuable insights into the proposed latency-cost tradeoff in erasure-coded storage.

Sprout: A Functional Caching Approach to Minimize Service Latency in Erasure-Coded Storage

“…In these systems, the rapid growth of data traffic such as those generated by online video streaming, Big Data analytics, social networking and E-commerce activities has put a significant burden on the underlying networks of datacenter storage systems. Many researchers have begun to focus on latency analysis in erasure coded storage systems [7][8][9][10][11][12][13][14] and to investigate algorithms for joint latency optimization and resource management [12,[14][15][16][17][18].…”

Optimal Server Selection for Straggler Mitigation

“…To compute the mean server utilization cost for t 1 c, we substitute m = 1 in the equation (16). For t 1 < c, we need to evaluate the integral t1+c t1F k S1 (t)dt.…”

Managing Response Time Tails by Sharding

“…A number of recent works have studied the effectiveness of coding on latency reduction in (N , K) partial-join queues [4,8,9,22,31,35]. In one variant, each job creates K tasks, which can be served by any K out of the N servers, and departs only after all its tasks complete service [8,35].…”