TY - GEN
T1 - Erasure Correction of Scalar Codes in the Presence of Stragglers
AU - Raviv, Netanel
AU - Cassuto, Yuval
AU - Cohen, Rami
AU - Schwartz, Moshe
N1 - Publisher Copyright: © 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - Recent advances in coding for distributed storage systems have reignited the interest in scalar codes over extension fields. In parallel, the rise of large-scale distributed systems has motivated the study of computing in the presence of stragglers, i.e., servers that are slow to respond or unavailable. This paper addresses storage systems that employ linear codes over extension fields. A common task in such systems is the reconstruction of the entire dataset using sequential symbol transmissions from multiple servers, which are received concurrently at a central data collector. However, a key bottleneck in the reconstruction process is the possible presence of stragglers, which may result in excessive latency. To mitigate the straggler effect, the reconstruction should be possible given any sufficiently large set of sequentially received symbols, regardless of their source. In what follows, an algebraic framework for this scenario is given, and a number of explicit constructions are provided. Our main result is a construction that uses a recursive composition of generalized Reed-Solomon codes over smaller fields. In addition, we show links of this problem to Gabidulin codes and to universally decodable matrices.
AB - Recent advances in coding for distributed storage systems have reignited the interest in scalar codes over extension fields. In parallel, the rise of large-scale distributed systems has motivated the study of computing in the presence of stragglers, i.e., servers that are slow to respond or unavailable. This paper addresses storage systems that employ linear codes over extension fields. A common task in such systems is the reconstruction of the entire dataset using sequential symbol transmissions from multiple servers, which are received concurrently at a central data collector. However, a key bottleneck in the reconstruction process is the possible presence of stragglers, which may result in excessive latency. To mitigate the straggler effect, the reconstruction should be possible given any sufficiently large set of sequentially received symbols, regardless of their source. In what follows, an algebraic framework for this scenario is given, and a number of explicit constructions are provided. Our main result is a construction that uses a recursive composition of generalized Reed-Solomon codes over smaller fields. In addition, we show links of this problem to Gabidulin codes and to universally decodable matrices.
UR - http://www.scopus.com/inward/record.url?scp=85052486670&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ISIT.2018.8437322
DO - https://doi.org/10.1109/ISIT.2018.8437322
M3 - منشور من مؤتمر
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1983
EP - 1987
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -