Write-Optimized Dynamic Hashing for Persistent Memory

Write-Optimized Dynamic Hashing for Persistent Memory

USENIX via YouTube Direct link

Conclusion

16 of 19

16 of 19

Conclusion

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Write-Optimized Dynamic Hashing for Persistent Memory

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

  1. 1 Intro
  2. 2 Background: Static Hashing
  3. 3 Insertion Latency CDF
  4. 4 Disk-based Extendible Hashing
  5. 5 Extendible Hashing - Insertion
  6. 6 Extendible Hashing - Bucket Split
  7. 7 Extendible Hashing - Directory doubling
  8. 8 Persistent Memory
  9. 9 Challenge in In-Memory Extendible Hashing
  10. 10 Segment: Intemediate Level
  11. 11 Recovery: Split History Buddy Tree in CCEH
  12. 12 Segment Split: Legacy CoW
  13. 13 Segment Split: Lazy Deletion
  14. 14 Experimental Setup
  15. 15 CCEH VS Legacy Extendible Hash
  16. 16 Conclusion
  17. 17 Question?
  18. 18 Insertion Performance Breakdown
  19. 19 Load Factor

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.