20 results for “GPU-accelerated sparse solver”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Chenghan Wang, Zhen Zhuang, Shui Jiang, Siyuan Liang +8 more
This paper proposes CUTh-Solver, a GPU-accelerated Preconditioned Conjugate Gradient (PCG)-based sparse solver framework for high-resolution 3D IC thermal simulation, achieving significant speedup ove…
This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…
The paper introduces $g$MAGNUS, a new algorithm for sparse matrix-matrix multiplication on GPUs that addresses heavy rows by reordering intermediate products and achieves significant speedups.
First implementation of a 3D Gaussian renderer on an Intelligence Processing Unit (IPU) with 1,472 independent tiles using only on-chip SRAM.
This paper reformulates cascaded second-order filtering as a block-tridiagonal linear system and develops parallel solution algorithms, achieving high performance on SIMD cores, multi-core CPUs, and G…
Yidong Zhao, Lars Blatny, Xiang Feng, Mikkel M. Juel +2 more
This paper proposes a unified sparse background-grid framework for the Material Point Method (MPM), significantly reducing computational time and memory usage in large-scale simulations where the mate…
The paper presents improvements to the performance and scalability of WaterLily.jl, a scale-resolving incompressible flow solver, through the addition of MPI-based parallelism and optimizations to the…
Rania Zitouni, Nadine Bousdjira, Sarah Hasnaoui, Amel Sadoun +1 more
This paper compares and optimizes CUDA strategies for a shallow neural network, achieving a 1.41x speedup on a large dataset.
This paper presents a method for compressing matrices using a RePair straight-line program (SLP), allowing matrix-vector products with time and space proportional to the compressed size, and demonstra…
A new solver-free parallel spectral sparsification algorithm for weighted graphs is presented, relying on low-diameter decompositions and independent sampling, eliminating dependence on target approxi…
The paper proposes FOAM, an adaptive damping method that stabilizes the Shampoo optimization algorithm by dynamically controlling damping and eigendecomposition frequency, thereby reducing staleness-i…
PrunePath introduces a budget-adaptive structured sparsification framework that efficiently prunes Feed-forward networks in large language models, achieving hardware-friendly sparsity and measurable s…
This paper proposes FSZ, a GPU error-bounded lossy compressor with three innovations for higher compression ratios and throughput within a single CUDA kernel.
En-Ming Huang, An-Cheng Chang, Bai-Cheng Jeng, Shih-Hao Hung +1 more
This paper introduces a distribution-aware framework for modeling and benchmarking Mixture-of-Experts (MoE) inference, showing that the best fused-MoE kernel changes with routing skew and token count,…
This paper proposes a randomized iterative method called Sequential Preconditioned Conjugate Gradient Method (SPCG) for large-scale linear statistical models, which significantly reduces computational…
This paper demonstrates that Large Language Models (LLMs) can serve as accurate and selective surrogates for costly GPU kernel performance measurements, significantly expanding the search space for op…