update readme
This commit is contained in:
parent
77be9df1d8
commit
e33c1521a6
@ -27,13 +27,13 @@ Notable aspects of the design include:
|
||||
many smaller lists per memory "page" which both reduces fragmentation
|
||||
and increases locality --
|
||||
things that are allocated close in time get allocated close in memory.
|
||||
(A memory "page" in mimalloc contains blocks of one size class and is
|
||||
usually 64KB on a 64-bit system).
|
||||
(A memory "page" in _mimalloc_ contains blocks of one size class and is
|
||||
usually 64KiB on a 64-bit system).
|
||||
- __eager page reset__: when a "page" becomes empty (with increased chance
|
||||
due to free list sharding) the memory is marked to the OS as unused ("reset" or "purged")
|
||||
reducing (real) memory pressure and fragmentation, especially in long running
|
||||
programs.
|
||||
- __secure__: mimalloc can be build in secure mode, adding guard pages,
|
||||
- __secure__: _mimalloc_ can be build in secure mode, adding guard pages,
|
||||
randomized allocation, encrypted free lists, etc. to protect against various
|
||||
heap vulnerabilities. The performance penalty is only around 3% on average
|
||||
over our benchmarks.
|
||||
|
Loading…
Reference in New Issue
Block a user