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.
动态平均读写算法并不是随机使用可用的块,而是平均使用块,因此,每个块都获得了相同的使用机会。
Static wear-leveling algorithms address an even more interesting problem.
静态平均读写算法解决了一个更有趣的问题。
Static wear-leveling algorithms address this by periodically moving stale data to new blocks.
静态平均读写算法解决了这一问题,因为它可以定期将数据移动到新块。
应用推荐