Session 7: Memory Hierarchy Models

Name: Session 7: Memory Hierarchy Models
Uploaded: 2013-12-18T17:23:39Z
Duration: 1 h 22 min 54 s
Description: 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

1:22:54

Up Next

Session 8: Cache-Oblivious Structures I

Continue

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