TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Performance Quiz #14: Memory Locality, X64 vs. X86, Alignment, and Density

5 点作者 Quppa超过 10 年前

1 comment

signa11超过 10 年前
explanation by &#x27;Ryan&#x27; on the linked page:<p>Wait - are you concluding that completely randomized access is the same speed as sequential for very large cases? That would be very surprising!!<p>What&#x27;s the range of rand()? If it&#x27;s 32k that would mean you&#x27;re just shuffling the first 32k items and doing basically sequential reads for most items in the large case, and the per-item avg would become very close to the sequential case. This matches your data very well.