Bonus Performance Optimization: Cache Blocking Technique #10
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.
I implemented a cache blocking technique to optimize matrix multiplication and achieved a 1.5x on first run and 1.6x performance improvement (approximately 49.2% and 59.5% respectively) faster compared to the reference implementation).
Optimization Details:
Technique: Divided large matrices into smaller submatrices or blocks. These blocks were sized to align with my CPU’s cache hierarchy, reducing cache misses and improving data reuse.
Block Sizes:
My CPU Cache Details that were considered for choosing block size:
The block size (32x32x32) was chosen to fit within the available L2/L3 cache for efficient data storage and retrieval during compu
1st run result
station.
2nd run result