利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

27 条记录 (耗时 0.017 秒)

    Management of invalid tracks
    1.
    发明授权
    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.

    摘要翻译： 实现本发明的方法在具有数据存储单元的数据存储系统中进行，所述数据存储单元包括至少两个构成数据存储元件。 每个组成数据存储元件处于第一状态或第二状态。 该方法包括提供具有与数据存储单元对应的条目的数据结构。 该条目包括指示数据存储单元的至少一个构成数据存储元件是否处于第一状态的状态信息。 在组成数据存储元件的状态的任何改变之后，根据需要更新这些条目。 扫描数据存储单元而不是数据存储元件提供了一种更有效的方式来将数据存储元件定位在第一状态，特别是在这种数据存储元件是罕见的情况下。

    Data structure for write pending
    2.
    发明授权
    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.

    摘要翻译： 控制数据存储系统中的活动是通过提供写入待处理的元素列表进行控制的，其中每个元素被定义为存储与对存储器的待写入的高速缓冲存储器数据元素有关的信息，并且保持写入挂起列表，使得 数据元素的降级可以基于待处理写入的成熟度。

    Data structure for write pending
    3.
    发明授权
    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.

    摘要翻译： 控制数据存储系统中的活动是通过提供写入待处理的元素列表进行控制的，其中每个元素被定义为存储与对存储器的待写入的高速缓冲存储器数据元素有关的信息，并且保持写入挂起列表，使得 数据元素的降级可以基于待处理写入的成熟度。

    Dynamic cache partitioning
    4.
    发明授权
    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.

    摘要翻译： 描述了用于确定高速缓存槽的技术。 接收用于多个系列中的每一个的一组标准。 获得与所述多个族中的第一个相关联的接收数据操作。 根据与接收到的数据操作相关联的准则，确定是否在接收数据操作的高速缓存中分配高速缓存时隙。 第一系列的标准包括用于确定第一系列的高速缓存分区大小范围的最小值和最大值。 最大值用于确定第一系列允许的最大缓存分区大小。

    Disk queue management for quality of service
    5.
    发明授权
    Disk queue management for quality of service 有权
    磁盘队列管理服务质量

    公开(公告)号：US07281086B1

    公开(公告)日：2007-10-09

    申请号：US11143813

    申请日：2005-06-02

    申请人： Sachin Suresh More ,  Yechiel Yochai ,  Amnon Naamad ,  Adnan Sahin

    发明人： Sachin Suresh More ,  Yechiel Yochai ,  Amnon Naamad ,  Adnan Sahin

    IPC分类号： G06F12/00

    CPC分类号： G06F3/0659 ,  G06F3/061 ,  G06F3/0676 ,  G06F12/0866

    摘要： A mixed queue method for managing storage requests directed includes a low-priority request queue on which all low-priority requests are placed and where they are subject to throughput optimization by re-ordering. When a high-priority request limit has not been reached, high-priority requests are placed on a high-priority request queue where they are executed in a pre-emptive manner with respect to the queued low-priority requests, thus experiencing reduced access time. When the high-priority request limit has been reached, the high-priority requests are placed on the low-priority request queue, such that the high-priority requests are included in the throughput optimization along with the low-priority requests on the request queue. Starvation of the low-priority requests is avoided, and the overall throughput of the disk drive is maintained at a relatively high level. The high-priority request limit can be realized in several ways, such as by monitoring the number of outstanding high-priority requests or the rate at which high-priority requests are issued to the disk drive.

    摘要翻译： 用于管理定向的存储请求的混合队列方法包括：在其上放置所有低优先级请求的低优先级请求队列，以及通过重新排序在哪里进行吞吐量优化。 当没有达到高优先级请求限制时，高优先级请求被放置在高优先级请求队列上，在高优先级请求队列中，它们相对于排队的低优先级请求以优先的方式被执行，从而经历减少的访问时间 。 当达到高优先级请求限制时，高优先级请求被放置在低优先级请求队列上，使得高优先级请求被包括在吞吐量优化中以及请求队列上的低优先级请求 。 避免了低优先级请求的饥饿，并且磁盘驱动器的整体吞吐量保持在较高的水平。 高优先级请求限制可以通过几种方式实现，例如通过监视未完成的高优先级请求的数量或向磁盘驱动器发出高优先级请求的速率。

    Disk access quality of service
    6.
    发明授权
    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操作以及从特定源的先前访问请求以来的时间，将新的访问请求添加到 如果新的访问请求是紧急的，则磁盘资源队列，如果新的访问请求不紧急且磁盘资源队列的长度大于预定的队列深度值，则将新的访问请求添加到特定源的源队列。

    Asymmetrically interleaving access to redundant storage devices
    8.
    发明授权
    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.

    摘要翻译： 描述了用于访问存储在多个逻辑卷中的数据的过程和设备。 数据被复制在第一和第二存储元件上，例如磁盘镜的冗余硬盘驱动器。 多个逻辑卷可分为第一个逻辑卷和第二个逻辑卷。 针对第一逻辑卷的所有读取请求被引导到第一和第二存储元件之一。 针对第二逻辑卷的读请求在第一和第二存储元件之间是非对称交错的。 确定和实现非对称交织比，其将读请求基本上平衡第一和第二存储元件之间的多个逻辑卷。

    Cache slot promotion in a replacement queue cache using determinations of probabilities and costs
    9.
    发明授权
    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.

    摘要翻译： 技术和标准用于以替换队列的形式促进高速缓存内的时隙。 可以基于考虑以下标准的不等式来促进缓存时隙：丢失高速缓存命中的概率，获得高速缓存命中以及与促进时隙相关联的价格或成本。 当替换队列处于锁定状态和解锁状态时，或仅当替换队列处于锁定状态时，可以根据预定的促销策略来使用上述准则。 不同的成本可能与替换队列的状态相关联，因为替换队列可能被锁定与在替换队列上执行的操作相关联。 与锁定的替换队列相关联的成本可能与与解锁的替换队列相关联的成本不同。 可以将与上述标准相关联的不同阈值和值指定为动态系统参数。

    Techniques for automated evaluation and movement of data between storage tiers for thin devices
    10.
    发明授权
    Techniques for automated evaluation and movement of data between storage tiers for thin devices 有权
    用于在薄型设备的存储层之间自动评估和移动数据的技术

    公开(公告)号：US09052830B1

    公开(公告)日：2015-06-09

    申请号：US13135306

    申请日：2011-06-30

    申请人： Marik Marshak ,  Adnan Sahin ,  Xiaomei Liu ,  Hui Wang ,  Sean C. Dolan ,  Amnon Naamad

    发明人： Marik Marshak ,  Adnan Sahin ,  Xiaomei Liu ,  Hui Wang ,  Sean C. Dolan ,  Amnon Naamad

    IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F3/06

    CPC分类号： G06F3/061 ,  G06F3/0608 ,  G06F3/0611 ,  G06F3/064 ,  G06F3/0647 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0689

    摘要： Described are techniques for evaluating data movement alternative. A set of criteria including capacity and performance limits is received. First processing is performed to evaluate a plurality of alternatives for use in data movement with respect to a set of logical devices having data stored on a set of physical storage devices. Each of the plurality of alternatives includes a different set of data movement criteria comprising capacity limits and a different set of performance limits. The set of physical storage devices includes at least a first physical device of one of a plurality of storage tiers and a second physical device of another one of the plurality of storage tier. One of the sets of performance limits is selected in accordance with the first processing.

    摘要翻译： 描述了评估数据移动替代方法的技术。 收到一套标准，包括容量和性能限制。 执行第一处理以针对具有存储在一组物理存储设备上的数据的一组逻辑设备来评估用于数据移动的多个替代方案。 多个替代方案中的每一个包括不同的数据移动标准集合，其包括容量限制和不同的性能限制集合。 所述一组物理存储设备至少包括多个存储层中的一个的第一物理设备和所述多个存储层中的另一个存储层的第二物理设备。 根据第一处理选择性能极限集合中的一个。