bingmann / malloc_count
Method to measure the amount of allocated memory of a program at run-time.
☆65Updated 2 years ago
Related projects: ⓘ
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆29Updated 5 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last week
- For details, see the blog post:☆31Updated 9 months ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 8 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆44Updated 4 years ago
- Super Scalar Sample Sort in modern C++☆20Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆106Updated 6 months ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆43Updated 5 years ago
- Implementation of the sacabench framework☆15Updated 3 years ago
- A handy script to visualize google benchmark output☆53Updated last year
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Provides a header-only iterator template that is easy to adapt for any custom container☆48Updated 2 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆30Updated 7 years ago
- MALT is a MALloc Tracker to find where and how your made your memory allocations in C/C++/Fortran applications.☆107Updated this week
- linear time suffix array construction algorithm☆12Updated 7 years ago
- Generic Reusable Parallel Patterns Interface☆81Updated last year
- ☆9Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆62Updated 3 years ago
- Compact Data Structures Library☆97Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆244Updated last year
- Sample implementation of C++20 atomic_wait/notify☆56Updated 5 years ago
- FFQ: A Fast Single-Producer/Multiple-Consumer Concurrent FIFO Queue (IPDPS 2017)☆29Updated 6 years ago
- A C++ header-only support for serialization of generic objects to be used when the type is known a-priori.☆52Updated 11 years ago
- CMake BASIS makes it easy to create sharable software and libraries that work together. This is accomplished by combining and documenting…☆48Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆29Updated 6 months ago
- C++20 Generalized Suffix Tree implementation☆11Updated last year