On the Latency and Energy Efficiency of Erasure-Coded Cloud Storage Systems
Akshay Kumar, Ravi Tandon, T. Charles Clancy

TL;DR
This paper analyzes how erasure coding affects latency and energy efficiency in heterogeneous distributed storage systems, showing that coding can reduce latency and improve energy efficiency through a queuing theoretic approach and simulations.
Contribution
It introduces a model for heterogeneous DSS with erasure coding, linking energy efficiency to average latency, and provides bounds and insights through analysis and simulations.
Findings
Erasure coding reduces average latency in DSS.
Coding improves energy efficiency by lowering latency.
System parameters significantly impact performance and energy use.
Abstract
The increase in data storage and power consumption at data-centers has made it imperative to design energy efficient Distributed Storage Systems (DSS). The energy efficiency of DSS is strongly influenced not only by the volume of data, frequency of data access and redundancy in data storage, but also by the heterogeneity exhibited by the DSS in these dimensions. To this end, we propose and analyze the energy efficiency of a heterogeneous distributed storage system in which storage servers (disks) store the data of distinct classes. Data of class is encoded using a erasure code and the (random) data retrieval requests can also vary across classes. We show that the energy efficiency of such systems is closely related to the average latency and hence motivates us to study the energy efficiency via the lens of average latency. Through this connection, we show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cloud Computing and Resource Management · Caching and Content Delivery
