7. Memory Hierarchy Models

Описание к видео 7. Memory Hierarchy Models

MIT 6.851 Advanced Data Structures, Spring 2012
View the complete course: http://ocw.mit.edu/6-851S12
Instructor: Erik Demaine

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.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Комментарии

Информация по комментариям в разработке

Похожие видео