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

1. 发明授权

US07899996B1 Full track read for adaptive pre-fetching of data 有权
标题翻译：全面跟踪读取数据的自适应预取
公开(公告)号：US07899996B1
公开(公告)日：2011-03-01
申请号：US12006127
申请日：2007-12-31
申请人： Orit Levin-Michael
发明人： Orit Levin-Michael
IPC分类号： G06F12/00
CPC分类号： G06F12/0862 , G06F2212/6024
摘要： Adaptively pre-fetching data includes collecting a first set of statistics based on a number of avoidable read-misses in which data exists that is prior to data being read, collecting a second set of statistics based on a number of avoidable read-misses in which data exists that follows data being read, and collecting a third set of statistics based on said first and second sets of statistics. On the basis of the second set of statistics, a pre-fetch technique is selected from a first technique that pre-fetches data following data being read and a second technique that pre-fetches data before and following the data being read. The first and third set of statistics may be used to determine when to pre-fetch data.
摘要翻译：自适应预取数据包括基于在数据被读取之前存在数据的可避免的读取错误的数量收集第一组统计信息，基于可避免的读取错误的数量来收集第二组统计信息，其中随后数据被读取的数据，以及基于所述第一和第二组统计信息收集第三组统计信息。在第二组统计的基础上，从预读取正在读取的数据之后的数据的第一种技术中选择预取技术，以及在读取数据之前和之后预取数据的第二种技术。第一组和第三组统计可用于确定何时预取数据。

2. 发明授权

US06671774B1 Method and apparatus for performing swap analysis 有权
标题翻译：执行交换分析的方法和装置
公开(公告)号：US06671774B1
公开(公告)日：2003-12-30
申请号：US09817328
申请日：2001-03-26
申请人： Tao Kai Lam , Orit Levin Michael , Adnan Sahin
发明人： Tao Kai Lam , Orit Levin Michael , Adnan Sahin
IPC分类号： B06F1200
CPC分类号： G06F11/3433 , G06F3/0601 , G06F11/3452 , G06F11/3485 , G06F2003/0697 , G06F2201/81
摘要： Described are techniques used in connection with determining one or more pairs of logical volumes (LVs) to increase the performance of storage devices by swapping these LVs. Future performance of the anticipated potential LV swap is determined in accordance with past performance data collected prior to actually performing the swap. Data is gathered for a first arrangement of data storage devices for a period of time. A proposed modification to the first arrangement, such as swapping LVs of data on one or more storage devices, is produced. A performance estimation is produced using past performance data for the one or more pairs of proposed LV swap candidates. The search for pairs of LV candidates is determined using an iterative technique in which earlier iterations attempt to produce candidates from a smaller, more focused pool of possible LVs. The pool of LVs is expanded upon subsequent iterations if earlier iterations using heuristics providing for a more focused search are unsuccessful.
摘要翻译：描述了与确定一对或多对逻辑卷（LV）一起使用的技术，以通过交换这些LV来增加存储设备的性能。根据在实际执行交换之前收集的过去业绩数据来确定预期潜在的低压互换的未来业绩。数据被收集用于数据存储设备的第一布置一段时间。产生了对一个或多个存储设备上的数据的交换LV的第一配置的修改。使用用于一对或多对所提出的LV交换候选者的过去性能数据产生性能估计。使用迭代技术来确定对LV候选对的搜索，其中较早的迭代尝试从可能的LV的较小的，更集中的池中产生候选。如果使用启发式方法提供更为集中的搜索的早期迭代不成功，则后续迭代扩展了LV池。

3. 发明授权

US08069310B1 Methods and systems for incorporating sequential stream read requests into prefetch management for data storage having a cache memory 有权
标题翻译：将顺序流读请求合并到具有高速缓冲存储器的数据存储的预取管理中的方法和系统
公开(公告)号：US08069310B1
公开(公告)日：2011-11-29
申请号：US11726744
申请日：2007-03-22
申请人： Orit Levin-Michael , Peng Yin , William N. Eagle , Stephen F. Modica , Rong Yu
发明人： Orit Levin-Michael , Peng Yin , William N. Eagle , Stephen F. Modica , Rong Yu
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F12/0862 , G06F12/0866
摘要： Data units are prefetched into a cache memory by executing a first prefetch task to prefetch a first prefetch series of data units from off-cache. A first prefetch operation is executed to prefetch and store a first selected set of data units. Decisions are made about the first prefetch task, subsequent prefetch operations and prefetch tasks based on in-cache data units associated with the first prefetch task and on other data units that are read from off-cache but that are not associated with the first prefetch task. A determination is made whether an additional data unit that is read from an off-cache logical location is a first prefetch series member. If so, it is associated with the first prefetch task, and, for decision making, is treated as having been prefetched into cache in accordance with the first prefetch task.
摘要翻译：通过执行第一预取任务来将数据单元预取到高速缓冲存储器中，以从超高速缓存中预取第一预取数据单元序列。执行第一预取操作以预取和存储第一选定的数据单元组。关于第一预取任务，后续预取操作和基于与第一预取任务相关联的高速缓存数据单元以及从高速缓存中读取但与第一预取任务相关联的其他数据单元的预取任务，。确定从非高速缓存逻辑位置读取的附加数据单元是否是第一预取序列成员。如果是，则它与第一预取任务相关联，并且为了进行决策，根据第一预取任务被视为已被预取到高速缓存中。

4. 发明授权

US07822731B1 Techniques for management of information regarding a sequential stream 有权
标题翻译：管理有关顺序流的信息的技术
公开(公告)号：US07822731B1
公开(公告)日：2010-10-26
申请号：US12079939
申请日：2008-03-28
申请人： Rong Yu , Orit Levin-Michael , John W. Lefferts
发明人： Rong Yu , Orit Levin-Michael , John W. Lefferts
IPC分类号： G06F17/30
CPC分类号： G11B27/36 , G06F12/0862 , G06F12/0866 , G06F2212/6026 , G11B20/10527 , G11B27/329 , G11B2020/1062 , G11B2020/10685 , G11B2020/10759 , G11B2220/61 , G11B2220/65
摘要： Described are techniques for managing a sequential stream in a data storage system. A front-end component receives a plurality of data operations for a plurality of data portions and determines that the plurality of data portions are associated with a sequential stream. Each of the plurality of data portions of the sequential stream is associated with a sequential stream identifier, and a position indicator uniquely identifying a position of said each data portion in said sequential stream. Each of the plurality of data portions that is prefetched is associated with a remaining prefetched identifier and included in a prefetched chunk of data portions. The front-end component uses information about said sequential stream in connection with managing said sequential stream. The information includes the sequential stream identifier, one or more position indicators, and one or more remaining prefetched identifiers.
摘要翻译：描述了用于管理数据存储系统中的顺序流的技术。前端组件接收多个数据部分的多个数据操作，并确定多个数据部分与顺序流相关联。顺序流的多个数据部分中的每一个与顺序流标识符相关联，并且位置指示器唯一地标识所述顺序流中的每个数据部分的位置。预取的多个数据部分中的每一个与剩余的预取标识符相关联，并被包括在预取的数据部分块中。前端组件与管理所述顺序流一起使用关于所述顺序流的信息。信息包括顺序流标识符，一个或多个位置指示符以及一个或多个剩余的预取标识符。

5. 发明授权

US07558919B1 Dynamic cache partitioning 有权
标题翻译：动态缓存分区
公开(公告)号：US07558919B1
公开(公告)日：2009-07-07
申请号：US11254089
申请日：2005-10-19
申请人： Yechiel Yochai , David Shadmon , Josef Ezra , Amnon Naamad , Lee W. Sapiro , Orit Levin-Michael
发明人： Yechiel Yochai , David Shadmon , Josef Ezra , Amnon Naamad , Lee W. Sapiro , Orit Levin-Michael
IPC分类号： G06F12/02
CPC分类号： G06F12/0842 , G06F12/0893
摘要： Described are techniques for determining a cache slot. A set of criteria for each of a plurality of families is received. A received data operation associated with a first of said plurality of families is obtained. It is determined, in accordance with the criteria associated with the received data operation, whether to allocate a cache slot in the cache for the received data operation. The criteria for the first family includes a minimum value and a maximum value used in determining a cache partition size range for the first family. The maximum value is used in determining a maximum cache partition size allowable for the first family.
摘要翻译：描述了用于确定高速缓存槽的技术。接收用于多个系列中的每一个的一组标准。获得与所述多个族中的第一个相关联的接收数据操作。根据与接收到的数据操作相关联的准则，确定是否在接收数据操作的高速缓存中分配高速缓存时隙。第一系列的标准包括用于确定第一系列的高速缓存分区大小范围的最小值和最大值。最大值用于确定第一系列允许的最大缓存分区大小。

6. 发明授权

US06664964B1 Correlation criteria for logical volumes 有权
标题翻译：逻辑卷的相关标准
公开(公告)号：US06664964B1
公开(公告)日：2003-12-16
申请号：US09709077
申请日：2000-11-10
申请人： Orit Levin-Michael , Adnan Sahin
发明人： Orit Levin-Michael , Adnan Sahin
IPC分类号： G06T1120
CPC分类号： G06F11/3452 , G06F3/0601 , G06F11/3409 , G06F11/3485 , G06F2003/0697 , G06F2201/81 , G06T11/206
摘要： A system and method for determining whether activity graphs (hereinafter “graphs”) for logical volumes of data storage are correlated. A number of correlation criteria are applied to the graphs, including the area ratio criteria determines whether an area ratio described by the graph is at least as great as a predetermined value; the peak ratio criteria indicates that one graph is correlated to another graph if a peak ratio described by the two graphs is as large as a predetermined peak ratio value; and the sharp peak criteria indicates in the event that one graph is correlated to another graphs having at least one coincidental peak. Different combinations of all or some of the disclosed correlation criteria and the traditional correlation coefficient may be used to determine whether graphs of logical volumes are correlated, the level of correlation, and how “strong” of a correlation exists between the graphs.
摘要翻译：用于确定用于逻辑卷数据存储的活动图（以下称为“图”）的系统和方法是相关的。多个相关标准被应用于图形，包括面积比率准则确定由图表描述的面积比是否至少与预定值一样大; 如果由两个图形描述的峰值比例与预定的峰值比值一样大，则峰值比率标准表示一个图与另一个图相关; 并且尖峰标准表示在一个图与至少具有一个巧合峰的另一图相关联的情况下。可以使用所公开的相关标准和传统相关系数中的全部或一些的不同组合来确定逻辑卷的图形是否相关，相关级别以及图之间存在相关性如何“强”。

7. 发明授权

US08667224B1 Techniques for data prefetching 有权
标题翻译：数据预取技术
公开(公告)号：US08667224B1
公开(公告)日：2014-03-04
申请号：US12004300
申请日：2007-12-20
申请人： Rong Yu , Orit Levin-Michael , John W. Lefferts , Pei-Ching Hwang , Peng Yin , Yechiel Yochai , Dan Aharoni , Qun Fan , Stephen R. Ives
发明人： Rong Yu , Orit Levin-Michael , John W. Lefferts , Pei-Ching Hwang , Peng Yin , Yechiel Yochai , Dan Aharoni , Qun Fan , Stephen R. Ives
IPC分类号： G06F12/00
CPC分类号： G06F12/0862 , G06F2212/6024
摘要： Described are techniques for processing a data operation in a data storage system. A front-end component of the data storage system receives the data operation. In response to receiving the data operation, the front-end component performs first processing. The first processing includes determining whether the data operation is a read operation requesting to read a data portion which results in a cache miss; and if said determining determines that the data operation is a read operation resulting in a cache miss, performing read miss processing. Read miss processing includes sequential stream recognition processing performed by the front-end component to determine whether the data portion is included in a sequential stream.
摘要翻译：描述了用于处理数据存储系统中的数据操作的技术。数据存储系统的前端组件接收数据操作。响应于接收到数据操作，前端组件执行第一处理。第一处理包括确定数据操作是否是请求读取导致高速缓存未命中的数据部分的读取操作; 并且如果所述确定确定数据操作是导致高速缓存未命中的读取操作，则执行读出未命中处理。读未命中处理包括由前端组件执行的顺序流识别处理，以确定数据部分是否包括在顺序流中。

8. 发明授权

US08429351B1 Techniques for determining an amount of data to prefetch 有权
标题翻译：用于确定预取数据量的技术
公开(公告)号：US08429351B1
公开(公告)日：2013-04-23
申请号：US12079919
申请日：2008-03-28
申请人： Rong Yu , Orit Levin-Michael , Roderick M. Klinger , Yechiel Yochai , John W. Lefferts
发明人： Rong Yu , Orit Levin-Michael , Roderick M. Klinger , Yechiel Yochai , John W. Lefferts
IPC分类号： G06F12/02
CPC分类号： G06F12/0862 , G06F12/0866
摘要： Described are techniques for processing a data operation in a data storage system. A front-end component receives the data operation to read a data portion. In response to receiving the data operation, the front-end component performs first processing. The first processing includes determining whether the data operation is a read operation resulting in a cache hit to a prefetched data portion of a sequential stream, and if said determining determines that said data operation results in a cache hit to a prefetched data portion, performing processing in connection with prefetching additional data for said sequential stream. The processing includes determining whether to prefetch additional data for said sequential stream and, if so, an amount of additional data to prefetch. The processing uses one or more criteria to determine one or more of an amount of data to prefetch in a single prefetch request and a track ahead parameter.
摘要翻译：描述了用于处理数据存储系统中的数据操作的技术。前端组件接收数据操作以读取数据部分。响应于接收到数据操作，前端组件执行第一处理。第一处理包括确定数据操作是否是导致对顺序流的预取数据部分的高速缓存命中的读取操作，并且如果所述确定确定所述数据操作导致对预取数据部分的高速缓存命中，则执行处理与预取所述顺序流的附加数据有关。该处理包括确定是否预取用于所述顺序流的附加数据，如果是，则预取附加数据的预取量。处理使用一个或多个标准来确定在单个预取请求和前进跟踪参数中预取的数据量的一个或多个。

9. 发明授权

US07155573B1 Cache fall through time estimation 有权
标题翻译：缓存通过时间估计下降
公开(公告)号：US07155573B1
公开(公告)日：2006-12-26
申请号：US10853035
申请日：2004-05-25
申请人： Orit Levin-Michael , Josef Ezra
发明人： Orit Levin-Michael , Josef Ezra
IPC分类号： G06F12/08
CPC分类号： G06F12/123 , G06F11/3438 , G06F12/0866 , G06F2201/885
摘要： A method for estimating the fall through time of a cache includes maintaining local statistics associated with each data cache slot replaced by a processor, reading from a memory global statistics related to each data cache slot replaced by a plurality of processors, calculating new global statistics, and estimating a fall through time of the cache in response to the global statistics at a predetermined rate. When the global statistics are the result of at least a threshold number of data cache slots having been replaced, the new global statistics are calculated by weighting the global statistics by a factor of less than one and adding the weighted global statistics to the local statistics. When the global statistics are not the result of at least a threshold number of data cache slots having been replaced, the new global statistics are calculated by adding a time related to the lapsed time to a global sum value associated with the time stamp difference of the replaced data cache slots. In a multi-processor computer system, each of the processors accesses the global memory to update the global statistics at a different time. The fall through time is estimated continuously at a first predetermined rate and the global statistics are updated at a second predetermined rate that, in one embodiment, is a multiple of the first predetermined rate.
摘要翻译：用于估计高速缓存的下降时间的方法包括维护与由处理器取代的每个数据高速缓冲存储器相关联的本地统计信息，从与由多个处理器取代的每个数据高速缓冲存储器相关的存储器全局统计信息读取，计算新的全局统计信息，以及响应于预定速率的全局统计来估计缓存的下降时间。当全局统计信息是已被替换的至少一个阈值数量的高速缓存槽的结果时，通过将全局统计量加权小于1的因子来计算新的全局统计信息，并将加权的全局统计信息加到本地统计信息中。当全局统计信息不是至少已经被替换的数据高速缓冲存储器的阈值数量的结果时，通过将与经过的时间相关的时间相加到与时间戳差异相关联的全局和值来计算新的全局统计信息取代了数据缓存槽位。在多处理器计算机系统中，每个处理器访问全局存储器以在不同的时间更新全局统计信息。以第一预定速率连续地估计下降时间，并且以一个实施例中的第一预定速率的倍数以第二预定速率更新全局统计。

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

热门服务

关于我们

友情链接

联系方式