mark-poscablo / gpu-prefix-sum

Related projects ⓘ

Alternatives and complementary repositories for gpu-prefix-sum

• kuiwuchn / 3x3_SVD_CUDA
  Fast CUDA 3x3 SVD
  ☆69Updated 6 years ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆55Updated last month
• horizon-research / rtnn
  ☆56Updated last year
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆61Updated 8 months ago
• txstc55 / EGGS
  EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…
  ☆25Updated 4 years ago
• milakov / int_fastdiv
  Fast integer division with divisor not known at compile time. To be used primarily in CUDA kernels.
  ☆70Updated 9 years ago
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 2 years ago
• Hanke98 / AutoQuantizer
  Code for SIGGRAPH 2022 paper "Automatic quantization for physics-based simulation"
  ☆61Updated 2 years ago
• jia-kai / SANM
  A symbolic asymptotic numerical solver
  ☆30Updated 3 years ago
• NVIDIA / rtx_compute_samples
  RTX compute samples
  ☆68Updated last year
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆96Updated 5 years ago
• knotman90 / cuStreamComp
  Efficient CUDA Stream Compaction Library
  ☆33Updated last year
• PatWie / cuda-design-patterns
  Some CUDA design patterns and a bit of template magic for CUDA
  ☆146Updated last year
• smidm / Singular-Value-Decomposition
  Quick singular value decomposition as described by: A. McAdams, A. Selle, R. Tamstorf, J. Teran and E. Sifakis, “Computing the Singular V…
  ☆19Updated 11 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆71Updated 9 months ago
• aekul / aether
  ☆51Updated 5 years ago
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 3 years ago
• ndd314 / cuda_examples
  ☆64Updated 10 years ago
• hmatuschek / eigen3-nnls
  Non-Negative Least Squares implementation for Eigen3
  ☆37Updated last year
• bryancatanzaro / trove
  Full-speed Array of Structures access
  ☆160Updated last year
• mitsuba-renderer / nanothread
  nanothread — Minimal thread pool for task parallelism
  ☆57Updated 6 months ago
• dumerrill / merge-spmv
  ☆90Updated 7 years ago
• gishi523 / cusparse-cholesky-solver
  A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
  ☆18Updated 4 years ago
• ingowald / closestSurfacePointQueries
  Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
  ☆23Updated 2 years ago
• deshanadesai / acorns
  https://arxiv.org/pdf/2007.05094.pdf An Easy-To-Use Code Generator for Gradients and Hessians
  ☆30Updated 3 years ago
• InteractiveComputerGraphics / TreeNSearch
  C++ library for fast computation of neighbor lists in point clouds.
  ☆54Updated last year
• taichi-dev / taichicon
  TaichiCon: Taichi Conferences
  ☆71Updated 2 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆95Updated 6 months ago
• apc-llc / whippletree
  Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU
  ☆21Updated 8 years ago