DOKSparse
CUDA-Guide
DOKSparse | CUDA-Guide | |
---|---|---|
2 | 2 | |
2 | 46 | |
- | - | |
4.2 | 4.0 | |
10 months ago | 4 months ago | |
Cuda | Cuda | |
MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
DOKSparse
- GDlog: A GPU-Accelerated Deductive Engine
-
tensor.to_sparse() Memory Allocation
If using sparse tensors is a must, you can look into DOK sparse format, which is supported for 2d matrices in scipy. it kinda allows you to access any element of the sparse tensor in constant time, which makes it possible to create your tensor directly in sparse format, skipping the need to create a dense numpy array first. In case you need a GPU version of this, I have a library that implements sparse dok tensor in pytorch and cuda. currently it's GPU only.
CUDA-Guide
What are some alternatives?
cub - [ARCHIVED] Cooperative primitives for CUDA C++. See https://github.com/NVIDIA/cccl
instant-ngp - Instant neural graphics primitives: lightning fast NeRF and more
MegBA - MegBA: A GPU-Based Distributed Library for Large-Scale Bundle Adjustment
spikingjelly - SpikingJelly is an open-source deep learning framework for Spiking Neural Network (SNN) based on PyTorch.
cuhnsw - CUDA implementation of Hierarchical Navigable Small World Graph algorithm
TorchPQ - Approximate nearest neighbor search with product quantization on GPU in pytorch and cuda
LSQR-CUDA - This is a LSQR-CUDA implementation written by Lawrence Ayers under the supervision of Stefan Guthe of the GRIS institute at the Technische Universität Darmstadt. The LSQR library was authored Chris Paige and Michael Saunders.
cudnnxx - cuDNN C++ wrapper.
cccl - CUDA C++ Core Libraries
FirstCollisionTimestepRarefiedGasSimulator - This simulator computes all possible intersections for a very small timestep for a particle model