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

1. 发明授权

US09037820B2 Optimized context drop for a solid state drive (SSD) 有权
标题翻译：针对固态硬盘（SSD）的优化上下文下降
公开(公告)号：US09037820B2
公开(公告)日：2015-05-19
申请号：US13537377
申请日：2012-06-29
申请人： Prasun Ratn , Suhas Nayak , Sanjeev N. Trika
发明人： Prasun Ratn , Suhas Nayak , Sanjeev N. Trika
IPC分类号： G06F12/00 , G06F11/14 , G06F13/00 , G06F13/28 , G06F12/10
CPC分类号： G06F11/1446 , G06F11/1441 , G06F12/1009 , Y02D10/13
摘要： A mass storage system employs a paging table for memory page redirection and maintains the paging table for power loss recovery (PLR) using a FIFO queue of paging table (L2P) segments to be written to non-volatile memory. The FIFO queue identifies a sequence of the L2P segments in conjunction with sequence number and marking data of the affected segments for recreating the paging table. Upon power failure, a power loss recovery (PLR) mechanism scans for the last segment written based on the FIFO queue. The PLR process recovers unwritten paging table entries by replaying the corresponding changes in the order defined by the sequence numbers. The recovery process continues for each sequence number in the current context, until the L2P information in the paging table is recreated to the point just prior to power loss.
摘要翻译：大容量存储系统采用用于存储器页面重定向的寻呼表，并且使用寻呼表（L2P）段的FIFO队列来维护用于功率损耗恢复的寻呼表（PLR），以将其写入非易失性存储器。 FIFO队列结合序列号识别L2P段的序列，并且识别受影响段的标记数据，以重新创建寻呼表。断电时，功率损耗恢复（PLR）机制扫描基于FIFO队列写入的最后一个段。 PLR进程通过重播按序列号定义的顺序的相应更改来恢复未写入的分页表条目。对于当前上下文中的每个序列号，恢复过程将继续进行，直到寻呼表中的L2P信息被重新创建到掉电之前。

2. 发明授权

US09323542B2 Optimized cold boot for non-volatile memory 有权
标题翻译：针对非易失性存储器优化冷启动
公开(公告)号：US09323542B2
公开(公告)日：2016-04-26
申请号：US13977081
申请日：2011-12-27
申请人： Prasun Ratn , Robert J. Royer, Jr. , Suhas Nayak , Sanjeev N. Trika
发明人： Prasun Ratn , Robert J. Royer, Jr. , Suhas Nayak , Sanjeev N. Trika
IPC分类号： G06F9/44 , G06F3/06 , G06F12/10
CPC分类号： G06F9/4403 , G06F3/0601 , G06F9/4401 , G06F12/10 , Y02D10/13
摘要： Various embodiments are directed to apparatuses and methods for faster solid state drive (SSD) boot-up. On boot-up, SSD control algorithms may load non-logical to physical (L2P) parts of a context and signal the system that the SSD is ready. The context may comprise various state data pertaining to the SSD. After signaling that the SSD may be ready to receive access requests, the SSD control algorithms may begin loading segments of the L2P table sequentially. Access to the L2P table may be blocked, however, when a requested segment has not yet been loaded. In such cases, the SSD control algorithms may then load the requested segment out of turn and then service the access request.
摘要翻译：各种实施例涉及用于更快的固态驱动（SSD）启动的装置和方法。在启动时，SSD控制算法可以将非逻辑加载到上下文的物理（L2P）部分，并向系统通知SSD已准备就绪。上下文可以包括与SSD相关的各种状态数据。在指示SSD可能准备好接收访问请求之后，SSD控制算法可以开始依次加载L2P表的段。但是，当请求的段尚未加载时，可能会阻止对L2P表的访问。在这种情况下，SSD控制算法可以随后加载所请求的段，然后服务于访问请求。

3. 发明申请

US20140115315A1 OPTIMIZED COLD BOOT FOR NON-VOLATILE MEMORY 有权
标题翻译：优化的冷启动非易失性存储器
公开(公告)号：US20140115315A1
公开(公告)日：2014-04-24
申请号：US13977081
申请日：2011-12-27
申请人： Prasun Ratn , Robert J. Royer, JR. , Suhas Nayak , Sanjeev N. Trika
发明人： Prasun Ratn , Robert J. Royer, JR. , Suhas Nayak , Sanjeev N. Trika
IPC分类号： G06F9/44
CPC分类号： G06F9/4403 , G06F3/0601 , G06F9/4401 , G06F12/10 , Y02D10/13
摘要： Various embodiments are directed to apparatuses and methods for faster solid state drive (SSD) boot-up. On boot-up, SSD control algorithms may load non-logical to physical (L2P) parts of a context and signal the system that the SSD is ready. The context may comprise various state data pertaining to the SSD. After signaling that the SSD may be ready to receive access requests, the SSD control algorithms may begin loading segments of the L2P table sequentially. Access to the L2P table may be blocked, however, when a requested segment has not yet been loaded. In such cases, the SSD control algorithms may then load the requested segment out of turn and then service the access request.
摘要翻译：各种实施例涉及用于更快的固态驱动（SSD）启动的装置和方法。在启动时，SSD控制算法可以将非逻辑加载到上下文的物理（L2P）部分，并向系统通知SSD已准备就绪。上下文可以包括与SSD相关的各种状态数据。在指示SSD可能准备好接收访问请求之后，SSD控制算法可以开始依次加载L2P表的段。但是，当请求的段尚未加载时，可能会阻止对L2P表的访问。在这种情况下，SSD控制算法可以随后加载所请求的段，然后服务于访问请求。

4. 发明申请

US20140006683A1 OPTIMIZED CONTEXT DROP FOR A SOLID STATE DRIVE (SSD) 有权
标题翻译：用于固态驱动（SSD）的优化上下文
公开(公告)号：US20140006683A1
公开(公告)日：2014-01-02
申请号：US13537377
申请日：2012-06-29
申请人： Prasun Ratn , Suhas Nayak , Sanjeev N. Trika
发明人： Prasun Ratn , Suhas Nayak , Sanjeev N. Trika
IPC分类号： G06F12/02
CPC分类号： G06F11/1446 , G06F11/1441 , G06F12/1009 , Y02D10/13
摘要： A mass storage system employs a paging table for memory page redirection and maintains the paging table for power loss recovery (PLR) using a FIFO queue of paging table (L2P) segments to be written to non-volatile memory. The FIFO queue identifies a sequence of the L2P segments in conjunction with sequence number and marking data of the affected segments for recreating the paging table. Upon power failure, a power loss recovery (PLR) mechanism scans for the last segment written based on the FIFO queue. The PLR process recovers unwritten paging table entries by replaying the corresponding changes in the order defined by the sequence numbers. The recovery process continues for each sequence number in the current context, until the L2P information in the paging table is recreated to the point just prior to power loss.
摘要翻译：大容量存储系统采用用于存储器页面重定向的寻呼表，并且使用寻呼表（L2P）段的FIFO队列来维护用于功率损耗恢复的寻呼表（PLR），以将其写入非易失性存储器。 FIFO队列结合序列号识别L2P段的序列，并且识别受影响段的标记数据，以重新创建寻呼表。断电时，功率损耗恢复（PLR）机制扫描基于FIFO队列写入的最后一个段。 PLR进程通过重播按序列号定义的顺序的相应更改来恢复未写入的分页表条目。对于当前上下文中的每个序列号，恢复过程将继续进行，直到寻呼表中的L2P信息被重新创建到掉电之前。

5. 发明授权

US07797479B2 Technique to write to a non-volatile memory 有权
标题翻译：写入非易失性存储器的技术
公开(公告)号：US07797479B2
公开(公告)日：2010-09-14
申请号：US11172608
申请日：2005-06-30
申请人： Sanjeev N. Trika , Robert W. Faber , Rick Coulson , Jeanna N. Matthews
发明人： Sanjeev N. Trika , Robert W. Faber , Rick Coulson , Jeanna N. Matthews
IPC分类号： G06F13/00 , G06F13/28 , G06F9/26 , G06F9/34
CPC分类号： G06F12/0246 , G06F2212/7209
摘要： A technique includes performing a plurality of write operations to store data in different physical memory locations. Each of the physical memory locations are associated with a logical address that is shared in common among the physical addresses. The technique includes storing sequence information in the physical memory locations to indicate which one of the write operations occurred last.
摘要翻译：一种技术包括执行多个写入操作以将数据存储在不同的物理存储器位置中。每个物理存储器位置与物理地址中共同共享的逻辑地址相关联。该技术包括将序列信息存储在物理存储器位置中以指示写入操作中哪一个最后发生。

6. 发明申请

US20090276586A1 Wrap-around sequence numbers for recovering from power-fall in non-volatile memory 有权
标题翻译：用于从非易失性存储器中掉电恢复的包装序列号
公开(公告)号：US20090276586A1
公开(公告)日：2009-11-05
申请号：US12151207
申请日：2008-05-05
申请人： Robert Royer , Han H. Chau , Sanjeev N. Trika
发明人： Robert Royer , Han H. Chau , Sanjeev N. Trika
IPC分类号： G06F12/00
CPC分类号： G06F12/0246 , G06F2212/7207
摘要： Incrementing sequence numbers in the metadata of non-volatile memory is used in the event of a resume from power fail to determine which data in the memory is current and valid, and which data is not. To reduce the amount of metadata space consumed by these sequence numbers, the numbers are permitted to be small enough to wrap around when the maximum value is reached. Two different techniques are disclosed to keep this wrap around condition from causing ambiguity in the relative values of the sequence numbers.
摘要翻译：在电源故障恢复的情况下，使用非易失性存储器的元数据中的递增序列号，以确定存储器中的哪个数据是当前的和有效的，哪些数据不是。为了减少这些序列号消耗的元数据空间的数量，允许这些数字足够小，以便在达到最大值时循环。公开了两种不同的技术以保持这种环绕条件，从而导致序列号的相对值中的歧义。

7. 发明申请

US20090172280A1 SYSTEMS AND METHODS FOR FAST STATE MODIFICATION OF AT LEAST A PORTION OF NON-VOLATILE MEMORY 有权
标题翻译：至少一个非易失性存储器部分进行快速状态修改的系统和方法
公开(公告)号：US20090172280A1
公开(公告)日：2009-07-02
申请号：US11966826
申请日：2007-12-28
申请人： Sanjeev N. Trika , Debra Hensgen , Han H. Chau , Michael Johnston
发明人： Sanjeev N. Trika , Debra Hensgen , Han H. Chau , Michael Johnston
IPC分类号： G06F12/00
CPC分类号： G06F12/0246 , G06F2212/7207 , G06F2212/7211
摘要： A method is provided for reducing the number of writes in a non-volatile memory (122). The method involves writing data in the non-volatile memory and determining a set of data from the data in the non-volatile memory to be written to a removable memory (126) that is operatively coupled to the non-volatile memory (e.g., a NAND memory). The method also involves writing the set of data to the removable memory (e.g., a hard disk) from the non-volatile memory. The method further involves writing a delineation marker (e.g., a sequence number) to the non-volatile memory specifying that the set of data has been written to the removable memory. Notably, the metadata of the data in the non-volatile memory comprises at least one marker set as a specific marker type (e.g., a valid marker and a dirty marker).
摘要翻译：提供了一种用于减少非易失性存储器（122）中的写入数量的方法。该方法涉及在非易失性存储器中写入数据并且从非易失性存储器中的数据确定一组数据以写入可操作地耦合到非易失性存储器的可移除存储器（126），例如， NAND存储器）。该方法还涉及从非易失性存储器将该组数据写入可移动存储器（例如，硬盘）。该方法还包括将描述标记（例如，序列号）写入非易失性存储器，指定该数据集已被写入可移动存储器。值得注意的是，非易失性存储器中的数据的元数据包括设置为特定标记类型的至少一个标记（例如，有效标记和脏标记）。

8. 发明申请

US20090089508A1 METHOD FOR REDUCING NUMBER OF WRITES IN A CACHE MEMORY 有权
标题翻译：减少高速缓存存储器中写入次数的方法
公开(公告)号：US20090089508A1
公开(公告)日：2009-04-02
申请号：US11863770
申请日：2007-09-28
申请人： Sanjeev N. Trika , Rick Mangold , Andrew Vogan
发明人： Sanjeev N. Trika , Rick Mangold , Andrew Vogan
IPC分类号： G06F13/00
CPC分类号： G06F12/0804 , G06F12/0866 , G06F2212/1036 , G06F2212/2022
摘要： Disclosed is a method for reducing number of writes in a write-back non-volatile cache memory. The method comprises: writing a plurality of data in the cache memory, wherein cache lines meta data for each of the plurality of data is marked as dirty; determining a set of data of the plurality of the data in the cache memory to be flushed to a hard disk, wherein the hard disk is operatively coupled to the cache memory; flushing the set of data of the plurality of data to the hard disk from the cache memory; and writing a clean-marker to the cache memory specifying which of the plurality of the data has been flushed to the disk.
摘要翻译：公开了一种减少写回非易失性高速缓冲存储器中的写入次数的方法。该方法包括：在高速缓冲存储器中写入多个数据，其中高速缓存行用于多个数据中的每一个的元数据被标记为脏; 确定要刷新到硬盘的高速缓冲存储器中的多个数据的数据集，其中硬盘可操作地耦合到高速缓冲存储器; 从所述高速缓存存储器将所述多个数据的数据集合刷新到所述硬盘; 以及向所述高速缓存存储器中写入干净标记，其指定所述多个数据中的哪一个已刷新到所述盘。

9. 发明申请

US20090077313A1 METHOD AND APPARATUS TO MAINTAIN DATA INTEGRITY IN DISK CACHE MEMORY DURING AND AFTER PERIODS OF CACHE INACCESSIBILITY 有权
标题翻译：在高速缓存不可靠期间和之后的盘存储器中保持数据完整性的方法和装置
公开(公告)号：US20090077313A1
公开(公告)日：2009-03-19
申请号：US12272906
申请日：2008-11-18
申请人： Sanjeev N. Trika , Michael K. Eschmann , Jeanna N. Matthews , Vasudevan Srinivasan
发明人： Sanjeev N. Trika , Michael K. Eschmann , Jeanna N. Matthews , Vasudevan Srinivasan
IPC分类号： G06F12/08 , G06F1/32 , G06F15/177
CPC分类号： G06F12/0804 , G06F11/1471 , G06F12/0866 , G06F2201/82
摘要： A volatile or nonvolatile cache memory can cache mass storage device read data and write data. The cache memory may become inaccessible, and I/O operations may go directly to the mass storage device, bypassing the cache memory. A log of write operations may be maintained to update the cache memory when it becomes available.
摘要翻译：易失性或非易失性缓存存储器可以缓存大容量存储设备读取数据并写入数据。高速缓冲存储器可能变得不可访问，并且I / O操作可能会绕过高速缓冲存储器直接进入大容量存储设备。可以维护写入操作的日志，以在高速缓存存储器可用时更新缓冲存储器。

10. 发明授权

US07231497B2 Merging write-back and write-through cache policies 有权
标题翻译：合并回写和直写缓存策略
公开(公告)号：US07231497B2
公开(公告)日：2007-06-12
申请号：US10867884
申请日：2004-06-15
申请人： Sanjeev N. Trika , John I. Garney , Michael K. Eschmann
发明人： Sanjeev N. Trika , John I. Garney , Michael K. Eschmann
IPC分类号： G06F12/00
CPC分类号： G06F12/0804 , G06F12/0866
摘要： In one embodiment, the present invention includes a method for writing data to a disk if inserting the data into a cache, such as a disk cache associated with the disk, would cause a threshold of dirty data in the cache to be met or exceeded. Further, in certain embodiments, the cache may store data according to a first cache policy and a second cache policy. A determination of whether to store data according to the first or second policies may be dependent upon an amount of dirty data in the cache, in certain embodiments. In certain embodiments, the cache may include at least one portion reserved for clean data.
摘要翻译：在一个实施例中，本发明包括如果将数据插入诸如与该磁盘相关联的磁盘高速缓存的高速缓存中时将数据写入到磁盘的方法，将导致满足或超过高速缓存中的脏数据的阈值。此外，在某些实施例中，高速缓存可以根据第一高速缓存策略和第二高速缓存策略来存储数据。在某些实施例中，根据第一或第二策略是否存储数据的确定可以取决于高速缓存中的脏数据量。在某些实施例中，高速缓存可以包括为干净数据保留的至少一个部分。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式