# US 2013/0159748 A1 · Energy-Efficient Polling Loop

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0159748 A1
- Document ID: US20130159748A1
- Status: Published application
- Kind: A1
- Application number: 13/770,300
- Filed: 2013-02-19
- Published: 2013-06-20
- Earliest claimed: 2011-08-31
- Assignees: International Business Machines Corporation
- Inventors: Ian D. Judd
- Web page: https://patentgrep.com/patent/US20130159748A1

## CPC

- G06F 1/324: by lowering clock frequency
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Logic is provided for increasing energy-efficiency of a data processing system. First logic continuously checks a plurality of I/O ports for incoming workload. Responsive to the incoming workload being lower than a low workload threshold for a current operating frequency, second logic reduces an operating frequency of the processor. Responsive to the incoming workload being higher than a high workload threshold, the second logic increases the operating frequency of the processor.

## Claims

### Claim 1

A method for increasing energy-efficiency of a data processing system, the method comprising:
continuously checking, by a processor executing a user-mode program in the data processing system, a plurality of I/O ports for incoming workload;
responsive to the incoming workload being lower than a low workload threshold for a current operating frequency, reducing, by the processor, an operating frequency of the processor; and
responsive to the incoming workload being higher than a high workload threshold, increasing, by the processor, the operating frequency of the processor.

### Claim 2 (depends on 1)

The method of claim 1, further comprising.
during a predetermined power management cycle, receiving, by the processor, a sample indicating a value of a busy flag (B) at predetermined intervals (T);
for a current predetermined interval (T), responsive to a value of the busy flag (B) failing to be equal to a first value, incrementing, by the processor, a count for a number of samples (N);
responsive to a current value of the count for the number of samples (N) being greater than a total number of samples (M), determining, by the processor, whether a current value of a count of samples (U) is less than a low threshold (L); and
responsive to the current value of the count of samples (U) being less than the low threshold (L), decreasing, by the processor, the operating frequency of the processor in order to reduce power consumption and increase energy efficiency.

### Claim 3 (depends on 2)

The method of claim 2, wherein decreasing the operating frequency of the processor further comprises:
incrementing, by the processor, a count of consecutive cycles (D) by a second value;
determining, by the processor, whether a current value of the count of consecutive cycles (D) is greater than or equal to a threshold for number of cycles with low I/O workload (P) before the operating frequency of the processor is decreased; and
responsive to the current value of the count of consecutive cycles (D) being greater than or equal to the threshold for number of cycles with low I/O workload (P), decreasing, by the processor, the operating frequency of the processor in order to reduce power consumption and increase energy efficiency.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
responsive to the current value of the count of consecutive cycles (D) being less than the threshold for number of cycles with low I/O workload (P), re-initializing, by the processor, the count for the number of samples (N);
re-initializing, by the processor, the count of samples (U); and
waiting, by the processor, for another sampling of the value of the busy flag (B) at a next predetermined interval (T).

### Claim 5 (depends on 2)

The method of claim 2, further comprising:
responsive to a value of the busy flag (B) being equal to the first value, incrementing, by the processor, the count of samples (U) by a second value prior to incrementing a count for the number of samples (N).

### Claim 6 (depends on 2)

The method of claim 2, further comprising;
responsive to the current value of the count for the number of samples (N) being less than or equal to the total number of samples (M), waiting, by the processor, for another sample of the value of the busy flag (B) at a next predetermined interval (T).

### Claim 7 (depends on 2)

The method of claim 2, further comprising:
responsive to the current value of the count of samples (U) being greater than or equal to the low threshold (L), determining, by the processor, whether the current value of the count of samples (U) is greater than a high threshold (H); and
responsive to the current value of the count of samples (U) being less than or equal to the high threshold (H), leaving, by the processor, the operating frequency of the processor at a current setting.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
responsive to the current value of the count of samples (U) being greater than the high threshold (H), increasing, by the processor, the operating frequency of the processor.

### Claim at position 9

9-24. (canceled)
