Alternatives and similar repositories for memory-landscape:

Users that are interested in memory-landscape are comparing it to the libraries listed below

• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆17Updated 4 years ago
• bpowers / mstat
  fine-grained, cgroup-based tool for profiling memory usage over time of a process tree
  ☆46Updated 9 months ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• boostorg / boost_unordered_benchmarks
  ☆19Updated 5 months ago
• goodell / cppmem
  totally unofficial git repo containing sources for the CppMem tool available at http://svr-pes20-cppmem.cl.cam.ac.uk/cppmem/help.html and…
  ☆26Updated 12 years ago
• jonatanlinden / PR
  A lock-free priority queue implementation
  ☆34Updated 6 years ago
• usi-systems / freud
  Freud, a tool to create Performance Annotations for C/C++ programs
  ☆21Updated 8 months ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• deater / deterministic
  code for examining determinism of performance counters
  ☆21Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• jemalloc / jemalloc-experiments
  Performance testing or system benchmarks for jemalloc
  ☆32Updated last year
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆39Updated 10 months ago
• emeryberger / dthreads
  dthreads: Efficient Deterministic Multithreading
  ☆51Updated 10 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• b-shi / PMC-PMI
  Performance Counter Measurements at the cycle granularity
  ☆18Updated 3 years ago