会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • Method and apparatus for enabling access to tiered shared storage using dynamic tier partitioning
    • 用于使用动态层划分访问分层共享存储的方法和装置
    • US09335948B1
    • 2016-05-10
    • US13431071
    • 2012-03-27
    • Ahmet KiracAdnan SahinMarik MarshakAmnon Naamad
    • Ahmet KiracAdnan SahinMarik MarshakAmnon Naamad
    • G06F3/06
    • G06F3/0649G06F3/061G06F3/0631G06F3/0665G06F3/0685
    • To facilitate both minimal allocations and adaptive allocations, two sets of storage group policies are defined—one policy setting minimal allocation values for storage group access to storage resources and one policy setting maximal allocation values for storage group access to storage. In addition, a set of priority weights is specified that is used to balance access to storage tiers across storage groups. Upon existence of contention for storage resources, minimum allocation values for storage groups are determined based on the priority weights for the storage groups, resulting in threshold values being set to enable at least partial access to storage resources for all storage groups without requiring priority weighting of the activity density distributions of the competing storage groups. Allocations other than the minimal allocations are provided based on relative activity density distribution of storage extents between groups.
    • 为了方便最小分配和自适应分配,定义了两组存储组策略 - 一种策略设置用于存储组访问存储资源的最小分配值,以及一个策略设置用于存储组访问存储的最大分配值。 此外,还指定了一组优先级权重,用于平衡对存储组间存储层的访问。 在存储资源的争用存在时,基于存储组的优先级权重来确定存储组的最小分配值,导致阈值被设置为使得能够至少部分地访问所有存储组的存储资源,而不需要优先权重 竞争存储组的活动密度分布。 基于分组之间的存储范围的相对活动密度分布提供除最小分配之外的分配。
    • 9. 发明授权
    • Management of two-queue request structure for quality of service in disk storage systems
    • 管理磁盘存储系统中服务质量的两队列请求结构
    • US07293136B1
    • 2007-11-06
    • US11208291
    • 2005-08-19
    • Sachin Suresh MoreAdnan SahinWilliam J. Glynn
    • Sachin Suresh MoreAdnan SahinWilliam J. Glynn
    • G06F12/00
    • G06F3/0659G06F3/0611G06F3/0656G06F3/0676
    • Storage requests are divided into high-priority requests generally requiring low response time and low-priority requests generally requiring high throughput. The high-priority requests are further divided into several priorities reflecting different classes of service. The low-priority requests are placed on a low-priority request queue where they are executed in a throughput-optimizing order generally different from their arrival order. For each high-priority request, if there are not more than a predetermined number n (e.g., 1) outstanding requests for execution by the disk drive of greater priority, then the request is placed on a high-priority request queue where it is generally executed ahead of requests on the low-priority request queue. If there are more than n such greater-priority requests outstanding, then the high-priority request is placed on the low priority request queue and included in the throughput optimization along with the low-priority requests. The number of priority levels for the high priority requests may be two or more, and in one illustrated embodiment is equal to three.
    • 存储请求被分为通常需要低响应时间和通常需要高吞吐量的低优先级请求的高优先级请求。 高优先级请求进一步分为反映不同类别服务的几个优先级。 低优先级请求被放置在低优先级请求队列中,它们以与其到达顺序不同的吞吐量优化顺序执行。 对于每个高优先级请求,如果没有超过预定数量n(例如,1)由磁盘驱动器执行的未完成请求具有较高优先级,则该请求被放置在高优先级请求队列上 在低优先级请求队列上的请求之前执行。 如果存在超过n个这样的较高优先级请求,则高优先级请求被置于低优先级请求队列上,并且包括在吞吐量优化中以及低优先级请求。 高优先级请求的优先级数量可以是两个或更多个,并且在一个所示实施例中等于三个。