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

1. 发明申请

US20140068219A1 FREE SPACE COLLECTION IN LOG STRUCTURED STORAGE SYSTEMS 有权
标题翻译：日志结构存储系统中的空间收集
公开(公告)号：US20140068219A1
公开(公告)日：2014-03-06
申请号：US13604711
申请日：2012-09-06
申请人： Bruce McNutt
发明人： Bruce McNutt
IPC分类号： G06F12/06
CPC分类号： G06F3/0611 , G06F3/061 , G06F3/0619 , G06F3/0652 , G06F3/0665 , G06F3/0689 , G06F11/1076 , G06F12/0833 , G06F12/0875 , G06F12/123 , G06F12/128 , G06F2212/466 , G06F2212/621
摘要： A mechanism is provided for optimizing free space collection in a storage system having a plurality of segments. A collection score value is calculated for least one of the plurality of segments. The collection score value is calculated by determining a sum, across tracks in the segment, of the amount of time over a predetermined period of time during which the track has been invalid due to a more recent copy being written in a different segment. Segments are chosen for free space collection based on the determined collection score value.
摘要翻译：提供了一种用于优化具有多个段的存储系统中的自由空间收集的机制。计算多个片段中的至少一个片段的集合得分值。通过在段中的轨道上确定由于更新的副本被写入不同段中而在轨道已经无效的预定时间段内的时间量的总和来计算收集分数值。根据确定的收集分数值，选择分段进行可用空间收集。

2. 发明授权

US08230131B2 Data migration to high speed storage in accordance with I/O activity over time 有权
标题翻译：根据I / O活动随时间的推移，数据迁移到高速存储
公开(公告)号：US08230131B2
公开(公告)日：2012-07-24
申请号：US12559362
申请日：2009-09-14
申请人： Joseph Smith Hyde, II , Bruce McNutt
发明人： Joseph Smith Hyde, II , Bruce McNutt
IPC分类号： G06F3/00 , G06F12/00 , G06F13/00
CPC分类号： G06F3/0649 , G06F3/0613 , G06F3/0685
摘要： Methods, controllers for data storage, data storage systems, and computer program products are directed to migrating data after the initial placement of the data in data storage entities having higher speed and in other data storage. Steps of a method to migrate data to the higher speed data storage are (1) identifying at least one group of data having had at least one I/O activity in each of a plurality of intervals of time, occurring over a string of multiple intervals of time, wherein the I/O activity is with respect to the other data storage from which data is to be migrated. The time for each of the multiple intervals is selected such that bursts of the I/O activity are likely to be contained in one interval. (2) The identified group of data is classified to the higher speed data storage and migrated.
摘要翻译：用于数据存储，数据存储系统和计算机程序产品的控制器用于在将数据初始放置在具有较高速度的数据存储实体中并在其它数据存储中之后迁移数据。将数据迁移到更高速度数据存储的方法的步骤是（1）识别至少一组在多个时间间隔中的每一个中具有至少一个I / O活动的数据，这些数据在多个间隔的串上发生的时间，其中I / O活动是相对于要迁移数据的其他数据存储。选择多个间隔中的每一个的时间，使得I / O活动的突发可能包含在一个间隔中。（2）将所识别的数据组分类为更高速度的数据存储并进行迁移。

3. 发明授权

US07840720B2 Using priority to determine whether to queue an input/output (I/O) request directed to storage 有权
标题翻译：使用优先级确定是否对指向存储的输入/输出（I / O）请求进行排队
公开(公告)号：US07840720B2
公开(公告)日：2010-11-23
申请号：US12060215
申请日：2008-03-31
申请人： Matthew Joseph Kalos , Bruce McNutt
发明人： Matthew Joseph Kalos , Bruce McNutt
IPC分类号： G06F13/14 , G06F13/18
CPC分类号： G06F3/0659 , G06F3/061 , G06F3/0656 , G06F3/067 , G06F3/0671
摘要： Provided are a method, system, and article of manufacture for using priority to determine whether to queue an Input/Output (I/O) request directed to storage. A maximum number of concurrent requests directed to a storage is measured. The measured maximum number of concurrent requests is used to determine a threshold for a specified priority. Subsequent requests of the specified priority directed to the storage are allowed to proceed in response to determining that a current number of concurrent requests for the specified priority does not exceed the determined threshold for the specified priority. Subsequent requests directed to the storage having a priority greater than the specified priority are allowed to proceed. Subsequent requests directed to the storage having the specified priority are queued in a queue in response to determining that the current number of concurrent requests for the specified priority exceeds the overall threshold.
摘要翻译：提供了一种方法，系统和制品，用于使用优先级来确定是否对指向存储的输入/输出（I / O）请求进行排队。测量针对存储的并发请求的最大数量。测量的最大并发请求数用于确定指定优先级的阈值。响应于确定当前指定优先级的并发请求数量不超过所确定的优先级的阈值，允许针对存储器的指定优先级的后续请求进行。允许针对具有大于指定优先级的优先级的存储的后续请求继续进行。响应于确定当前指定优先级的并发请求数超过总阈值，针对具有指定优先级的存储器的后续请求被排队在队列中。

4. 发明申请

US20100174867A1 USING DIFFERENT ALGORITHMS TO DESTAGE DIFFERENT TYPES OF DATA FROM CACHE 有权
标题翻译：使用不同的算法从缓存中减少不同类型的数据
公开(公告)号：US20100174867A1
公开(公告)日：2010-07-08
申请号：US12731111
申请日：2010-03-24
申请人： Binny Sher Gill , Michael Thomas Benhase , Joseph Smith Hyde, II , Thomas Charles Jarvis , Bruce McNutt , Dharmendra Shantilal Modha
发明人： Binny Sher Gill , Michael Thomas Benhase , Joseph Smith Hyde, II , Thomas Charles Jarvis , Bruce McNutt , Dharmendra Shantilal Modha
IPC分类号： G06F12/08
CPC分类号： G06F12/0804 , G06F12/0866 , G06F12/124 , G06F2212/502
摘要： Provided are a method, system, and article of manufacture for using different algorithms to destage different types of data from cache. A first destaging algorithm is used to destage a first type of data to a storage for a first duration. A second destaging algorithm is used to destage a second type of data to the storage for a second duration.
摘要翻译：提供了一种使用不同算法从缓存中去除不同类型的数据的方法，系统和制品。使用第一个降级算法将第一类型的数据转储到第一个持续时间的存储器。第二种去度数算法被用于在第二持续时间内将存储的第二类型的数据转移到存储器中。

5. 发明授权

US07404036B2 Rebalancing of striped disk data 有权
标题翻译：条带磁盘数据的重新平衡
公开(公告)号：US07404036B2
公开(公告)日：2008-07-22
申请号：US11286482
申请日：2005-11-23
申请人： Joseph Smith Hyde, II , Bruce McNutt
发明人： Joseph Smith Hyde, II , Bruce McNutt
IPC分类号： G06F12/02
CPC分类号： G06F11/1096 , G06F3/0607 , G06F3/0631 , G06F3/0644 , G06F3/0689 , G06F2206/1012
摘要： Provided are a method, system, and article of manufacture, where a plurality of extents are stored in a first set of storage units coupled to a controller. A determination is made that a second set of storage units has been coupled to the controller. The plurality of extents are distributed among all storage units included in the first set of storage units and the second set of storage units.
摘要翻译：提供了一种方法，系统和制品，其中多个范围被存储在耦合到控制器的第一组存储单元中。确定第二组存储单元已经耦合到控制器。多个区段分布在包括在第一组存储单元和第二组存储单元中的所有存储单元中。

6. 发明授权

US06842826B1 Method and apparatus for providing efficient management of least recently used (LRU) algorithm insertion points corresponding to defined times-in-cache 失效
标题翻译：用于提供与定义的高速缓存时间相对应的最近最少使用（LRU）算法插入点的有效管理的方法和装置
公开(公告)号：US06842826B1
公开(公告)日：2005-01-11
申请号：US09588955
申请日：2000-06-07
申请人： Bruce McNutt
发明人： Bruce McNutt
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/123 , G06F12/0866
摘要： A method and apparatus for providing efficient management of LRU insertion points corresponding to defined times-in-cache is disclosed. Insertion points are implemented as “dummy entries” in the LRU list. As such, they undergo the standard process for aging out of cache, along with all other entries. A circular queue of insertion points is maintained. At regular intervals, a new insertion point is placed at the top of the LRU list, and at the tail of the queue. When an insertion point reaches the bottom of the LRU list (“ages out”), it is removed form the head of the queue. Since insertion points are added to the list at regular intervals, the remaining time for data at the corresponding LRU list positions to age out must increase in the same, regular steps, as we consider insertion points from the bottom to the top of the LRU list. Therefore, we can find an insertion point which exhibits any desired age-out time, by indexing into the circular queue.
摘要翻译：公开了一种用于提供与定义的高速缓存时间相对应的LRU插入点的有效管理的方法和装置。插入点在LRU列表中被实现为“虚拟条目”。因此，它们经历了从缓存中老化的标准过程以及所有其他条目。维持插入点的圆形队列。定期地，新的插入点放置在LRU列表的顶部，并在队列的尾部。当插入点到达LRU列表的底部（“age out”）时，将从队列的头部移除。由于插入点以规则的间隔添加到列表中，因此我们考虑从LRU列表的底部到顶部的插入点，以相同的常规步骤增加相应的LRU列表中要淘汰的位置的剩余时间。。因此，我们可以通过索引到循环队列中找到展现任何期望的退出时间的插入点。

7. 发明授权

US5649153A Aggressive adaption algorithm for selective record caching 失效
标题翻译：用于选择性记录缓存的主动适应算法
公开(公告)号：US5649153A
公开(公告)日：1997-07-15
申请号：US492430
申请日：1995-06-19
申请人： Bruce McNutt , Ruth Enid Azevedo , Gary E. Morain , Barrie N. Harding
发明人： Bruce McNutt , Ruth Enid Azevedo , Gary E. Morain , Barrie N. Harding
IPC分类号： G06F12/08 , G06F12/02
CPC分类号： G06F12/0866 , G06F12/0862
摘要： A cache management system for dynamically switching between record caching and track caching. Statistics are collected within the cache management system to determine the type and amount of locality associated with a specific data set currently within the cache. Using these statistics, metrics of the actual hit ratio, whole-track hit ratio, and other-record-hit ratio are generated. The metrics are periodically reviewed for a given band, and the band is placed into one of three cache modes accordingly. The mode assignment determines what type of staging will be performed for data within the band in the event of a miss. The possible modes are: track mode for track-based staging, record mode for staging of a single record only, or uncached mode if no data is to be staged. If a band has been assigned to either record or track mode, the assignment is re-evaluated after for a predetermined number of I/O's (128). If the band has been assigned to uncached mode, then after another predetermined number of I/O's (4096), the band is reassigned to record mode in order to force an update of the band statistics.
摘要翻译：用于在记录缓存和跟踪缓存之间动态切换的缓存管理系统。在缓存管理系统内收集统计信息以确定与当前在高速缓存内的特定数据集相关联的位置的类型和数量。使用这些统计数据，生成实际命中率，整体命中率和其他记录命中率的度量。针对给定的频带定期检查度量，并且相应地将频带置于三个缓存模式之一。模式分配决定了在错过的情况下对频带内的数据执行什么类型的分段。可能的模式是：仅用于基于轨道的分段的跟踪模式，仅记录单个记录的记录模式，或者如果不分段数据则为非缓存模式。如果一个频带已被分配到记录或跟踪模式，则在预定数量的I / O（128）之后重新评估分配。如果频带已被分配给未缓存模式，则在另一预定数量的I / O（4096）之后，将频带重新分配到记录模式，以强制更新频带统计。

8. 发明授权

US5606688A Method and apparatus for dynamic cache memory allocation via single-reference residency times 失效
标题翻译：通过单参考驻留时间动态缓存存储器分配的方法和装置
公开(公告)号：US5606688A
公开(公告)日：1997-02-25
申请号：US298826
申请日：1994-08-31
申请人： Bruce McNutt , Brian J. Smith
发明人： Bruce McNutt , Brian J. Smith
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/0866 , G06F12/121
摘要： A cache having dynamic cache memory allocation is provided. A cache memory stores a plurality of data blocks, each block belonging to one of a plurality of data sets. A cache directory maintains a list of entries associated with the data blocks stored in the cache memory, wherein each entry corresponds to an individual data block and has fields for storing information including a designation of the data set to which the corresponding data block belongs. A directory controller generates each entry when the corresponding data block is loaded in the cache. The directory controller inserts the generated entry into the list at the optimal insertion point for the data block's data set, which is derived from a calculated optimal single-reference residency time for that data set. Further, the directory controller moves an entry in the list to the insertion point for the given data set of a corresponding data block when the corresponding data block is referenced in the cache. A storage control unit for storing data blocks within the cache memory replaces in the cache memory the data block corresponding to the bottom entry of the list with the data block corresponding to an entry inserted into the list.
摘要翻译：提供具有动态高速缓冲存储器分配的缓存。高速缓冲存储器存储多个数据块，每个块属于多个数据集之一。缓存目录维护与存储在高速缓冲存储器中的数据块相关联的条目的列表，其中每个条目对应于单个数据块，并且具有用于存储包括相应数据块所属的数据集的指定的信息的字段。当对应的数据块加载到缓存中时，目录控制器会生成每个条目。目录控制器将生成的条目插入数据块的数据集的最佳插入点的列表中，该数据集是从该数据集的计算的最优单引用驻留时间导出的。此外，当高速缓存中引用对应的数据块时，目录控制器将列表中的条目移动到相应数据块的给定数据集的插入点。用于将数据块存储在高速缓冲存储器内的存储控制单元将对应于列表底部条目的数据块与对应于插入到列表中的条目的数据块替换在高速缓冲存储器中。

9. 发明授权

US5499354A Method and means for dynamic cache management by variable space and time binding and rebinding of cache extents to DASD cylinders 失效
标题翻译：通过可变空间进行动态缓存管理的方法和方法，并将缓存区段的时间绑定和重新绑定到DASD气瓶
公开(公告)号：US5499354A
公开(公告)日：1996-03-12
申请号：US64295
申请日：1993-05-19
申请人： John G. Aschoff , Jeffrey A. Berger , David A. Burton , Bruce McNutt , Stanley C. Kurtz
发明人： John G. Aschoff , Jeffrey A. Berger , David A. Burton , Bruce McNutt , Stanley C. Kurtz
IPC分类号： G06F12/08 , G06F12/02
CPC分类号： G06F12/0866 , G06F2212/312
摘要： Dynamic allocation of read cache space is allocated among bands of DASD cylinders rather than to data sets or processes as a function of a weighted average hit ratio to the counterpart cache space. Upon the hit ratio falling below a predetermined threshold, the bands are disabled for a defined interval as measured by cache accesses and then rebound to cache space again.
摘要翻译：读取高速缓存空间的动态分配在DASD气缸的频带之间分配，而不是数据集或进程作为与对方高速缓存空间的加权平均命中率的函数。当命中率下降到预定阈值以下时，通过高速缓存访问测量的频带被禁用定义的间隔，然后再次反弹到高速缓存空间。

10. 发明授权

US08560507B2 Generation of realistic file content changes for deduplication testing 失效
标题翻译：为重复数据删除测试生成实际的文件内容更改
公开(公告)号：US08560507B2
公开(公告)日：2013-10-15
申请号：US13465190
申请日：2012-05-07
申请人： Bruce McNutt
发明人： Bruce McNutt
IPC分类号： G06F17/00 , G06F7/00
CPC分类号： G06F17/30156 , G06F17/30091
摘要： Data to be processed through deduplication product testing is arranged into a single, continuous stream. At least one of a plurality of random modifications are applied to the arranged data in a self-similar pattern exhibiting scale invariance. A plurality of randomly sized subsets of the arranged data modified with the self-similar pattern is mapped into each of a plurality of randomly sized deduplication test files.
摘要翻译：通过重复数据消除产品测试处理的数据被排列成单个连续流。将多个随机修改中的至少一个以呈现尺度不变性的自相似图案应用于排列数据。用自相似图案修改的排列数据的多个随机大小的子集映射到多个随机大小的重复数据删除测试文件中的每一个中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式