专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2005066972A1 NON-VOLATILE MEMORY AND METHOD WITH BLOCK MANAGEMENT SYSTEM 审中-公开
标题翻译：非易失性存储器和方法与块管理系统
公开(公告)号：WO2005066972A1
公开(公告)日：2005-07-21
申请号：PCT/US2004/043692
申请日：2004-12-21
申请人： SANDISK CORPORATION , BENNETT, Alan David , BRYCE, Alan Douglas , GOROBETS, Sergey , SINCLAIR, Alan Welsh , SMITH, Peter John
发明人： BENNETT, Alan David , BRYCE, Alan Douglas , GOROBETS, Sergey , SINCLAIR, Alan Welsh , SMITH, Peter John
IPC分类号： G11C16/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.
摘要翻译：非易失性存储器系统被组织在物理存储器位置的物理组中。每个物理组（元区块）作为一个单元是可擦除的，可用于存储一组逻辑数据。存储器管理系统允许通过分配专用于记录逻辑组的更新数据的元区块来更新逻辑数据组。更新元区块以所接收的顺序记录更新数据，并且对于是否按照原始存储（顺序）或不是混乱的顺序，记录是否处于正确的逻辑顺序中是没有限制的。最终，更新元区块被关闭以进一步录制。几个进程之一将发生，但最终将以完全填充的元区块以正确的顺序取代原来的元区块。在混乱的情况下，目录数据以有利于频繁更新的方式保存在非易失性存储器中。系统支持同时更新的多个逻辑组。

2. 发明申请

WO2005066793A2 NON-VOLATILE MEMORY AND METHOD WITH NON-SEQUENTIAL UPDATE BLOCK MANAGEMENT 审中-公开
标题翻译：非易失性存储器和非顺序更新块管理方法
公开(公告)号：WO2005066793A2
公开(公告)日：2005-07-21
申请号：PCT/US2004/043762
申请日：2004-12-21
申请人： SANDISK CORPORATION , SINCLAIR, Alan Welsh , GOROBETS, Sergey Anatolievich , BENNETT, Alan David , SMITH, Peter John
发明人： SINCLAIR, Alan Welsh , GOROBETS, Sergey Anatolievich , BENNETT, Alan David , SMITH, Peter John
IPC分类号： G06F12/02
CPC分类号： G06F12/0246 , G06F2212/7202
摘要： 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 non-volatile 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中并被周期性地存储到非易失性存储器中。在一个实施例中，索引被存储在专用于存储索引的块中。在另一个实施例中，索引被存储在更新块本身中。在另一个实施例中，索引被存储在每个逻辑单元的标题中。在另一方面，在最后一个索引更新之后但在下一个之前写入的逻辑单元将其索引信息存储在每个逻辑单元的标题中。以这种方式，在断电之后，可以确定最近写入的逻辑单元的位置，而不必在初始化期间执行扫描。在另一方面，块被部署顺序地且部分地非顺序地管理，定向到多于一个的逻辑子组。

3. 发明申请

WO2005066970A2 NON-VOLATILE MEMORY AND METHOD WITH CONTROL DATA MANAGEMENT 审中-公开
标题翻译：非易失性存储器和控制数据管理的方法
公开(公告)号：WO2005066970A2
公开(公告)日：2005-07-21
申请号：PCT/US2004/043680
申请日：2004-12-22
申请人： SANDISK CORPORATION , GOROBETS, Sergey Anatolievich , BRYCE, Alan Douglas , BENNETT, Alan David
发明人： GOROBETS, Sergey Anatolievich , BRYCE, Alan Douglas , BENNETT, Alan David
IPC分类号： G11C11/56
CPC分类号： G11C16/20 , G06F11/1072 , G06F11/141 , G06F11/1415 , G06F11/1658 , G06F11/1666 , G06F12/0246 , G06F2212/7202 , G06F2212/7205 , G11C11/5621 , G11C11/5628 , G11C29/00 , 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.
摘要翻译：在具有块管理系统的非易失性存储器中，诸如块管理系统的控制数据的关键数据保持重复。描述了用于在多状态存储器中强制写入和读取关键数据的两个副本的各种方法。在本发明的另一方面，在包含控制数据的存储器块上的抢占式垃圾收集避免了不希望的情况，其中大量的这种存储器块需要同时被垃圾收集。

4. 发明申请

WO2006065575A1 NON-VOLATILE MEMORY AND METHOD WITH MULTI-STREAM UPDATE TRACKING 审中-公开
标题翻译：非易失性存储器和方法与多流程更新跟踪
公开(公告)号：WO2006065575A1
公开(公告)日：2006-06-22
申请号：PCT/US2005/044001
申请日：2005-12-05
申请人： SANDISK CORPORATION , GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
发明人： GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
IPC分类号： G06F12/02
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.
摘要翻译：根据预定条件，将数据更新到非易失性存储器可以记录在至少两个交织流中，诸如更新块或便笺块块中。缓冲块块用于缓冲最终发往更新块的更新数据。与流中的更新的顺序记录的同步信息与至少一个流一起被保存。这将允许识别可能存在于多个内存块上的最新版本的数据。在一个实施例中，同步信息被保存在第一块中，并且是指向第二块中的下一个记录位置的写指针。在另一个实施例中，同步信息是时间戳。

5. 发明申请

WO2006065655A1 NON-VOLATILE MEMORY AND METHOD WITH IMPROVED INDEXING FOR SCRATCH PAD AND UPDATE BLOCKS 审中-公开
标题翻译：非易失性存储器和方法，用于改进刀片和更新块的索引
公开(公告)号：WO2006065655A1
公开(公告)日：2006-06-22
申请号：PCT/US2005/044649
申请日：2005-12-07
申请人： SANDISK CORPORATION , GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
发明人： GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
IPC分类号： G06F12/02
CPC分类号： G06F12/0246 , 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. In a preferred embodiment, an index of the data stored in the scratch pad block as well that stored in the update block is saved in an unused portion of the scratch pad block every time the scratch pad block is written to.
摘要翻译：根据预定条件，将数据更新到非易失性存储器可以被记录在至少两个交织流中，诸如更新块或便笺块块中。缓冲块块用于缓冲最终发往更新块的更新数据。在优选实施例中，存储在便签区块中的数据的索引以及存储在更新块中的数据被保存在每次写入便笺块块时的便笺本块的未使用部分中。

6. 发明申请

WO2005066792A2 NON-VOLATILE MEMORY AND METHOD WITH MEMORY PLANES ALIGNMENT 审中-公开
标题翻译：非易失性存储器和方法与存储器平面对齐
公开(公告)号：WO2005066792A2
公开(公告)日：2005-07-21
申请号：PCT/US2004/043377
申请日：2004-12-21
申请人： SANDISK CORPORATION , GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
发明人： GOROBETS, Sergey Anatolievich , SMITH, Peter John , BENNETT, Alan David
IPC分类号： G06F12/02
CPC分类号： G11C16/105 , G06F12/0246 , G06F2212/7202 , G06F2212/7208 , G11C11/5628 , G11C16/102
摘要： 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.
摘要翻译：非易失性存储器由一组存储器平面构成，每个存储器平面具有其自己的一组读/写电路，使得存储器平面可以并行操作。存储器被进一步组织成可擦除块，每个块用于存储数据的逻辑单元的逻辑组。在更新逻辑单元时，逻辑单元的所有版本都保持在与原始单元相同的平面中。优选地，逻辑单元的所有版本在平面内对准，使得它们都由相同的一组感测电路服务。在随后的垃圾回收操作中，不需要从不同的平面或不同的感测电路组检索最新版本的逻辑单元，否则导致性能降低。在一个实施例中，通过按照顺序复制最新版本的逻辑单元来填补对齐之后留下的任何间隙。

7. 发明申请

WO2010078222A1 NON-VOLATILE MEMORY AND METHOD WITH WRITE CACHE PARTITIONING 审中-公开
标题翻译：非易失性存储器和写入缓存分区的方法
公开(公告)号：WO2010078222A1
公开(公告)日：2010-07-08
申请号：PCT/US2009/069535
申请日：2009-12-24
申请人： SANDISK CORPORATION , PALEY, Alexander , GOROBETS, Sergey Anatolievich , ZILBERMAN, Eugene , BENNETT, Alan David , TRAISTER, Shai , TOMLIN, Andrew , WU, William S. , SO, Bum Suck
发明人： PALEY, Alexander , GOROBETS, Sergey Anatolievich , ZILBERMAN, Eugene , BENNETT, Alan David , TRAISTER, Shai , TOMLIN, Andrew , WU, William S. , SO, Bum Suck
IPC分类号： G06F12/02 , G06F12/08
CPC分类号： G06F12/0246 , G06F12/0804 , G06F2212/1016 , G06F2212/7204 , G11C11/5628 , G11C2211/5641
摘要： A portion of a nonvolatile memory is partitioned from a main multi-level memory array to operate as a cache. The cache memory is configured to store at less capacity per memory cell and finer granularity of write units compared to the main memory. In a block-oriented memory architecture, the cache has multiple functions, not merely to improve access speed, but is an integral part of a sequential update block system. Decisions to write data to the cache memory or directly to the main memory or decisions to archive data from the cache memory to the main memory depend on the attributes and characteristics of the data to be written, the state of the blocks in the main memory portion and the state of the blocks in the cache portion. The cache memory has a capacity dynamically increased by allocation of blocks from the main memory in response to a demand to increase the capacity. Preferably, a block with an endurance count higher than average is allocated. The logical addresses of data are partitioned into zones to limit the size of the indices for the cache.
摘要翻译：将非易失性存储器的一部分从主多层存储器阵列分区以作为高速缓存进行操作。缓存存储器被配置为以比每个存储器单元更少的容量存储和与主存储器相比写入单元的更细粒度。在面向块的存储器架构中，缓存具有多个功能，而不仅仅是提高访问速度，而是顺序更新块系统的组成部分。将数据写入高速缓冲存储器或直接写入主存储器的决定或将数据从高速缓冲存储器归档到主存储器的决定取决于要写入的数据的属性和特性，主存储器部分中的块的状态以及高速缓存部分中的块的状态。响应于增加容量的需求，高速缓冲存储器具有通过从主存储器分配块而动态增加的容量。优选地，分配耐力计数高于平均值的块。数据的逻辑地址被划分为区域以限制高速缓存的索引的大小。

8. 发明申请

WO2006065536A1 CLUSTER AUTO-ALIGNMENT 审中-公开
标题翻译：集群自动对齐
公开(公告)号：WO2006065536A1
公开(公告)日：2006-06-22
申请号：PCT/US2005/043285
申请日：2005-11-30
申请人： SANDISK CORPORATION , GOROBETS, Sergey Anatolievich , BENNETT, Alan David
发明人： GOROBETS, Sergey Anatolievich , BENNETT, Alan David
IPC分类号： G06F3/06
CPC分类号： G06F12/0246 , G06F2212/7202
摘要： Alignment of clusters to pages is provided in a non-volatile memory system that receives data from a host in clusters and writes data to a memory array in units of a page. Alignment is implemented within each block using offsets in logical-to-physical mapping of data. Different blocks may have different offsets. When a host sends data with different cluster boundary locations, the data may be written with different offsets so that data maintains alignment.
摘要翻译：集群与页面的对准在非易失性存储器系统中提供，该非易失性存储器系统以群集方式从主机接收数据，并以页为单位将数据写入存储器阵列。使用数据的逻辑到物理映射中的偏移在每个块内实现对齐。不同的块可能具有不同的偏移量。当主机发送具有不同簇边界位置的数据时，可以用不同的偏移量写入数据，以便数据保持对齐。

9. 发明申请

WO2008045839A1 NON-VOLATILE MEMORY WITH WORST-CASE CONTROL DATA MANAGEMENT AND METHODS THEREFOR 审中-公开
标题翻译：具有恶劣情况控制数据管理的非易失性存储器及其方法
公开(公告)号：WO2008045839A1
公开(公告)日：2008-04-17
申请号：PCT/US2007/080725
申请日：2007-10-08
申请人： SANDISK CORPORATION , BENNETT, Alan David , HUTCHISON, Neil David , GOROBETS, Sergey Anatolievich
发明人： BENNETT, Alan David , HUTCHISON, Neil David , GOROBETS, Sergey Anatolievich
IPC分类号： G11C16/10 , G06F12/02
CPC分类号： G06F12/0246 , G06F12/0292 , G06F12/0866 , G06F2212/7202 , G06F2212/7205 , G11C16/105 , G11C16/349 , G11C16/3495 , Y02D10/13
摘要： 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.
摘要翻译：在具有块管理系统的非易失性存储器中，写入块的数据包括主机写入数据以及用于管理块的系统控制数据。当块已满或不再接受数据时，在重写操作中将其上的数据的有效版本重新定位到另一个块之后，它将被关闭。改进的优先重写方案可以防止在同时发生多次重写时立即发生多次重写的最坏情况。特别地，用于控制数据的优先重写的调度基于多个考虑因素，包括基于用于存储主机数据的更新块的配置，每个控制块重写所需的时间和可用于控制块重写的时间，前台主机操作所需的时间和主机写入延迟。

10. 发明申请

WO2011162973A1 USE OF GUARD BANDS AND PHASED MAINTENANCE OPERATIONS TO AVOID EXCEEDING MAXIMUM LATENCY REQUIREMENTS IN NON-VOLATILE MEMORY SYSTEMS 审中-公开
标题翻译：使用保护银行和相关维护操作避免在非易失性存储系统中超过最大期限要求
公开(公告)号：WO2011162973A1
公开(公告)日：2011-12-29
申请号：PCT/US2011/039845
申请日：2011-06-09
申请人： SANDISK TECHNOLOGIES INC. , GOROBETS, Sergey Anatolievich , BENNETT, Alan David , YOUNG, Robert George
发明人： GOROBETS, Sergey Anatolievich , BENNETT, Alan David , YOUNG, Robert George
IPC分类号： G06F12/02
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 prioritising 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.
摘要翻译：提出了用于执行维护操作（例如垃圾收集）的技术，在非易失性存储器系统上仍将遵守协议的最大等待时间或超时要求。提供了可用于存储主机数据，控制数据或两者的空间中的安全保护带。如果在存储器的访问上确定超过了保护带空间，则系统通过触发并清除清除操作的优先级将恢复恢复到基本状态，以重新建立所有安全保护带而不破坏时序要求。为了遵守这些定时要求，在允许的等待时间段期间，操作被分成多个部分并以相位方式完成。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式