3 ms·
Data memory-dependent prefetchers like in Apple's newer chips I think only work with full pointers and not offsets, so it could be a decent perf hit.
by cma 1y ago
Data memory-dependent prefetchers like in Apple's newer chips I think only work with full pointers and not offsets, so it could be a decent perf hit.
- astrange 1y agoIndices can be much smaller than pointers (which are 8 bytes), so they have plenty of cache advantages of their own which can make up for that.
- deleted 1y ago[deleted]
- whstl 1y agoStill depends. If the indices are pointing to a dense, flat, contiguous array, it will still be faster than following pointers into scattered heap allocations, with or without prefetching, because of how CPU caching works.