forked from Java2ArkTS/Java2ArkTS
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParallelComputationExample.java
More file actions
61 lines (52 loc) · 1.58 KB
/
Copy pathParallelComputationExample.java
File metadata and controls
61 lines (52 loc) · 1.58 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
public class ParallelComputationExample {
public static void main(String[] args) {
int[] array = new int[100];
for (int i = 0; i < array.length; i++) {
array[i] = i + 1;
}
int numThreads = 4;
int chunkSize = array.length / numThreads;
Thread[] threads = new Thread[numThreads];
ST[] tasks = new ST[numThreads];
// 创建并启动多个线程
for (int i = 0; i < numThreads; i++) {
int start = i * chunkSize;
int end = (i == numThreads - 1) ? array.length : start + chunkSize;
tasks[i] = new ST(array, start, end);
threads[i] = new Thread(tasks[i]);
threads[i].start();
}
// 等待所有线程完成
int totalSum = 0;
for (int i = 0; i < numThreads; i++) {
try {
threads[i].join();
totalSum += tasks[i].getSum();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
System.out.println("Total sum of squares: " + totalSum);
}
}
class ST implements Runnable {
private final int[] array;
private final int start;
private final int end;
private int sum;
public ST(int[] array, int start, int end) {
this.array = array;
this.start = start;
this.end = end;
this.sum = 0;
}
@Override
public void run() {
for (int i = start; i < end; i++) {
sum += array[i] * array[i];
}
}
public int getSum() {
return sum;
}
}