Alternatives and similar repositories for lrmalloc:

Users that are interested in lrmalloc are comparing it to the libraries listed below

• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆30Updated 7 months ago
• dexter0 / prs
  Portable Runtime System
  ☆23Updated 8 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆62Updated last year
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆46Updated 5 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆13Updated 10 months ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 8 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆43Updated 11 years ago
• qlibs / swar
  C++20 SIMD Within A Register library
  ☆28Updated 4 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆120Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆37Updated 4 years ago
• pabloariasal / couring
  C++20 Coroutines and io_uring
  ☆47Updated 2 years ago
• ARM-software / progress64
  PROGRESS64 is a C library of scalable functions for concurrent programs, primarily focused on networking applications.
  ☆74Updated last week
• mpoeter / emr
  Effective Memory Reclamation
  ☆53Updated 4 years ago
• DolevAdas / Jiffy
  ☆43Updated 4 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• mars-research / DRAMHiT
  ☆28Updated this week
• ljestrada / charconvutils
  C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…
  ☆8Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆26Updated last year
• boostorg / boost_unordered_benchmarks
  ☆17Updated 2 months ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆74Updated 3 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆15Updated 2 years ago
• amdn / itoa
  World's fastest integer to ASCII conversion, C++14 template meta-programming implementation, any size integer 8,16,32,64-bit, signed or u…
  ☆27Updated 8 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• qlibs / mem
  C++20 Memory Allocators
  ☆31Updated 4 months ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago