|Title:||Evaluating Zigzag Code in a Distributed Storage System
|Supervisors:||Gala Yadgar, Eitan Yaakobi, Assaf Schuster
|Abstract:||This gap between theory and practice has been observed in previous studies that applied theoretically optimal techniques to real systems. In this paper, we present a novel system-level approach to bridging this gap in the context of reducing recovery costs. We optimize the sequentiality of the data read, at the cost of a minor increase in its amount. We use Zigzag - a family of erasure codes with minimal overhead and optimal recovery - and trade its theoretical optimality for real performance gains. Our implementation of Zigzag and its optimizations in Ceph reduces recovery costs with two, three and four parity nodes, for large and small objects alike. We could cut down recovery time by up to 28% compared to that of Reed-Solomon, and to reduce the amount of data read and transferred by 18% to 39%.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2017/MSC/MSC-2017-13), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the MSC technical reports of 2017
To the main CS technical reports page
Computer science department, Technion