Also, memory is way slower than the CPU cache(s). So operating within a small su... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		nine_k on July 25, 2020 \| parent \| context \| favorite \| on: Wolfsort: An ultra-fast hybrid radix sort algorith... Also, memory is way slower than the CPU cache(s). So operating within a small subset of the available memory is still beneficial if you need the top performance.

gridlockd on July 25, 2020 [–]

There often is only a narrow range where (data + overhead) is larger than cache, but (data + 0) is smaller than cache.

Cached reads/writes arent't free either, so if overhead drastically reduces those, you may come out on top 100% of the time.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact