Alternatives and similar repositories for SIMDgameoflife

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

• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆155Updated last year
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆40Updated 3 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 7 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 9 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• trishume / gigatrace
  Proof-of-concept for a memory-efficient data structure for zooming billion-event traces
  ☆70Updated 4 years ago
• expr-fi / fastlwc
  SIMD-enhanced word counter
  ☆247Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 7 months ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated last month
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆232Updated last year
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆98Updated 3 years ago
• google / zuckerli
  ☆28Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆60Updated 4 years ago
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆104Updated 7 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆83Updated 6 years ago
• AjayMT / silk
  The Silk Programming Language
  ☆79Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• feroldi / oxide
  Regionalized Value State Dependence Graph written in Rust
  ☆11Updated 5 years ago
• tekknolagi / ddcg
  Implementation of destination-driven code generation with control destinations. See [post.md](post.md)
  ☆24Updated 11 months ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago