summaryrefslogtreecommitdiff
path: root/doc/mimalloc-doc.h
diff options
context:
space:
mode:
authorDaan Leijen <daan@microsoft.com>2022-04-14 16:28:05 -0700
committerDaan Leijen <daan@microsoft.com>2022-04-14 16:28:05 -0700
commit0b72d8a2ef791674ac3cbab7910546cf2833e6c1 (patch)
tree15848f7f6fb1a7bbab18a2ac464f951c520512d0 /doc/mimalloc-doc.h
parentca0bac743da2bee23f2284dc63caaa6dd7ae621c (diff)
update readme for v1.7.6 release
Diffstat (limited to 'doc/mimalloc-doc.h')
-rw-r--r--doc/mimalloc-doc.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/mimalloc-doc.h b/doc/mimalloc-doc.h
index ea2a1ad..e0f1cae 100644
--- a/doc/mimalloc-doc.h
+++ b/doc/mimalloc-doc.h
@@ -56,7 +56,7 @@ Notable aspects of the design include:
- __first-class heaps__: efficiently create and use multiple heaps to allocate across different regions.
A heap can be destroyed at once instead of deallocating each object separately.
- __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 12.5% waste in allocation sizes),
+ times (_wcat_), bounded space overhead (~0.2% meta-data, with low internal fragmentation),
and has no internal points of contention using only atomic operations.
- __fast__: In our benchmarks (see [below](#performance)),
_mimalloc_ outperforms all other leading allocators (_jemalloc_, _tcmalloc_, _Hoard_, etc),