一、三种并发概念的提出时间:
- Java2—多线程
- Java5—Executor框架
- Java7—Fork-Join框架
二、Fork-Join简介
- Java7提供的一种并行框架:分解、治理、合并(分治编程)
- 适合用于整体任务量不好确定的场合(最小任务可确定)
- 关键类:
- ForkJoinPool 创建任务池对象
- RecursiveAction 父类
- RecursiveTask
三、案例
利用Fork-Join框架,计算[1,10000000]区间内所有整数的和
主方法
import java.math.BigInteger;
import java.util.concurrent.RecursiveTask;
//分任务求和
public class SumTask extends RecursiveTask<Long> {
private int start;
private int end;
public SumTask(int start, int end) {
this.start = start;
this.end = end;
}
public static final int threadhold = 5;
//计算的方法
@Override
protected Long compute() {
Long sum = 0L;
// 1.如果任务足够小, 就直接执行
boolean canCompute = (end - start) <= threadhold;
if (canCompute) {
for (int i = start; i <= end; i++) {
sum = sum + i;
}
} else {
// 2.任务大于阈值, 调用SumTask方法,分裂为2个任务
int middle = (start + end) / 2;
SumTask subTask1 = new SumTask(start, middle);
SumTask subTask2 = new SumTask(middle + 1, end);
invokeAll(subTask1, subTask2);
Long sum1 = subTask1.join();
Long sum2 = subTask2.join();
// 结果合并
sum = sum1 + sum2;
}
return sum;
}
}
分解任务的方法SumTest
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.ForkJoinTask;
//分任务求和
public class SumTest {
public static void main(String[] args) throws ExecutionException, InterruptedException {
//创建执行线程池
ForkJoinPool pool = new ForkJoinPool();
//ForkJoinPool pool = new ForkJoinPool(4);
//创建任务
SumTask task = new SumTask(1, 10000000);
//提交任务
ForkJoinTask<Long> result = pool.submit(task);
//等待结果
do {
System.out.printf("Main: Thread Count: %d\n",pool.getActiveThreadCount());
System.out.printf("Main: Paralelism: %d\n",pool.getParallelism());
try {
Thread.sleep(50);
} catch (InterruptedException e) {
e.printStackTrace();
}
} while (!task.isDone());
//输出结果
System.out.println(result.get().toString());
}
}
运行结果
Main: Thread Count: 1
Main: Paralelism: 4
Main: Thread Count: 4
Main: Paralelism: 4
50000005000000