โ† All posts

Compute-Bound vs Memory-Bound

Compute-Bound vs Memory-Bound

[๐—”๐—œ] In AI, ๐—ฐ๐—ผ๐—บ๐—ฝ๐˜‚๐˜๐—ฒ-๐—ฏ๐—ผ๐˜‚๐—ป๐—ฑ means the chip is limited by how fast it can do math. ๐— ๐—ฒ๐—บ๐—ผ๐—ฟ๐˜†-๐—ฏ๐—ผ๐˜‚๐—ป๐—ฑ means itโ€™s limited by how fast it can move data.

๐—–๐—ผ๐—บ๐—ฝ๐˜‚๐˜๐—ฒ-๐—ฏ๐—ผ๐˜‚๐—ป๐—ฑ
This is the usual bottleneck in ๐˜๐—ฟ๐—ฎ๐—ถ๐—ป๐—ถ๐—ป๐—ด. The GPU/TPU is busy crunching huge batches of matrix math, so performance depends on raw ๐—™๐—Ÿ๐—ข๐—ฃ๐—ฆ.

๐— ๐—ฒ๐—บ๐—ผ๐—ฟ๐˜†-๐—ฏ๐—ผ๐˜‚๐—ป๐—ฑ
This is the big issue in ๐—Ÿ๐—Ÿ๐—  ๐—ถ๐—ป๐—ณ๐—ฒ๐—ฟ๐—ฒ๐—ป๐—ฐ๐—ฒ. Models generate ๐—ผ๐—ป๐—ฒ ๐˜๐—ผ๐—ธ๐—ฒ๐—ป ๐—ฎ๐˜ ๐—ฎ ๐˜๐—ถ๐—บ๐—ฒ, and each token requires pulling the modelโ€™s weights through memory. The problem isnโ€™t the math โ€” itโ€™s ๐—ด๐—ฒ๐˜๐˜๐—ถ๐—ป๐—ด ๐˜๐—ต๐—ฒ ๐˜„๐—ฒ๐—ถ๐—ด๐—ต๐˜๐˜€ ๐˜๐—ผ ๐˜๐—ต๐—ฒ ๐—ฐ๐—ผ๐—บ๐—ฝ๐˜‚๐˜๐—ฒ ๐—ฐ๐—ผ๐—ฟ๐—ฒ๐˜€ ๐—ณ๐—ฎ๐˜€๐˜ ๐—ฒ๐—ป๐—ผ๐˜‚๐—ด๐—ต.

Because on-chip memory is too small, the weights live in ๐—ผ๐—ณ๐—ณ-๐—ฐ๐—ต๐—ถ๐—ฝ ๐—›๐—•๐— , and the cores often sit idle waiting for data. So inference speed is capped by ๐—บ๐—ฒ๐—บ๐—ผ๐—ฟ๐˜† ๐—ฏ๐—ฎ๐—ป๐—ฑ๐˜„๐—ถ๐—ฑ๐˜๐—ต, not compute power.

Originally published on LinkedIn.

Turn your expertise into LinkedIn posts like this one.

Try Postars free โ†’