Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly

Bo Bai; Gong Zhang; Liang Chen; Ting-Yi Wu; Xiang Wu; Yunghsiang S. Han; Zhengrui Li

arxiv: 2102.02436 · v1 · pith:26SKVIRFnew · submitted 2021-02-04 · 💻 cs.IT · math.IT

Lower Bound on the Optimal Access Bandwidth of (K+2,K,2)-MDS Array Code with Degraded Read Friendly

Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu This is my paper

classification 💻 cs.IT math.IT

keywords arraycodeaccessbandwidthbounddegradedfriendlylower

0 comments

read the original abstract

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discussed. For the DRF MDS array code with 2 redundant nodes and the sub-packetization level of 2, the lower bound of its access bandwidth is derived.

This paper has not been read by Pith yet.

Lower Bound on the Optimal Access Bandwidth of (K+2,K,2)-MDS Array Code with Degraded Read Friendly

discussion (0)