Alternatives and similar repositories for c-minheap-array

Users that are interested in c-minheap-array are comparing it to the libraries listed below

• silentbicycle / skiparray
  unrolled skip list library for C
  ☆22Updated 6 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆29Updated 11 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆56Updated 10 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 6 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 9 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆184Updated last year
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆80Updated 10 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• darkautism / lfqueue
  Minimize lock-free queue ever!
  ☆134Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆141Updated 2 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆90Updated 4 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 5 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆53Updated 4 years ago
• etherealvisage / avl
  Simple unoptimized AVL tree implementation in C89
  ☆41Updated 5 years ago
• skeeto / trie
  C99 trie library
  ☆101Updated 6 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 years ago
• coditva / udt-c
  A basic implementation of UDP-based Data Transfer protocol (UDT) in C
  ☆95Updated 5 years ago
• chriso / intern
  Fast, efficient string interning
  ☆100Updated 8 years ago
• silentbicycle / skiplist
  skiplist library for C.
  ☆54Updated 9 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 7 years ago
• anholt / hash_table
  A simple C hash table (open addressing and rehashing) for embedding into projects
  ☆60Updated 6 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• jobtalle / pool
  A generic C memory pool
  ☆101Updated 9 years ago
• silentbicycle / mpool
  memory pool allocator
  ☆52Updated 13 years ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆83Updated 3 years ago