Dynamic Power Budget Allocation in Multi-Processor Server Farms

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Server farms face increasing energy consumption and costs due to growing demand for internet-based services, with existing power allocation methods failing to optimize performance within a fixed power budget, leading to inefficiencies in processing incoming jobs.

Innovation Solution

A method using a queuing theoretic model to determine the desired frequency/power state for each server in a multi-processor system, allowing for dynamic control of operating states to minimize mean response time and optimize power allocation among servers, leveraging dynamic frequency and voltage scaling mechanisms.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If power budget is increased to handle growing server demand, then processing capacity and performance are improved, but energy consumption and operating costs increase

Engineering Contradiction:
Improveprocessing capacityVSAvoidenergy consumption
Core Design Contradiction:
ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies dynamic power allocation by continuously adjusting the power distribution to individual servers based on real-time workload conditions. The system monitors queue lengths and dynamically modifies power budgets, transitioning from static to dynamic power management to optimize the trade-off between processing capacity and energy consumption.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes power allocation parameters dynamically based on workload demand. By adjusting power distribution parameters according to queue lengths and server utilization, the system optimizes processing capacity while controlling energy consumption, rather than maintaining fixed power allocations.

Inventive Principle:
Principle #35Parameter changes

2Loss of time

If more servers are activated to process incoming jobs, then mean response time is reduced, but power consumption increases

Engineering Contradiction:
Improvemean response timeVSAvoidpower consumption
Core Design Contradiction:
Loss of timeVSUse of energy by stationary object

Solution Approach 1:

The system dynamically adjusts power allocation parameters to individual servers based on real-time queue lengths and workload conditions. When queues are long, more power is allocated to reduce response time; when queues are short, power is reduced to save energy, creating an adaptive response time-power trade-off.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent implements feedback mechanisms that monitor queue lengths and server performance metrics, then use this information to adjust power allocation decisions. This closed-loop control enables the system to respond to changing conditions and optimize the balance between response time and power consumption.

Inventive Principle:
Principle #23Feedback

3Ease of operation

If power is allocated uniformly across all servers, then system simplicity is maintained, but performance optimization is lost

Engineering Contradiction:
Improvepower allocation simplicityVSAvoidperformance efficiency
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The patent transitions from uniform power allocation to localized power allocation, where each server receives power based on its specific workload conditions and queue length. This allows performance optimization at the individual server level while maintaining a relatively simple centralized control mechanism.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS9052895B2Power budget allocation in multi-processor systems
Publication Date: 2015.06.09 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US9052895B2 patent drawing
  • US9052895B2 patent drawing
  • US9052895B2 patent drawing

AI summary

Systems, apparatuses, methods, and software that implement power budget allocation optimization algorithms in multi-processor systems, such as server farms. The algorithms are derived from a queuing theoretic model that minimizes the mean response time of the system to the jobs in the workload while accounting for a variety of factors. These factors include, but are not necessarily limited to, the type of power (frequency) scaling mechanism(s) available within the processors in the system, the power-to-frequency relationship(s) of the processors for the scaling mechanism(s) available, whether or not the system is an open or closed loop system, the arrival rate of jobs incoming into the system, the number of jobs within the system, and the type of workload being processed.