37089980
Description
Mind Map by Angelica Cordero, updated more than 1 year ago
|
Created by Angelica Cordero
over 3 years ago
|
|
Memory Management and B-Trees
- Memory Management
- In order to run programs and store
information, the computer’s memory must
be managed so as to determine what data
is stored in what memory cells.
- Allocating Space in
the Memory Heap
- Dynamic Memory
Allocation
- The Memory
Heap
- Dynamic Memory
Allocation
- Garbage Collection
- The Mark-Sweep
Algorithm
- Performing
DFS In-Place
- The Mark-Sweep
Algorithm
- Allocating Space in
the Memory Heap
- In order to run programs and store
information, the computer’s memory must
be managed so as to determine what data
is stored in what memory cells.
- Memory Hierarchies and Caching
- Memory Systems
- Caching Strategies
- Memory Systems
- External Searching and B-Trees
- (a,b) Trees
- Multiway search tree such
that each node has
between a and b children
and stores between a−1
and b−1 entries.
- Multiway search tree such
that each node has
between a and b children
and stores between a−1
and b−1 entries.
- B-Trees
- A version of the (a,b) tree
data structure, which is
the best-known method
for maintaining a map in
external memory.
- A version of the (a,b) tree
data structure, which is
the best-known method
for maintaining a map in
external memory.
- (a,b) Trees
- External-Memory Sorting
- Multiway Merge-Sort
- The main idea behind
this variation is to merge
many recursively sorted
lists at a time, thereby
reducing the number of
levels of recursion.
- The main idea behind
this variation is to merge
many recursively sorted
lists at a time, thereby
reducing the number of
levels of recursion.
- Multiway Merge-Sort
Media attachments
Want to create your own Mind Maps for free with GoConqr? Learn more.