intrusive binary tree
hawkw opened this issue · 2 comments
hawkw commented
The current buddy allocator in SOS uses linked lists for free lists. Using a binary tree would likely offer much better performance. We should eventually write one.
hawkw commented
Could be trickier than writing lists. Also, low-priority, as the lists should basically work fine.
hawkw commented
i think if we really want to aggressively optimize data structures (and who doesn't? :D) an intrusive AVL tree is probably a good fit for alloc