Completed
Red Black Trees Results
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Optimizing Systems for Byte-Addressable NVM by Reducing Bit Flipping
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction
- 2 ByteAddressable NVM
- 3 Do we do it in software or hardware
- 4 Is this something we can do
- 5 Data Structures
- 6 XOR Linked Lists
- 7 Least Significant Bit
- 8 RedBlack Tree
- 9 Evaluation Criteria
- 10 Prior Work
- 11 Warmup Results
- 12 XOR Linked List Results
- 13 Hash Table Results
- 14 Red Black Trees Results
- 15 Layer 2 Cache Effects
- 16 Hash Table Performance
- 17 Conclusion
- 18 Real Hardware
- 19 Questions
