O_bound
en.wikipedia.org · 825 words · saved by 1 readers
Couldn't find lead section for O_bound
From Wikipedia, the free encyclopedia In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period spent waiting for input/output operations to be completed, which can be juxtaposed with being CPU bound. This circumstance arises when the rate at which data is requested is slower than the rate it is consumed or, in other words, more time is spent requesting data than processing it.[1] I/O bound as an inherent problem in computing [edit] The I/O bound state has been identified as a problem in computing…
saved by
related reading
- All About Rooflines | How To Scale Your Modeljax-ml.github.io
- Blocking and Nonblocking IO in Operating System - GeeksforGeeksgeeksforgeeks.org
- Intro - Putting the "You" in CPUcpu.land
- Amdahl's law - Wikipediaen.wikipedia.org
- The "Basics" | Putting the "You" in CPUcpu.land
- IO devices and latency — PlanetScaleplanetscale.com
- Goodput - Wikipediaen.wikipedia.org
- theartofhpc.com/istc/sequential.html#ThevonNeumannarchitecturetheartofhpc.com
- How The Computer Works: The CPU and Memoryhomepage.cs.uri.edu
- Multiprocessing - Wikipediaen.wikipedia.org
- A very concrete explanation of how a cache worksparksb.github.io
- Memory access is O(N^[1/3])vitalik.eth.limo