|
|
|
|
|
by jharsman
3903 days ago
|
|
I find it really weird that the article says: > It’s curious that we have low cache hit rates, a lot of time stalled on cache/memory, and low bandwidth utilization. That's typical for most workloads! Software is almost never compute or bandwidth bound in my experience, but instead spends most of its time waiting on memory in pointer chasing code. This is especially true for code written in managed languages like Java (since everything typically is boxed and allocated all over the heap). |
|
Perhaps random access of small data causes frequent waits without utilizing the bandwidth in a way that block copies would.