会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Efficient super cluster implementation for solving connected problems in a distributed environment
    • 有效的超级群集实现,用于解决分布式环境中的连接问题
    • US08090762B2
    • 2012-01-03
    • US11329263
    • 2006-01-10
    • Robert G. DeenJames H. KaufmanTobin J. Lehman
    • Robert G. DeenJames H. KaufmanTobin J. Lehman
    • G06F15/16G06F15/163
    • G06F9/5066
    • Embodiments herein present a system, method, etc. for an efficient super cluster implementation for solving connected problems in a distributed environment. More specifically, the system adapts computing latency to communication latency, wherein the system comprises VPPs wrapped within OCW layers. The VPPs represent a subset of an overall computer task; and, the OCW layers are adapted to enclose the VPPs. Specifically, the number of OCWs that enclose a VPP correspond to the number of computing iterations that may be locally executed by the VPP during an inter-VPP communication cycle. In addition, each VPP comprises collections of OPCs, wherein the OPCs comprise data, methods, and pointers to neighbors. The OPCs are indexed separately based on whether the OPC is part of an OCW layer.
    • 本文的实施例提出了用于解决分布式环境中的连接问题的有效的超群集实现的系统,方法等。 更具体地,系统将计算延迟适应于通信等待时间,其中系统包括包含在OCW层内的VPP。 VPP代表整个计算机任务的一个子集; 并且,OCW层适于包围VPP。 具体地,包围VPP的OCW的数量对应于在VPP通信周期期间由VPP本地执行的计算迭代次数。 另外,每个VPP包括OPC集合,其中OPC包括数据,方法和指向邻居的指针。 OPC是根据OPC是否是OCW层的一部分分开索引。
    • 7. 发明申请
    • SYSTEM AND METHOD FOR AUTOMATICALLY SEGMENTING AND POPULATING A DISTRIBUTED COMPUTING PROBLEM
    • 自动分类和分配分布式计算问题的系统和方法
    • US20080301405A1
    • 2008-12-04
    • US12191483
    • 2008-08-14
    • James H. KaufmanTobin Jon Lehman
    • James H. KaufmanTobin Jon Lehman
    • G06F15/76G06F9/30
    • G06F17/5018
    • The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
    • 分布式计算问题的初始划分可能是至关重要的,并且通常是用户的烦恼的来源。 提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合,将问题自动地将问题分解成原始程序单元(OPC)的固定大小的集合。 位于集合边缘的OPC可与相邻集合边缘的OPC通信,并与集合“核心”或内部非边缘部分内的OPC分开索引。 因此,核心OPC可以独立于迭代集合和集合集(VPP)之间的任何通信。 边缘上的所有OPC都具有与远程信息(即它们的邻居都在相邻集合的相同边缘上)的公共依赖关系。
    • 9. 发明授权
    • System and method for automatically segmenting and populating a distributed computing problem
    • 用于自动分段和填充分布式计算问题的系统和方法
    • US08606844B2
    • 2013-12-10
    • US12191483
    • 2008-08-14
    • James H. KaufmanTobin Jon Lehman
    • James H. KaufmanTobin Jon Lehman
    • G06F15/16G06T15/00
    • G06F17/5018
    • The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).
    • 分布式计算问题的初始划分可能是至关重要的,并且通常是用户的烦恼的来源。 提供了一种基于所指定的问题的复杂性以及可用于整个作业的各种口径的计算代理的组合,将问题自动地将问题分解成原始程序单元(OPC)的固定大小的集合。 位于集合边缘的OPC可与相邻集合边缘的OPC通信,并与集合“核心”或内部非边缘部分内的OPC分开索引。 因此,核心OPC可以独立于迭代集合和集合集(VPP)之间的任何通信。 边缘上的所有OPC都具有与远程信息(即它们的邻居都在相邻集合的相同边缘上)的公共依赖关系。
    • 10. 发明授权
    • System and method for balancing a computing load among computing resources in a distributed computing problem
    • 用于在分布式计算问题中平衡计算资源之间的计算负载的系统和方法
    • US07590984B2
    • 2009-09-15
    • US10448625
    • 2003-05-29
    • James H. KaufmanTobin Jon Lehman
    • James H. KaufmanTobin Jon Lehman
    • G06F9/46
    • G06F9/5066
    • A distributed parallel computing system actively takes advantage of problem partitioning to balance the computing load among computing resources continually during processing. Variable problem partitions (VPPs) are initially defined as groups of original problem cells (OPCs). VPPs may be redefined and redistributed during execution, if necessary, to optimize performance based on the actual computing agent parameters and costs observed or reported through self-tests. For example, a good rule for efficient execution of a computing problem may be that the time required to perform a computation sequence (iteration) of all OPCs in a VPP should be comparable to the time required to share results via edge OPCs at the VPP collection perimeters. The rules that yield cost-efficient execution may be saved and re-used to generate initial partitionings for subsequent computing problem execution runs.
    • 分布式并行计算系统积极利用问题划分,在处理过程中不断平衡计算资源之间的计算负担。 可变问题分区(VPPs)最初被定义为原始问题单元(OPC)的组。 如果需要,可以在执行期间重新定义和重新分配VPP,以根据实际的计算代理参数和通过自检来观察或报告的成本优化性能。 例如,有效执行计算问题的一个好的规则可能是执行VPP中所有OPC的计算序列(迭代)所需的时间应该与VPP集合上的边缘OPC共享结果所需的时间相当 周长 可以保存产生成本效益的执行的规则,并重新使用这些规则来生成用于后续计算问题执行运行的初始分区。