11 |
|
|
12 |
|
/** |
13 |
|
* Divide and Conquer matrix multiply demo |
14 |
< |
**/ |
15 |
< |
|
14 |
> |
*/ |
15 |
|
public class MatrixMultiply { |
16 |
|
|
17 |
|
/** for time conversion */ |
19 |
|
|
20 |
|
static final int DEFAULT_GRANULARITY = 32; |
21 |
|
|
22 |
< |
/** The quadrant size at which to stop recursing down |
22 |
> |
/** |
23 |
> |
* The quadrant size at which to stop recursing down |
24 |
|
* and instead directly multiply the matrices. |
25 |
|
* Must be a power of two. Minimum value is 2. |
26 |
< |
**/ |
26 |
> |
*/ |
27 |
|
static int granularity = DEFAULT_GRANULARITY; |
28 |
|
|
29 |
|
public static void main(String[] args) throws Exception { |
193 |
|
* Note that the results are added into C, not just set into C. |
194 |
|
* This works well here because Java array elements |
195 |
|
* are created with all zero values. |
196 |
< |
**/ |
197 |
< |
|
196 |
> |
*/ |
197 |
|
void multiplyStride2() { |
198 |
|
for (int j = 0; j < size; j+=2) { |
199 |
|
for (int i = 0; i < size; i +=2) { |