Non-volatile memory and method with multi-stream updating
    32.
    发明授权
    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
    33.
    发明授权
    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.

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

    Non-volatile memory and method with memory planes alignment
    34.
    发明授权
    Non-volatile memory and method with memory planes alignment 有权
    非易失性存储器和方法与存储器平面对齐

    公开(公告)号:US07913061B2

    公开(公告)日:2011-03-22

    申请号:US12239351

    申请日:2008-09-26

    IPC分类号: G06F12/00

    摘要: A non-volatile memory is constituted from a set of memory planes, each having its own set of read/write circuits so that the memory planes can operate in parallel. The memory is further organized into erasable blocks, each for storing a logical group of logical units of data. In updating a logical unit, all versions of a logical unit are maintained in the same plane as the original. Preferably, all versions of a logical unit are aligned within a plane so that they are all serviced by the same set of sensing circuits. In a subsequent garbage collection operation, the latest version of the logical unit need not be retrieved from a different plane or a different set of sensing circuits, otherwise resulting in reduced performance. In one embodiment, any gaps left after alignment are padded by copying latest versions of logical units in sequential order thereto.

    摘要翻译: 非易失性存储器由一组存储器平面构成,每个存储器平面具有其自己的一组读/写电路,使得存储器平面可以并行操作。 存储器被进一步组织成可擦除块,每个块用于存储数据的逻辑单元的逻辑组。 在更新逻辑单元时,逻辑单元的所有版本都保持在与原始单元相同的平面中。 优选地,逻辑单元的所有版本在平面内对准,使得它们都由相同的一组感测电路服务。 在随后的垃圾回收操作中,不需要从不同的平面或不同的感测电路组检索最新版本的逻辑单元,否则导致性能降低。 在一个实施例中,通过按照顺序复制最新版本的逻辑单元来填补对齐之后留下的任何间隙。

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

    公开(公告)号:US07624239B2

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

    申请号:US11273774

    申请日:2005-11-14

    IPC分类号: G06F13/12

    摘要: 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 Non-Sequential Update Block Management
    36.
    发明申请
    Non-Volatile Memory And Method With Non-Sequential Update Block Management 有权
    非易失性存储器和非顺序更新块管理方法

    公开(公告)号:US20090019218A1

    公开(公告)日:2009-01-15

    申请号:US12239489

    申请日:2008-09-26

    IPC分类号: G06F12/02 G06F12/00 G06F12/06

    摘要: In a nonvolatile memory with block management system that supports update blocks with non-sequential logical units, an index of the logical units in a non-sequential update block is buffered in RAM and stored periodically into the nonvolatile memory. In one embodiment, the index is stored in a block dedicated for storing indices. In another embodiment, the index is stored in the update block itself. In yet another embodiment, the index is stored in the header of each logical unit. In another aspect, the logical units written after the last index update but before the next have their indexing information stored in the header of each logical unit. In this way, after a power outage, the location of recently written logical units can be determined without having to perform a scanning during initialization. In yet another aspect, a block is managed as partially sequential and partially non-sequential, directed to more than one logical subgroup.

    摘要翻译: 在具有支持具有非顺序逻辑单元的更新块的块管理系统的非易失性存储器中,非顺序更新块中的逻辑单元的索引被缓冲在RAM中并被周期性地存储到非易失性存储器中。 在一个实施例中,索引被存储在专用于存储索引的块中。 在另一个实施例中,索引被存储在更新块本身中。 在另一个实施例中,索引被存储在每个逻辑单元的标题中。 在另一方面,在最后一个索引更新之后但在下一个之前写入的逻辑单元将其索引信息存储在每个逻辑单元的标题中。 以这种方式,在断电之后,可以确定最近写入的逻辑单元的位置,而不必在初始化期间执行扫描。 在另一方面,块被部署顺序地且部分地非顺序地管理,定向到多于一个的逻辑子组。

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

    公开(公告)号:US07412560B2

    公开(公告)日:2008-08-12

    申请号:US11191686

    申请日:2005-07-27

    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.

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

    Non-volatile memory with worst-case control data management
    38.
    发明申请
    Non-volatile memory with worst-case control data management 审中-公开
    具有最坏情况控制数据管理的非易失性存储器

    公开(公告)号:US20080091871A1

    公开(公告)日:2008-04-17

    申请号:US11549040

    申请日:2006-10-12

    IPC分类号: G06F13/00 G06F12/00

    摘要: In a nonvolatile memory with a block management system, data written to blocks include host write data and also system control data for managing the blocks. When a block is full or no longer accepting data, it is closed after valid versions of the data on it are relocated to another block in a rewrite operation. An improved pre-emptive rewrite scheme prevents a worst-case situation where multiple rewrites to occur at once when they happened to be full at the same time. Particularly, the scheduling of the pre-emptive rewrites for control data is based on a number of considerations including the time required for each control block rewrite and the time available for control block rewrites based on the configuration of the update blocks for storing host data, the time required in the foreground host operation and the host write latency.

    摘要翻译: 在具有块管理系统的非易失性存储器中,写入块的数据包括主机写入数据以及用于管理块的系统控制数据。 当块已满或不再接受数据时,在重写操作中将其上的数据的有效版本重定位到另一个块之后,它将被关闭。 改进的优先重写方案可以防止在同时发生多次重写时立即发生多次重写的最坏情况。 特别地,用于控制数据的优先重写的调度基于多个考虑因素,包括基于用于存储主机数据的更新块的配置,每个控制块重写所需的时间和可用于控制块重写的时间, 前台主机操作所需的时间和主机写入延迟。