<html><head><style type='text/css'>p { margin: 0; }</style></head><body><div style='font-family: arial,helvetica,sans-serif; font-size: 12pt; color: #000000'><b>Local erasure coding for data storage</b>
<br>
<b><a href="http://research.microsoft.com/en-us/people/yekhanin/">Sergey Yekhanin</a></b>, Microsoft Research<br>Wednesday, October 23- 4:30pm<br>Computer Science 105<br>
<br>
Historically, most large distributed storage systems (e.g., Hotmail)
have been using replication to provide reliability against machine
failures. Today however as the amount of stored data reaches multiple
Exabytes keeping few copies of data around is becoming prohibitively
expensive. Therefore more and more systems are adopting erasure coding
in place of replication.<br><br><p>
Local Reconstruction Codes (LRCs) are a new class of erasure correcting
codes designed specifically for applications in data storage. Built upon
the rich mathematical theory of locally decodable codes developed in
the theory community, LRCs provide high level of reliability and allow
data fragments to be reconstructed quickly in typical failure scenarios.
LRCs have been recently deployed by Windows Azure Storage and are going
to ship in Windows 8.1 and Windows Server 2012. <br></p><p><br></p><p>
In this talk we will discuss motivation behind local reconstruction
codes and cover the main technical challenges and tradeoffs in the
design of these codes.</p><p><br>
</p>
(Based on joint papers with Brad Calder, Michael Forbes, Parikshit
Gopalan, Cheng Huang, Bob Jenkins, Jin Li, Aaron Ogus, Huseyin Simitci,
and Yikang Xu.)
<div><br><span name="x"></span><br></div><br></div></body></html>