ForkJoin

规律：总共拆N次生成N+1个task, 阻塞2*N个线程。

最近用到了forkJoin, 可以拆分任务/汇总结果。具体原理可以参考其他文档。疑惑的是new ForkJoinPool(4)不能提供队列大小设置，只有设置一个核心线程数。也就是说默认使用无界队列。这里采用的是workQueue的双向链表。初始队列大小2*13次方。

此处记录一下forkJoinPool用法,  原理类似递归，会循环进入compute()方法。具体看下面例子：

1: 声明一个forkJoinPool：

    private static final ForkJoinPool pool = new ForkJoinPool(4);

2：在MerchantPayManagerServiceImpl里面提交任务，传this到构造方法。默认等待结果：

  pool.invoke(new DealMerchantPayReportsTask(this, merchantPayVosFilter));

3：建立Task类，必须继承RecursiveTask。可以收集返回结果：

package com.fee.task;

import com.google.common.collect.Lists;
import com.fee.service.impl.MerchantPayManagerServiceImpl;
import com.fee.vo.MerchantPayVo;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.List;
import java.util.concurrent.RecursiveTask;

/**
 * @Author:
 * @Date: 18/10/23 15:48
 * @Description: *
 */

public class DealMerchantPayReportsTask extends RecursiveTask<Integer> {
    /**
     * The main computation performed by this task.
     *
     * @return the result of the computation
     */
    private static final Logger LOGGER = LoggerFactory.getLogger(DealMerchantPayReportsTask.class);
    private static final int THREAD_HOLD = 1000;
    private MerchantPayManagerServiceImpl merchantPayManagerServiceImpl;
    private int begin;
    private int end;
    private List<MerchantPayVo> merchantPayVoList;

    public DealMerchantPayReportsTask(MerchantPayManagerServiceImpl merchantPayManagerServiceImpl, List<MerchantPayVo> merchantPayVoList) {
        this.merchantPayManagerServiceImpl = merchantPayManagerServiceImpl;
        this.merchantPayVoList = merchantPayVoList;
        this.begin = 0;
        this.end = merchantPayVoList.size();
    }


    @Override
    protected Integer compute() {
        List<DealMerchantPayReportsTask> dealMerchantPayReportsTasks = Lists.newArrayList();
        if (end - begin <= THREAD_HOLD) {
            for (MerchantPayVo merchantPayVo : merchantPayVoList) {
                try {
                    merchantPayManagerServiceImpl.dealMerchantPayReports(merchantPayVo);
                } catch (Exception e) {
                    LOGGER.error("标的名称:" + merchantPayVo.getSubjectName() + "处理异常!原因:" + e);
                }
            }

        } else {
            int middle = (begin + end) / 2;
            List<MerchantPayVo> leftList = merchantPayVoList.subList(begin, middle);
            DealMerchantPayReportsTask leftTask = new DealMerchantPayReportsTask(merchantPayManagerServiceImpl, leftList);
            dealMerchantPayReportsTasks.add(leftTask);
            List<MerchantPayVo> rightList = merchantPayVoList.subList(middle, end);
            DealMerchantPayReportsTask rightTask = new DealMerchantPayReportsTask(merchantPayManagerServiceImpl, rightList);
            dealMerchantPayReportsTasks.add(rightTask);

            invokeAll(dealMerchantPayReportsTasks);
            for (DealMerchantPayReportsTask task : dealMerchantPayReportsTasks) {
                task.join();
            }
        }

        return null;
    }
}

ForkJoin原理图：