并发编程(十三)-Fork/Join使用

一、Fork/Join

1. 描述

• Fork/Join 是 JDK 1.7 加入的新的线程池实现，它体现的是一种分治思想，适用于能够进行任务拆分的 cpu 密集型运算
• 所谓的任务拆分，是将一个大任务拆分为算法上相同的小任务，直至不能拆分可以直接求解。跟递归相关的一些计算，如归并排序、斐波那契数列、都可以用分治思想进行求解
• Fork/Join 在分治的基础上加入了多线程，可以把每个任务的分解和合并交给不同的线程来完成，进一步提升了运算效率
• Fork/Join 默认会创建与 cpu 核心数大小相同的线程池

2. 使用

• 提交给 Fork/Join 线程池的任务需要继承 RecursiveTask（有返回值）或 RecursiveAction（没有返回值）

计算对 1~n 之间的整数求和的任务

@Slf4j(topic = "c.TestForkJoin2")
public class TestForkJoin2 {

    /**
     * new MyTask(5)  5+ new MyTask(4)
     * new MyTask(4)  4+ new MyTask(3)
     * new MyTask(3)  3+ new MyTask(2)
     * new MyTask(2)  5+ new MyTask(1)
     * new MyTask(1)  1
     */
    public static void main(String[] args) {
        // 分配4个线程
        ForkJoinPool pool = new ForkJoinPool(4);
        System.out.println("结果：" + pool.invoke(new MyTask(5)));
    }
}

// 1~n 之间整数的和
@Slf4j(topic = "c.MyTask")
class MyTask extends RecursiveTask<Integer> {

    private final int n;

    public MyTask(int n) {
        this.n = n;
    }

    @Override
    public String toString() {
        return "{" + n + '}';
    }

    @Override
    protected Integer compute() {
        // 如果 n 已经为 1，可以求得结果了
        // 终止条件
        if (n == 1) {
            log.debug("join({}) ", n);
            return n;
        }

        // fork：将任务进行拆分
        AddTask1 t1 = new AddTask1(n - 1);
        t1.fork();
        log.debug("fork({})  + {}", n, t1);

        // 合并(join)结果
        int result = n + t1.join();
        log.debug("join({})  + {} = {}", n, t1, result);
        return result;
    }
}

11:26:43.554 c.AddTask [ForkJoinPool-1-worker-3] - fork() 3 + {2}
11:26:43.554 c.AddTask [ForkJoinPool-1-worker-2] - fork() 4 + {3}
11:26:43.554 c.AddTask [ForkJoinPool-1-worker-0] - fork() 2 + {1}
11:26:43.554 c.MyTask [ForkJoinPool-1-worker-1] - fork(5)  + {4}
11:26:43.560 c.AddTask [ForkJoinPool-1-worker-2] - join() 1
11:26:43.560 c.AddTask [ForkJoinPool-1-worker-0] - join() 2 + {1} = 3
11:26:43.560 c.AddTask [ForkJoinPool-1-worker-3] - join() 3 + {2} = 6
11:26:43.560 c.AddTask [ForkJoinPool-1-worker-2] - join() 4 + {3} = 10
11:26:43.560 c.MyTask [ForkJoinPool-1-worker-1] - join(5)  + {4} = 15
结果：15

进一步优化：拆分成两部分

public class TestForkJoin {

    public static void main(String[] args) {
        ForkJoinPool pool = new ForkJoinPool(4);
        System.out.println("结果：" + pool.invoke(new AddTask3(1, 5)));
    }
}

@Slf4j(topic = "c.AddTask")
class AddTask3 extends RecursiveTask<Integer> {

    int begin;
    int end;

    public AddTask3(int begin, int end) {
        this.begin = begin;
        this.end = end;
    }

    @Override
    public String toString() {
        return "{" + begin + "," + end + '}';
    }

    @Override
    protected Integer compute() {
        // 当计算到最后一个数时，终止
        if (begin == end) {
            log.debug("join({}) ", begin);
            return begin;
        }
        // 只剩最后两个相邻数时，也可以终止拆分
        if (end - begin == 1) {
            log.debug("join({})  + {} = {}", begin, end, end + begin);
            return end + begin;
        }
        // 分两部分拆分
        int mid = (end + begin) / 2;

        AddTask3 t1 = new AddTask3(begin, mid);
        t1.fork();
        AddTask3 t2 = new AddTask3(mid + 1, end);
        t2.fork();
        log.debug("fork({})  + {} = ?", t1, t2);

        int result = t1.join() + t2.join();
        log.debug("join({})  + {} = {}", t1, t2, result);
        return result;
    }
}

11:35:38.711 c.AddTask [ForkJoinPool-1-worker-1] - fork({1,3})  + {4,5} = ?
11:35:38.711 c.AddTask [ForkJoinPool-1-worker-3] - join(4)  + 5 = 9
11:35:38.717 c.AddTask [ForkJoinPool-1-worker-1] - join(3) 
11:35:38.711 c.AddTask [ForkJoinPool-1-worker-2] - fork({1,2})  + {3,3} = ?
11:35:38.711 c.AddTask [ForkJoinPool-1-worker-0] - join(1)  + 2 = 3
11:35:38.717 c.AddTask [ForkJoinPool-1-worker-2] - join({1,2})  + {3,3} = 6
11:35:38.718 c.AddTask [ForkJoinPool-1-worker-1] - join({1,3})  + {4,5} = 15
结果：15