Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.