mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-03 22:19:32 +03:00
Update readme.md
Add new benchmark figures
This commit is contained in:
parent
d143bb05bb
commit
d4167b38e1
1 changed files with 12 additions and 5 deletions
17
readme.md
17
readme.md
|
@ -264,11 +264,13 @@ with 128GB ECC memory, running Ubuntu 18.04.1 with LibC 2.27 and GCC 7.3.0.
|
|||
|
||||
The first benchmark set consists of programs that allocate a lot:
|
||||
|
||||

|
||||

|
||||

|
||||
|
||||
Memory usage:
|
||||
|
||||

|
||||

|
||||

|
||||
|
||||
The benchmarks above are (with N=16 in our case):
|
||||
|
||||
|
@ -309,9 +311,6 @@ diffrerences here when running with 16 cores in parallel.
|
|||
The second benchmark tests specific aspects of the allocators and
|
||||
shows more extreme differences between allocators:
|
||||
|
||||

|
||||
|
||||

|
||||
|
||||
The benchmarks in the second set are (again with N=16):
|
||||
|
||||
|
@ -354,6 +353,14 @@ Hoard allocator is specifically designed to avoid this false sharing and we
|
|||
are not sure why it is not doing well here (although it still runs almost 5×
|
||||
faster than tcmalloc and jxmalloc).
|
||||
|
||||
## Benchmarks on a 4-core Intel workstation
|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||
|
||||
# References
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue