Alternatives and similar repositories for PerfUtils:

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

• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆118Updated 5 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• boostorg / boost_unordered_benchmarks
  ☆18Updated 5 months ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 6 years ago
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆51Updated 8 years ago
• wrl / thread-sync-latency-tests
  testing latencies of various linux thread synchronization primitives
  ☆18Updated 8 years ago
• zhuoyw / CLFQ
  Implementaions of concurrent lock-free SPSC queue in c++.
  ☆17Updated 7 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• cyfdecyf / spinlock
  Different implementations of spinlock.
  ☆104Updated 10 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• MarkReedZ / mrloop
  An event loop for C using io_uring
  ☆48Updated 11 months ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago
• frevib / epoll-echo-server
  ☆50Updated 5 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 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
• condy0919 / bipolar
  A nano concurrency library
  ☆24Updated 4 years ago
• RobertLeahy / AsioUring
  ☆57Updated 4 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆189Updated last week
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 2 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago