3party/mimalloc
0
0
Fork 0
mirror of https://github.com/microsoft/mimalloc.git synced 2024-12-27 13:33:18 +08:00
Code Issues Projects Releases Wiki Activity

add reference to the technical report

Browse Source
This commit is contained in:
Daan 2019-06-21 08:46:03 -07:00 committed by GitHub
parent 644f59fad7
commit 69efa50a0d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
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

@ -47,7 +47,7 @@ Notable aspects of the design include:
and usually uses less memory (up to 25% more in the worst case). A nice property
is that it does consistently well over a wide range of benchmarks.
You can read more on the design of _mimalloc_ in the upcoming technical report
You can read more on the design of _mimalloc_ in the [technical report](https://www.microsoft.com/en-us/research/publication/mimalloc-free-list-sharding-in-action)
which also has detailed benchmark results.
Enjoy!
@ -252,7 +252,7 @@ suffering from underperformance in less common situations (which is what
the second half of our benchmark set tests for).
We show here only the results on an AMD EPYC system (Apr 2019) -- for
specific details and further benchmarks we refer to the technical report.
specific details and further benchmarks we refer to the [technical report](https://www.microsoft.com/en-us/research/publication/mimalloc-free-list-sharding-in-action).
The benchmark suite is scripted and available separately
as [mimalloc-bench](https://github.com/daanx/mimalloc-bench).