/
matmult_block_ijk.go
162 lines (150 loc) · 3.21 KB
/
matmult_block_ijk.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
// Copyright 2019 Changkun Ou. All rights reserved.
// Use of this source code is governed by a MIT
// license that can be found in the LICENSE file.
package mat
import "sync"
// DotBlockIJK block matrix multiplication
func (A *Dense) DotBlockIJK(blockSize int, B, C Matrix) (err error) {
if (A.Col() != B.Row()) || (C.Row() != A.Row()) || (C.Col() != B.Col()) {
return ErrMatSize
}
min := A.Row()
if A.Col() < min {
min = A.Col()
}
if B.Col() < min {
min = B.Col()
}
var (
kk, jj, i, j, k int
sum float64
en = blockSize * (min / blockSize)
)
for kk = 0; kk < en; kk += blockSize {
for jj = 0; jj < en; jj += blockSize {
for i = 0; i < A.Row(); i++ {
for j = jj; j < jj+blockSize; j++ {
sum = 0.0
for k = kk; k < kk+blockSize; k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
}
// residue right
for i = 0; i < A.Row(); i++ {
for j = en; j < B.Col(); j++ {
sum = 0.0
for k = kk; k < kk+blockSize; k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
}
// residue bottom
for jj = 0; jj < en; jj += blockSize {
for i = 0; i < A.Row(); i++ {
for j = jj; j < jj+blockSize; j++ {
sum = 0.0
for k = en; k < A.Col(); k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
}
// residule bottom right
for i = 0; i < A.Row(); i++ {
for j = en; j < B.Col(); j++ {
sum = 0.0
for k = en; k < A.Col(); k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
return
}
// DotBlockIJKP block matrix multiplication
func (A *Dense) DotBlockIJKP(blockSize int, B, C Matrix) (err error) {
if (A.Col() != B.Row()) || (C.Row() != A.Row()) || (C.Col() != B.Col()) {
return ErrMatSize
}
min := A.Row()
if A.Col() < min {
min = A.Col()
}
if B.Col() < min {
min = B.Col()
}
en := blockSize * (min / blockSize)
wg := sync.WaitGroup{}
for kk := 0; kk < en; kk += blockSize {
for jj := 0; jj < en; jj += blockSize {
wg.Add(1) // per block
go func(kk, jj int) {
for i := 0; i < A.Row(); i++ {
for j := jj; j < jj+blockSize; j++ {
sum := 0.0
for k := kk; k < kk+blockSize; k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
wg.Done()
}(kk, jj)
}
wg.Wait()
// residue right
for i := 0; i < A.Row(); i++ {
wg.Add(1) // per row
go func(i int) {
for j := en; j < B.Col(); j++ {
sum := 0.0
for k := kk; k < kk+blockSize; k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
wg.Done()
}(i)
}
wg.Wait()
}
// residue bottom
for jj := 0; jj < en; jj += blockSize {
wg.Add(1) // per row
go func(jj int) {
for i := 0; i < A.Row(); i++ {
for j := jj; j < jj+blockSize; j++ {
sum := 0.0
for k := en; k < A.Col(); k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
}
wg.Done()
}(jj)
}
wg.Wait()
// residule bottom right
for i := 0; i < A.Row(); i++ {
wg.Add(1) // per row
go func(i int) {
for j := en; j < B.Col(); j++ {
sum := 0.0
for k := en; k < A.Col(); k++ {
sum += A.At(i, k) * B.At(k, j)
}
C.Inc(i, j, sum)
}
wg.Done()
}(i)
}
wg.Wait()
return
}