博客
关于我
Java 开发必备! I/O与Netty原理精讲
阅读量:132 次
发布时间:2019-02-26

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

I/O??????????????????????????????BIO/NIO/AIO?????Java?????????????????I/O?????????????????Netty????????

??Java I/O??

1. BIO?Blocking IO?

BIO?Java?????I/O????????????????????????????????????BIO??accept?read??????????????????accept???????????????read?????????????????????????????????????????????????????????

2. NIO?Non Blocking IO?

NIO?Java 1.4???????????????????????????????????????????Selector???????????Selector??????I/O?????????????????NIO??????????

  • Buffer??????????????????????????
  • Channel???????????????
  • Selector???????????Channel?I/O???

Epoll?Linux???????????????????????

3. AIO?NIO 2.0?

AIO?Java NIO 2.0??????????NIO???AIO?????????????????????????????????AIO????????????????????????????

??I/O????

1. ??I/O??

??????????????->??->??->??->??????????????????????????????????????????????????????????????

2. Reactor??

Reactor??????????????????I/O???????????Reactor???????????

  • ??????Reactor??????????Handler??Selector?
  • ???????????Selector???????????
  • ??????????Reactor??????????

Reactor???NIO?????????????????

??Netty????

Netty???Reactor???????????????????????????????

  • ??????BossGroup?WorkerGroup????????????????
  • ChannelPipeline?????????????????
  • ChannelHandler????????????????????

Netty???????????????????I/O????????????????

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

你可能感兴趣的文章
poj 1258 Agri-Net
查看>>
quagga 和 zebos
查看>>
poj 1286 Necklace of Beads
查看>>
POJ 1321 棋盘问题
查看>>
poj 1321(回溯)
查看>>
Qt高级——Qt元对象系统源码解析
查看>>
qt调用vs2008编写的dll动态库(隐式调用)
查看>>
Qt读取注册表默认值
查看>>
poj 1679 判断MST是不是唯一的 (次小生成树)
查看>>
POJ 1703 Find them, Catch them
查看>>
POJ 1703 Find them, Catch them 并查集
查看>>
POJ 1738 An old Stone Game(石子合并)
查看>>
POJ 1740 A New Stone Game(博弈)题解
查看>>
Qt网络编程之实例二POST方式
查看>>
POJ 1765 November Rain
查看>>
poj 1860 Currency Exchange
查看>>
POJ 1961 Period
查看>>
POJ 2019 Cornfields (二维RMQ)
查看>>
poj 2057 The Lost House 贪心思想在动态规划上的应用
查看>>
poj 2057 树形DP,数学期望
查看>>