会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Management of invalid tracks
    • 管理无效的轨道
    • US07406574B1
    • 2008-07-29
    • US10081682
    • 2002-02-25
    • Amnon NaamadYechiel YochaiSachin More
    • Amnon NaamadYechiel YochaiSachin More
    • G06F12/06
    • G11B20/1217G06F12/0866G11B20/1883G11B2020/1238G11B2020/1285G11B2020/1826G11B2220/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.
    • 实现本发明的方法在具有数据存储单元的数据存储系统中进行,所述数据存储单元包括至少两个构成数据存储元件。 每个组成数据存储元件处于第一状态或第二状态。 该方法包括提供具有与数据存储单元对应的条目的数据结构。 该条目包括指示数据存储单元的至少一个构成数据存储元件是否处于第一状态的状态信息。 在组成数据存储元件的状态的任何改变之后,根据需要更新这些条目。 扫描数据存储单元而不是数据存储元件提供了一种更有效的方式来将数据存储元件定位在第一状态,特别是在这种数据存储元件是罕见的情况下。
    • 3. 发明授权
    • Disk access quality of service
    • 磁盘访问服务质量
    • US08935490B1
    • 2015-01-13
    • US12930101
    • 2010-12-28
    • Amnon NaamadSachin More
    • Amnon NaamadSachin More
    • G06F12/02
    • G06F3/0683G06F3/0611G06F3/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操作以及从特定源的先前访问请求以来的时间,将新的访问请求添加到 如果新的访问请求是紧急的,则磁盘资源队列,如果新的访问请求不紧急且磁盘资源队列的长度大于预定的队列深度值,则将新的访问请求添加到特定源的源队列。
    • 7. 发明授权
    • Cache slot promotion in a replacement queue cache using determinations of probabilities and costs
    • 使用确定概率和成本,在替换队列缓存中缓存槽促销
    • US06715039B1
    • 2004-03-30
    • US09951016
    • 2001-09-12
    • Orit Levin MichaelRon ArnanAmnon NaamadSachin More
    • Orit Levin MichaelRon ArnanAmnon NaamadSachin More
    • G06F1200
    • G06F12/126G06F12/0866G06F12/121G06F12/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.
    • 技术和标准用于以替换队列的形式促进高速缓存内的时隙。 可以基于考虑以下标准的不等式来促进缓存时隙:丢失高速缓存命中的概率,获得高速缓存命中以及与促进时隙相关联的价格或成本。 当替换队列处于锁定状态和解锁状态时,或仅当替换队列处于锁定状态时,可以根据预定的促销策略来使用上述准则。 不同的成本可能与替换队列的状态相关联,因为替换队列可能被锁定与在替换队列上执行的操作相关联。 与锁定的替换队列相关联的成本可能与与解锁的替换队列相关联的成本不同。 可以将与上述标准相关联的不同阈值和值指定为动态系统参数。
    • 8. 发明授权
    • Prefetch algorithm for short sequences
    • 短序列的预取算法
    • US06721870B1
    • 2004-04-13
    • US09879431
    • 2001-06-12
    • Yechiel YochaiSachin MoreRon Arnan
    • Yechiel YochaiSachin MoreRon Arnan
    • G06F1200
    • G06F3/0659G06F3/0611G06F3/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个轨道的范围内的每个序列长度的给定序列长度的序列出现的累积计数。 该过程将基于概率的阈值应用于其预测以控制要生成的预取任务的侵略性。 基于系统活动级别度量(如处理器利用率和平均内存访问时间)调整阈值。
    • 10. 发明授权
    • Data storage system modeling
    • 数据存储系统建模
    • US09354813B1
    • 2016-05-31
    • US13729680
    • 2012-12-28
    • Sean C. DolanSachin MoreHui WangXiaomei LiuMarik Marshak
    • Sean C. DolanSachin MoreHui WangXiaomei LiuMarik Marshak
    • G06F3/06G06F17/50G06F11/34
    • G06F3/061G06F3/0631G06F3/0647G06F3/0653G06F3/0655G06F3/0685G06F11/3419G06F11/3466G06F11/3485G06F17/5009
    • Described are modeling techniques. In accordance with one or more criteria, a determination may be made as to whether to use a dynamic model or a static model to model performance of components, such as storage devices, of a data storage system. A system may include first and second data storage systems where the first data storage system includes a computer readable medium with first code that performs processing in connection with data storage movement optimizations using one or more models including a dynamic model, and second code that generates and maintains the dynamic model used to model performance of storage devices. The second code may include code for performing first processing to determine device sets each of which does not share back-end resources of the second data storage system with any other device sets, and performing second processing to determine sets of performance curves corresponding to the device sets.
    • 描述的是建模技术。 根据一个或多个标准,可以确定是否使用动态模型或静态模型来建模数据存储系统的组件(诸如存储设备)的性能。 系统可以包括第一和第二数据存储系统,其中第一数据存储系统包括具有第一代码的计算机可读介质,第一代码使用包括动态模型的一个或多个模型与数据存储移动优化相结合执行处理,第二代码生成和 维护用于建模存储设备性能的动态模型。 第二代码可以包括用于执行第一处理以确定每个不与任何其他设备组共享第二数据存储系统的后端资源的设备组的代码,并且执行第二处理以确定与该设备相对应的性能曲线集合 套。