kiper220/mimalloc
1
0
Fork 0
mirror of https://github.com/microsoft/mimalloc.git synced 2025-05-04 22:49:32 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix spelling

Browse source
This commit is contained in:
daan 2020-09-23 20:02:24 -07:00
parent 46239cf0c2
commit 1adec58c83
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
readme.md
View file

@ -32,9 +32,9 @@ It also has an easy way to override the default allocator in [Windows](#override
(A mimalloc page contains blocks of one size class and is usually 64KiB on a 64-bit system). (A mimalloc page contains blocks of one size class and is usually 64KiB on a 64-bit system).
- __free list multi-sharding__: the big idea! Not only do we shard the free list - __free list multi-sharding__: the big idea! Not only do we shard the free list
per mimalloc page, but for each page we have multiple free lists. In particular, there per mimalloc page, but for each page we have multiple free lists. In particular, there
is one list for thread-local `free` operatinons, and another separate one for concurrent `free` is one list for thread-local `free` operations, and another one for concurrent `free`
operations. Free-ing from another thread can now be a single CAS without needing 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 sophisticated coordination between threads. Since there will be
thousands of separate free lists, contention is naturally distributed over the heap, 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 similar to randomized algorithms like skip lists where adding