Java RecursiveTask的并行计算任务

最新推荐文章于 2024-01-28 23:40:41 发布

zhengzizhi

最新推荐文章于 2024-01-28 23:40:41 发布

阅读量882

点赞数

分类专栏： Java多线程文章标签： RecursiveTask RecursiveAction 并行执行的任务

本文链接：https://blog.csdn.net/zhengzizhi/article/details/84953756

版权

Java多线程专栏收录该内容

21 篇文章 0 订阅

订阅专栏

范例1：

package com.myth;

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

public class MultiRecursiveTaskDemo {

    public static void main(String[] args) throws Exception {
        int arr[] = new int[999];
        Random random = new Random();
        int total = 0;
        // 初始化100个数字元素
        for (int i = 0; i < arr.length; i++) {
            int temp = random.nextInt(100);
            // 对数组元素赋值,并将数组元素的值添加到total总和中
            total += (arr[i] = temp);
        }
        System.out.println("普通主线程计算出来的总和 = " + total);
        System.out.println("CPU内核数 = " + Runtime.getRuntime().availableProcessors());

        // 创建包含Runtime.getRuntime().availableProcessors()返回值作为线程池中并行线程的个数
        ForkJoinPool forkJoinPool = new ForkJoinPool();

        // 提交可分解的计算任务
         Future<Integer> future = forkJoinPool.submit(new RecursiveTaskDemo(arr, 0, arr.length));
         System.out.println("并行任务计算出来的总和 = " + future.get());
        //Integer sum = forkJoinPool.invoke(new RecursiveTaskDemo(arr, 0, arr.length));
        //System.out.println("并行任务计算出来的总和 = " + sum);

        // 关闭线程池
        forkJoinPool.shutdown();

    }
}

package com.myth;

import java.util.concurrent.RecursiveTask;

public class RecursiveTaskDemo extends RecursiveTask<Integer> {

    /**
     * 每个"小任务"最多只打印70个数
     */
    private static final int MAX = 70;
    private int arr[];
    private int start;
    private int end;

    public RecursiveTaskDemo(int[] arr, int start, int end) {
        this.arr = arr;
        this.start = start;
        this.end = end;
    }

    @Override
    protected Integer compute() {
        int sum = 0;
        // 当end-start的值小于MAX时候，开始打印
        if ((end - start) < MAX) {
            long nanotime = System.nanoTime();
            System.out.println(Thread.currentThread().getName() + " nanotime = " + nanotime + " end - start = " + end + " - " + start + " = " + (end - start));
            for (int i = start; i < end; i++) {
                sum += arr[i];
            }
            return sum;
        } else {
            // 将大任务分解成两个小任务
            int middle = (start + end) / 2;
            long nanotime = System.nanoTime();
            System.err.println(Thread.currentThread().getName() + " nanotime = " + nanotime + "  =====任务分解======  " + " middle - start = " + middle + " - " + start + " = " + (middle - start) + "   " + " end - middle = " + end + " - " + middle + " = " + (end - middle));
            RecursiveTaskDemo left = new RecursiveTaskDemo(arr, start, middle);
            RecursiveTaskDemo right = new RecursiveTaskDemo(arr, middle, end);
            // 并行执行两个小任务
            left.fork();
            right.fork();
            // 把两个小任务累加的结果合并起来
            return left.join() + right.join();
        }
    }

}

run:
普通主线程计算出来的总和 = 50223
CPU内核数 = 4
ForkJoinPool-1-worker-1 nanotime = 27641633809928  =====任务分解======   middle - start = 499 - 0 = 499    end - middle = 999 - 499 = 500
ForkJoinPool-1-worker-1 nanotime = 27641634829397 end - start = 62 - 0 = 62
ForkJoinPool-1-worker-3 nanotime = 27641635038158 end - start = 561 - 499 = 62
ForkJoinPool-1-worker-1 nanotime = 27641634690437  =====任务分解======   middle - start = 249 - 0 = 249    end - middle = 499 - 249 = 250
ForkJoinPool-1-worker-3 nanotime = 27641635180960 end - start = 624 - 561 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635226106 end - start = 811 - 749 = 62
ForkJoinPool-1-worker-3 nanotime = 27641635266770 end - start = 686 - 624 = 62
ForkJoinPool-1-worker-1 nanotime = 27641634763119  =====任务分解======   middle - start = 124 - 0 = 124    end - middle = 249 - 124 = 125
ForkJoinPool-1-worker-1 nanotime = 27641635288542 end - start = 124 - 62 = 62
ForkJoinPool-1-worker-2 nanotime = 27641635275415 end - start = 874 - 811 = 63
ForkJoinPool-1-worker-3 nanotime = 27641635299428 end - start = 749 - 686 = 63
ForkJoinPool-1-worker-1 nanotime = 27641634798979  =====任务分解======   middle - start = 62 - 0 = 62    end - middle = 124 - 62 = 62
ForkJoinPool-1-worker-2 nanotime = 27641635729437 end - start = 936 - 874 = 62
ForkJoinPool-1-worker-2 nanotime = 27641635758894 end - start = 999 - 936 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635909381 end - start = 311 - 249 = 62
ForkJoinPool-1-worker-3 nanotime = 27641634864617  =====任务分解======   middle - start = 749 - 499 = 250    end - middle = 999 - 749 = 250
ForkJoinPool-1-worker-2 nanotime = 27641635951965 end - start = 374 - 311 = 63
ForkJoinPool-1-worker-3 nanotime = 27641635952926 end - start = 186 - 124 = 62
ForkJoinPool-1-worker-2 nanotime = 27641636021766 end - start = 436 - 374 = 62
ForkJoinPool-1-worker-3 nanotime = 27641634916167  =====任务分解======   middle - start = 624 - 499 = 125    end - middle = 749 - 624 = 125
ForkJoinPool-1-worker-2 nanotime = 27641636048341 end - start = 499 - 436 = 63
ForkJoinPool-1-worker-1 nanotime = 27641635975659 end - start = 249 - 186 = 63
并发任务计算出来的总和 = 50223
ForkJoinPool-1-worker-3 nanotime = 27641634998775  =====任务分解======   middle - start = 561 - 499 = 62    end - middle = 624 - 561 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635114362  =====任务分解======   middle - start = 874 - 749 = 125    end - middle = 999 - 874 = 125
ForkJoinPool-1-worker-2 nanotime = 27641635155665  =====任务分解======   middle - start = 811 - 749 = 62    end - middle = 874 - 811 = 63
ForkJoinPool-1-worker-3 nanotime = 27641635220343  =====任务分解======   middle - start = 686 - 624 = 62    end - middle = 749 - 686 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635401567  =====任务分解======   middle - start = 936 - 874 = 62    end - middle = 999 - 936 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635843423  =====任务分解======   middle - start = 374 - 249 = 125    end - middle = 499 - 374 = 125
ForkJoinPool-1-worker-2 nanotime = 27641635878003  =====任务分解======   middle - start = 311 - 249 = 62    end - middle = 374 - 311 = 63
ForkJoinPool-1-worker-3 nanotime = 27641635901056  =====任务分解======   middle - start = 186 - 124 = 62    end - middle = 249 - 186 = 63
ForkJoinPool-1-worker-2 nanotime = 27641635986866  =====任务分解======   middle - start = 436 - 374 = 62    end - middle = 499 - 436 = 63
BUILD SUCCESSFUL (total time: 0 seconds)

范例2：并行执行的打印任务

package com.myth;

import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.TimeUnit;

public class MultiTaskMemo {

    public static void main(String[] args) throws Exception {
  
        ForkJoinPool forkJoinPool = new ForkJoinPool();
        // 提交可分解的RaskDemo任务
        forkJoinPool.submit(new RaskDemo(0, 100));
        //阻塞当前线程3秒直到 ForkJoinPool 中所有的任务都执行结束
        forkJoinPool.awaitTermination(3, TimeUnit.SECONDS);
        // 关闭线程池
        forkJoinPool.shutdown();
    }
}

package com.myth;

import java.util.concurrent.RecursiveAction;

public class RaskDemo extends RecursiveAction {

    /**
     * 每个"小任务"最多只打印20个数
     */
    private static final int MAX = 20;

    private int start;
    private int end;

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

    @Override
    protected void compute() {
        //当end - start的值小于MAX时，开始打印
        if ((end - start) < MAX) {
            for (int i = start; i < end; i++) {
                System.out.println(Thread.currentThread().getName() + " end - start = " + end + " - " + start + "   i = " + i);
            }
        } else {
            // 将大任务分解成两个小任务
            int middle = (start + end) / 2;
            RaskDemo left = new RaskDemo(start, middle);
            RaskDemo right = new RaskDemo(middle, end);
            left.fork();
            right.fork();
        }
    }
}

run:
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 37
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 38
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 39
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 62
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 63
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 87
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 12
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 13
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 14
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 15
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 88
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 89
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 90
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 91
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 92
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 93
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 64
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 65
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 66
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 67
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 68
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 40
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 41
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 42
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 43
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 69
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 94
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 95
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 96
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 16
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 17
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 97
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 98
ForkJoinPool-1-worker-1 end - start = 100 - 87   i = 99
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 75
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 76
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 77
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 78
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 79
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 80
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 81
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 82
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 83
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 84
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 85
ForkJoinPool-1-worker-1 end - start = 87 - 75   i = 86
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 0
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 1
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 2
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 3
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 4
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 5
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 70
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 71
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 72
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 73
ForkJoinPool-1-worker-3 end - start = 75 - 62   i = 74
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 50
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 51
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 52
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 53
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 54
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 55
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 56
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 57
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 58
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 59
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 60
ForkJoinPool-1-worker-3 end - start = 62 - 50   i = 61
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 25
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 26
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 27
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 28
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 29
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 30
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 31
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 32
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 33
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 34
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 35
ForkJoinPool-1-worker-3 end - start = 37 - 25   i = 36
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 44
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 45
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 46
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 47
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 48
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 6
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 7
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 8
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 9
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 10
ForkJoinPool-1-worker-1 end - start = 12 - 0   i = 11
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 18
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 19
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 20
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 21
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 22
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 23
ForkJoinPool-1-worker-0 end - start = 25 - 12   i = 24
ForkJoinPool-1-worker-2 end - start = 50 - 37   i = 49
BUILD SUCCESSFUL (total time: 3 seconds)

范例3：

package com.myth;

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

public class CountTask extends RecursiveTask<Long> {

    private static final int THRESHOLD = 10000;
    private long start;
    private long end;

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

    @Override
    protected Long compute() {
        System.out.println(Thread.currentThread().getName() + " end - start + 1 = " + end + " - " + start + " + 1" + " = " + (end - start + 1));
        long sum = 0;
        boolean canCompute = (end - start) < THRESHOLD;
        if (canCompute) {
            for (long i = start; i <= end; i++) {
                sum += i;
            }
        } else {
            // 分解成100个小任务
            long step = (end - start + 1) / 100;
            System.err.println("step = " + step);
            ArrayList<CountTask> subTasks = new ArrayList();
            long pos = start;
            for (int i = 0; i < 100; i++) {
                long lastOne = pos + step;
                if (lastOne > end) {
                    lastOne = end;
                }
                CountTask subTask = new CountTask(pos, lastOne);
                pos += step + 1;
                subTasks.add(subTask);
                subTask.fork(); // 提交任务，提交的任务和线程数量并不是一对一的关系
            }
            for (CountTask t : subTasks) {
                sum += t.join(); // 累加每个子任务的结果
            }
        }
        return sum;
    }

    public static void main(String[] args) {
        System.err.println("当前CPU的核心数单位(颗)：" + Runtime.getRuntime().availableProcessors());
        ForkJoinPool forkJoinPool = new ForkJoinPool();
        CountTask task = new CountTask(101L, 200000L); // 200000L
        ForkJoinTask<Long> result = forkJoinPool.submit(task);
        try {
            long res = result.get();
            System.out.println("sum = " + res);
        } catch (InterruptedException e) {
            e.printStackTrace();
        } catch (ExecutionException e) {
            e.printStackTrace();
        }
    }

run:
当前CPU的核心数单位(颗)：4
step = 1999
ForkJoinPool-1-worker-1 end - start + 1 = 200000 - 101 + 1 = 199900
ForkJoinPool-1-worker-3 end - start + 1 = 4100 - 2101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 2100 - 101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 6100 - 4101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 8100 - 6101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 10100 - 8101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 12100 - 10101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 14100 - 12101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 16100 - 14101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 18100 - 16101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 20100 - 18101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 22100 - 20101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 24100 - 22101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 26100 - 24101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 28100 - 26101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 30100 - 28101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 32100 - 30101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 34100 - 32101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 36100 - 34101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 38100 - 36101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 40100 - 38101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 42100 - 40101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 44100 - 42101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 46100 - 44101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 48100 - 46101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 50100 - 48101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 52100 - 50101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 54100 - 52101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 56100 - 54101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 58100 - 56101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 60100 - 58101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 62100 - 60101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 64100 - 62101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 66100 - 64101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 68100 - 66101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 70100 - 68101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 72100 - 70101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 74100 - 72101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 76100 - 74101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 80100 - 78101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 78100 - 76101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 82100 - 80101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 84100 - 82101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 86100 - 84101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 88100 - 86101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 90100 - 88101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 92100 - 90101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 94100 - 92101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 96100 - 94101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 98100 - 96101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 100100 - 98101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 102100 - 100101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 104100 - 102101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 106100 - 104101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 108100 - 106101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 112100 - 110101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 110100 - 108101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 114100 - 112101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 116100 - 114101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 118100 - 116101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 120100 - 118101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 122100 - 120101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 126100 - 124101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 128100 - 126101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 130100 - 128101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 124100 - 122101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 134100 - 132101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 132100 - 130101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 136100 - 134101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 138100 - 136101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 140100 - 138101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 142100 - 140101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 146100 - 144101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 148100 - 146101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 144100 - 142101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 150100 - 148101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 152100 - 150101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 154100 - 152101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 156100 - 154101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 158100 - 156101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 162100 - 160101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 164100 - 162101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 160100 - 158101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 166100 - 164101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 168100 - 166101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 170100 - 168101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 172100 - 170101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 174100 - 172101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 176100 - 174101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 178100 - 176101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 180100 - 178101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 182100 - 180101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 184100 - 182101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 186100 - 184101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 188100 - 186101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 190100 - 188101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 192100 - 190101 + 1 = 2000
ForkJoinPool-1-worker-3 end - start + 1 = 194100 - 192101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 196100 - 194101 + 1 = 2000
ForkJoinPool-1-worker-2 end - start + 1 = 200000 - 198101 + 1 = 1900
ForkJoinPool-1-worker-3 end - start + 1 = 198100 - 196101 + 1 = 2000
sum = 20000094950
BUILD SUCCESSFUL (total time: 0 seconds)

zhengzizhi

关注

0
点赞
踩
2

收藏

觉得还不错? 一键收藏
0
评论
Java RecursiveTask的并行计算任务

范例1：package com.myth;import java.util.Random;import java.util.concurrent.ForkJoinPool;import java.util.concurrent.Future;public class MultiRecursiveTaskDemo { public static void main(Str...
复制链接

扫一扫

专栏目录