Patent attributes
Techniques for memory management are described. A memory management data structure may include a tree structure of nodes each representing a free memory portion of a size used as a key value. The tree may be a modified AVL tree with nodes sorted based on key values corresponding to free memory portion sizes. The data structure may include a first list representing a memory map corresponding to different memory portions where each entry of the first list represents a memory portion with an associated memory address range that is not contiguous with respect to any other memory address range of any other memory portion represented by an entry on the first list. Each entry of the first list representing a free memory portion may be associated with a node of the tree structure.
