Erasure coding for data storage
1,298 views · Published 13 April 2016 · 1:26:00 · Indexed 20 November 2026
Channel: ФКН НИУ ВШЭ · 2016 · Education
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 Zettabytes keeping few copies of data around is prohibitively expensive. Therefore more and more systems are adopting erasure coding in place of replication. Coding for distributed storage has some unique challenges and trade-offs. In this talk, we review the state of the art in erasure codes for distributed storage. Speaker: Sergey Yekhanin, Microsoft Research. Workshop on Theoretical Computer Science 2016: https://cs.hse.ru/en/big-data/tcs-lab/tcs2016/ Faculty of Computer Science: https://cs.hse.ru/en/ Follow us: https://www.facebook.com/hsefcs, https://twitter.com/CS_HSE
More from this channel
-
1:18:31
[Коллоквиум]: On scale invariance, multifractal formalism, and their applications
-
1:09:43
[Коллоквиум]: Resourse Allocation in the Cloud - Assaf Schuster, Techion
-
1:08:04
[ИТ-лекторий] Занимательная прикладная аналитика в Яндексе
-
1:17:41
[Коллоквиум]: Probabilistic graphical models: Factor graphs and more
-
1:05:46
[Коллоквиум]: Process Mining: Data Science in Action - Wil van der Aalst
-
2:18
[Презентация факультета в ДК ЗИЛ]: Григорий Бакунов, директор по распрост. инф. технологий Яндекс
-
2:55
[Презентация факультета в ДК ЗИЛ]: Григорий Канторович, проректор по работе с абитуриентами ВШЭ
-
11:34
[Презентация факультета в ДК ЗИЛ]: Иван Аржанцев, декан факультета компьютерных наук