Spare block management of non-volatile memories
    11.
    发明授权
    Spare block management of non-volatile memories 有权
    非易失性存储器的备件管理

    公开(公告)号:US08040744B2

    公开(公告)日:2011-10-18

    申请号:US12348825

    申请日:2009-01-05

    IPC分类号: G11C29/00

    摘要: Techniques for the management of spare blocks in re-programmable non-volatile memory system, such as a flash EEPROM system, are presented. In one set of techniques, for a memory partitioned into two sections (for example a binary section and a multi-state section), where blocks of one section are more prone to error, spare blocks can be transferred from the more error prone partition to the less error prone partition. In another set of techniques for a memory partitioned into two sections, blocks which fail in the more error prone partition are transferred to serve as spare blocks in the other partition. In a complementary set of techniques, a 1-bit time stamp is maintained for free blocks to determine whether the block has been written recently. Other techniques allow for spare blocks to be managed by way of a logical to physical conversion table by assigning them logical addresses that exceed the logical address space of which a host is aware.

    摘要翻译: 提出了用于管理可重新编程的非易失性存储器系统中的备用块的技术,例如闪存EEPROM系统。 在一组技术中,对于分为两个部分(例如二进制部分和多状态部分)的内存,一个部分的块更容易出错,备用块可以从更易出错的分区传输到 较小的错误分区。 在分为两部分的内存的另一组技术中,在更容易出错的分区中失败的块被传送到另一分区中的备用块。 在一组互补的技术中,为空闲块维护1位时间戳,以确定块是否已被最近写入。 其他技术允许通过逻辑到物理转换表来管理备用块,分配逻辑地址超过主机知道的逻辑地址空间。

    Spare Block Management of Non-Volatile Memories
    12.
    发明申请
    Spare Block Management of Non-Volatile Memories 有权
    非易失性存储的备件管理

    公开(公告)号:US20100172179A1

    公开(公告)日:2010-07-08

    申请号:US12348825

    申请日:2009-01-05

    IPC分类号: G11C16/04 G11C29/00

    摘要: Techniques for the management of spare blocks in re-programmable non-volatile memory system, such as a flash EEPROM system, are presented. In one set of techniques, for a memory partitioned into two sections (for example a binary section and a multi-state section), where blocks of one section are more prone to error, spare blocks can be transferred from the more error prone partition to the less error prone partition. In another set of techniques for a memory partitioned into two sections, blocks which fail in the more error prone partition are transferred to serve as spare blocks in the other partition. In a complementary set of techniques, a 1-bit time stamp is maintained for free blocks to determine whether the block has been written recently. Other techniques allow for spare blocks to be managed by way of a logical to physical conversion table by assigning them logical addresses that exceed the logical address space of which a host is aware.

    摘要翻译: 提出了用于管理可重新编程的非易失性存储器系统中的备用块的技术,例如闪存EEPROM系统。 在一组技术中,对于分为两个部分(例如二进制部分和多状态部分)的内存,一个部分的块更容易出错,备用块可以从更易出错的分区传输到 较小的错误分区。 在分为两部分的内存的另一组技术中,在更容易出错的分区中失败的块被传送到另一分区中的备用块。 在一组互补的技术中,为空闲块维护1位时间戳,以确定块是否已被最近写入。 其他技术允许通过逻辑到物理转换表来管理备用块,分配逻辑地址超过主机知道的逻辑地址空间。

    Scheduling of housekeeping operations in flash memory systems
    13.
    发明授权
    Scheduling of housekeeping operations in flash memory systems 有权
    安排闪存系统中的内务管理操作

    公开(公告)号:US07565478B2

    公开(公告)日:2009-07-21

    申请号:US11949618

    申请日:2007-12-03

    IPC分类号: G06F12/02 G06F13/00

    摘要: A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

    摘要翻译: 操作一个可重新编程的非易失性存储器系统,例如闪存EEPROM系统,其具有分组为可同时擦除的单元块的存储器单元,以在主机命令的执行期间在前台执行存储器系统管理操作,其中, 内务管理操作与主机命令的执行无关。 在为执行该特定命令建立的时间预算内执行一个或多个此类内务处理操作和主机命令的执行。 一个这样的命令是将正在接收的数据写入存储器。 一个这样的内务处理操作是通过重复擦除和重新编程来平衡累积的各个块的磨损。

    Scheduling of Housekeeping Operations in Flash Memory Systems
    14.
    发明申请
    Scheduling of Housekeeping Operations in Flash Memory Systems 有权
    闪存系统中的家务操作计划

    公开(公告)号:US20090265508A1

    公开(公告)日:2009-10-22

    申请号:US12493500

    申请日:2009-06-29

    IPC分类号: G06F12/02 G06F12/00

    摘要: A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

    摘要翻译: 操作一个可重新编程的非易失性存储器系统,例如闪存EEPROM系统,其具有分组为可同时擦除的单元块的存储器单元,以在主机命令的执行期间在前台执行存储器系统管理操作,其中, 内务管理操作与主机命令的执行无关。 在为执行该特定命令建立的时间预算内执行一个或多个此类内务处理操作和主机命令的执行。 一个这样的命令是将正在接收的数据写入存储器。 一个这样的内务处理操作是通过重复擦除和重新编程来平衡累积的各个块的磨损。

    Scheduling of housekeeping operations in flash memory systems
    15.
    发明授权
    Scheduling of housekeeping operations in flash memory systems 有权
    安排闪存系统中的内务管理操作

    公开(公告)号:US07315917B2

    公开(公告)日:2008-01-01

    申请号:US11312985

    申请日:2005-12-19

    IPC分类号: G06F12/00 G06F13/00

    摘要: A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

    摘要翻译: 操作一个可重新编程的非易失性存储器系统,例如闪存EEPROM系统,其具有分组为可同时擦除的单元块的存储器单元,以在主机命令的执行期间在前台执行存储器系统管理操作,其中, 内务管理操作与主机命令的执行无关。 在为执行该特定命令建立的时间预算内执行一个或多个此类内务处理操作和主机命令的执行。 一个这样的命令是将正在接收的数据写入存储器。 一个这样的内务处理操作是通过重复擦除和重新编程来平衡累积的各个块的磨损。

    Adaptive Deterministic Grouping of Blocks into Multi-Block Units
    19.
    发明申请
    Adaptive Deterministic Grouping of Blocks into Multi-Block Units 有权
    块自适应确定性分组成多块单位

    公开(公告)号:US20110191530A1

    公开(公告)日:2011-08-04

    申请号:US13084396

    申请日:2011-04-11

    IPC分类号: G06F12/00

    摘要: The present invention presents techniques for the linking of physical blocks of a non-volatile memory into composite logical structures or “metablocks”. After determining an initial linking of good physical blocks into metablocks, a record of the linking is maintained in the non-volatile memory where it can be readily accessed when needed. In one set of embodiments, the initially linking is deterministically formed according to an algorithm and can be optimized according to the pattern of any bad blocks in the memory. As additional bad blocks arise, the linking is updated using by replacing the bad blocks in a linking with good blocks, preferably in the same sub-array of the memory as the block that they are replacing.

    摘要翻译: 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后,在非易失性存储器中维护链接的记录,在需要时可以容易地访问。 在一组实施例中,根据算法确定性地形成初始链接,并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现,链接被更新,通过替换与优质块链接的坏块,优选地与它们所替换的块相同的存储器子阵列来更新。

    Adaptive Deterministic Grouping of Blocks into Multi-Block Units
    20.
    发明申请
    Adaptive Deterministic Grouping of Blocks into Multi-Block Units 有权
    块自适应确定性分组成多块单位

    公开(公告)号:US20090292944A1

    公开(公告)日:2009-11-26

    申请号:US12512282

    申请日:2009-07-30

    IPC分类号: G06F11/20

    摘要: The present invention presents techniques for the linking of physical blocks of a non-volatile memory into composite logical structures or “metablocks”. After determining an initial linking of good physical blocks into metablocks, a record of the linking is maintained in the non-volatile memory where it can be readily accessed when needed. In one set of embodiments, the initially linking is deterministically formed according to an algorithm and can be optimized according to the pattern of any bad blocks in the memory. As additional bad blocks arise, the linking is updated using by replacing the bad blocks in a linking with good blocks, preferably in the same sub-array of the memory as the block that they are replacing.

    摘要翻译: 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后,在非易失性存储器中维护链接的记录,在需要时可以容易地访问。 在一组实施例中,根据算法确定性地形成初始链接,并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现,链接被更新,通过替换与优质块链接的坏块,优选地与它们所替换的块相同的存储器子阵列来更新。