Mathematical Foundations of Data Storage Systems

Description: Lecture, four hours; discussion, one hour; outside study, seven hours. Requisite: course 131A or equivalent. Research developments in new mathematical techniques for emerging large-scale, ultra-reliable, fast, and affordable data storage systems. Topics include, but are not limited to, graph-based codes and algebraic codes and decoders for modern storage devices (e.g., Flash), rank modulation, rewriting codes, algorithms for data deduplication and synchronization, and redundant array of independent disks (RAID) systems. Letter grading.

Units: 4.0
1 of 1
Overall Rating 4.0
Easiness 3.0/ 5
Clarity 4.0/ 5
Workload 4.0/ 5
Helpfulness 4.0/ 5
Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
1 of 1

Adblock Detected

Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate annoying ads just as much as you do, but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so please consider disabling your ad-blocking software while using this site.

Thank you for supporting us!