Adaptive deterministic grouping of blocks into multi-block units
    12.
    发明授权
    Adaptive deterministic grouping of blocks into multi-block units 有权
    块自适应确定性分组成多块单位

    公开(公告)号:US07970985B2

    公开(公告)日:2011-06-28

    申请号:US12512282

    申请日:2009-07-30

    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.

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

    Structures for the management of erase operations in non-volatile memories
    13.
    发明授权
    Structures for the management of erase operations in non-volatile memories 有权
    用于管理非易失性存储器中擦除操作的结构

    公开(公告)号:US07783845B2

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

    申请号:US11273773

    申请日:2005-11-14

    IPC分类号: G06F13/12

    CPC分类号: G06F12/0246 G06F2212/7205

    摘要: The present invention presents a number of improvements for managing erase processes in non-volatile memory. Such memory systems typically manage the memory by logically organize the basic unit of physical erase (erase block) into composite logical groupings (meta-blocks or logical group), where an erase block generally consists of a number of sectors. When an erase command is received, the specified sectors are checked against the memory system's control data. If the specified sectors span any full logical grouping, the full logical groupings can each be treated as a whole and erased according to one process (such as performing a true, physical erase), while other sectors are “logically” erased at the sector level by standard techniques.

    摘要翻译: 本发明提出了用于管理非易失性存储器中的擦除处理的许多改进。 这样的存储器系统通常通过将物理擦除的基本单元(擦除块)逻辑地组织到复合逻辑分组(元块或逻辑组)中来管理存储器,其中擦除块通常由多个扇区组成。 当接收到擦除命令时,根据存储器系统的控制数据检查指定的扇区。 如果指定的扇区跨越任何完整的逻辑分组,则完全逻辑分组可以作为一个整体处理,并根据一个进程(如执行真实的物理擦除)进行擦除,而其他扇区在扇区级“逻辑”地擦除 通过标准技术。

    Non-volatile memory and method with multi-stream updating
    19.
    发明授权
    Non-volatile memory and method with multi-stream updating 有权
    非易失性存储器和多流更新方法

    公开(公告)号:US08151035B2

    公开(公告)日:2012-04-03

    申请号:US12189396

    申请日:2008-08-11

    IPC分类号: G06F12/00

    摘要: In a memory that is programmable page by page and each page having multiple sectors that are once-programmable, even if successive writes are sequential, the data recorded to an update block may be fragmented and non-sequential. Instead of recording update data to an update block, the data is being recorded in at least two interleaving streams. When a full page of data is available, it is recorded to the update block. Otherwise, it is temporarily recorded to the scratch pad block until a full page of data becomes available to be transferred to the update block. Preferably, a pipeline operation allows the recording to the update block to be set up as soon as the host write command indicates a full page could be written. If the actual write data is incomplete due to interruptions, the setup will be canceled and recording is made to the scratch pad block instead.

    摘要翻译: 在逐页可编程的存储器中,每页具有一次可编程的多个扇区,即使顺序写入是顺序的,记录到更新块的数据可能是分段的和非顺序的。 代替将更新数据记录到更新块,数据被记录在至少两个交错流中。 当全页数据可用时,它被记录到更新块。 否则,它暂时记录到便笺块块中,直到完整页面的数据可用于传送到更新块。 优选地,管道操作允许一旦主机写入命令指示可以写入完整页面就可以对更新块进行记录。 如果实际的写入数据由于中断而不完整,则设置将被取消,而代之以记录。

    Adaptive deterministic grouping of blocks into multi-block units
    20.
    发明授权
    Adaptive deterministic grouping of blocks into multi-block units 有权
    块自适应确定性分组成多块单位

    公开(公告)号:US08117381B2

    公开(公告)日:2012-02-14

    申请号: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.

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