Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication

Details Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication

2008-08-07

arxiv.org/abs/0808.1108v2

Computer Science

Data Structures and Algorithms

Fixed typos

Scientific paper

We investigate effects of ordering in blocked matrix--matrix multiplication. We find that submatrices do not have to be stored contiguously in memory to achieve near optimal performance. Instead it is the choice of execution order of the submatrix multiplications that leads to a speedup of up to four times for small block sizes. This is in contrast to results for single matrix elements showing that contiguous memory allocation quickly becomes irrelevant as the blocksize increases.

Affiliated with

Also associated with

No associations

Rating

Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache oblivious storage and access heuristics for blocked matrix-matrix multiplication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29033