公开(公告)号：US08782327B1

公开(公告)日：2014-07-15

申请号：US12777771

申请日：2010-05-11

申请人： Ho-Fan Kang ,  Lan D. Phan

发明人： Ho-Fan Kang ,  Lan D. Phan

IPC分类号： G06F12/00

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

摘要： Embodiments of the invention are directed to enable simultaneous or nearly simultaneous execution of internal and host-issued commands in a non-volatile storage subsystem while maintaining data consistency. Embodiments maintain validity information on data residing at physical addresses as well as logical to physical address mappings in the solid-state storage subsystem. In one embodiment, a controller within the storage subsystem selectively cancels internal commands that it determines to be writing data that has been rendered invalid by another command. In one embodiment, the determination is made by consulting the validity information kept by the controller in an invalid page table.

摘要翻译： 本发明的实施例涉及在保持数据一致性的同时或几乎同时执行在非易失性存储子系统中的内部和主机发出的命令。 实施例保持驻留在物理地址上的数据以及固态存储子系统中的逻辑到物理地址映射的有效性信息。 在一个实施例中，存储子系统内的控制器选择性地取消其确定正在通过另一个命令写入已经被无效的数据的内部命令。 在一个实施例中，通过在无效页表中查询由控制器保存的有效性信息进行确定。

公开(公告)号：US08458435B1

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

申请号：US12973085

申请日：2010-12-20

申请人： Charles P. Rainey, III ,  Dominic S. Suryabudi ,  Ho-Fan Kang

发明人： Charles P. Rainey, III ,  Dominic S. Suryabudi ,  Ho-Fan Kang

IPC分类号： G06F12/00

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

摘要： Embodiments of the invention are directed to systems and methods for detecting sequential write threads in non-volatile storage media. The embodiments described herein detect write commands directed to a range of logical addresses corresponding to a write thread. Upon detection of a write command directed to a write thread, the write command is assigned a physical write address associated with the write thread. Identification of write threads can be implemented with a hardware component which performs comparison operations between the write command address range and the write thread address range.

摘要翻译： 本发明的实施例涉及用于检测非易失性存储介质中的顺序写入线程的系统和方法。 这里描述的实施例检测针对对应于写入线程的逻辑地址的范围的写入命令。 在检测到写入线程的写入命令时，写入命令被分配与写入线程相关联的物理写入地址。 可以用执行写入命令地址范围和写入线程地址范围之间的比较操作的硬件组件来实现写入线程的识别。

公开(公告)号：US09026716B2

公开(公告)日：2015-05-05

申请号：US12778740

申请日：2010-05-12

申请人： Ho-Fan Kang ,  Alan Chingtao Kan

发明人： Ho-Fan Kang ,  Alan Chingtao Kan

IPC分类号： G06F12/00 ,  G06F12/02 ,  G11C16/16

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

摘要： Methods and systems for optimizing the selection of memory blocks for garbage collection to maximize the amount of memory freed by garbage collection operations are disclosed. Some of these systems and methods provide for the efficient selection of optimal or near-optimal garbage collection candidate blocks, with the most optimal selection defined as block(s) with the most invalid pages. In some cases, a controller classifies memory blocks into various invalid block pools by the amount of invalid pages each block contains. When garbage collection is performed, the controller selects a block from a non-empty pool of blocks with the highest minimum amount of invalid pages. The pools facilitate the optimal or near-optimal selection of garbage collection candidate blocks in an efficient manner and the data structure of the pools can be implemented with bitmasks, which take minimal space in memory.

摘要翻译： 公开了用于优化用于垃圾收集的存储器块的选择以最大化由垃圾收集操作释放的存储器的量的方法和系统。 这些系统和方法中的一些提供了对最优或近似最优的垃圾收集候选块的有效选择，其中最优选择被定义为具有最无效页的块。 在某些情况下，控制器通过每个块包含的无效页面的数量将内存块分类为各种无效块池。 当执行垃圾收集时，控制器从非空的无效页面的最小数量的块中选择一个块。 这些池有助于以有效的方式优化或接近最优选择垃圾收集候选块，并且可以使用在存储器中占用最小空间的位掩码来实现池的数据结构。

公开(公告)号：US08725931B1

公开(公告)日：2014-05-13

申请号：US12732951

申请日：2010-03-26

申请人： Ho-Fan Kang

发明人： Ho-Fan Kang

IPC分类号： G06F13/12

CPC分类号： G06F13/1642 ,  G06F12/0246

摘要： Embodiments of the invention are directed to a storage subsystem comprising a non-volatile solid-state memory array and a controller. In one embodiment, the controller includes a system operation module configured to manage system memory operations and a queue configured to receive memory commands from a host system and the system operation module. The controller is configured to execute, in the memory array, memory commands from the queue in a sequence that is based at least in part on a throttling ratio provided by the system operation module.

摘要翻译： 本发明的实施例涉及包括非易失性固态存储器阵列和控制器的存储子系统。 在一个实施例中，控制器包括被配置为管理系统存储器操作的系统操作模块和被配置为从主机系统和系统操作模块接收存储器命令的队列。 控制器被配置为在存储器阵列中以至少部分地基于系统操作模块提供的节流比的顺序执行来自队列的存储器命令。

公开(公告)号：US08612804B1

公开(公告)日：2013-12-17

申请号：US12895691

申请日：2010-09-30

申请人： Ho-Fan Kang ,  Cliff Pajaro

发明人： Ho-Fan Kang ,  Cliff Pajaro

IPC分类号： G06F11/00

CPC分类号： G11C16/349 ,  G06F12/0238 ,  G06F2212/7211

摘要： Embodiments of the invention are directed to systems and methods for improving wear leveling performance in solid-state memory. The embodiments described herein make more consistent the number of wear leveling operations that need to be performed, so that sudden spikes in the number wear leveling operations may be reduced in solid-state memory. In one embodiment, a rule-based wear leveling approach is used to spread out the execution of wear leveling operations that otherwise would have been triggered in clusters. Under the rule-based approach, wear leveling is periodically triggered by a specified interval of erase counts associated with a unit of solid-state memory such as a group of blocks, rather than by a threshold based on erase counts.

摘要翻译： 本发明的实施例涉及用于改善固态存储器中的磨损均衡性能的系统和方法。 这里描述的实施例使得需要执行的磨损均衡操作的数量更加一致，使得在固态存储器中可能减少数量磨损均衡操作中的突发尖峰。 在一个实施例中，使用基于规则的磨损均衡方法来分散否则将以群集触发的磨损均衡操作的执行。 在基于规则的方法下，通过与固态存储器单元（例如一组块）相关联的指定间隔的擦除次数周期性地触发损耗均衡，而不是基于擦除计数的阈值。

公开(公告)号：US09075708B1

公开(公告)日：2015-07-07

申请号：US13173431

申请日：2011-06-30

申请人： Ho-Fan Kang ,  Stephen P. Hack ,  Jerry Lo ,  Frederick H. Adi ,  Lan D. Phan

发明人： Ho-Fan Kang ,  Stephen P. Hack ,  Jerry Lo ,  Frederick H. Adi ,  Lan D. Phan

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

CPC分类号： G06F12/0246 ,  G06F2212/7202 ,  G06F2212/7207 ,  G06F2212/7209

摘要： The present disclosure is directed to managing write commands for a storage system implementing address indirection. In some storage systems, a mapping table that provides logical-to-physical mapping may have individual entries that each references a logical address size that exceeds the size of an atomic write to the storage media. In such systems, a write to a logical address is not atomic as it may require several discrete physical writes that may individually fail. The techniques presented employ several pre-commit and post-commit actions to save data that enables the storage system to make writes to these logical addresses atomic and prevent undue delay on powerup.

摘要翻译： 本公开涉及管理实现地址间接的存储系统的写入命令。 在一些存储系统中，提供逻辑到物理映射的映射表可以具有每个条目，每个条目引用超过对存储介质的原子写入大小的逻辑地址大小。 在这种系统中，对逻辑地址的写入不是原子的，因为它可能需要可能单独失败的多个离散物理写入。 所提出的技术采用几种预提交​​和后提交操作来保存数据，使存储系统能够对这些逻辑地址进行原子写入，并防止在上电时出现不适当的延迟。

公开(公告)号：US08898373B1

公开(公告)日：2014-11-25

申请号：US13172772

申请日：2011-06-29

申请人： Ho-Fan Kang ,  Cliff Pajaro

发明人： Ho-Fan Kang ,  Cliff Pajaro

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

CPC分类号： G06F12/0246 ,  G06F2212/1016 ,  G06F2212/7211

摘要： Embodiments of the invention are directed to systems and methods for improving wear leveling performance in solid-state memory. The embodiments described herein make more consistent the number of wear leveling operations that needs to be performed, so that sudden spikes in the number wear leveling operations may be reduced in solid-state memory. In one embodiment, a staggered threshold-based wear leveling approach is used to spread out the execution of wear leveling operations that otherwise would have been triggered in clusters. Under the staggered threshold-based approach, wear leveling is periodically triggered by different wear leveling thresholds that are associated with various units of solid-state memory such as a group of blocks, so that only a certain amount of units are wear leveled at any given time.

摘要翻译： 本发明的实施例涉及用于改善固态存储器中的磨损均衡性能的系统和方法。 这里描述的实施例使得需要执行的磨损均衡操作的数量更加一致，使得在固态存储器中数量磨损均衡操作中的突发尖峰可能会减少。 在一个实施例中，使用交错的基于阈值的磨损均衡方法来分散否则将以群集触发的磨损均衡操作的执行。 在基于阈值的交错方法下，磨损平衡由不同的固态存储器单元（例如一组块）相关联的不同的磨损均衡阈值周期性地触发，使得只有一定量的单元在任何给定的 时间。

公开(公告)号：US08769190B1

公开(公告)日：2014-07-01

申请号：US13214132

申请日：2011-08-19

申请人： Mei-Man L. Syu ,  Matthew Call ,  Ho-Fan Kang ,  Lan D. Phan

发明人： Mei-Man L. Syu ,  Matthew Call ,  Ho-Fan Kang ,  Lan D. Phan

IPC分类号： G06F12/00

CPC分类号： G06F12/0246 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0688 ,  G06F13/376 ,  G06F2212/7202 ,  G06F2212/7208

摘要： Embodiments of the invention are directed to enabling concurrent commands from command requesters in a non-volatile solid-state storage subsystem in a manner that reduces contentions among the commands. Embodiments group blocks of memory into multiple sets of superblocks and associate a command requester to each superblock set. In one embodiment, the superblock sets are dynamically associated with a requester. In one embodiment, the superblock sets are dynamically associated with requesters based in part on at least one of internal memory management needs and host command throughput. In one embodiment, an erase command is executed on a superblock within a set and a simultaneous write command is executed on a superblock within another set.

摘要翻译： 本发明的实施例旨在以减少命令之间的争用的方式实现在非易失性固态存储子系统中的命令请求者的并发命令。 实施例将存储器块组合成多组超级块，并将命令请求者关联到每个超级块集合。 在一个实施例中，超级块集合与请求者动态关联。 在一个实施例中，超级块集合部分地基于内部存储器管理需求和主机命令吞吐量中的至少一个来动态地与请求者相关联。 在一个实施例中，对集合内的超级块执行擦除命令，并且在另一组中的超级块上执行同时写入命令。

公开(公告)号：US08612669B1

公开(公告)日：2013-12-17

申请号：US12824434

申请日：2010-06-28

申请人： Mei-Man L. Syu ,  Matthew Call ,  Ho-Fan Kang ,  Lan D. Phan

发明人： Mei-Man L. Syu ,  Matthew Call ,  Ho-Fan Kang ,  Lan D. Phan

IPC分类号： G06F12/16 ,  G11C16/34 ,  G11C11/406

CPC分类号： G06F3/0604 ,  G06F3/065 ,  G06F3/0688 ,  G06F12/0238 ,  G06F12/0246 ,  G06F12/123 ,  G06F2212/1032 ,  G06F2212/7209 ,  G11C16/3418 ,  G11C16/3431 ,  G11C16/349

摘要： Systems and methods for retaining data in non-volatile solid-state are disclosed in which refresh copy operations are performed on data stored in non-volatile solid-state memory. A controller can comprise a data retention module configured to issue copy commands within different periods of time, and to maintain usage data on a storage subsystem. A refresh copy operation helps ensure that data written to memory retain integrity by causing data to be programmed again onto the memory, which minimizes the risk of data error caused by electron leak in the non-volatile solid-state memory. One or more data structures may be used to determine memory blocks that require refresh copy operations. In one embodiment, a validity bit array is used to track blocks that contain valid data. In another embodiment, a least recently used list is used to track blocks that have been least recently written.

摘要翻译： 公开了用于将数据保存在非易失性固态中的系统和方法，其中对存储在非易失性固态存储器中的数据执行刷新复制操作。 控制器可以包括配置为在不同时间段内发布复制命令并且将存储子系统上的使用数据维护的数据保留模块。 刷新复制操作有助于确保写入存储器的数据通过将数据重新编程到存储器上来保持完整性，从而最小化由非易失性固态存储器中的电子泄漏引起的数据错误的风险。 可以使用一个或多个数据结构来确定需要刷新复制操作的存储器块。 在一个实施例中，有效位阵列用于跟踪包含有效数据的块。 在另一个实施例中，使用最近最少使用的列表来跟踪最近最少写入的块。

公开(公告)号：US20110283049A1

公开(公告)日：2011-11-17

申请号：US12778740

申请日：2010-05-12

申请人： HO-FAN KANG ,  ALAN CHINGTAO KAN

发明人： HO-FAN KANG ,  ALAN CHINGTAO KAN

IPC分类号： G06F12/02 ,  G06F12/10 ,  G06F12/00

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

摘要： Embodiments of the invention are directed to optimizing the selection of memory blocks for garbage collection to maximize the amount of memory freed by garbage collection operations. The systems and methods disclosed herein provide for the efficient selection of optimal or near-optimal garbage collection candidate blocks, with the most optimal selection defined as block(s) with the most invalid pages. In one embodiment, a controller classifies memory blocks into various invalid block pools by the amount of invalid pages each block contains. When garbage collection is performed, the controller selects a block from a non-empty pool of blocks with the highest minimum amount of invalid pages. The pools facilitate the optimal or near-optimal selection of garbage collection candidate blocks in an efficient manner and the data structure of the pools can be implemented with bitmasks, which take minimal space in memory.

摘要翻译： 本发明的实施例旨在优化用于垃圾收集的存储器块的选择，以最大化由垃圾收集操作释放的存储器的量。 本文公开的系统和方法提供了对最优或近似最优的垃圾回收候选块的有效选择，其中最优选择被定义为具有最无效页的块。 在一个实施例中，控制器通过每个块包含的无效页面的量将存储器块分类为各种无效块池。 当执行垃圾收集时，控制器从非空的无效页面的最小数量的块中选择一个块。 这些池有助于以有效的方式优化或接近最优选择垃圾收集候选块，并且可以使用在存储器中占用最小空间的位掩码来实现池的数据结构。