Anonymous user
Page Frame Allocation: Difference between revisions
Jump to navigation
Jump to search
m
No period is required at the start of the section name
| [unchecked revision] | [unchecked revision] |
m (s/dword/uint32_t/g) |
m (No period is required at the start of the section name) |
||
Line 65:
[[Image:Flat_list.png]]
===Tree-based approach
Since it is frequent that the list is searched for a given address or a given size, it may be interesting to use more efficient data structures. One of them that still keeps the ability of traversing the whole list is the AVL Tree. Each "node" in the AVL tree will describe a memory region and has pointer to the subtree of lower nodes and to the subtree of higher nodes.
| |||