Back to Results
First PageMeta Content
Reed–Solomon error correction / Erasure code / Linear code / Systematic code / Code / Telecommunications engineering / Coding theory / Notation / Mathematics


Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth KV Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, and Kannan Ramchandran, University of California, Berkel
Add to Reading List

Document Date: 2015-06-10 01:10:30

Open Document

File Size: 563,77 KB

Share Result on Facebook

City

Santa Clara / /

Company

Amazon / Intel / Facebook / /

Country

United States / /

Facility

Kannan Ramchandran University of California / University of California / /

IndustryTerm

distributed storage systems / assignment algorithm / generation network / individual storage devices / helper assignment algorithm / storage network / low churn systems / savings in network / storage systems / /

Organization

University of California / Berkeley / USENIX Association / Kannan Ramchandran University / /

Position

Prime Minister / /

ProgrammingLanguage

C++ / /

ProvinceOrState

California / /

Technology

87 Algorithm / PM-vanilla code using Algorithm / assignment algorithm / 2 Algorithm / Storage Technologies / Kleitman-Wang algorithm / helper assignment algorithm / data warehouse / 4 Optimizing RBT-Helper Assignment In Algorithm / Xeon E5-2670v2 processor / 1 Algorithm / /

URL

www.usenix.org/conference/fast15/technical-sessions/presentation/rashmi / /

SocialTag