| 01-09-2004, 01:57 PM | #46 |
A binary tree could probably increase the efficiency but it will definitely require larger minimum sizes for the allocations. It would also require one additional information at each node: The largest amount of memory, you will find in the left side of the tree. Also a mean to prevent degenerating of the tree is needed, something like AVL-trees. But if implemented good it might be able to even find the most fitting free space for the requested allocation. The boolean array will not be needed all the time as you can easily build it in the merging algorithm itself. |