Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

intrusive binary tree #32

Open
hawkw opened this issue Jan 30, 2018 · 2 comments
Open

intrusive binary tree #32

hawkw opened this issue Jan 30, 2018 · 2 comments

Comments

@hawkw
Copy link
Member

hawkw commented Jan 30, 2018

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 hawkw added this to the intruder_alarm 0.2.0 milestone Jan 30, 2018
@hawkw
Copy link
Member Author

hawkw commented Jan 30, 2018

Could be trickier than writing lists. Also, low-priority, as the lists should basically work fine.

@hawkw
Copy link
Member Author

hawkw commented Jan 31, 2018

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant