brianpursley / sorting-networkLinks
Python script to check sorting networks and generate sorting network diagrams
☆22Updated last year
Alternatives and similar repositories for sorting-network
Users that are interested in sorting-network are comparing it to the libraries listed below
Sorting:
- A benchmark for random memory accesses☆127Updated 3 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆132Updated last year
- O(n log n) In-place Stable Quicksort☆22Updated 6 months ago
- An evolutionary approach to find small and low latency sorting networks☆78Updated 3 months ago
- Testing memory-level parallelism☆82Updated last year
- Online demo without installing at - https://buildit.so/tryit☆188Updated last month
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- Library for lock-free locks☆84Updated 2 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆125Updated last month
- A minimalistic and high-performance SAT solver☆147Updated 4 years ago
- Generic model checker for concurrent C programs (mirror repository)☆189Updated 2 months ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆354Updated last year
- ☆53Updated last year
- A static verifier for concurrent C programs☆136Updated 5 years ago
- Tapir extension to LLVM for optimizing Parallel Programs☆132Updated 5 years ago
- Mirror kept for legacy. Moved to https://github.com/llvm/llvm-project☆88Updated 6 years ago
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- InstLatX64_Demo☆45Updated 3 months ago
- Measuring cmov vs branch-mov performance☆90Updated 7 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible☆54Updated last year
- A benchmark for cache efficient data structures.☆32Updated 6 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- xxHash Cleaner C Reference Implementation☆50Updated 5 years ago
- ☆39Updated 5 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- ☆38Updated 4 years ago
- A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.☆24Updated 8 years ago