博客
关于我
26. ForkJoin:单机版的MapReduce - 并发工具类
阅读量:386 次
发布时间:2019-03-05

本文共 2478 字,大约阅读时间需要 8 分钟。

???????ForkJoin??

??????

????????????????????????????????????????????????????????????????????????????

  • ??????????????????????????????????????
  • ??????????????????????????????
  • Fork/Join???

    Fork/Join???Java???????????????????????????????????????

    • Fork?????????fork()????????????????????
    • Join?????????join()?????????????????

    ForkJoin?????????????

  • ForkJoinPool????????????????ForkJoin???????????????????????????
  • ForkJoinTask???????????????????????????
    • fork()??????????
    • join()??????????????
  • ForkJoinTask????????

  • RecursiveAction?????????????????????????
  • RecursiveTask????????????????????????
  • ForkJoinPool????

    ForkJoinPool??????????-???????????????????????ForkJoinPool????????????????????????????????????????????????????????????????

    ForkJoinPool??????????????????????????????????

    ??MapReduce??????

    MapReduce???????????????????????????MapReduce??????????

    public class MyTest2 {    public static void main(String[] args) {        String[] fc = {            "hello world", "hello me", "hello fork", "hello join",            "fork join in world"        };        ForkJoinPool fjp = new ForkJoinPool(3);        MR mr = new MR(fc, 0, fc.length);        Map
    result = fjp.invoke(mr); result.forEach((k, v) -> System.out.println(k + ":" + v)); } static class MR extends RecursiveTask
    > { private String[] fc; private int start, end; MR(String[] fc, int fr, int to) { this.fc = fc; this.start = fr; this.end = to; } @Override protected Map
    compute() { if (end - start == 1) { return calc(fc[start]); } else { int mid = (start + end) / 2; MR mr1 = new MR(fc, start, mid); mr1.fork(); MR mr2 = new MR(fc, mid, end); return merge(mr2.compute(), mr1.join()); } } private Map
    merge(Map
    r1, Map
    r2) { Map
    result = new HashMap<>(); result.putAll(r1); r2.forEach((k, v) -> { Long c = result.get(k); if (c != null) { result.put(k, c + v); } else { result.put(k, v); } }); return result; } private Map
    calc(String line) { Map
    result = new HashMap<>(); String[] words = line.split("\\s+"); for (String w : words) { Long v = result.get(w); if (v != null) { result.put(w, v + 1L); } else { result.put(w, 1L); } } return result; } }}

    ??????MR???????????????????????ForkJoin?????????????????????????????????

    转载地址:http://hihwz.baihongyu.com/

    你可能感兴趣的文章
    MySQL中的时间函数
    查看>>
    mysql中的约束
    查看>>
    MySQL中的表是什么?
    查看>>
    mysql中穿件函数时候delimiter的用法
    查看>>
    Mysql中索引的分类、增删改查与存储引擎对应关系
    查看>>
    Mysql中索引的最左前缀原则图文剖析(全)
    查看>>
    MySql中给视图添加注释怎么添加_默认不支持_可以这样取巧---MySql工作笔记002
    查看>>
    Mysql中获取所有表名以及表名带时间字符串使用BetweenAnd筛选区间范围
    查看>>
    Mysql中视图的使用以及常见运算符的使用示例和优先级
    查看>>
    Mysql中触发器的使用示例
    查看>>
    Mysql中设置只允许指定ip能连接访问(可视化工具的方式)
    查看>>
    mysql中还有窗口函数?这是什么东西?
    查看>>
    mysql中间件
    查看>>
    MYSQL中频繁的乱码问题终极解决
    查看>>
    MySQL为Null会导致5个问题,个个致命!
    查看>>
    MySQL为什么不建议使用delete删除数据?
    查看>>
    MySQL主从、环境搭建、主从配制
    查看>>
    Mysql主从不同步
    查看>>
    mysql主从同步及清除信息
    查看>>
    MySQL主从同步相关-主从多久的延迟?
    查看>>