知识卡片
块访问摊薄定位延迟
磁盘在完成定位后按连续块读取或写入,而非每次只取一个小项。
一次访问带回更多相邻数据,才能摊薄机械定位的固定成本;块大小与设备有关,不能把书中示例尺寸写成通用常量。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第18章 B树 · 查看原书依据
In order to amortize the time spent waiting for mechanical movements, also known as latency, disk drives access not just one item but several at a time. Information is divided into a number of equal-sized blocks of bits that appear consecutively within tracks, and each disk read or write is of one or more entire blocks.2 Typical disk drives have block sizes running from 512 to 4096 bytes.
参考来源
- 位置:《算法导论(第4版)》第18章《B树》(OEBPS/chapter018.xhtml,文本字符[5000,10000))。
- 结论依据:原文解释按连续块传输是为摊薄定位延迟。
- 原始内容:In order to amortize the time spent waiting for mechanical movements, also known as latency , disk drives access not just one item but several at a time. Information is divided into a number of equal-sized blocks of bits that appear consecutively within tracks, and each disk read or write is of one or more entire blocks. 2 Typical disk drives have block sizes running from 512 to 4096 bytes.