Message passing based allocator
Перейти к файлу
Matthew Parkinson 02d2ab8f7e Pagemap requires registration of used space
This PR exposes a pagemap interface to specify ranges that are being
used. The overall invariant is that any memory in the address space
manager has the pagemap committed. This means that individual operations
do not need to commit entries.

This is important for Windows that does not support lazy commit.  It is
also important if we want to PROT_NONE most of the pagemap to reduce the
risk of memory safety issues getting access to the pagemap.

There are minor changes to test to pull memory directly from the Pal.
There are also bug fixes in the pagemap tests.
2021-07-21 09:36:06 +01:00
ci Major refactor of snmalloc (#343) 2021-07-12 15:53:36 +01:00
docs Expose reserve_at_least in all Pals 2021-07-21 09:36:06 +01:00
src Pagemap requires registration of used space 2021-07-21 09:36:06 +01:00
.clang-format Update to use clangformat9 2020-02-06 09:09:32 +00:00
.clang-tidy Add the const parameter checker. 2019-04-30 09:46:10 +01:00
.gitignore Used start of a slab for link. 2019-05-21 09:47:23 +01:00
CMakeLists.txt Major refactor of snmalloc (#343) 2021-07-12 15:53:36 +01:00
LICENSE Initial commit 2019-01-09 06:05:57 -08:00
README.md Separate out building and porting docs. (#260) 2020-11-10 13:33:45 +00:00
azure-pipelines.yml Major refactor of snmalloc (#343) 2021-07-12 15:53:36 +01:00
difference.md Improve slow path performance for allocation (#143) 2020-03-31 09:17:53 +01:00
security.md Update documentation 2020-02-28 09:03:41 +00:00
snmalloc.pdf Add paper. 2019-05-23 15:13:47 +01:00

README.md

snmalloc

snmalloc is a high-performance allocator. snmalloc can be used directly in a project as a header-only C++ library, it can be LD_PRELOADed on Elf platforms (e.g. Linux, BSD), and there is a crate to use it from Rust.

Its key design features are:

  • Memory that is freed by the same thread that allocated it does not require any synchronising operations.
  • Freeing memory in a different thread to initially allocated it, does not take any locks and instead uses a novel message passing scheme to return the memory to the original allocator, where it is recycled. This enables 1000s of remote deallocations to be performed with only a single atomic operation enabling great scaling with core count.
  • The allocator uses large ranges of pages to reduce the amount of meta-data required.
  • The fast paths are highly optimised with just two branches on the fast path for malloc (On Linux compiled with Clang).
  • The platform dependencies are abstracted away to enable porting to other platforms.

snmalloc's design is particular well suited to the following two difficult scenarios that can be problematic for other allocators:

  • Allocations on one thread are freed by a different thread
  • Deallocations occur in large batches

Both of these can cause massive reductions in performance of other allocators, but do not for snmalloc.

Comprehensive details about snmalloc's design can be found in the accompanying paper, and differences between the paper and the current implementation are described here. Since writing the paper, the performance of snmalloc has improved considerably.

Build Status

Further documentation

Contributing

This project welcomes contributions and suggestions. Most contributions require you to agree to a Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us the rights to use your contribution. For details, visit https://cla.microsoft.com.

When you submit a pull request, a CLA-bot will automatically determine whether you need to provide a CLA and decorate the PR appropriately (e.g., label, comment). Simply follow the instructions provided by the bot. You will only need to do this once across all repos using our CLA.

This project has adopted the Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact opencode@microsoft.com with any additional questions or comments.