high-performance modeling of beam dynamics in particle accelerators with collective effects
-
Updated
Oct 2, 2024 - C++
high-performance modeling of beam dynamics in particle accelerators with collective effects
A parallel packed CSR data structure for large-scale dynamic graphs
(R) Efficient methods and operators for the sparse matrix classes in 'Matrix' (esp. CSR format or "RsparseMatrix")
A Method for efficiently processing SpMV using SIMD and load balancing
Graph Reorder And Converter (e.g, Parallel OpenMP Implementation of Edge List to CSR with Sorted Neighbors) - by Yulin Che (https://github.com/CheYulin)
A multi-threaded implementation of vertex-centric graph processing for CPUs.
Min-𝜖 Cosine 𝑘-Nearest Neighbor Graph Construction using Inverted Index Algorithm for CMPE255 Extra Credit Project at SJSU
Comparison of PageRank algorithm using various datatypes.
Template repository for custom backends in MS Annika.
Compute the graph minor when given the cluster configuration. Implemented in three versions using OpenMPI, pthreads and OpenCilk.
Add a description, image, and links to the csr topic page so that developers can more easily learn about it.
To associate your repository with the csr topic, visit your repo's landing page and select "manage topics."