Alternatives and similar repositories for ParallelGrep

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

• google-research / automemcpy
  ☆22Updated 3 years ago
• keithw / sourdough
  Starter template for networking-related programs
  ☆21Updated 7 years ago
• netdata / libjudy
  Fork of the Judy C library for dynamic array originally imported from the SF project https://sourceforge.net/projects/judy/ with patches …
  ☆33Updated 5 years ago
• ceph / libcrush
  ☆18Updated 5 years ago
• linfenghuaster / Regex-FPGA
  Accelerating the regular expression matching on FPGA for applications in Networking and Bioinformatics.
  ☆13Updated 8 years ago
• plasma-umass / memory-landscape
  The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).
  ☆20Updated 4 years ago
• google / zuckerli
  ☆28Updated 3 years ago
• mbrossard / has
  Dynamic-language-like data structure for C
  ☆15Updated 9 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• zyedidia / perforator
  Record "perf" performance metrics for individual functions/regions of an ELF binary.
  ☆81Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• p-quic / ubpf
  Implementation of the user-space eBPF VM based on the iovisor version (https://github.com/iovisor/ubpf)
  ☆13Updated 5 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• dialtr / libcount
  C/C++ Implementation of the HyperLogLog++ cardinality estimation algorithm.
  ☆28Updated 2 years ago
• vitalyvch / rng_buf
  An optimized Ring Buffer implementation based on the POSIX shared memory trick
  ☆17Updated last year
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆122Updated last week
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago
• ashvardanian / HashTableBenchmark
  A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
  ☆12Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆40Updated last year
• plasma-umass / DoubleTake
  Evidence-based dynamic analysis: a fast checker for memory errors.
  ☆21Updated 8 years ago
• catid / libcat
  Common code library
  ☆14Updated 8 years ago
• google / fpc
  FPC calculates information to be used in fixed-point integer calculations
  ☆29Updated 9 years ago
• sysml / mini-os
  Minimalistic Operating System for Xen
  ☆66Updated 3 years ago
• leaningtech / cheerp-bullet
  Bullet physics library ported to JavaScript with Cheerp
  ☆23Updated 10 years ago
• kiwenlau / MPI_PI
  Calculate PI using MPI with 3 different methods
  ☆19Updated 10 years ago