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

1. 发明授权

US07406574B1 Management of invalid tracks 有权
标题翻译：管理无效的轨道
公开(公告)号：US07406574B1
公开(公告)日：2008-07-29
申请号：US10081682
申请日：2002-02-25
申请人： Amnon Naamad , Yechiel Yochai , Sachin More
发明人： Amnon Naamad , Yechiel Yochai , Sachin More
IPC分类号： G06F12/06
CPC分类号： G11B20/1217 , G06F12/0866 , G11B20/1883 , G11B2020/1238 , G11B2020/1285 , G11B2020/1826 , G11B2220/20
摘要： A method for implementing the invention is carried out in a data-storage system having a data storage unit that includes at least two constituent data storage elements. Each of the constituent data storage elements is either in a first state or a second state. The method includes providing a data structure having an entry corresponding to the data storage unit. The entry includes status information indicating whether at least one constituent data storage element of the data storage unit is in the first state. These entries are updated as necessary following any changes in state of the constituent data storage element. Scanning the data storage units instead of the data storage elements provides a more efficient way to locate data storage elements in the first state, particularly where such data storage elements are rare.
摘要翻译：实现本发明的方法在具有数据存储单元的数据存储系统中进行，所述数据存储单元包括至少两个构成数据存储元件。每个组成数据存储元件处于第一状态或第二状态。该方法包括提供具有与数据存储单元对应的条目的数据结构。该条目包括指示数据存储单元的至少一个构成数据存储元件是否处于第一状态的状态信息。在组成数据存储元件的状态的任何改变之后，根据需要更新这些条目。扫描数据存储单元而不是数据存储元件提供了一种更有效的方式来将数据存储元件定位在第一状态，特别是在这种数据存储元件是罕见的情况下。

2. 发明授权

US07437515B1 Data structure for write pending 有权
标题翻译：写入挂起的数据结构
公开(公告)号：US07437515B1
公开(公告)日：2008-10-14
申请号：US11037932
申请日：2005-01-18
申请人： Amnon Naamad , Yechiel Yochai , Sachin More
发明人： Amnon Naamad , Yechiel Yochai , Sachin More
IPC分类号： G06F12/00 , G06F13/00
CPC分类号： G06F12/0804
摘要： Destaging activities in a data storage system are controlled by providing a write pending list of elements, where each element is defined to store information related to a cache memory data element for which a write to storage is pending, and maintaining the write pending list so that destaging of a data element can be based on the maturity of the pending write.
摘要翻译：控制数据存储系统中的活动是通过提供写入待处理的元素列表进行控制的，其中每个元素被定义为存储与对存储器的待写入的高速缓冲存储器数据元素有关的信息，并且保持写入挂起列表，使得数据元素的降级可以基于待处理写入的成熟度。

3. 发明授权

US06865648B1 Data structure for write pending 有权
标题翻译：写入挂起的数据结构
公开(公告)号：US06865648B1
公开(公告)日：2005-03-08
申请号：US10179536
申请日：2002-06-24
申请人： Amnon Naamad , Yechiel Yochai , Sachin More
发明人： Amnon Naamad , Yechiel Yochai , Sachin More
IPC分类号： G06F12/00 , G06F12/08
CPC分类号： G06F12/0804
摘要： Destaging activities in a data storage system are controlled by providing a write pending list of elements, where each element is defined to store information related to a cache memory data element for which a write to storage is pending, and maintaining the write pending list so that destaging of a data element can be based on the maturity of the pending write.
摘要翻译：控制数据存储系统中的活动是通过提供写入待处理的元素列表进行控制的，其中每个元素被定义为存储与对存储器的待写入的高速缓冲存储器数据元素有关的信息，并且保持写入挂起列表，使得数据元素的降级可以基于待处理写入的成熟度。

4. 发明授权

US08935490B1 Disk access quality of service 有权
标题翻译：磁盘访问服务质量
公开(公告)号：US08935490B1
公开(公告)日：2015-01-13
申请号：US12930101
申请日：2010-12-28
申请人： Amnon Naamad , Sachin More
发明人： Amnon Naamad , Sachin More
IPC分类号： G06F12/02
CPC分类号： G06F3/0683 , G06F3/0611 , G06F3/0659
摘要： Providing quality of service levels to a plurality of sources that perform access requests to a disk resource includes providing a disk resource queue containing access requests for the disk resource, providing a source queue for each of the sources containing access requests generated by a corresponding one of the sources, determining if a new access request from a particular source is urgent according to a specified number of I/O operations per second for the particular source and a time since a previous access request from the particular source, adding the new access request to the disk resource queue if the new access request is urgent, and adding the new access request the source queue of the particular source if the new access request is not urgent and the length of the disk resource queue is greater than a predetermined queue depth value.
摘要翻译：向执行对磁盘资源的访问请求的多个源提供服务级别的质量包括提供包含对于磁盘资源的访问请求的磁盘资源队列，为包含由对应的源，确定来自特定源的新的访问请求是否紧急，根据特定源的每秒的指定数量的I / O操作以及从特定源的先前访问请求以来的时间，将新的访问请求添加到如果新的访问请求是紧急的，则磁盘资源队列，如果新的访问请求不紧急且磁盘资源队列的长度大于预定的队列深度值，则将新的访问请求添加到特定源的源队列。

5. 发明授权

US06721870B1 Prefetch algorithm for short sequences 有权
标题翻译：短序列的预取算法
公开(公告)号：US06721870B1
公开(公告)日：2004-04-13
申请号：US09879431
申请日：2001-06-12
申请人： Yechiel Yochai , Sachin More , Ron Arnan
发明人： Yechiel Yochai , Sachin More , Ron Arnan
IPC分类号： G06F1200
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0689
摘要： A prefetch process that generates prefetch tasks for short sequences that are no longer than n tracks in length. The value of n is selected as 8. The prefetch process maintains a history of short sequences, uses that history to predict an expected length of a current sequence and generates a short prefetch task based on that prediction. The historical short sequence data is stored in histograms, each histogram being associated with a different logical volume. The histograms store a cumulative count of sequence occurrences of a given sequence length for each sequence length in a range of 1 track to n tracks. The process applies a probability-based threshold to its prediction to control the aggressiveness of the prefetch task to be generated. The threshold is adjusted based on system activity level metrics, such as processor utilization and average memory access time.
摘要翻译：对于不长于n个轨道的短序列生成预取任务的预取过程。 n的值被选择为8.预取过程保持短序列的历史，使用该历史来预测当前序列的预期长度，并且基于该预测生成短预取任务。历史短序列数据存储在直方图中，每个直方图与不同的逻辑卷相关联。直方图存储在1个轨道到n个轨道的范围内的每个序列长度的给定序列长度的序列出现的累积计数。该过程将基于概率的阈值应用于其预测以控制要生成的预取任务的侵略性。基于系统活动级别度量（如处理器利用率和平均内存访问时间）调整阈值。

6. 发明授权

US06954833B1 Expedited dynamic mirror service policy 有权
标题翻译：快速动态镜像服务策略
公开(公告)号：US06954833B1
公开(公告)日：2005-10-11
申请号：US09895941
申请日：2001-06-29
申请人： Yechiel Yochai , Sachin More , Ron Arnan
发明人： Yechiel Yochai , Sachin More , Ron Arnan
IPC分类号： G06F12/00 , G06F12/16
CPC分类号： G06F11/2069 , G06F3/0605 , G06F3/061 , G06F3/0631 , G06F3/065 , G06F3/0653 , G06F3/0689 , G06F11/201 , G06F11/2071 , G06F11/2089
摘要： A seek minimizing process for use in storage controller of a data storage system is presented. The process collects statistics for physical devices storing mirrored logical volumes. The statistics include utilization and activity level. The process determines from the statistics the top n busiest physical devices. The process evaluates each of the n physical devices for mirror policy adjustment that will result in reduced seek time when the utilization of the physical device is greater than a threshold, for example, 50%.
摘要翻译：提出了一种用于数据存储系统的存储控制器的搜索最小化过程。该进程收集存储镜像逻辑卷的物理设备的统计信息。统计资料包括利用率和活动水平。这个过程从统计数据中确定了最繁忙的物理设备。该过程评估用于镜像策略调整的n个物理设备中的每一个，这将导致当物理设备的利用率大于阈值（例如，50％）时减少的寻道时间。

7. 发明授权

US07177853B1 Cache management via statistically adjusted time stamp queue 有权
标题翻译：通过统计调整的时间戳队列缓存管理
公开(公告)号：US07177853B1
公开(公告)日：2007-02-13
申请号：US10080321
申请日：2002-02-21
申请人： Josef Ezra , Yechiel Yochai , Daniel Lambright , Sachin More , Yedidia Atzmony
发明人： Josef Ezra , Yechiel Yochai , Daniel Lambright , Sachin More , Yedidia Atzmony
IPC分类号： G06F17/30
CPC分类号： G06F12/0871 , G06F12/084 , G06F12/12 , Y10S707/99931
摘要： Described are techniques and criteria used in connection with cache management. The cache may be organized as a plurality of memory banks in which each memory bank includes a plurality of slots. Each memory bank has an associate control slot that includes groups of extents of tags. Each cache slot has a corresponding tag that includes a bit value indicating the availability of the associated cache slot, and a time stamp indicating the last time the data in the slot was used. The cache may be shared by multiple processors. Exclusive access of the cache slots is implemented using an atomic compare and swap instruction. The time stamp of slots in the cache may be adjusted to indicate ages of slots affecting the amount of time a particular portion of data remains in the cache.
摘要翻译：描述了与缓存管理相关联使用的技术和标准。高速缓存可以被组织为多个存储体，其中每个存储体包括多个时隙。每个存储体都有一个关联控制槽，包括一组标签区。每个高速缓存槽具有包括指示相关高速缓存槽的可用性的位值的对应标签，以及指示使用槽中的数据的最后时间的时间戳。高速缓存可以由多个处理器共享。使用原子比较和交换指令实现高速缓存槽的独占访问。可以调整高速缓存中的时隙的时间戳以指示影响特定部分数据保留在高速缓存中的时间量的时隙的年龄。

8. 发明授权

US07640342B1 System and method for determining configuration of one or more data storage systems 有权
标题翻译：用于确定一个或多个数据存储系统的配置的系统和方法
公开(公告)号：US07640342B1
公开(公告)日：2009-12-29
申请号：US10786644
申请日：2004-02-25
申请人： Dan Aharoni , Amnon Naamad , Sachin More , Kenneth Goguen , Xiaoyan Wei , Maureen Lally , Dimitar Petkov Gueorguiev
发明人： Dan Aharoni , Amnon Naamad , Sachin More , Kenneth Goguen , Xiaoyan Wei , Maureen Lally , Dimitar Petkov Gueorguiev
IPC分类号： G06F15/173 , G06F15/16 , G06F15/177 , G06F9/24 , G06F1/24 , G06F9/46 , H04J1/16 , H04J3/14 , H04L12/26 , G06F3/00 , G06F3/048 , G06F7/00 , G06F17/30 , G06F9/00 , G06F11/00 , H04L12/28 , H04L12/56 , H04L1/00 , G01R31/08 , G08C15/00
CPC分类号： G06F3/0653 , G06F3/0605 , G06F3/0629 , G06F3/067 , G06F11/3419 , G06F11/3442 , G06F11/3457 , G06F11/3485 , G06F11/3495 , G06F2201/885
摘要： This invention is a system and method for configuring a data storage system based on workload, response time, or utilization requirements. The method includes the steps of receiving workload, utilization or response time data, analyzing the respective received data, determining a configuration for a data storage system which may be available in report form to a user.
摘要翻译：本发明是一种基于工作负载，响应时间或利用要求来配置数据存储系统的系统和方法。该方法包括以下步骤：接收工作负载，利用率或响应时间数据，分析相应的接收数据，确定数据存储系统的配置，数据存储系统可以以报告形式向用户提供。

9. 发明授权

US07552280B1 Asymmetrically interleaving access to redundant storage devices 有权
标题翻译：非对称交错访问冗余存储设备
公开(公告)号：US07552280B1
公开(公告)日：2009-06-23
申请号：US11427082
申请日：2006-06-28
申请人： Amnon Naamad , Ron Arnan , Sachin More , Ian Adams
发明人： Amnon Naamad , Ron Arnan , Sachin More , Ian Adams
IPC分类号： G06F12/00
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0613 , G06F3/0689 , G06F11/2087
摘要： Described is a process and device for accessing data stored in multiple logical volumes. The data are replicated on first and second storage elements, such as the redundant hard disk drives of a disk mirror. The multiple logical volumes are divisible into a first logical volume and a second logical volume. All read requests targeting the first logical volume are directed to one of the first and second storage elements. Read requests targeting the second logical volume are asymmetrically interleaved between the first and second storage elements. An asymmetric interleave ratio is determined and implemented that substantially balances the read requests to the multiple logical volumes between the first and second storage elements.
摘要翻译：描述了用于访问存储在多个逻辑卷中的数据的过程和设备。数据被复制在第一和第二存储元件上，例如磁盘镜的冗余硬盘驱动器。多个逻辑卷可分为第一个逻辑卷和第二个逻辑卷。针对第一逻辑卷的所有读取请求被引导到第一和第二存储元件之一。针对第二逻辑卷的读请求在第一和第二存储元件之间是非对称交错的。确定和实现非对称交织比，其将读请求基本上平衡第一和第二存储元件之间的多个逻辑卷。

10. 发明授权

US06715039B1 Cache slot promotion in a replacement queue cache using determinations of probabilities and costs 有权
标题翻译：使用确定概率和成本，在替换队列缓存中缓存槽促销
公开(公告)号：US06715039B1
公开(公告)日：2004-03-30
申请号：US09951016
申请日：2001-09-12
申请人： Orit Levin Michael , Ron Arnan , Amnon Naamad , Sachin More
发明人： Orit Levin Michael , Ron Arnan , Amnon Naamad , Sachin More
IPC分类号： G06F1200
CPC分类号： G06F12/126 , G06F12/0866 , G06F12/121 , G06F12/123
摘要： Techniques and criteria are used in connection with promoting a slot within a cache in the form of a replacement queue. A cache slot may be promoted based on an inequality that considers the following criteria: probability of losing a cache hit, gaining a cache hit, and the price or cost associated with promoting a slot. The foregoing criteria may be used in accordance with a predetermined promotion policy when the replacement queue is in a locked state and an unlocked state, or only when the replacement queue is in a locked state. Different costs may be associated with the state of the replacement queue as locked or unlocked as the replacement queue may be locked in connection with operations that are performed on the replacement queue. The cost associated with a locked replacement queue may be different than the cost associated with an unlocked replacement queue. Different thresholds and values associated with the foregoing criteria may be specified as dynamic system parameters.
摘要翻译：技术和标准用于以替换队列的形式促进高速缓存内的时隙。可以基于考虑以下标准的不等式来促进缓存时隙：丢失高速缓存命中的概率，获得高速缓存命中以及与促进时隙相关联的价格或成本。当替换队列处于锁定状态和解锁状态时，或仅当替换队列处于锁定状态时，可以根据预定的促销策略来使用上述准则。不同的成本可能与替换队列的状态相关联，因为替换队列可能被锁定与在替换队列上执行的操作相关联。与锁定的替换队列相关联的成本可能与与解锁的替换队列相关联的成本不同。可以将与上述标准相关联的不同阈值和值指定为动态系统参数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式