Abstract: A computer-implemented method, a computer system and a computer program product boost efficiency through energy-aware workload placement. The method includes obtaining an energy profile for a plurality of computer servers and power consumption data for each computer server in the plurality of computer servers. The method also includes determining an optimal temperature for each computer server in the plurality of computer servers based on the energy profile. The method further includes determining a target processor utilization for each computer server in the plurality of computer servers based on the optimal temperature. In addition, the method includes calculating an efficiency rank for each computer server in the plurality of computer servers based on the target processor utilization and the power consumption data. Lastly, the method includes deploying a workload on a computer server with a highest efficiency rank.

Abstract: Approaches presented herein enable provisional scheduling of resources in a cloud computing environment. More specifically, a first group request to host an application is obtained. This first group request includes one or more virtual units, which each have one or more topological constraints. One or more resources are scheduled for each of the virtual units. This scheduling includes provisionally allocating the resources to each of the virtual units according to the topological constraints. Each resource comprises a respective weight. In response to obtaining a second group request, the resources are provisionally re-allocated to one or more virtual units of the second group request according to one or more topological constraints of the second group request and the respective weight of each of the resources. This re-allocating minimizes a summation of each respective weight of the resources. A new respective weight is then assigned to each of the resources.

Abstract: Disclosed embodiments provide a virtual topology in response to an allocation request. The virtual topology is a synchronized subgraph of the physical topology. The synchronized subgraph virtual topology mirrors the physical topology in terms of tree structure. However, merely sharing the physical topology with users/customers is not feasible, as it may reveal additional infrastructure details such as MAC addresses, IP addresses, and the like, that can compromise security and/or jeopardize multi-tenant operations. Disclosed embodiments create virtual topology structures with obfuscated node data, so that important data such as physical IP addresses and/or MAC addresses are hidden from the end-users. Thus, disclosed embodiments provide the benefits of performance enhancement that comes from sharing the topology without the downside of compromising security by revealing physical topology details.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate optimization of resource usage based on quota trees are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise a determination component that determines one or more quota trees that classify a job request as inadmissible. The computer executable components further comprise an optimization component that optimizes resource usage to enable admissibility of the job request based on the one or more quota trees.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate using multiple quota trees in resource scheduling are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise an evaluation component that executes admissibility of a job request based on a scope property of one or more quota trees that apply to the job request.

Abstract: Aspects of the invention include selecting a node for an infrastructure update. The selected node is included in a cluster of nodes executing workloads that include containers. A future workload is prevented from being scheduled on the selected node. A workload currently executing on the selected node is migrated to another node included in the cluster of nodes. Infrastructure code on the selected node is updated, and in response to the updating, the ability to schedule a future workload on the selected node is enabled.

Abstract: Techniques and a system for adaptive data packing are provided. In one example, a system includes a container component and a computing node component. The container component monitors one or more resources for container data in a network environment and determines variability data representative of a variability of the one or more resources for the container data during a period of time. The computing node component that selects a computing node in the network environment for particular container data based on the variability data.

Abstract: Techniques and a system for adaptive data packing are provided. In one example, a system includes a container component and a computing node component. The container component monitors one or more resources for container data in a network environment and determines variability data representative of a variability of the one or more resources for the container data during a period of time. The computing node component that selects a computing node in the network environment for particular container data based on the variability data.

Abstract: Techniques facilitating advising bid values for usage of resource in a resource allocation data analytics framework are provided. In one example, a computer-implemented method can include generating, by a system operatively coupled to a processor, one or more performance models. A performance model of the one or more performance models is associated with respective service classes for a resource of a computing infrastructure associated with a provider network and comprising one or more resources available for allocation. A service class of the respective service classes represents a performance differentiation compared to other ones of the respective service classes. The computer-implemented method can also include determining, by the system, a suggested bid value for the resource. The suggested bid value represents an expected performance metric of the resource as a function of a bid value and is based on the one or more performance models.

Abstract: Techniques facilitating advising bid values for usage of resource in a resource allocation data analytics framework are provided. In one example, a computer-implemented method can include generating, by a system operatively coupled to a processor, one or more performance models. A performance model of the one or more performance models is associated with respective service classes for a resource of a computing infrastructure associated with a provider network and comprising one or more resources available for allocation. A service class of the respective service classes represents a performance differentiation compared to other ones of the respective service classes. The computer-implemented method can also include determining, by the system, a suggested bid value for the resource. The suggested bid value represents an expected performance metric of the resource as a function of a bid value and is based on the one or more performance models.

Abstract: Aspects of the invention include selecting a node for an infrastructure update. The selected node is included in a cluster of nodes executing workloads that include containers. A future workload is prevented from being scheduled on the selected node. A workload currently executing on the selected node is migrated to another node included in the cluster of nodes. Infrastructure code on the selected node is updated, and in response to the updating, the ability to schedule a future workload on the selected node is enabled.

Abstract: Techniques facilitating advising bid values for usage of resource in a resource allocation data analytics framework are provided. In one example, a computer-implemented method can include generating, by a system operatively coupled to a processor, one or more performance models. A performance model of the one or more performance models is associated with respective service classes for a resource of a computing infrastructure associated with a provider network and comprising one or more resources available for allocation. A service class of the respective service classes represents a performance differentiation compared to other ones of the respective service classes. The computer-implemented method can also include determining, by the system, a suggested bid value for the resource. The suggested bid value represents an expected performance metric of the resource as a function of a bid value and is based on the one or more performance models.

Abstract: Techniques facilitating advising bid values for usage of resource in a resource allocation data analytics framework are provided. In one example, a computer-implemented method can include generating, by a system operatively coupled to a processor, one or more performance models. A performance model of the one or more performance models is associated with respective service classes for a resource of a computing infrastructure associated with a provider network and comprising one or more resources available for allocation. A service class of the respective service classes represents a performance differentiation compared to other ones of the respective service classes. The computer-implemented method can also include determining, by the system, a suggested bid value for the resource. The suggested bid value represents an expected performance metric of the resource as a function of a bid value and is based on the one or more performance models.

Abstract: Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, such techniques direct requests associated with calls to servers in a system comprised of a network routing calls between a plurality of callers and at least one receiver wherein a load balancer sends requests associated with calls to a plurality of servers as follows. A request associated with a call, a caller, or a receiver is received, depending on the particular load balancing technique. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with the call, the caller, or the receiver, depending on the particular load balancing technique. The subsequent request is sent to the server based on determining that the subsequent request is associated with the call, the caller, or the receiver, again depending on the particular load balancing technique.

Abstract: Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, such techniques direct requests associated with calls to servers in a system comprised of a network routing calls between a plurality of callers and at least one receiver wherein a load balancer sends requests associated with calls to a plurality of servers as follows. A request associated with a call, a caller, or a receiver is received, depending on the particular load balancing technique. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with the call, the caller, or the receiver, depending on the particular load balancing technique. The subsequent request is sent to the server based on determining that the subsequent request is associated with the call, the caller, or the receiver, again depending on the particular load balancing technique.

Abstract: Systems and methods for admission control to a physical host system are provided herein. One aspect provides for receiving at least one resource request at an admission control component of a distributed computing system, the at least one resource request comprised of at least one system type; processing the at least one resource request utilizing at least one physical host accessible to the distributed computing system; specifying a number of resource request slots to be reserved for at least one system type based on at least one future reservation threshold accessible to the admission control component; and blocking resource requests from entering the system through the admission control component based on a number of available resource request slots and the at least one future reservation threshold. Other embodiments and aspects are also described herein.

Abstract: Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, such techniques direct requests associated with calls to servers in a system comprised of a network routing calls between a plurality of callers and at least one receiver wherein a load balancer sends requests associated with calls to a plurality of servers as follows. A request associated with a call, a caller, or a receiver is received, depending on the particular load balancing technique. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with the call, the caller, or the receiver, depending on the particular load balancing technique. The subsequent request is sent to the server based on determining that the subsequent request is associated with the call, the caller, or the receiver, again depending on the particular load balancing technique.

Abstract: Described herein are methods, systems, apparatuses and products for cost-aware replication of intermediate data in dataflows. An aspect provides receiving at least one measurement indicative of a reliability cost associated with executing a dataflow; computing a degree of replication of at least one intermediate data set in the dataflow based on the reliability cost; and communicating at least one replication factor to at least one component of a system responsible for replication of the at least one intermediate data set in the dataflow; wherein the at least one intermediate data set is replicated according to the replication factor. Other embodiments are disclosed.

Abstract: Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, a method for directing requests associated with calls to servers in a system comprised of a network routing calls between a plurality of nodes wherein a node participates in a call as a caller or a receiver and wherein a load balancer sends requests associated with calls to a plurality of servers comprises the following steps. A request associated with a node belonging to a group including a plurality of nodes is received. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with a node belonging to the group. The subsequent request is sent to the server based on determining that the subsequent request is associated with a node belonging to the group.

Abstract: In a computer system comprising a plurality of computing devices wherein the plurality of computing devices processes a plurality of tasks and each task has a task type, a method for determining overheads associated with task types comprises the following steps. Overheads are estimated for a plurality of task types. One of the plurality of computing devices is selected to execute one of the plurality of tasks, wherein the selection comprises estimating load on at least a portion of the plurality of computing devices from tasks assigned to at least a portion of the plurality of computing devices and the estimates of overheads of the plurality of task types. One or more of the estimates of overheads of the plurality of task types are varied.