[SYSTEMDS-3855] Vector API: Sparse-Sparse Matrix Multiplication Kernels#2553
Open
Elmanjhg wants to merge 1 commit into
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR completes the missing Vector API (SIMD) implementations for sparse matrix combinations, extending the work done in previous dense/sparse vectorization PR #2423.
Modifications
Replaced the scalar inner loops with the vectorized "vectMultiplyAddScatter" using the JDK 17 Vector API in the following three Sparse-Sparse matrix multiplication kernels within "LibMatrixMult.java":
Testing & Validation
BENCHMARK
Hardware Environment (Linux)
The benchmark uses like the PR Request before the Java Microbenchmark Harness (JMH) framework to measure the performance of the rewritten kernels. The result is the average execution time in microseconds. Each benchmark run consists of 5 warmup iterations followed by 10 measurement iterations (1 second each), executed in a single forked JVM.
Sparse-Sparse Benchmark Result Summary
0.01, likely where the overhead of vector preparation and scatter operations slightly outweighs the raw SIMD throughput.Benchmark Parameters
Top Performance Gains (Speedup > 1.0)
Top Performance Losses (Speedup < 1.0)
Baseline vs Vectorized Performance plots
Raw Data
runtimeComparisonSYSTEMDSProject.csv