IP Library Patent Application 18188078
Patent Application
App. No. 18/188,078

CODE REFACTORING ENERGY MANAGEMENT

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
18/188,078
Abstract

Embodiments of the present invention provide computer-implemented methods, computer program products and computer systems. For example, embodiments of the present invention can, in response to receiving a request, create a power refactoring model for a codebase based on received telemetry data and static analysis of code within the codebase. Embodiments of the present invention can further optimize existing code regions within the codebase to function with less energy requirements using the created power refactoring model and replace existing code regions within the codebase with optimized code that functions with less energy requirements.

Claims (54)

1 . A computer-implemented method comprising:

in response to receiving a request, creating a power refactoring model for a codebase based on received telemetry data and static analysis of code within the codebase;

optimizing existing code regions within the codebase to function with less energy requirements using the created power refactoring model; and

replacing existing code regions within the codebase with optimized code that functions with less energy requirements.

2 . The computer-implemented method of claim 1 , wherein optimizing code regions within the codebase using the created power refactoring model comprises:

determining what code can be refactored using a lower consumption development language or algorithm; and

generating one or more alternate code implementations for the code that can be refactored.

3 . The computer-implemented method of claim 2 , wherein determining what code can be refactored using a lower consumption development language or algorithm comprises:

identifying code regions having highest power consumption; and

identifying code types of the identified code regions having the highest power consumption.

4 . The computer-implemented method of claim 3 , further comprising:

generating one or more simulations for the generated one or more alternate code implementations.

5 . The computer-implemented method of claim 4 , further comprising:

identifying an alternate code implementation of the generated one or more alternate code implementations having a lowest power consumption.

6 . The computer-implemented method of claim 5 , further comprising:

storing the identified alternate code implementation in a database comprising substituted code having low power consumption.

7 . The computer-implemented method of claim 1 , wherein a request comprises one or more pull requests in a continuous integration, continuous delivery (CICD) pipeline.

8 . A computer program product comprising:

one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising:

program instructions to, in response to receiving a request, create a power refactoring model for a codebase based on received telemetry data and static analysis of code within the codebase;

program instructions to optimize existing code regions within the codebase to function with less energy requirements using the created power refactoring model; and

program instructions to replace existing code regions within the codebase with optimized code that functions with less energy requirements.

9 . The computer program product of claim 8 , wherein the program instructions to optimize code regions within the codebase using the created power refactoring model comprise:

program instructions to determine what code can be refactored using a lower consumption development language or algorithm; and

program instructions to generate one or more alternate code implementations for the code that can be refactored.

10 . The computer program product of claim 9 , wherein the program instructions to determining what code can be refactored using a lower consumption development language or algorithm comprise:

program instructions to identify code regions having highest power consumption; and

program instructions to identify code types of the identified code regions having the highest power consumption.

11 . The computer program product of claim 10 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to generate one or more simulations for the generated one or more alternate code implementations.

12 . The computer program product of claim 11 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to identify an alternate code implementation of the generated one or more alternate code implementations having a lowest power consumption.

13 . The computer program product of claim 12 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to store the identified alternate code implementation in a database comprising substituted code having low power consumption.

14 . The computer program product of claim 8 , wherein a request comprises one or more pull requests in a continuous integration, continuous delivery (CICD) pipeline.

15 . A computer system comprising:

one or more computer processors;

one or more computer readable storage media; and

program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:

program instructions to, in response to receiving a request, create a power refactoring model for a codebase based on received telemetry data and static analysis of code within the codebase;

program instructions to optimize existing code regions within the codebase to function with less energy requirements using the created power refactoring model; and

program instructions to replace existing code regions within the codebase with optimized code that functions with less energy requirements.

16 . The computer system of claim 15 , wherein the program instructions to optimize code regions within the codebase using the created power refactoring model comprise:

program instructions to determine what code can be refactored using a lower consumption development language or algorithm; and

program instructions to generate one or more alternate code implementations for the code that can be refactored.

17 . The computer system of claim 16 , wherein the program instructions to determining what code can be refactored using a lower consumption development language or algorithm comprise:

program instructions to identify code regions having highest power consumption; and

program instructions to identify code types of the identified code regions having the highest power consumption.

18 . The computer system of claim 17 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to generate one or more simulations for the generated one or more alternate code implementations.

19 . The computer system of claim 18 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to identify an alternate code implementation of the generated one or more alternate code implementations having a lowest power consumption.

20 . The computer system of claim 19 , wherein the program instructions stored on the one or more computer readable storage media further comprise:

program instructions to store the identified alternate code implementation in a database comprising substituted code having low power consumption.

Assignments (5)
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTY FROM IBM RESEARCH AND INTELLECTUAL PROPERTY TO INTERNATIONAL BUSINESS MACHINED CORPORATION AND TO CORRECT THE RECEIVING PARTY FROM ZEPHYR BUYER L.P. TO ZEPHYR BUYER, L.P. PREVIOUSLY RECORDED AT REEL: 66795 FRAME: 858. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Mar 20, 2024
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: ZEPHYR BUYER, L.P.
Reel/Frame 066838/0157 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTY NAME PREVIOUSLY RECORDED AT REEL: 66796 FRAME: 188. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Mar 20, 2024
From: ZEPHYR BUYER, L.P.
To: THE WEATHER COMPANY, LLC
Reel/Frame 067188/0894 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 13, 2024
From: IBM RESEARCH AND INTELLECTUAL PROPERTY
To: ZEPHYR BUYER L.P.
Reel/Frame 066795/0858 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 13, 2024
From: ZEPHYR BUYER L.P.
To: THE WEATHER COMPANY, LLC
Reel/Frame 066796/0188 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 22, 2023
From: PENROSE, ANDREW T.; DUNNE, JONATHAN D.; LAMB, MARSHALL ALLEN; FLYNN, JAMES W; O'LEARY, JASON
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 063063/0231 →