|
|
 |
|
|
Thread Tools | Display Modes |
Nov 27th, 2004, 12:01 AM
|
#1 |
|
Newbie
Join Date: Nov 2004
Posts: 1
Rep Power: 0
 |
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? |
|
|
|
Nov 27th, 2004, 1:08 AM
|
#2 |
|
Hobbyist Programmer
Join Date: Nov 2004
Location: 1691 miles East of L.A.
Posts: 159
Rep Power: 4
|
Not sure if it's faster but there is discussion and code concerning a fast 4x4 matrix mult. algorithm here.
__________________
-- lostcauz Stepped in what?... Behind whose barn?... I didn't even know they had a cow! |
|
|
|
|
Nov 28th, 2004, 3:27 PM
|
#3 |
|
Expert Programmer
Join Date: Jul 2004
Location: Halifax, Nova Scotia (Canada)
Posts: 784
Rep Power: 5
  |
I hate to bring this up, but you could look into the alrogithms used behind DirectX technology if it is available, it has a very highly optimized matrix multiplication alrgorithm.
__________________
Clifford Matthew Roche <geek@cliffordroche.com> Web Hosting: http://www.crd-hosting.com Consulting: http://www.crdev-consulting.com |
|
|
|
|
Dec 11th, 2004, 2:41 PM
|
#4 |
|
Programmer
Join Date: Sep 2004
Location: JHB , South Africa
Posts: 79
Rep Power: 4
|
If you need this for graphics programming than the chances of getting your code to run faster than the funcitons supplied by openGL and DX is slim. But I am sure www.google.com will help you out with this.
__________________
Ravilj's OpenGL Terrain aka WinTerrain Last Updated: 17/01/2005! |
|
|
|
|
| Bookmarks |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | |
| Display Modes | |
|
|
Linear Mode
