Zhen Peng's repositories
simple_linalg_kernels
Some simple linear algebra kernels, such as GEMM, SpMM, SpMV, etc, implemented in C++ and OpenMP
sparsetir-artifact
Repository for artifact evaluation of ASPLOS 2023 paper "SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning"
johnpzh.github.io
Zhen's Website
tmux_conf
tmux configure file
cudnn_samples_v9
cuDNN samples v9.x
LAGraph
This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas.org/LAGraph/ . Documentation: https://lagraph.readthedocs.org
ParallelSpGEMM
Parallel SpGEMM. Uses workspace. Uses Scipy to read mtx files. Uses pybind11 to run C++ SpGEMM.
parallel_ANNS
Parallel Approximate Nearest Neighbor Search
Galois
Galois: C++ library for multi-core and multi-node parallelization
graphit
GraphIt - A High-Performance Domain Specific Language for Graph Analytics
DiskANN
Graph based indices for approximate nearest neighbor search
cudnn_samples_v8
cuDNN samples v8.x
efanna_graph
an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
tflm_hw
Tensorflow Lite for Microcontroller Hello-World Example for ST 32F469IDISCOVERY in PlatformIO IDE in Visual Studio Code
hnswlib
Header-only C++/python library for fast approximate nearest neighbors
parallel_distance_oracle
A parallel labeling method for shortest distance queries of large complex graphs.
nsg
Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
bashrc
bash configure
bfs_simd_benchmarks
Parallel Graph Analytics System on Knights Landing
GeminiGraph
A computation-centric distributed graph processing system.
sspexp_clone
Clone from http://degroup.cis.umac.mo/sspexp/, the implementation of the VLDB'17 paper An Experimental Study on Hub Labeling based Shortest Path Algorithms.
pruned-landmark-labeling
Fast and exact shortest-path distance querying index