会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Sharding method and apparatus using directed graphs
    • 使用有向图的分片方法和装置
    • US07043621B2
    • 2006-05-09
    • US10439977
    • 2003-05-15
    • Arif MerchantMahesh KallahallaRam Swaminathan
    • Arif MerchantMahesh KallahallaRam Swaminathan
    • G06F12/00
    • G06F3/0608G06F3/061G06F3/0629G06F3/0665G06F3/0683Y10S707/99953Y10S707/99956
    • A method and apparatus is used to divide a storage volume into shards. The division is made using a directed graph having a vertex for each block in the storage volume and directed-edges between pairs of vertices representing a shard of blocks, associating a weight with each directed edge that represents the dissimilarity for the shard of blocks between the corresponding pair of vertices, selecting a maximum number of shards (K) for dividing the storage volume, identifying a minimum aggregate weight associated with a current vertex for a combination of no more than K shards, performing the identification of the minimum aggregate weight for vertices in the directed graph, and picking the smallest aggregated weight associated with the last vertex to determine a sharding that spans the storage volume and provides a minimal dissimilarity among no more than K shards of blocks.
    • 使用方法和装置将存储卷分成碎片。 使用具有存储卷中的每个块的顶点的有向图以及表示块的块的顶点对之间的有向边,将权重与代表块之间的块的不同性的每个有向边相关联 相应的顶点对,选择用于划分存储卷的最大碎片数(K),识别与不超过K个碎片的组合的当前顶点相关联的最小聚集权重,执行顶点的最小聚集权重的标识 在有向图中,并选择与最后一个顶点相关联的最小聚合权重,以确定跨越存储卷的分片,并在不超过K个块的块中提供最小的不相似性。
    • 5. 发明授权
    • Quality of service controller and method for a data storage system
    • 数据存储系统的服务质量控制器和方法
    • US07917903B2
    • 2011-03-29
    • US10400556
    • 2003-03-27
    • Christopher LumbArif MerchantGuillermo Alvarez
    • Christopher LumbArif MerchantGuillermo Alvarez
    • G06F9/46
    • G06F9/4887
    • A quality-of-service controller and related method for a data storage system. Requests for each of a plurality of storage system workloads are prioritized. The requests are selectively forwarded to a storage device queue according to their priorities so as to maintain the device queue at a target queue depth. The target queue depth is adjusted response to a latency value for the requests wherein the latency value is computed based on a difference between an arrival time and a completion time of the requests for each workload. Prioritizing the requests may be accomplished by computing a target deadline for a request based on a monitored arrival time of the request and a target latency for its workload. To reduce latencies, the target queue depth may be reduced when the target latency for a workload is less than its computed latency value. To increase throughput, the target queue depth may be increased when the target latency for each workload is greater than each computed latency value.
    • 一种数据存储系统的服务质量控制器和相关方法。 优先考虑多个存储系统工作负载中的每一个的请求。 这些请求根据其优先级选择性地转发到存储设备队列,以便将设备队列保持在目标队列深度。 根据对每个工作负载的请求的到达时间和完成时间之间的差值来计算等待时间值,从而对目标队列深度进行调整响应。 可以通过基于所请求的监视到达时间和其工作负载的目标延迟来计算请求的目标截止时间来实现优先级请求。 为了减少延迟,当工作负载的目标延迟小于其计算的延迟值时,可能会减少目标队列深度。 为了增加吞吐量,当每个工作负载的目标延迟大于每个计算的等待时间值时,可能会增加目标队列深度。
    • 7. 发明申请
    • Method of hashing address space to storage servers
    • 将存储服务器的地址空间散列的方法
    • US20060236073A1
    • 2006-10-19
    • US11051436
    • 2005-02-03
    • Craig SoulesArif MerchantAlistair VeitchYasushi Saito
    • Craig SoulesArif MerchantAlistair VeitchYasushi Saito
    • G06F12/10G06F9/46
    • G06F3/0631G06F3/0613G06F3/067G06F2206/1012
    • An embodiment of a method of hashing an address space to a plurality of storage servers begins with a first step of dividing the address space by a number of the storage servers to form data segments. Each data segment comprises a base address. A second step assigns the data segments to the storage servers according to a sequence. The method continues with a third step of measuring a load on each of the storage servers. According to an embodiment, the method concludes with a fourth step of adjusting data shares assigned to the storage servers according to the sequence to approximately balances the loads on the storage servers while maintaining the base address for each data segment on an originally assigned storage server. According to another embodiment, the method periodically performs the third and fourth steps to maintain an approximately balanced load on the storage servers.
    • 将地址空间散列到多个存储服务器的方法的实施例开始于将地址空间除以多个存储服务器以形成数据段的第一步骤。 每个数据段包括基地址。 第二步根据序列将数据段分配给存储服务器。 该方法继续测量每个存储服务器上的负载的第三步。 根据实施例,该方法结束于第四步骤,根据顺序调整分配给存储服务器的数据共享,以大致平衡存储服务器上的负载,同时维护原始分配的存储服务器上的每个数据段的基址。 根据另一实施例,该方法周期性地执行第三和第四步骤以维持存储服务器上的大致平衡的负载。