ForkJoinTask 的实现是一个递归任务 RecursiveTask,当向ForkJoinPool提交这个任务时,框架会调用RecursiveTask的compute方法,并返回这个任务的执行结果,当满足某个fork条件时,框架会fork这个任务,并等待这个任务执行完join后,返回任务结果,下面举个例子说明使用场景。
当我们需要计算 1 + 2 + … + 50 时(当然这个例子很简单),这里我们设置fork的阀值为10,即计算 x + … + y,当 y - x >= 10 的时候 fork一个线程,然后递归计算,指导满足线程计算的条件,未满足条件的继续fork。
看看运行结果:
下面是代码:
package org.kylin.test;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.Future;
import java.util.concurrent.RecursiveTask;
/**
* Created by hongbin.dhb on 2015/6/19.
*/
public class CountTask extends RecursiveTask<Integer> {
private static Log log = LogFactory.getLog(CountTask.class);
private static final int THRESHOLD = 10; // 阀值
private int start;
private int end;
public CountTask(int start, int end) {
this.start = start;
this.end = end;
log.debug(" --> CountTask(" + start + ", " + end + ") created.");
}
@Override
protected Integer compute() {
int sum = 0;
boolean canCompute = (end - start) <= THRESHOLD;
// 如果任务足够小,就直接计算
if (canCompute) {
for (int i = start; i <= end; i++) {
sum += i;
}
log.debug("CountTask(" + start + ", " + end + ") computed, sum = " + sum);
} else {
log.debug("CountTask(" + start + ", " + end + ") can not compute, fork and join.");
// 如果任务大于阀值,就分裂成2个子任务计算
int middle = (start + end) / 2;
CountTask leftTask = new CountTask(start, middle);
CountTask rightTask = new CountTask(middle + 1, end);
// 执行子任务
leftTask.fork();
rightTask.fork();
// 等待子任务执行完,并得到结果
int leftResult = leftTask.join();
int rightResult = rightTask.join();
// 合并子任务
sum = leftResult + rightResult;
}
return sum;
}
public static void main(String[] args) {
ForkJoinPool forkJoinPool = new ForkJoinPool();
CountTask task = new CountTask(1, 50);
Future<Integer> result = forkJoinPool.submit(task);
try {
log.debug("result = " + result.get());
} catch (InterruptedException e) {
log.error(e.getMessage(), e);
} catch (ExecutionException e) {
log.error(e.getMessage(), e);
}
}
}