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

I/O bound

Another way to think about sequentiality is the concept (in computer science) of a condition called I/O bound, in which the time it takes to complete a computation is mainly determined by the time spent waiting for input/output (I/O) operations to be completed. This condition arises when the rate at which data is requested is slower than the rate at which it is consumed, or, in short, more time is spent requesting data than processing it.

In an I/O bound state, the CPU must stall its operation, waiting for data to be processed. This means that, even if the CPU gets faster at processing data, processes tend to not increase in speed in proportion to the increased CPU speed, since they get more I/O-bound. With faster computation speed being the primary goal of new computer and processor designs, I/O bound states are becoming undesirable, yet more and more common, in programs.

As you have seen, there are a number of situations in which the application of concurrent programming results in decreased processing speed, and they should thus be avoided. It is therefore important for us to not see concurrency as a golden ticket that can produce unconditionally better execution times, and to understand the differences between the structures of programs that benefit from concurrency and programs that do not.

主站蜘蛛池模板: 神农架林区| 新乡市| 伊川县| 揭西县| 佛山市| 景德镇市| 焦作市| 桃园市| 澎湖县| 化隆| 历史| 蒙阴县| 花莲县| 和政县| 芦溪县| 麻栗坡县| 龙川县| 探索| 丰县| 安吉县| 镇远县| 沙湾县| 冀州市| 建宁县| 红安县| 梁河县| 庆元县| 福建省| 仙游县| 姜堰市| 富锦市| 佛山市| 定远县| 建平县| 渝北区| 沁阳市| 滦平县| 华坪县| 麻江县| 无棣县| 江门市|