会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements
    • 基于具有确定容量的多个节点的分布式计算选择性地加入具有资源需求的资源组
    • US08639816B2
    • 2014-01-28
    • US13541621
    • 2012-07-03
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • G06F15/16G06F15/173H04L12/28H04L12/50
    • G06F9/5072G06F2209/5011G06F2209/505
    • A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.
    • 网络通过计算节点提供基于参与相应资源组的分布式计算服务,每个资源组包括加入相应资源组以执行相应分布式计算服务的任何计算节点的相应资源需求。 响应于确定其对应的可用节点容量,每个计算节点被配置用于选择性地创建和加入至少一个新的资源组,以执行具有相应资源需求的对应的分布式计算服务,和/或选择性地将至少一个 可用资源组,基于相应的可用节点容量,满足相应的资源需求。 每个计算节点还被配置为基于确定的条件选择性地离开所连接的资源组中的任何一个。 因此,基于相应的可用节点容量,每个计算节点可以选择参与相应计算服务所需的尽可能多的资源组。
    • 7. 发明授权
    • Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements
    • 基于具有确定容量的多个节点的分布式计算选择性地加入具有资源需求的资源组
    • US08239540B2
    • 2012-08-07
    • US13221625
    • 2011-08-30
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • G06F15/16G06F15/173H04L12/28H04L12/50
    • G06F9/5072G06F2209/5011G06F2209/505
    • A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.
    • 网络通过计算节点提供基于参与相应资源组的分布式计算服务,每个资源组包括加入相应资源组以执行相应分布式计算服务的任何计算节点的相应资源需求。 响应于确定其对应的可用节点容量,每个计算节点被配置用于选择性地创建和加入至少一个新的资源组,以执行具有相应资源需求的对应的分布式计算服务,和/或选择性地将至少一个 可用资源组,基于相应的可用节点容量,满足相应的资源需求。 每个计算节点还被配置为基于确定的条件选择性地离开所连接的资源组中的任何一个。 因此,基于相应的可用节点容量,每个计算节点可以选择参与相应计算服务所需的尽可能多的资源组。
    • 8. 发明授权
    • Arrangement for a distributed file system having data objects mapped independent of any data object attribute
    • 一种分布式文件系统的安排,它具有独立于任何数据对象属性映射的数据对象
    • US08229985B2
    • 2012-07-24
    • US11051333
    • 2005-02-07
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • Bryan C. TurnerJohn ToebesDouglas Jay Walker
    • G06F17/00
    • G06F17/30215G06F17/30067Y10S707/959Y10S707/96
    • Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file.
    • 分布式文件系统的每个数据文件由独立于数据文件的任何属性的相应的全局唯一对象标识符来标识。 分布式文件系统中的节点具有包括多个目录条目的文件系统,其中每个目录条目具有文件名字段,属性字段和配置用于指定全局唯一对象标识符的对象标识符字段。 全局唯一的对象标识符通常由分布式文件系统的任何节点可访问,并且唯一地标识数据文件,使数据文件能够基于相应的对象标识符被任何节点普遍识别。 数据文件可以独立于设备文件系统存储,基于在数据文件名称与其对象标识符之间提供分辨率,随后在对象标识符与数据文件的选定位置之间进行分辨率。
    • 9. 发明申请
    • GRACEFULLY CHANGING A NODE IN A DISTRIBUTED COMPUTING NETWORK
    • 在分布式计算网络中彻底改变节点
    • US20100228841A1
    • 2010-09-09
    • US12779768
    • 2010-05-13
    • Douglas Jay WalkerBryan Turner
    • Douglas Jay WalkerBryan Turner
    • G06F15/177
    • H04W24/00H04L41/12H04L67/104H04L67/1046H04L67/1048H04L67/1065
    • In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change.
    • 在一个实施例中,一种方法包括确定改变由网络中的特定节点控制的对象的数量。 每个对象是由网络提供的资源,并且在N维的坐标空间中具有唯一的对象位置。 每个节点在N维的坐标空间中具有唯一的节点位置。 每个节点使用两个位置之间的标量距离的约定的定义来控制最接近节点的零个或多个对象的控制集合中的对象的操作。 添加与N维不同的N + 1维度。 N + 1维对于多个对象具有零值。 确定特定节点的N + 1维度的特定值,使得特定节点的特定控制集合中的对象数量的改变不大于阈值改变。