viktorleis / perfeventLinks
An easy-to-use, header-only C++ wrapper for Linux' perf event API
☆138Updated last month
Alternatives and similar repositories for perfevent
Users that are interested in perfevent are comparing it to the libraries listed below
Sorting:
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ☆81Updated 5 months ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 9 months ago
- ☆125Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Software Transactional Objects☆56Updated last year
- ☆150Updated 2 years ago
- ☆50Updated last year
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆57Updated last year
- Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…☆26Updated 2 years ago
- ☆30Updated 6 years ago
- Quickstep project☆44Updated last year
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- Library for lock-free locks☆84Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆78Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆70Updated last month
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A transactional main-memory database system on multicores☆106Updated 7 years ago
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Updated last year
- HOT - Height Optimized Trie☆158Updated 7 years ago
- pmwcas☆139Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- ☆30Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆84Updated 3 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago