专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06817016B1 Dominant edge identification for efficient partition and distribution 失效
标题翻译：优势边缘识别有效的分配和分配
公开(公告)号：US06817016B1
公开(公告)日：2004-11-09
申请号：US09676424
申请日：2000-09-29
申请人： Mark N. Wegman , Vadakkedathu T. Rajan , Tova Roth , Douglas N. Kimelman , Karin Hogstedt
发明人： Mark N. Wegman , Vadakkedathu T. Rajan , Tova Roth , Douglas N. Kimelman , Karin Hogstedt
IPC分类号： G06F15163
CPC分类号： H04L29/06 , H04L67/10 , H04L69/329
摘要： A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Then, dominant edges are identified within the communication graph. For any non-terminal node, a connected edge is dominant if it is at least as heavy (its weight is greater than or equal to) as the sum of the remaining non-terminal edges and the heaviest of the remaining terminal edges. The min cut for the communication graph need not include any dominant edges and so, dominant edges are removed from consideration for the final min cut solution. Finally, program components which may be a single program unit or an aggregate of units are placed on computers according to the communication graph min cut solution.
摘要翻译：一种任务管理系统，方法和计算机程序产品，用于确定多个机器上的任务组件的最佳布置，用于任务执行，特别是用于将程序组件放置在多个计算机上用于分布式处理。首先，生成表示计算机程序的通信图，其中每个程序单元（例如，对象）表示为图中的节点。节点通过表示连接节点之间的通信的边缘连接到其他节点。对每个边缘施加重量，该重量是连接边缘之间的连通水平的度量。代表多台计算机的终端节点附加到通信图。然后，在通信图中识别出优势边。对于任何非终端节点，如果连续边缘至少与剩余的非终端边缘和最重的其余终端边缘的总和一样重（其重量大于或等于），则连接边是主要的。通信图的最小切割不需要包括任何主要边缘，因此，最终最小切割解决方案的主要边缘被删除。最后，根据通信图最小切割解决方案，将可能是单个程序单元或单元集合的程序组件放置在计算机上。

2. 发明授权

US06862731B1 Net zeroing for efficient partition and distribution 失效
标题翻译：净归零有效的分配和分配
公开(公告)号：US06862731B1
公开(公告)日：2005-03-01
申请号：US09676425
申请日：2000-09-29
申请人： Tova Roth , Vadakkedathu T. Rajan , Douglas N. Kimelman , Mark N. Wegman , Karin Hogstedt
发明人： Tova Roth , Vadakkedathu T. Rajan , Douglas N. Kimelman , Mark N. Wegman , Karin Hogstedt
IPC分类号： G06F9/46 , G06F9/50 , G06F15/173
CPC分类号： G06F9/5066
摘要： The present invention is a task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of ones of the multiple computers are attached to the communication graph. Independent nets may be separated out of the communication graph. For each net, non-terminal nodes adjacent to all of terminal nodes on the net and connected to the net by non-zero weighted edges are identified For each identified non-terminal node, the smallest weight for any terminal edge is identified and the weight of each terminal edge is reduced by the value of that smallest weight, the weight of terminal edges having the smallest weight being reduced to zero. After reducing weights on any terminal edges, The min cut solution is obtained from the reduced graph and program components, which may be a single program unit or an aggregate of units, are placed on computers according to the communication graph min cut solution.
摘要翻译：本发明是一种任务管理系统，方法和计算机程序产品，用于确定用于任务执行的多个机器上的任务组件的最佳布置，特别是用于将程序组件放置在多个计算机上用于分布式处理。首先，生成表示计算机程序的通信图，其中每个程序单元（例如，对象）表示为图中的节点。节点通过表示连接节点之间的通信的边缘连接到其他节点。对每个边缘施加重量，该重量是连接边缘之间的连通水平的度量。代表多台计算机的终端节点被附加到通信图。独立网可以从通信图中分离出来。对于每个网络，识别与网络上所有终端节点相邻并且通过非零加权边缘连接到网络的非终端节点对于每个识别的非终端节点，识别任何终端边缘的最小权重，并且权重每个终端边缘的最小重量减去最小重量的值，将最小重量的终端边缘的重量减小到零。在减少任何终端边缘的权重之后，最小切割解决方案是从减少的图形中获得的，程序组件可以是单个程序单元或单元集合，根据通信图最小切割解决方案放置在计算机上。

3. 发明授权

US07010789B1 Independent net task identification for efficient partition and distribution 失效
标题翻译：独立的净任务识别，有效的分配和分配
公开(公告)号：US07010789B1
公开(公告)日：2006-03-07
申请号：US09676422
申请日：2000-09-29
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Mark N. Wegman , Karin Hogstedt
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Mark N. Wegman , Karin Hogstedt
IPC分类号： G06F9/46
CPC分类号： G06F9/5066
摘要： A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Then, the communication graph is divided into independent nets and a min cut is found for each independent net. The min cut for the communication graph is the combination of the min cuts for all of the independent nets. Finally, program components which may be a single program unit or an aggregate of units are placed on computers according to the communication min cut.
摘要翻译：一种任务管理系统，方法和计算机程序产品，用于确定多个机器上的任务组件的最佳布置，用于任务执行，特别是用于将程序组件放置在多个计算机上用于分布式处理首先，生成表示计算机程序的通信图，其中每个程序单元（例如，对象）表示为图中的节点。节点通过表示连接节点之间的通信的边缘连接到其他节点。对每个边缘施加重量，该重量是连接边缘之间的连通水平的度量。代表多台计算机的终端节点附加到通信图。然后，通信图被分成独立网，每个独立网找到最小切点。通信图的最小切割是所有独立网络的最小切割的组合。最后，可以将单个程序单元或单元的集合的程序组件根据通信最小切割放置在计算机上。

4. 发明申请

US20080163163A1 MINIMIZING INTERACTION COSTS AMONG COMPONENTS OF COMPUTER PROGRAMS 有权
标题翻译：最小化计算机程序组件的交互成本
公开(公告)号：US20080163163A1
公开(公告)日：2008-07-03
申请号：US12037080
申请日：2008-02-25
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F9/44
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.
摘要翻译：一种用于使计算机程序的组件之间的交互的总成本最小化的方法，每个组件的特征在于至少一个实现属性包括以下步骤：a）执行程序的至少部分运行; b）监视程序的至少部分运行以测量每对组件之间的相互作用量; c）确定每对相互作用的部件之间的交互成本; d）确定最小化至少部分跑步的总成本的实现属性的选择; 以及e）将所述实现属性的选择分配给所述组件以用于所述程序的后续至少部分运行。

5. 发明授权

US07730001B2 Computer system program and method to characterize each of a plurality of objects used at runtime to determine a lowest cost property among a plurality of potential alternative properties for each of said objects minimizing total cost of interaction among components during program execution 失效
标题翻译：用于表征运行时使用的多个对象中的每一个的计算机系统程序和方法，以确定每个所述对象的多个潜在替代属性中的最低成本属性，从而最小化在程序执行期间组件之间的交互的总成本
公开(公告)号：US07730001B2
公开(公告)日：2010-06-01
申请号：US10073608
申请日：2002-02-11
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F15/18 , G06F9/44 , G06F9/445 , G06F9/45 , G06F9/50 , G05B13/00
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： A method is provided for characterizing objects generated during an initial run of a program, each object being characterized by a number of alternative properties which can be chosen. The method includes steps of instrumenting an initial run of program to determine characterization information about each of objects, then determining a desirable property for each object, then determining a correlation between the desirable property and the characterization information for each of the objects. This correlation is then used to select a property for an object that is subsequently created during a run of the program based only upon characterization information about the subsequently created object.
摘要翻译：提供了一种用于表征在程序的初始运行期间生成的对象的方法，每个对象的特征在于可以选择的多个备选属性。该方法包括以下步骤：对程序的初始运行进行测试，以确定关于每个对象的特征信息，然后确定每个对象的期望属性，然后确定所需属性与每个对象的表征信息之间的相关性。然后，该相关性仅用于基于仅关于随后创建的对象的表征信息来选择随后在程序运行期间创建的对象的属性。

6. 发明授权

US07392515B2 Program components having multiple selectable implementations 有权
标题翻译：具有多个可选择实现的程序组件
公开(公告)号：US07392515B2
公开(公告)日：2008-06-24
申请号：US10073630
申请日：2002-02-11
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： Libraries and individual program components are provided with a common interface and a number of alternative implementations (e.g. hash table, tree, compressed) which can be selected. The component is instrumented to measure a cost of each of its alternative implementations, both independent of and in the context of the interaction of that component with other components of the computer program. Based on measured cost, the desired implementation is chosen for the component by an external controller that is generic to the computer program or by an application program that interfaces with the library or component.
摘要翻译：库和单独的程序组件被提供有可以被选择的公共接口和多个替代实现（例如，哈希表，树，压缩）。该组件用于测量其每个替代实现的成本，独立于该组件与计算机程序的其他组件的交互的上下文。基于测量成本，通过与计算机程序通用的外部控制器或与库或组件接口的应用程序为组件选择所需的实现。

7. 发明授权

US07360205B2 Minimizing interaction costs among components of computer programs 失效
标题翻译：最小化计算机程序组件之间的交互成本
公开(公告)号：US07360205B2
公开(公告)日：2008-04-15
申请号：US10073628
申请日：2002-02-11
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F9/44 , G01D3/00
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： A system and method for minimizing total cost of interaction among components of a computer program which are each characterized by at least one implementation property. A implementation property may, for example, be a choice of string representation (e.g. ASCII, UNICODE, EBCDIC or choice of data structure (e.g. hash, tree, compressed). The method comprises the steps of: carrying out a run of the program; monitoring that run to measure an amount of interaction between each pair of components; determining a cost of interaction between each pair of interacting components; determining a choice of implementation properties which minimizes total cost of the run; and assigning choices of implementation properties to said components for a future run of the program.
摘要翻译：一种用于最小化计算机程序的组件之间的交互的总成本的系统和方法，每个功能的特征在于至少一个实现属性。例如，实现属性可以是字符串表示的选择（例如ASCII，UNICODE，EBCDIC或数据结构的选择（例如，哈希，树，压缩）。该方法包括以下步骤：执行程序的运行; 运行的监视以测量每对组件之间的交互量;确定每对相互作用组件之间的交互成本;确定最小化运行总成本的实现属性的选择;以及向所述组件分配实现属性的选择为未来运行的程序。

8. 发明授权

US06823510B1 Machine cut task identification for efficient partition and distribution 失效
标题翻译：切割任务识别，有效分配和分配
公开(公告)号：US06823510B1
公开(公告)日：2004-11-23
申请号：US09676423
申请日：2000-09-29
申请人： Vadekkadathu T. Rajan , Douglas N. Kimelman , Tova Roth , Mark N. Wegman , Karin Hogstedt
发明人： Vadekkadathu T. Rajan , Douglas N. Kimelman , Tova Roth , Mark N. Wegman , Karin Hogstedt
IPC分类号： G06F946
CPC分类号： G06F9/5066
摘要： A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Independent nets may be separated out of the communication graph. A cut is made at each terminal node and the weights of the cut edges are summed. The second heaviest terminal is identified from the cut and edges connected to at least one internal node and not connected to the second heaviest edge are compared against the weight of the second heaviest edge. Any edge found in the comparison to be at least as heavy as the second heaviest terminal node need not be included in the min cut for the communication graph and so, is removed from consideration for the final min cut solution. Finally, program components which may be a single program unit or an aggregate of units are placed on computers according to the communication graph min cut solution.
摘要翻译：一种任务管理系统，方法和计算机程序产品，用于确定多个机器上的任务组件的最佳布置，用于任务执行，特别是用于将程序组件放置在多个计算机上用于分布式处理。首先，生成表示计算机程序的通信图，其中每个程序单元（例如，对象）表示为图中的节点。节点通过表示连接节点之间的通信的边缘连接到其他节点。对每个边缘施加重量，该重量是连接边缘之间的连通水平的度量。代表多台计算机的终端节点附加到通信图。独立网可以从通信图中分离出来。在每个终端节点处进行切割，并将切割边缘的权重相加。从切割中识别出第二个最重的终端，并且将连接到至少一个内部节点的边缘与未连接到第二最重的边缘的边缘进行比较，与第二最重的边缘的重量进行比较。在比较中发现的至少与第二个最重的终端节点一样重要的任何边缘不需要包含在通信图形的最小切割中，因此从最终切割解决方案的考虑中移除。最后，根据通信图最小切割解决方案，将可能是单个程序单元或单元集合的程序组件放置在计算机上。

9. 发明授权

US08706704B2 Method and system for creating semantic relationships using hyperlinks 有权
标题翻译：使用超链接创建语义关系的方法和系统
公开(公告)号：US08706704B2
公开(公告)日：2014-04-22
申请号：US11775913
申请日：2007-07-11
申请人： Steven R. Abrams , Bard Bloom , Paul T. Keyser , Douglas N. Kimelman , Eric M. Nelson , Tova Roth , Ian Simmonds , Steven Tang , Wendy D. Neuberger , Dru Ann Vlissides
发明人： Steven R. Abrams , Bard Bloom , Paul T. Keyser , Douglas N. Kimelman , Eric M. Nelson , Tova Roth , Ian Simmonds , Steven Tang , John M. Vlissides , Wendy D. Neuberger
IPC分类号： G06F17/30
CPC分类号： G06F17/30731 , G06F17/30896 , G06F17/30902
摘要： A method and system are disclosed for creating a hyperlink together with an associated semantic link between a source entity, and a target entity. The source entity includes descriptive text. The system includes means for selecting text within the source entity, and means for selecting the target entity. Also, means are provided for selecting a type of semantic link, and means are provided for creating a hyperlink between said selected text and said target entity. The system further includes means for creating a semantic link of said type between said source entity and said target entity, including means for including in the hyperlink a reference to said semantic link. In the preferred embodiment of the invention, the means for selecting the type of semantic link includes means for prompting a user to select from among a plurality of candidate types of semantic links.
摘要翻译：公开了用于在源实体和目标实体之间创建超链接以及相关联的语义链接的方法和系统。源实体包括描述性文本。该系统包括用于选择源实体内的文本的装置，以及用于选择目标实体的装置。此外，提供了用于选择一种语义链接的装置，并且提供了用于在所述所选择的文本和所述目标实体之间创建超链接的装置。该系统还包括用于在所述源实体和所述目标实体之间创建所述类型的语义链接的装置，包括用于在超链接中包括对所述语义链接的引用的装置。在本发明的优选实施例中，用于选择语义链接类型的装置包括用于提示用户从多个候选类型的语义链接中进行选择的装置。

10. 发明申请

US20120260045A1 INCONSISTENCY ROBUSTNESS IN SCALABLE OLAP CUBES 有权
标题翻译：不可靠的OLAP CUBES中的稳健性
公开(公告)号：US20120260045A1
公开(公告)日：2012-10-11
申请号：US13434685
申请日：2012-03-29
申请人： Samuel S. Adams , Douglas N. Kimelman , David Ungar , Mark N. Wegman
发明人： Samuel S. Adams , Douglas N. Kimelman , David Ungar , Mark N. Wegman
IPC分类号： G06F12/08
CPC分类号： G06F17/30592
摘要： A method (and system) includes providing a memory including a plurality of named locations each holding a value and introducing at least one freshener. The at least one freshener chooses one of the plurality of named locations and re-computes its value.
摘要翻译：一种方法（和系统）包括提供包括多个命名位置的存储器，每个命名位置保持一个值并引入至少一个清新剂。至少一个清新剂选择多个命名位置中的一个，并重新计算其值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式