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

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. 

主站蜘蛛池模板: 兴安县| 东丽区| 安宁市| 修文县| 明溪县| 高唐县| 甘孜县| 汾阳市| 洛阳市| 称多县| 桃园县| 龙南县| 天水市| 砚山县| 余庆县| 遂宁市| 怀集县| 长葛市| 贵阳市| 台北市| 马尔康县| 翼城县| 华蓥市| 鄱阳县| 行唐县| 盈江县| 惠东县| 巍山| 临泉县| 沈阳市| 濮阳市| 尚义县| 板桥市| 宁武县| 黔南| 洞口县| 峨眉山市| 沭阳县| 上蔡县| 溧阳市| 博客|