Fast Erasure Coding for Data Storage - A Comprehensive Study of the Acceleration Techniques

Fast Erasure Coding for Data Storage - A Comprehensive Study of the Acceleration Techniques

USENIX via YouTube Direct link

Choice of Cauchy Matrix

16 of 25

16 of 25

Choice of Cauchy Matrix

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Fast Erasure Coding for Data Storage - A Comprehensive Study of the Acceleration Techniques

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Data Reliability
  3. 3 Replication - Erasure Code
  4. 4 Acceleration Techniques
  5. 5 Cauchy Reed-Solomon Codes
  6. 6 Fast GF Ops - Binary Representation
  7. 7 Techniques Tiers
  8. 8 Bitmatrix Normalization (BN)
  9. 9 Smart Scheduling (SS)
  10. 10 Scheduling - Cache Optimization (S-CO)
  11. 11 Vectorization
  12. 12 Question to Answer
  13. 13 Individual Techniques
  14. 14 Optimization Tiers
  15. 15 Combinations (ij)-strategy
  16. 16 Choice of Cauchy Matrix
  17. 17 Cost Function Improvement
  18. 18 Proposed Coding Procedure
  19. 19 Testing Setup
  20. 20 Encoding v.s. Efficient RS/CRS code
  21. 21 Encoding v.s. Three Parities Codes
  22. 22 Encoding v.s. Two Parities Codes
  23. 23 Overall Encoding Improvement
  24. 24 Decoding Throughput
  25. 25 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.