多线程数组的求和总结（MapReduce思想）

最新推荐文章于 2022-08-20 12:42:09 发布

zfx2013

最新推荐文章于 2022-08-20 12:42:09 发布

阅读量789

点赞数 1

分类专栏：程序员

本文链接：https://blog.csdn.net/zfx2013/article/details/89761996

版权

1、使用Fork/join

import java.util.ArrayList;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.ForkJoinTask;
import java.util.concurrent.RecursiveTask;

/**
 * @author ZFX
 * @date2019/3/31 15:09.
 */
public class CountTask extends RecursiveTask<Long> {
   

    /**
     * 阀值
     */
    static final int THRESHOLD = 10000;
    long start;
    long end;

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

    /**
     * 有返回值的
     * @return
     */
    @Override
    protected Long compute() {
   

        long sum = 0;
        // 当阀值小于10000则不分解了
        boolean canCompute = (end - start) < THRESHOLD;
        if (canCompute) {
   
            for (long i = start; i <= end; i++) {
   
                sum += i;
            }
        } else {
   
            // 2000
            long step = (start + end) / 100;
            ArrayList<CountTask> subTasks = new ArrayList<>();
            long pos = start;
            for (int i = 0; i < 100; i++) {
   
                long lastOne = pos + step;
                if (lastOne > end) {
   
                    lastOne = end;
                }
                //0-2000 个计算任务 * 100
                CountTask subTask = new CountTask(pos, lastOne);
                pos += step + 1;
                subTasks.add(subTask);
                subTask.fork