OffsetAllocator
Fast O(1) offset allocator with minimal fragmentation (by sebbbi)
streamflow
Lock-free multithreaded memory allocation (by scotts)
| OffsetAllocator | streamflow | |
|---|---|---|
| 1 | 2 | |
| 702 | 103 | |
| - | - | |
| 0.0 | - | |
| about 1 month ago | over 7 years ago | |
| C++ | C | |
| MIT License | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
OffsetAllocator
Posts with mentions or reviews of OffsetAllocator.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-05-01.
-
Fast, simple, hard real time allocator for Rust
https://github.com/sebbbi/OffsetAllocator
which has links to a pertinent paper at the end of that page.
streamflow
Posts with mentions or reviews of streamflow.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-05-01.
-
Fast, simple, hard real time allocator for Rust
This function is O(1): https://github.com/scotts/streamflow/blob/master/streamflow..... All other tree operations are also constant, because the fact that it is a 3-level tree is hardcoded.
Asymptotic bounds are useful when your input can grow arbitrarily large. When your input is fixed, the bounds become less useful and you should focus on the particulars of your case. In the case I'm presenting, the work done traversing the tree will be the same every time; it is O(1). That doesn't necessarily mean it's fast enough! It still may do too much work for the use case. For instance, I can imagine someone saying that the function above does too much pointer chasing for their use case.