-
公开(公告)号：US20110191530A1
公开(公告)日：2011-08-04
申请号：US13084396
申请日：2011-04-11
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.
摘要翻译： 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后，在非易失性存储器中维护链接的记录，在需要时可以容易地访问。 在一组实施例中，根据算法确定性地形成初始链接，并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现，链接被更新，通过替换与优质块链接的坏块，优选地与它们所替换的块相同的存储器子阵列来更新。
-
公开(公告)号：US20090292944A1
公开(公告)日：2009-11-26
申请号：US12512282
申请日：2009-07-30
IPC分类号： G06F11/20
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.
摘要翻译： 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后，在非易失性存储器中维护链接的记录，在需要时可以容易地访问。 在一组实施例中，根据算法确定性地形成初始链接，并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现，链接被更新，通过替换与优质块链接的坏块，优选地与它们所替换的块相同的存储器子阵列来更新。
-
公开(公告)号：US08239643B2
公开(公告)日：2012-08-07
申请号：US13244178
申请日：2011-09-23
IPC分类号： G06F12/00
CPC分类号： G06F11/1666 , G06F11/1072 , G06F11/141 , G06F11/1415 , G06F11/1658 , G06F12/0246 , G06F2212/7202 , G06F2212/7203 , G06F2212/7205 , G06F2212/7208 , G11C11/5621 , G11C11/5628 , G11C16/102 , G11C16/105 , G11C16/20 , G11C29/00 , G11C29/76 , G11C2211/5641
摘要： In a nonvolatile memory with block management system, critical data such as control data for the block management system is maintained in duplicates. Various methods are described for robustly writing and reading two copies of critical data in multi-state memory. In another aspect of the invention, a preemptive garbage collection on memory block containing control data avoids an undesirable situation where a large number of such memory blocks need be garbage collected at the same time.
摘要翻译： 在具有块管理系统的非易失性存储器中，诸如块管理系统的控制数据的关键数据保持重复。 描述了用于在多状态存储器中强制写入和读取关键数据的两个副本的各种方法。 在本发明的另一方面，在包含控制数据的存储器块上的抢先垃圾收集避免了不希望的情况，其中大量的这种存储块需要同时被垃圾收集。
-
公开(公告)号：US08117381B2
公开(公告)日：2012-02-14
申请号：US13084396
申请日：2011-04-11
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.
摘要翻译： 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后，在非易失性存储器中维护链接的记录，在需要时可以容易地访问。 在一组实施例中，根据算法确定性地形成初始链接，并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现，链接被更新，通过替换与优质块链接的坏块，优选地与它们所替换的块相同的存储器子阵列来更新。
-
5.发明授权公开(公告)号：US07624239B2
公开(公告)日：2009-11-24
申请号：US11273774
申请日：2005-11-14
IPC分类号： G06F13/12
CPC分类号： G11C16/16 , 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.
摘要翻译： 本发明提出了用于管理非易失性存储器中的擦除处理的许多改进。 这样的存储器系统通常通过将物理擦除的基本单元（擦除块）逻辑地组织到复合逻辑分组（元块或逻辑组）中来管理存储器，其中擦除块通常由多个扇区组成。 当接收到擦除命令时，根据存储器系统的控制数据检查指定的扇区。 如果指定的扇区跨越任何完整的逻辑分组，则完全逻辑分组可以作为一个整体处理，并根据一个进程（如执行真实的物理擦除）进行擦除，而其他扇区在扇区级“逻辑”地擦除 通过标准技术。
-
公开(公告)号：US20120017038A1
公开(公告)日：2012-01-19
申请号：US13244178
申请日：2011-09-23
IPC分类号： G06F12/02
CPC分类号： G06F11/1666 , G06F11/1072 , G06F11/141 , G06F11/1415 , G06F11/1658 , G06F12/0246 , G06F2212/7202 , G06F2212/7203 , G06F2212/7205 , G06F2212/7208 , G11C11/5621 , G11C11/5628 , G11C16/102 , G11C16/105 , G11C16/20 , G11C29/00 , G11C29/76 , G11C2211/5641
摘要： In a nonvolatile memory with block management system, critical data such as control data for the block management system is maintained in duplicates. Various methods are described for robustly writing and reading two copies of critical data in multi-state memory. In another aspect of the invention, a preemptive garbage collection on memory block containing control data avoids an undesirable situation where a large number of such memory blocks need be garbage collected at the same time.
摘要翻译： 在具有块管理系统的非易失性存储器中，诸如块管理系统的控制数据的关键数据保持重复。 描述了用于在多状态存储器中强制写入和读取关键数据的两个副本的各种方法。 在本发明的另一方面，在包含控制数据的存储器块上的抢先垃圾收集避免了不希望的情况，其中大量的这种存储块需要同时被垃圾收集。
-
公开(公告)号：US08051257B2
公开(公告)日：2011-11-01
申请号：US10917725
申请日：2004-08-13
IPC分类号： G06F12/16
CPC分类号： G06F11/1666 , G06F11/1072 , G06F11/141 , G06F11/1415 , G06F11/1658 , G06F12/0246 , G06F2212/7202 , G06F2212/7203 , G06F2212/7205 , G06F2212/7208 , G11C11/5621 , G11C11/5628 , G11C16/102 , G11C16/105 , G11C16/20 , G11C29/00 , G11C29/76 , G11C2211/5641
摘要： In a nonvolatile memory with block management system, critical data such as control data for the block management system is maintained in duplicates. Various methods are described for robustly writing and reading two copies of critical data in multi-state memory. In another aspect of the invention, a preemptive garbage collection on memory block containing control data avoids an undesirable situation where a large number of such memory blocks need be garbage collected at the same time.
摘要翻译： 在具有块管理系统的非易失性存储器中，诸如块管理系统的控制数据的关键数据保持重复。 描述了用于在多状态存储器中强制写入和读取关键数据的两个副本的各种方法。 在本发明的另一方面，在包含控制数据的存储器块上的抢先垃圾收集避免了不希望的情况，其中大量的这种存储块需要同时被垃圾收集。
-
公开(公告)号：US07970985B2
公开(公告)日：2011-06-28
申请号：US12512282
申请日：2009-07-30
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.
摘要翻译： 本发明提出了用于将非易失性存储器的物理块链接到复合逻辑结构或“元区块”中的技术。 在确定好的物理块到元区块的初始链接之后，在非易失性存储器中维护链接的记录，在需要时可以容易地访问。 在一组实施例中，根据算法确定性地形成初始链接，并且可以根据存储器中的任何坏块的模式进行优化。 随着额外的坏块出现，链接被更新，通过替换与优质块链接的坏块，优选地与它们所替换的块相同的存储器子阵列来更新。
-
9.发明授权公开(公告)号：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.
摘要翻译： 本发明提出了用于管理非易失性存储器中的擦除处理的许多改进。 这样的存储器系统通常通过将物理擦除的基本单元（擦除块）逻辑地组织到复合逻辑分组（元块或逻辑组）中来管理存储器，其中擦除块通常由多个扇区组成。 当接收到擦除命令时，根据存储器系统的控制数据检查指定的扇区。 如果指定的扇区跨越任何完整的逻辑分组，则完全逻辑分组可以作为一个整体处理，并根据一个进程（如执行真实的物理擦除）进行擦除，而其他扇区在扇区级“逻辑”地擦除 通过标准技术。
-
公开(公告)号：US07139864B2
公开(公告)日：2006-11-21
申请号：US10750155
申请日：2003-12-30
申请人： Alan David Bennett , Alan Douglas Bryce , Sergey Gorobets , Alan Welsh Sinclair , Peter John Smith
发明人： Alan David Bennett , Alan Douglas Bryce , Sergey Gorobets , Alan Welsh Sinclair , Peter John Smith
IPC分类号： G06F12/00
CPC分类号： G06F11/1666 , G06F11/1072 , G06F11/141 , G06F11/1415 , G06F11/1658 , G06F12/0246 , G06F2212/7202 , G06F2212/7203 , G06F2212/7205 , G06F2212/7208 , G11C11/5621 , G11C11/5628 , G11C16/102 , G11C16/105 , G11C16/20 , G11C29/00 , G11C29/76 , G11C2211/5641
摘要： A non-volatile memory system is organized in physical groups of physical memory locations. Each physical group (metablock) is erasable as a unit and can be used to store a logical group of data. A memory management system allows for update of a logical group of data by allocating a metablock dedicated to recording the update data of the logical group. The update metablock records update data in the order received and has no restriction on whether the recording is in the correct logical order as originally stored (sequential) or not (chaotic). Eventually the update metablock is closed to further recording. One of several processes will take place, but will ultimately end up with a fully filled metablock in the correct order which replaces the original metablock. In the chaotic case, directory data is maintained in the non-volatile memory in a manner that is conducive to frequent updates. The system supports multiple logical groups being updated concurrently.
摘要翻译： 非易失性存储器系统被组织在物理存储器位置的物理组中。 每个物理组（元区块）作为一个单元是可擦除的，可用于存储一组逻辑数据。 存储器管理系统允许通过分配专用于记录逻辑组的更新数据的元区块来更新逻辑数据组。 更新元区块以所接收的顺序记录更新数据，并且对于是否按照原始存储（顺序）或不是混乱的顺序，记录是否处于正确的逻辑顺序中是没有限制的。 最终，更新元区块被关闭以进一步录制。 几个进程之一将发生，但最终将以完全填充的元区块以正确的顺序取代原来的元区块。 在混乱的情况下，目录数据以有利于频繁更新的方式保存在非易失性存储器中。 系统支持同时更新的多个逻辑组。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.024 秒)