利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

59 条记录 (耗时 0.057 秒)

    Non-volatile memory and method with multi-stream update tracking
    21.
    发明授权
    Non-volatile memory and method with multi-stream update tracking 有权
    非易失性存储器和具有多流更新跟踪的方法

    公开(公告)号：US07366826B2

    公开(公告)日：2008-04-29

    申请号：US11192220

    申请日：2005-07-27

    申请人： Sergey Anatolievich Gorobets ,  Peter John Smith ,  Alan David Bennett

    发明人： Sergey Anatolievich Gorobets ,  Peter John Smith ,  Alan David Bennett

    IPC分类号： G06F12/00

    CPC分类号： G06F12/0246 ,  G06F2212/1032 ,  G06F2212/7203

    摘要： Update data to a non-volatile memory may be recorded in at least two interleaving streams such as either into an update block or a scratch pad block depending on a predetermined condition. The scratch pad block is used to buffered update data that are ultimately destined for the update block. Synchronization information about the order recording of updates among the streams is saved with at least one of the streams. This will allow the most recently written version of data that may exist on multiple memory blocks to be identified. In one embodiment, the synchronization information is saved in a first block and is a write pointer that points to the next recording location in a second block. In another embodiment, the synchronization information is a time stamp.

    摘要翻译： 根据预定条件，将数据更新到非易失性存储器可以记录在至少两个交织流中，诸如更新块或便笺块块中。 缓冲块块用于缓冲最终发往更新块的更新数据。 与流中的更新的顺序记录的同步信息与至少一个流一起被保存。 这将允许识别可能存在于多个内存块上的最新版本的数据。 在一个实施例中，同步信息被保存在第一块中，并且是指向第二块中的下一个记录位置的写指针。 在另一个实施例中，同步信息是时间戳。

    Method for non-volatile memory with worst-case control data management
    22.
    发明申请
    Method for non-volatile memory with worst-case control data management 审中-公开
    用于具有最坏情况控制数据管理的非易失性存储器的方法

    公开(公告)号：US20080091901A1

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

    申请号：US11549035

    申请日：2006-10-12

    申请人： Alan David Bennett ,  Neil David Hutchison ,  Sergey Anatolievich Gorobets

    发明人： Alan David Bennett ,  Neil David Hutchison ,  Sergey Anatolievich Gorobets

    IPC分类号： G06F13/00 ,  G06F12/00

    CPC分类号： G06F12/0246 ,  G06F2212/7202 ,  G06F2212/7205

    摘要： 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.

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

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

    公开(公告)号：US07970985B2

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

    申请号：US12512282

    申请日：2009-07-30

    申请人： Carlos J. Gonzalez ,  Alan Douglas Bryce ,  Sergey Anatolievich Gorobets ,  Alan David Bennett

    发明人： Carlos J. Gonzalez ,  Alan Douglas Bryce ,  Sergey Anatolievich Gorobets ,  Alan David Bennett

    IPC分类号： G06F12/00

    CPC分类号： G11C29/76 ,  G06F12/0246 ,  G06F2212/7201 ,  G06F2212/7208 ,  G11C29/808

    摘要： 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
    27.
    发明授权
    Structures for the management of erase operations in non-volatile memories 有权
    用于管理非易失性存储器中擦除操作的结构

    公开(公告)号：US07783845B2

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

    申请号：US11273773

    申请日：2005-11-14

    申请人： Alan David Bennett ,  Alan Douglas Bryce ,  Sergey Anatolievich Gorobets

    发明人： Alan David Bennett ,  Alan Douglas Bryce ,  Sergey Anatolievich Gorobets

    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.

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

    Use of guard bands and phased maintenance operations to avoid exceeding maximum latency requirements in non-volatile memory systems
    30.
    发明授权
    Use of guard bands and phased maintenance operations to avoid exceeding maximum latency requirements in non-volatile memory systems 有权
    使用保护频段和分阶段的维护操作，以避免在非易失性存储器系统中超过最大延迟要求

    公开(公告)号：US08417876B2

    公开(公告)日：2013-04-09

    申请号：US12821759

    申请日：2010-06-23

    申请人： Sergey Anatolievich Gorobets ,  Robert George Young ,  Alan David Bennett

    发明人： Sergey Anatolievich Gorobets ,  Robert George Young ,  Alan David Bennett

    IPC分类号： G06F12/06

    CPC分类号： G06F12/0246 ,  G06F2212/7205

    摘要： Techniques are presented for performing maintenance operations, such as garbage collection, on non-volatile memory systems will still respecting the maximum latency, or time-out, requirements of a protocol. A safety guard band in the space available for storing host data, control data, or both, is provided. If, on an access of the memory, it is determined that the guard band space is exceeded, the system uses a recovery back to the base state by triggering and prioritizing clean-up operations to re-establish all safety guard bands without breaking the timing requirements. To respect these timing requirements, the operations are split into portions and done in a phased manner during allowed latency periods.

    摘要翻译： 提出了用于执行维护操作（例如垃圾收集）的技术，在非易失性存储器系统上仍将遵守协议的最大等待时间或超时要求。 提供了可用于存储主机数据，控制数据或两者的空间中的安全保护带。 如果在存储器的访问上确定超过了保护带空间，则系统通过触发并清除清除操作的优先级将恢复恢复到基本状态，以重新建立所有安全保护带而不破坏时序 要求。 为了遵守这些时序要求，在允许的等待时间期间，操作被分成多个部分并以分阶段的方式完成。