博客
关于我
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 数据库操作指南:学习如何使用 Python 进行增删改查操作
    查看>>
    MySQL 数据库的高可用性分析
    查看>>
    Mysql 数据库重置ID排序
    查看>>
    Mysql 数据类型一日期
    查看>>
    MySQL 数据类型和属性
    查看>>
    Mysql 整形列的字节与存储范围
    查看>>
    MySQL 日期时间类型的选择
    查看>>
    Mysql 时间操作(当天,昨天,7天,30天,半年,全年,季度)
    查看>>
    MySQL 是如何加锁的?
    查看>>
    mysql 更新子表_mysql 在update中实现子查询的方式
    查看>>
    MySQL 有什么优点?
    查看>>
    mysql 权限整理记录
    查看>>
    mysql 权限登录问题:ERROR 1045 (28000): Access denied for user ‘root‘@‘localhost‘ (using password: YES)
    查看>>
    MYSQL 查看最大连接数和修改最大连接数
    查看>>
    mysql 查看锁_阿里/美团/字节面试官必问的Mysql锁机制,你真的明白吗
    查看>>
    MySql 查询以逗号分隔的字符串的方法(正则)
    查看>>
    MySQL 查询优化:提速查询效率的13大秘籍(避免使用SELECT 、分页查询的优化、合理使用连接、子查询的优化)(上)
    查看>>
    mysql 死锁 Deadlock found when trying to get lock; try restarting transaction
    查看>>