公开(公告)号：US07277960B2

公开(公告)日：2007-10-02

申请号：US10627883

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F15/173

CPC分类号： G06F9/5066

摘要： A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure. In an embodiment of the present invention, a placement indicator for a specific service is provided. Communication constraints between node pairs are also provided. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Constraints can be expressed for preventing unwanted placements. Preferences can be expressed for preferring specified placements. Each term of the sum of transport demands comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The placement indicator, the communication constraints, and an objective comprise an integer program. A local search solution is applied to solve the integer program, which determines the placement of the services onto the nodes.

摘要翻译： 确定分布式应用程序的服务在分布式资源基础设施节点上的位置的方法。 在本发明的实施例中，提供了用于特定服务的放置指示器。 还提供了节点对之间的通信约束。 通信约束确保特定节点对之间的传输需求的总和不超过特定节点对之间的传输容量。 可以表达限制，以防止不必要的安置。 可以表示偏好偏好指定的展示位置。 运输需求总和的每个术语包括第一位置变量，第二位置变量和与第一和第二位置变量相关联的服务之间的运输需求的乘积。 放置指示符，通信约束和目标包括整数程序。 应用本地搜索解决方案来解决整数程序，确定服务在节点上的位置。

公开(公告)号：US20050033844A1

公开(公告)日：2005-02-10

申请号：US10627883

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F9/50 ,  G06F15/173

CPC分类号： G06F9/5066

摘要： A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure. In an embodiment of the present invention, a placement indicator for a specific service is provided. Communication constraints between node pairs are also provided. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Constraints can be expressed for preventing unwanted placements. Preferences can be expressed for preferring specified placements. Each term of the sum comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The placement indicator, the communication constraints, and an objective comprise an integer program. A local search solution is applied to solve the integer program, which determines the placement of the services onto the nodes.

摘要翻译： 确定分布式应用程序的服务在分布式资源基础设施节点上的位置的方法。 在本发明的实施例中，提供了用于特定服务的放置指示器。 还提供了节点对之间的通信约束。 通信约束确保特定节点对之间的传输需求的总和不超过特定节点对之间的传输容量。 可以表达限制，以防止不必要的安置。 可以表示偏好偏好指定的展示位置。 总和的每个项包括第一放置变量，第二放置变量和与第一和第二放置变量相关联的服务之间的运输需求的乘积。 放置指示符，通信约束和目标包括整数程序。 应用本地搜索解决方案来解决整数程序，确定服务在节点上的位置。

公开(公告)号：US07805448B2

公开(公告)日：2010-09-28

申请号：US10418075

申请日：2003-04-18

申请人： Artur Andrzejak ,  Zhichen Xu

发明人： Artur Andrzejak ,  Zhichen Xu

IPC分类号： G06F17/30

CPC分类号： H04L67/104 ,  H04L29/06 ,  H04L67/1065 ,  H04L67/1074 ,  H04L69/329

摘要： A system comprises a plurality of computing resource. Attribute values for the computing resources are stored in a peer-to-peer network in the system. A method for storing an attribute value comprises receiving an attribute value for a resource in the system, identifying a node in the peer-to-peer network for storing the attribute value, wherein the node stores a range of attribute values encompassing the received attribute value, and storing the attribute value at the identified node.

摘要翻译： 系统包括多个计算资源。 计算资源的属性值存储在系统中的对等网络中。 用于存储属性值的方法包括：接收系统中的资源的属性值，识别对等网络中用于存储属性值的节点，其中该节点存储包含接收到的属性值的属性值的范围 并将属性值存储在所识别的节点处。

公开(公告)号：US07426570B2

公开(公告)日：2008-09-16

申请号：US10627324

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F15/16

CPC分类号： G06F9/5066

摘要： A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure comprises first, second, and third steps. The first step forms communication constraints between node pairs. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Each term of the sum comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The second step forms an objective. The communication constraints and the objective comprise an integer program. The third step employs a local search solution to solve the integer program, which determines the placement of the services onto the nodes.

摘要翻译： 确定分布式应用的服务在分布式资源基础设施的节点上的放置的方法包括第一，第二和第三步骤。 第一步形成节点对之间的通信约束。 通信约束确保特定节点对之间的传输需求的总和不超过特定节点对之间的传输容量。 总和的每个项包括第一放置变量，第二放置变量和与第一和第二放置变量相关联的服务之间的运输需求的乘积。 第二步形成目标。 通信约束和目标包括整数程序。 第三步采用本地搜索解决方案来解决整数程序，该整数程序确定服务在节点上的位置。

公开(公告)号：US07191107B2

公开(公告)日：2007-03-13

申请号：US10627274

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F17/10 ,  G06F15/16

CPC分类号： G06Q10/06

摘要： In an embodiment of a method of determining a value changes for a placement variable as part of a local search solution to an integer programming problem that models placement of services of a distributed application onto nodes of a distributed resource infrastructure, an unsatisfied communication constraint is selected. The unsatisfied communication constraint includes a sum of terms where at least some of the terms comprise products of placement variables. Stores are created for allowable changes of value for the variables in the unsatisfied communication constraint. The unsatisfied communication constraint is parsed through by term. For each variable in a term, the stores are updated with a change in the term for each of the allowable changes of the value while maintaining other variables constant. A variable to receive the value change, and possibly a value for the variable, are chosen based upon the store which meets at least one improvement criterion.

摘要翻译： 在将分布式应用的服务建模到分布式资源基础设施的节点上的整数规划问题的局部搜索解决方案的一部分中确定放置变量的值变化的方法的实施例中，选择不满足的通信约束 。 不满足的通信约束包括一些术语的总和，其中至少一些术语包括放置变量的乘积。 创建商店，以便在不满足的通信约束中允许变量的值更改。 不满足的通信约束通过术语解析。 对于术语中的每个变量，在保持其他变量不变的情况下，对于每个允许的值的变化，术语中的变化被更新。 基于满足至少一个改进标准的商店来选择接收值变化的变量以及可能的变量的值。

公开(公告)号：US20050265359A1

公开(公告)日：2005-12-01

申请号：US10845855

申请日：2004-05-13

申请人： Julie Drew ,  Artur Andrzejak

发明人： Julie Drew ,  Artur Andrzejak

IPC分类号： H04L12/56

CPC分类号： H04L45/12 ,  H04L49/25 ,  H04L49/254 ,  H04L49/3009

摘要： An embodiment of a method of designing an interconnect fabric for a set of nodes begins with a step of identifying the set of nodes, a switch, and a set of data flows. The switch comprises a set of ports. The data flows comprise transmissions between the nodes. The method concludes with a step of determining a near optimal assignment of the nodes to the ports of the switch according to a plurality of constraints and an objective.

摘要翻译： 设计用于一组节点的互连结构的方法的实施例以识别节点集合，交换机和一组数据流的步骤开始。 交换机包括一组端口。 数据流包括节点之间的传输。 该方法的结论是根据多个约束和目标，确定节点到交换机的端口的接近最佳分配的步骤。

公开(公告)号：US07188174B2

公开(公告)日：2007-03-06

申请号：US10330312

申请日：2002-12-30

申请人： Jerome Alexander Rolia ,  Xiaoyun Zhu ,  Martin Fraser Arlitt ,  Artur Andrzejak

发明人： Jerome Alexander Rolia ,  Xiaoyun Zhu ,  Martin Fraser Arlitt ,  Artur Andrzejak

IPC分类号： G06F15/173

CPC分类号： H04L67/1002 ,  H04L69/329

摘要： A system and method to provide admission control of resources for applications in resource utility environments. Admission control is used to efficiently allocate access to resources with a certain level of assurance based on statistical behavior of resource demands of applications.

摘要翻译： 一种为资源应用环境中的应用提供资源准入控制的系统和方法。 入门控制用于根据应用资源需求的统计行为，有效地分配对具有一定级别保证的资源的访问。

公开(公告)号：US20050021831A1

公开(公告)日：2005-01-27

申请号：US10627324

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F9/50 ,  G06F15/16

CPC分类号： G06F9/5066

摘要： A method of determining a placement of services of a distributed application onto nodes of a distributed resource infrastructure comprises first, second, and third steps. The first step forms communication constraints between node pairs. The communication constraints ensure that a sum of transport demands between a particular node pair does not exceed a transport capacity between the particular node pair. Each term of the sum comprises a product of a first placement variable, a second placement variable, and the transport demand between the services associated with the first and second placement variables. The second step forms an objective. The communication constraints and the objective comprise an integer program. The third step employs a local search solution to solve the integer program, which determines the placement of the services onto the nodes.

摘要翻译： 确定分布式应用的服务在分布式资源基础设施的节点上的放置的方法包括第一，第二和第三步骤。 第一步形成节点对之间的通信约束。 通信约束确保特定节点对之间的传输需求的总和不超过特定节点对之间的传输容量。 总和的每个项包括第一放置变量，第二放置变量和与第一和第二放置变量相关联的服务之间的运输需求的乘积。 第二步形成目标。 通信约束和目标包括整数程序。 第三步采用本地搜索解决方案来解决整数程序，该整数程序确定服务在节点上的位置。

公开(公告)号：US20050021583A1

公开(公告)日：2005-01-27

申请号：US10627274

申请日：2003-07-25

申请人： Artur Andrzejak ,  Sven Graupner

发明人： Artur Andrzejak ,  Sven Graupner

IPC分类号： G06F7/38 ,  G06Q10/00

CPC分类号： G06Q10/06

摘要： A method of determining a set of variables to receive value changes as part of a local search solution to an integer programming problem. The method can be used where a constraint has one or more polynomial terms of at least second order. In an embodiment of the present invention an unsatisfied constraint is selected. Stores are created for allowable changes of value for the variables in the unsatisfied constraint. The unsatisfied constraint is parsed through by term. For each variable in a term, the stores are updated with a change in the term for each of the allowable changes of the value while maintaining other variables constant. A variable to receive the value change, and possibly a value for the variable, are chosen based upon the store which meets at least one improvement criterion.

摘要翻译： 确定一组变量以接收值变化的方法，作为整数规划问题的局部搜索解决方案的一部分。 该方法可以在约束具有至少二阶的一个或多个多项式项的情况下使用。 在本发明的实施例中，选择不满足的约束。 创建商店，以便在不满足的约束中允许变量的值。 不满足的约束通过术语解析。 对于术语中的每个变量，在保持其他变量不变的情况下，对于每个允许的值的变化，术语中的变化被更新。 基于满足至少一个改进标准的商店来选择接收值变化的变量以及可能的变量的值。