对于随机读写安全所造成的性能损失几乎可以忽略不计；对于顺序读写，性能下降了7%- 28%。
For random accesses, the performance penalty can be ignored, and for sequential disk accesses, there are about 7-28% performance degradation.
通过仔细地观察读写序列计数，可以进一步确定访问是顺序的还是随机的。
By looking at the read and write sequence counts in detail, you can further determine if the access is sequential or random.
动态平均读写算法并不是随机使用可用的块，而是平均使用块，因此，每个块都获得了相同的使用机会。
Rather than randomly using blocks as they are available, dynamic wear-leveling algorithms attempt to evenly distribute the use of blocks so that each gets uniform use.
在上面的例子中，我描述了一个单线程的进程读写磁盘的单个随机块的情况。
In the example above I described a single-threaded process reading or writing a single random block on a disk.
由于它不是以高速旋转的磁盘作为存储介质，数据读写时不需要寻道时间，因此它有着传统硬盘不可比拟的顺序和随机存储速度。
Since it is not using high speed spinning disks as storage media like traditional hard disks, SSD obtains much higher sequential and random access speed than traditional hard disks.
我认为一些字节有高价值，给你“随机”在你的读写数据。
I'd expect that some bytes end up having higher-value bits set, giving you "random" data in your reads and writes.
我认为一些字节有高价值，给你“随机”在你的读写数据。
I'd expect that some bytes end up having higher-value bits set, giving you "random" data in your reads and writes.
应用推荐