On adaptive distributed storage systems based on functional MSR code

Sonowal, Mridupawan; Kumar, Brijesh

doi:10.1109/wispnet.2017.8299774

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To prove this, we will show that any optimal assignment to the variables k i,j can be modified to be of the proposed form, without decreasing the value of the objective s. Firstly, it is straightforward to check that there exists a feasible assignment to the variables k i,j that satisfies the statement. Conversion procedure from [6,5] to [13,12] (λ I = 12 and λ F = 5). Read access cost is 18 compared to 60 in the default approach (70% savings).…”

Section: B Access Cost Lower Bound For the General Regimementioning

confidence: 99%

See 1 more Smart Citation

Access-optimal Linear MDS Convertible Codes for All Parameters

Maturana

Mukka

Rashmi

2020

Preprint

View full text Add to dashboard Cite

In large-scale distributed storage systems, erasure codes are used to achieve fault tolerance in the face of node failures. Tuning code parameters to observed failure rates has been shown to significantly reduce storage cost. Such tuning of redundancy requires code conversion, i.e., a change in code dimension and length on already encoded data. Convertible codes [1] are a new class of codes designed to perform such conversions efficiently. The access cost of conversion is the number of nodes accessed during conversion.Existing literature has characterized the access cost of conversion of linear MDS convertible codes only for a specific and small subset of parameters. In this paper, we present lower bounds on the access cost of conversion of linear MDS codes for all valid parameters. Furthermore, we show that these lower bounds are tight by presenting an explicit construction for access-optimal linear MDS convertible codes for all valid parameters. En route, we show that, one of the degrees-of-freedom in the design of convertible codes that was inconsequential in the previously studied parameter regimes, turns out to be crucial when going beyond these regimes and adds to the challenge in the analysis and code construction.This work was funded in part by an NSF CAREER award (CAREER-1943409) and a Google faculty research award. We thank Michael Rudow for his suggestions in the writing of this paper.F. Maturana and K. V. Rashmi are with the

show abstract

Section: B Access Cost Lower Bound For the General Regimementioning

confidence: 99%

“…2. Conversion procedure from [13,12] to [6,5] (λ I = 5 and λ F = 12). Read access cost is 40, compared to 60 in the default approach (33.3% savings in read access cost).…”

Section: B Access Cost Lower Bound For the General Regimementioning

confidence: 99%