AuroraMiddleware/mimalloc
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update readme.md

Browse Source
This commit is contained in:
Daan 2020-09-14 08:31:20 -07:00 committed by GitHub
parent d6ca70c9cc
commit 0df0c17f5a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
readme.md
View File

@ -36,7 +36,7 @@ It also has an easy way to override the default allocator in [Windows](#override
operations. Free-ing from another thread can now be a single CAS without needing
a sophisticated data structure to coordinate between threads. Since there will be
thousands of separate free lists, contention is naturally distributed over the heap,
and the chance of contending on a single location will be low -- this is quite
and the chance of contending on a single location will be low -- this is quite
similar to randomized algorithms like skip lists where adding
a random oracle removes the need for a more complex algorithm.
- __eager page reset__: when a "page" becomes empty (with increased chance