kiper220/mimalloc
1
0
Fork 0
mirror of https://github.com/microsoft/mimalloc.git synced 2025-05-06 23:39:31 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

add security to readme

Browse source
This commit is contained in:
daan 2019-06-19 17:00:31 -07:00
parent 1df1d51333
commit b30d17d250
1 changed files with 6 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
readme.md
View file

@ -36,11 +36,17 @@ Notable aspects of the design include:
- __lazy initialization__: pages in a segment are lazily initialized so - __lazy initialization__: pages in a segment are lazily initialized so
no memory is touched until it becomes allocated, reducing the resident no memory is touched until it becomes allocated, reducing the resident
memory and potential page faults. memory and potential page faults.
- __secure__: mimalloc can be build in secure mode, adding guard pages,
randomized allocation, encoded free lists, etc. to protect against various
heap vulnerabilities. The performance penalty is only around 3% on average
over our benchmarks.
- __bounded__: it does not suffer from _blowup_ \[1\], has bounded worst-case allocation - __bounded__: it does not suffer from _blowup_ \[1\], has bounded worst-case allocation
times (_wcat_), bounded space overhead (~0.2% meta-data, with at most 16.7% waste in allocation sizes), times (_wcat_), bounded space overhead (~0.2% meta-data, with at most 16.7% waste in allocation sizes),
and has no internal points of contention using atomic operations almost and has no internal points of contention using atomic operations almost
everywhere. everywhere.
You can read more on the design of mimalloc in the upcoming technical report.
Enjoy! Enjoy!
# Building # Building