FockJoin实现的并发计算方法

2019独角兽企业重金招聘Python工程师标准>>>

package demo10;

import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.Future;
import java.util.concurrent.RecursiveTask;

public class CountTaskTmp extends RecursiveTask<Integer>{
	private static final long serialVersionUID = 1L;
	private static final int THRESHOLD = 3;
    private int start;
    private int end;
    public CountTaskTmp(int start, int end) {
        this.start = start;
        this.end = end;
    }
    @Override
    protected Integer compute() {
        int sum = 0;
        boolean canCompute = (end - start) <= THRESHOLD;
        if (canCompute) {
            for (int i = start; i <= end; i++)
                sum += i;
        } else {
            //如果任务大于阀值，就分裂成两个子任务计算
            int mid = (start + end) / 2;
            CountTaskTmp leftTask = new CountTaskTmp(start, mid);
            CountTaskTmp rightTask = new CountTaskTmp(mid+1, end);
             
            //执行子任务
            leftTask.fork();
            rightTask.fork();
             
            //等待子任务执行完，并得到结果
            int leftResult = (int)leftTask.join();
            int rightResult = (int)rightTask.join();
            System.out.println("leftResult:"+leftResult+"  ,rightResult:"+rightResult); 
            sum = leftResult + rightResult;
        }
        return sum;
    }
     
 
    public static void main(String[] args) {
        ForkJoinPool forkJoinPool = new ForkJoinPool();
         
        //生成一个计算资格，负责计算1+2+3+4+5+6  
        CountTaskTmp task = new CountTaskTmp(1, 6); 
        Future<Integer> result = forkJoinPool.submit(task);
        try {
            System.out.println(result.get());
        } catch (Exception e) {
        	e.printStackTrace();
        }
    }
}

执行结果：

leftResult:6  ,rightResult:15
21

 

转载于:https://my.oschina.net/u/2391658/blog/700084