Basic Information
Combinatorial And Algorithmic Problems Related to Data Access# Command Queues And Rotational Position Optimization, Constrained Data Placement. Analytical Treatment of Indirection Systems# Combinatorial Modeling Of Indirection Systems, Optimal Wear Leveling, Data Placement Via Graph Algorithms. Data Representation- Coding Data For Optimized Access# Write Once Memories, Re-write Codes. Date Reliability# Errors,faults And Their Models, Basic Elements in Combinatorial and Algebraic Error Correcting Coding Theory, , Asymmetric and Unidirectional Errors, Array Codes For Storage Systems, Reliability Analysis of Codes Storage Systems. Open Problems# Combinatorial Theory Problems, Algorithmic Problems. Learning Outcomes# at The End of The Course The Student Will Be 1. Familiar With The Algorithnic and Analytical Techniques That Enable The Design of Modern Storage Devices, Including Non Volatile Memories and Large Scale Storage System. Familiar With A Comprehansive Set of Tools Laying The Foundation For Deep And Effective Research Contribution in The Area of Data Storage.
Faculty: Electrical and Computer Engineering
|Graduate Studies
Pre-required courses
(44268 - Int. to Data Structur and Algorithms and 46267 - Computer Architecture)