博客
关于我
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 Cluster 7.0.36 发布
    查看>>
    Multimodal Unsupervised Image-to-Image Translation多通道无监督图像翻译
    查看>>
    MySQL Cluster与MGR集群实战
    查看>>
    multipart/form-data与application/octet-stream的区别、application/x-www-form-urlencoded
    查看>>
    mysql cmake 报错,MySQL云服务器应用及cmake报错解决办法
    查看>>
    Multiple websites on single instance of IIS
    查看>>
    mysql CONCAT()函数拼接有NULL
    查看>>
    multiprocessing.Manager 嵌套共享对象不适用于队列
    查看>>
    multiprocessing.pool.map 和带有两个参数的函数
    查看>>
    MYSQL CONCAT函数
    查看>>
    multiprocessing.Pool:map_async 和 imap 有什么区别?
    查看>>
    MySQL Connector/Net 句柄泄露
    查看>>
    multiprocessor(中)
    查看>>
    mysql CPU使用率过高的一次处理经历
    查看>>
    Multisim中555定时器使用技巧
    查看>>
    MySQL CRUD 数据表基础操作实战
    查看>>
    multisim变压器反馈式_穿过隔离栅供电:认识隔离式直流/ 直流偏置电源
    查看>>
    mysql csv import meets charset
    查看>>
    multivariate_normal TypeError: ufunc ‘add‘ output (typecode ‘O‘) could not be coerced to provided……
    查看>>
    MySQL DBA 数据库优化策略
    查看>>