官术网_书友最值得收藏!

Concurrency versus parallelism in I/O-bound algorithms

As seen before, I/O-bound algorithms are constantly waiting on something else. This constant waiting allows single-core devices to use the processor to do other useful tasks while waiting. So concurrent algorithms that are I/O-bound will perform similarly regardless of the execution happening in parallel or in a single core.

It is expected that I/O-bound algorithms will always perform better in concurrent implementations than if they are sequential. So it's recommended for I/O operations to be always executed concurrently. As mentioned before, in GUI applications it's particularly important to not block the UI thread. 

主站蜘蛛池模板: 芒康县| SHOW| 临漳县| 商丘市| 繁峙县| 永胜县| 阳谷县| 鄂托克旗| 凤山市| 通城县| 旅游| 乌兰县| 姜堰市| 尖扎县| 马边| 郎溪县| 武定县| 汝城县| 宜兰市| 章丘市| 措美县| 高平市| 梁山县| 甘谷县| 隆化县| 平原县| 理塘县| 榆中县| 承德县| 临泉县| 克山县| 盖州市| 盐城市| 肇源县| 河曲县| 米易县| 遂溪县| 潮州市| 胶州市| 呼和浩特市| 宜君县|