Alternatives and similar repositories for c-minheap-array:

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

• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆28Updated 10 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆42Updated 5 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆76Updated 9 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 9 years ago
• ennorehling / clibs
  single file C libraries
  ☆38Updated 2 weeks ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆84Updated 2 years ago
• ChrisDodd / shm_malloc
  Malloc replacement with support for shared and persistent memory allocation
  ☆32Updated 10 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last month
• eelejalde / Hazard-Pointers
  C implementation of the Hazard-Pointers memory manager
  ☆17Updated 10 years ago
• willemt / linked-list-queue
  A simple queue using a linked list written in C under the BSD license.
  ☆18Updated 7 years ago
• aji / libco
  userspace threads and coroutines for C
  ☆18Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆115Updated 9 years ago
• divfor / atomic_hash
  A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform
  ☆52Updated last year
• felix021 / libshmht
  Shared memory hash table for cache purposes.
  ☆12Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆44Updated 3 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 13 years ago
• skywind3000 / memslab
  Slab Memory Allocator in Application Layer
  ☆27Updated 7 years ago
• anholt / hash_table
  A simple C hash table (open addressing and rehashing) for embedding into projects
  ☆57Updated 5 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• jwerle / url.h
  Parse URLs in C much like Node's url module.
  ☆56Updated 7 months ago
• mirek / rb_tree
  Red-black tree C implementation
  ☆37Updated 6 years ago