|
Does anybody have a working algorithm or full copy of code that optimizes matrix multiplication in the x86 assembly language?
I know a basic algorithm in C:
for (i=0;i<BLOCK_SIZE;i++)
for (j=0;j<BLOCK_SIZE;j++)
for (k=0;k<BLOCK_SIZE;k++)
c[i*MAX+j] += a[i*MAX+k]*b[k*MAX+j];
but, does anybody know a faster one?
|