X X^t can be faster

Re:X X^t can be faster by TimorousBestie on Friday May 16, 2025 @12:34PM (#44007375)

I wish they could have modeled memory cache movements as well, somehow. It would have made the analysis more difficult but often these large matrix algorithms live or die by how cache-friendly the memory access patterns are.

Splitting into 4x4 blocks is typically very nice, though. Maybe it doesn’t matter so much to practical runtime.

[ Parent | on HN ]

Re:X X^t can be faster by grumpymuppet on Friday May 16, 2025 @05:21PM (#44009903)

I wish cache analysis was exposed more broadly everywhere. Everyone I deal with seems to understand and know how to think about it, but best practices seem to be wrapped up in a lot of heuristics.

I am aware of being able use hardware counters for profiling systems, but the more fine-grained exposure of what's happening at a lower level seems to be just hidden... Or I haven't found the right reference resource yet.

[ Parent | on HN ]

Re:X X^t can be faster by zacmps on Saturday May 17, 2025 @01:29AM (#44012246)

Do you know any resources for learning these heuristics?

[ Parent | on HN ]