Technical Program

Paper Detail

Paper Title On the I/O Costs in Repairing Short-Length Reed-Solomon Codes
Paper IdentifierTU3.R4.5
Authors Weiqi Li, University of California, Irvine, United States; Son Hoang Dau, RMIT University, Australia; Zhiying Wang, Hamid Jafarkhani, University of California, Irvine, United States; Emanuele Viterbo, Monash University, Australia
Session Reed-Solomon and MDS Codes
Location Odéon, Level 3
Session Time Tuesday, 09 July, 14:30 - 16:10
Presentation Time Tuesday, 09 July, 15:50 - 16:10
Manuscript  Click here to download the manuscript
Abstract Minimizing the repair bandwidth, i.e., the amount of information from the helper nodes needed for recovering the content of one failed node in an erasure-coded distributed storage system, has been the focus of many works in the literature. We investigate another important performance metric, namely the I/O cost, which specifies the amount of information that needs to be read by the helper nodes during the repair process of one failed node. We analyze the I/O costs of a few known repair schemes for Reed-Solomon codes of various lengths, in contrast to the previous works in this direction, which only studied the I/O costs in repairing full-length Reed-Solomon codes.