ForkJoinPool中submit处理流程

最新推荐文章于 2024-08-06 01:32:02 发布

架构成长指南

最新推荐文章于 2024-08-06 01:32:02 发布

阅读量5.6k

点赞数 1

分类专栏： java 并发文章标签： java 并发 ForkJoinPool

本文链接：https://blog.csdn.net/dweizhao/article/details/73480025

版权

java 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

并发

8 篇文章 0 订阅

订阅专栏

细节不详细介绍，具体可参考http://www.infoq.com/cn/articles/fork-join-introduction。本文主要分析的submit处理流程，示例代码：

package com.company.Chapter06;


import java.util.concurrent.ExecutionException;
import java.util.concurrent.Future;


public class CountTask extends RecursiveTask<Integer> {
    private static final int THEADHOLD = 2;//阈值
    private int start;
    private int end;

    public CountTask(int start, int end) {
        this.start = start;
        this.end = end;
    }

    protected Integer compute() {
        int sum = 0;
        boolean canCompute = (end - start) <= THEADHOLD;
        if (canCompute) {
            for (int i = start; i <= end; i++) {
                sum += i;
            }
        } else {
            int middle = (start + end) / 2;
            CountTask left = new CountTask(start, middle);
            CountTask right = new CountTask(middle + 1, end);
            left.fork();
            right.fork();
            int leftSum = left.join();
            int rightSum = right.join();
            sum = leftSum + rightSum;
        }
        return sum;
    }

    public static void main(String[] args) throws ExecutionException, InterruptedException {
        ForkJoinPool forkJoinPool=new ForkJoinPool();
        CountTask countTask=new CountTask(1,4);
        Future<Integer> result=forkJoinPool.submit(countTask);
        System.out.println(result.get());
    }
}

submit流程图：