ForkJoin简介

• 可以将任务拆分

//RecursiveTask 递归任务
public class ForkJoinDemo extends RecursiveTask<Long> {

    private Long start ;
    private Long end;

    private Long temp = 1000000L;

    public ForkJoinDemo(Long start,Long end){
        this.start = start;
        this.end = end;
    }

    @Override
    protected Long compute() {
        Long sum = 0L;
        if((end-start)<temp){
            for (long i = start; i < end; i++) {
                sum +=i;
            }
        }else {
            Long middle = (start + end)/2;
            ForkJoinDemo forkJoinDemo1 = new ForkJoinDemo(start,middle);
           //拆分任务
            forkJoinDemo1.fork();
            ForkJoinDemo forkJoinDemo2 = new ForkJoinDemo(middle+1L,end);
            forkJoinDemo2.fork();
			//将返回值相加
             sum = forkJoinDemo1.join()+forkJoinDemo2.join();
        }
        return sum;
    }
}

• 测试

public class ForkTest {
    public static void main(String[] args) throws ExecutionException, InterruptedException {

        test1();
        test2();//
        test3();//流的效率最高
    }

    public static void test1(){
        Long start = System.currentTimeMillis();
        Long sum = 0L;
        for (Long  i = 1L; i <=1000_000_000L ; i++) {
            sum +=i;
        }
        Long end = System.currentTimeMillis();
        System.out.println("sum= "+sum+" 时间： "+(end - start));
    }

    public static void test2() throws ExecutionException, InterruptedException {
        Long start = System.currentTimeMillis();
        ForkJoinDemo forkJoinDemo = new ForkJoinDemo(0L,1000_000_000L);
        ForkJoinPool forkJoinPool = new ForkJoinPool();
        //异步：submit 方法又返回值，同步：execute 无返回值，
        ForkJoinTask<Long> forkJoinTask = forkJoinPool.submit(forkJoinDemo);
        Long sum = forkJoinTask.get();
        Long end = System.currentTimeMillis();
        System.out.println("sum= "+sum+" 时间： "+(end - start));
    }

    public static void test3(){
        Long start = System.currentTimeMillis();

        Long sum = LongStream.rangeClosed(0L,1000_000_000L).parallel().reduce(0, Long::sum);
        Long end = System.currentTimeMillis();
        System.out.println("sum= "+sum+" 时间： "+(end - start));
    }
}