Lecture Videos
Session 7: Memory Hierarchy Models
Description: Cache-efficient structures. B-trees are good at data transferred in blocks between cache and main memory, main memory and disk, and so on, achieving O(logB N) insert/delete/predecessor/successor for N items and memory block transfers of size B.
Speaker: Prof. Erik Demaine
Course Info
Instructor
Departments
As Taught In
Spring
2012
Level
Course Info
Instructor
Departments
As Taught In
Spring
2012
Level
Learning Resource Types
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
