Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Information about a set of maintenance tasks and time windows includes a cost value per task per time window. Based on the information, a data model generator generates a data model, including task elements; time elements; cost elements; a total cost element; a constraint that requires each task element be assigned a time window from a respective domain, such that each time element is assigned a task count from a respective domain; a constraint that requires each cost element be assigned a cost value associated with a time window assigned (or to be assigned) to a task element corresponding to the cost element; and a constraint that requires the total cost element be assigned a total cost value that is a sum of the cost values assigned (or to be assigned) to the cost elements. Based on the data model, a CP solver determines a proposed maintenance schedule.

Abstract: “Resource guarantee” refers to a unit of a resource that is guaranteed and therefore designated to a consumer. A multi-phased constraint programming (CP) approach is used to determine assignments of resource guarantees of a set of consumers to a set of hosts in a resource system. Phase I uses CP to segregate non-split consumers from split consumers. Phase II uses CP to assign each cotenant group of non-split consumers to a respective host. Phase III uses CP to assign resource guarantees of the split consumers across the hosts, wherein resource guarantees of a single split consumer may be splits across different hosts. Each phase involves execution of a CP solver based on a different CP data model. A CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Techniques for filtering telemetry data to allocate system resources among system components are disclosed. A system filters a data set of telemetry data prior to allocating or re-allocating system resources to system components. A filtered data set includes data points that include the highest resource-utilization values for the system components. The system compares resource-usage for each component managed by a computing machine in one time period to the resource-usage for the component in another time period. The system omits from a filtered data set any time period in which the resource-usage value for each system component is subsumed by the resource-usage values of the same system components in another time period. The system generates resource-reallocation candidate models for the computing machines in the system based on the filtered data set. The system reallocates system resources among system components using a selected resource-reallocation candidate.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: “Resource guarantee” refers to a unit of a resource that is guaranteed and therefore designated to a consumer. A multi-phased constraint programming (CP) approach is used to determine assignments of resource guarantees of a set of consumers to a set of hosts in a resource system. Phase I uses CP to segregate non-split consumers from split consumers. Phase II uses CP to assign each cotenant group of non-split consumers to a respective host. Phase III uses CP to assign resource guarantees of the split consumers across the hosts, wherein resource guarantees of a single split consumer may be splits across different hosts. Each phase involves execution of a CP solver based on a different CP data model. A CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Information about a set of maintenance tasks and time windows includes a cost value per task per time window. Based on the information, a data model generator generates a data model, including task elements; time elements; cost elements; a total cost element; a constraint that requires each task element be assigned a time window from a respective domain, such that each time element is assigned a task count from a respective domain; a constraint that requires each cost element be assigned a cost value associated with a time window assigned (or to be assigned) to a task element corresponding to the cost element; and a constraint that requires the total cost element be assigned a total cost value that is a sum of the cost values assigned (or to be assigned) to the cost elements. Based on the data model, a CP solver determines a proposed maintenance schedule.