-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBlock.java
More file actions
241 lines (204 loc) · 6.49 KB
/
Block.java
File metadata and controls
241 lines (204 loc) · 6.49 KB
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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
/*
Este arquivo é parte do projeto Scientific Computing
Este é um software livre; você pode redistribuí-lo e/ou
modificá-lo dentro dos termos da Licença Pública Geral GNU como
publicada pela Fundação do Software Livre (FSF); na versão 3 da
Licença, ou (na sua opinião) qualquer versão.
Este programa é distribuído na esperança de que possa ser útil,
mas SEM NENHUMA GARANTIA; sem uma garantia implícita de ADEQUAÇÃO
a qualquer MERCADO ou APLICAÇÃO EM PARTICULAR. Veja a
Licença Pública Geral GNU para maiores detalhes.
Você deve ter recebido uma cópia da Licença Pública Geral GNU junto
com este programa, Se não, veja <http://www.gnu.org/licenses/>.
Arquivo: MultMatrix.java
Descrição: Operações com blocos e Threads.
Autor: Alexi Lallas Ribeiro Pereira <alexii2005@hotmail.com>
*/
package MatrixsOperations;
import java.lang.*;
public class Block extends MultiplicationBLOCK{
public static int [][] Merge(int matrix[][],int line, int caso){
int colun = line;
int block = line / 2;
int Block1A [][] = new int[block][block];
int Block2A [][] = new int[block][block];
int Block3A [][] = new int[block][block];
int Block4A [][] = new int[block][block];
int i1, j1, i2, j2, i3, j3, i4, j4;
i1 = j1 = i2 = j2 = i3 = j3 = i4 = j4 = 0;
// Block Division
for (int i = 0; i < line; i++) {
for (int j = 0; j < colun; j++) {
switch (caso){
case 1:
if (i < block && j < block) {
Block1A[i][j] = matrix[i][j];
}
case 2:
if (i < block && j >= block) {
j2 = j - block;
if (j2 < 0) {
j2 = 0;
}
Block2A[i][j2] = matrix[i][j];
j2++;
}
case 3:
if (i >= block && j < block) {
i3 = i - block;
if (i3 < 0) {
i3 = 0;
}
Block3A[i3][j] = matrix[i][j];
i3++;
}
case 4:
if (i >= block && j >= block) {
i4 = i - block;
j4 = j - block;
if (i4 < 0) {
i4 = 0;
}
if (j4 < 0) {
j4 = 0;
}
Block4A[i4][j4] = matrix[i][j];
j4++;
i4++;
}
}
}
}
// return only one Block
if (caso == 1){
return Block1A;
}
if (caso == 2){
return Block2A;
}
if (caso == 3){
return Block3A;
}
return Block4A;
}
public static int[][] reborn(int line, int result1[][], int result2[][], int result3[][],int result4[][]){
int colun = line;
int block = line / 2;
int result[][] = new int [line][colun];
// joint the blocks
int i1, j1, i2, j2, i3, j3, i4, j4;
i1 = j1 = i2 = j2 = i3 = j3 = i4 = j4 = 0;
for (int i = 0; i < line; i++) {
for (int j = 0; j < colun; j++) {
if (i < block && j < block) {
result[i][j] = result1[i][j];
}
if (i < block && j >= block) {
j2 = j - block;
if (j2 < 0) {
j2 = 0;
}
result[i][j] = result2[i][j2];
j2++;
}
if (i >= block && j < block) {
i3 = i - block;
if (i3 < 0) {
i3 = 0;
}
result[i][j] = result3[i3][j];
i3++;
}
if (i >= block && j >= block) {
i4 = i - block;
j4 = j - block;
if (i4 < 0) {
i4 = 0;
}
if (j4 < 0) {
j4 = 0;
}
result[i][j] = result4[i4][j4];
j4++;
i4++;
}
}
}
return result;
}
public int[][] MultiplicaBlockThread(int line, int matrix1[][], int matrix2[][]){
int colun = line;
int block = line / 2;
// merge the matrix to block
Matrix obj = new Matrix();
int Block1A [][] = Merge(matrix1,line,1);
int Block2A [][] = Merge(matrix1,line,2);
int Block3A [][] = Merge(matrix1,line,3);
int Block4A [][] = Merge(matrix1,line,4);
int Block1B [][] = Merge(matrix2,line,1);
int Block2B [][] = Merge(matrix2,line,2);
int Block3B [][] = Merge(matrix2,line,3);
int Block4B [][] = Merge(matrix2,line,4);
/* print the blocks
obj.print(Block1A,block);
obj.print(Block2A,block);
obj.print(Block3A,block);
obj.print(Block4A,block);
*/
MultiplicationBLOCK thread1 = new MultiplicationBLOCK();
MultiplicationBLOCK thread2 = new MultiplicationBLOCK();
MultiplicationBLOCK thread3 = new MultiplicationBLOCK();
MultiplicationBLOCK thread4 = new MultiplicationBLOCK();
Thread mult1 = new Thread(thread1);
Thread mult2 = new Thread(thread2);
Thread mult3 = new Thread(thread3);
Thread mult4 = new Thread(thread4);
// Thread Initialization
mult1.start();
mult2.start();
mult3.start();
mult4.start();
// Here we'll do the multiplication of the Blocks and the time calculation
long start = System.currentTimeMillis();
int result1[][] = thread1.run(block, Block1A, Block1B, Block2A, Block3B);
int result2[][] = thread2.run(block, Block1A, Block2B, Block2A, Block4B);
int result3[][] = thread3.run(block, Block3A, Block1B, Block4A, Block3B);
int result4[][] = thread4.run(block, Block3A, Block2B, Block4A, Block4B);
long elapsed = System.currentTimeMillis() - start;
// Call reborn() to join the blocks
int result[][] = reborn(line, result1, result2, result3, result4);
System.out.println("\nElapsed Time for Multiplication with Blocks in Threads: "+elapsed+" ms\n");
return result;
}
public int[][] MultiplicaBlock(int line, int matrix1[][], int matrix2[][]){
int colun = line;
int block = line / 2;
// merge the matrix to block
Matrix obj = new Matrix();
int Block1A [][] = Merge(matrix1,line,1);
int Block2A [][] = Merge(matrix1,line,2);
int Block3A [][] = Merge(matrix1,line,3);
int Block4A [][] = Merge(matrix1,line,4);
int Block1B [][] = Merge(matrix2,line,1);
int Block2B [][] = Merge(matrix2,line,2);
int Block3B [][] = Merge(matrix2,line,3);
int Block4B [][] = Merge(matrix2,line,4);
/* print the blocks
obj.print(Block1A,block);
obj.print(Block2A,block);
obj.print(Block3A,block);
obj.print(Block4A,block);
*/
// Here we'll do the multiplication of the Blocks and the time calculation
long start = System.currentTimeMillis();
int result1[][] = run(block, Block1A, Block1B, Block2A, Block3B);
int result2[][] = run(block, Block1A, Block2B, Block2A, Block4B);
int result3[][] = run(block, Block3A, Block1B, Block4A, Block3B);
int result4[][] = run(block, Block3A, Block2B, Block4A, Block4B);
long elapsed = System.currentTimeMillis() - start;
// Call reborn() to join the blocks
int result[][] = reborn(line, result1, result2, result3, result4);
System.out.println("\nElapsed Time for Multiplication with Blocks: "+elapsed+" ms\n");
return result;
}
}