会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Replicating kernel data that is read mostly and write rarely
    • 复制大部分读取的内核数据,很少写入
    • US06959342B1
    • 2005-10-25
    • US10643739
    • 2003-08-18
    • Stephan Kurt GippAaron Forest Godfrey
    • Stephan Kurt GippAaron Forest Godfrey
    • G06F13/00G06F13/16
    • G06F13/1657
    • A distributed computer system and a method for replicating data in a distributed computer system. The system includes a plurality of processing nodes. A processing node comprises at least one processor and at least one local memory, where the local memory is in communication with each processing node. The system also includes maintenance software to determine whether data is read substantially more frequently than it is written and to replicate the data that is read substantially more frequently than it is written among the plurality of processing nodes. The method includes reviewing classes of data, identifying whether at least a portion of data of a certain class used by the processing nodes is read substantially more frequently than it is written and replicating copies of the data of that class in the local memories.
    • 分布式计算机系统和在分布式计算机系统中复制数据的方法。 该系统包括多个处理节点。 处理节点包括至少一个处理器和至少一个本地存储器,其中本地存储器与每个处理节点通信。 该系统还包括维护软件,用于确定数据是否被读取得比其写入的频率大得多,并且复制比在多个处理节点之间写入的数据读得更多的数据。 该方法包括查看数据类别,识别处理节点使用的特定类别的数据的至少一部分是否被读取得比其在本地存储器中写入该类别的数据的副本更多的频率。
    • 5. 发明授权
    • Techniques for adaptive data transfer
    • 自适应数据传输技术
    • US08533374B1
    • 2013-09-10
    • US12944550
    • 2010-11-11
    • Stephan Kurt GippJeremy Howard Wartnick
    • Stephan Kurt GippJeremy Howard Wartnick
    • G06F3/00G06F13/38
    • G06F3/0611G06F3/0653G06F3/0656G06F3/067
    • Techniques for adaptive data transfer are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for adaptive data transfer comprising receiving a write request at an application protocol layer, buffering the write request, transferring to electronic storage a first portion of data of the buffered write request using a first setting value in a range, measuring, a transfer rate of the first portion of transferred data, varying the first setting value by a small amount in a first direction to identify a second setting value, transferring to electronic storage a second portion of data of the buffered write request using the second setting value, measuring a transfer rate of the second portion of transferred data, and replacing the first setting value with the second setting value if the transfer rate of the second portion of transferred data is greater than the first transfer rate.
    • 公开了用于自适应数据传输的技术。 在一个特定的示例性实施例中,这些技术可以被实现为用于自适应数据传输的方法,包括在应用协议层接收写入请求,缓冲写入请求,使用以下方式将缓冲写入请求的第一部分数据传送到电子存储器 第一设定值,测量传送数据的第一部分的传送速率,将第一设定值沿第一方向改变少量以识别第二设定值,将电子存储器的第二部分数据传送到电子存储器 所述缓冲写入请求使用所述第二设置值,测量传送数据的第二部分的传送速率,以及如果所传送的数据的第二部分的传送速率大于所述第一传送,则用所述第二设置值替换所述第一设置值 率。
    • 6. 发明授权
    • System and method for mapping between resource consumers and resource providers in a computing system
    • 在计算系统中资源使用者和资源提供者之间进行映射的系统和方法
    • US08296771B2
    • 2012-10-23
    • US10643740
    • 2003-08-18
    • Stephan Kurt Gipp
    • Stephan Kurt Gipp
    • G06F9/46G06F15/173
    • G06F9/5016
    • A system and method for allocating system resources is described herein. In one embodiment, the method comprises creating, in a computer system, a resource consumer and assigning the resource consumer one of a set of flavors. The method further includes determining whether the resource consumer is limited to receiving resources from a certain one of a set of resource providers, wherein each of the set of resource providers has one of the set of flavors. The method further includes marking a field to indicate that the resource consumer is limited to receiving resources from the certain one of the set of resource providers, if the resource consumer is limited to receiving resources from the certain one of the set of resource providers. The method further includes allocating a resource to the resource consumer from one of the set of resource providers whose flavor matches the flavor assigned to the resource consumer.
    • 这里描述了用于分配系统资源的系统和方法。 在一个实施例中,该方法包括在计算机系统中创建资源消费者并且分配资源消费者一组风格之一。 该方法还包括确定资源消费者是否被限于从一组资源提供者中的某一个接收资源,其中资源提供者集合中的每一个具有一组风格之一。 该方法还包括:如果资源消费者被限制为从资源提供者集合中的某一个接收资源,则标记字段以指示资源消费者被限制为从该资源提供者集合中的某一个接收资源。 该方法还包括从资源消耗者的风味与分配给资源消费者的风味相匹配的一组资源提供者中的一个资源消费者分配资源。
    • 7. 发明授权
    • Affinity based allocation for storage implementations employing deduplicated data stores
    • 使用重复数据删除数据存储的存储实现的基于亲和度的分配
    • US08315992B1
    • 2012-11-20
    • US12324428
    • 2008-11-26
    • Stephan Kurt GippAdonijah Park
    • Stephan Kurt GippAdonijah Park
    • G06F17/30
    • G06F11/1453
    • A method, apparatus, and computer program product for implementing affinity based allocation for storage implementations employing deduplicated data stores is disclosed. According to an embodiment of the present invention, a backup manager determines if information associating a data source with a first data target of a plurality of data targets has been established. The first data target is a deduplication data store and the information associating the data source with the first data target indicates an increased likelihood of at least some information stored on the data source is already being stored on the first data target prior to performing a backup. If information associating the data source with the first data target has been established, the backup manager stores a set of data on the data target.
    • 公开了一种用于实现使用重复数据删除的数据存储的存储实现的基于关联性分配的方法,装置和计算机程序产品。 根据本发明的实施例,备份管理器确定是否建立了将数据源与多个数据目标的第一数据目标相关联的信息。 第一数据目标是重复数据删除数据存储,并且将数据源与第一数据目标相关联的信息指示在执行备份之前,存储在数据源上的至少一些信息已经被存储在第一数据目标上的增加的可能性。 如果已经建立了将数据源与第一数据目标相关联的信息,则备份管理器将一组数据存储在数据目标上。