In computer science, a computational problem is memory-bound when the time it takes for it to complete is decided primarily by the amount of free memory required to hold the working data. This is in contrast to algorithms that are compute-bound, where the number of elementary computation steps is the deciding factor.
In computer science, a computational problem is memory-bound when the time it takes for it to complete is decided primarily by the amount of free memory required to hold the working data. This is in contrast to algorithms that are compute-bound, where the number of elementary computation steps is the deciding factor.
Source: Wikipedia "Memory-bound function" · CC BY-SA 4.0
Share this article: X · Bluesky