IP Library › Granted Patent US 12,429,840
Granted Patent B2
US 12,429,840 · App. 18/612,030 · Granted Sep 30, 2025

Datacenter level power management with reactive power capping

Inventors: Sumeet Kochar (Cary, NC); Roy Mehdi Zeighami (Fall City, WA); Jacob Adam Gabrielson (Seattle, WA)
Assignee: Oracle International Corporation
G05B19/042G05B2219/2639
View Patent ↗
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 12,429,840
App. No.
18/612,030
Granted
Sep 30, 2025
Kind
B2
Abstract

Disclosed techniques relate to managing power within a power distribution system. Power consumption corresponding to devices (e.g., servers) that receive power from an upstream device (e.g., a bus bar) may be monitored (e.g., by a service) to determine when power consumption corresponding to those devices has breached or will likely breach a budgeted threshold corresponding to an amount of power allocated to the upstream device. If the budgeted threshold is breached, or is likely to be breached, the service may initiate operations to distribute power caps for the devices and to initiate a timer. Although distributed, the power caps may be ignored by the devices until they are instructed to enforce the power caps (e.g., upon expiration of the timer). This allows the power consumption of the devices to exceed the budgeted power assigned to the upstream device at least until expiration of the timer while avoiding power outage events.

Claims (43)

1. A method, comprising:

identifying, by a power management service, a plurality of components of a power system that are arranged according to a power distribution hierarchy, the power distribution hierarchy comprising a plurality of nodes organized according to respective levels of a plurality of levels;

monitoring, by the power management service, power consumption of a set of lower-level components, the set of lower-level components being represented by a subset of nodes of a first level of the power distribution hierarchy;

obtaining, by the power management service, a machine-learning model that has been previously trained using supervised learning and labeled training data examples to predict a likelihood that a collective power consumption of one or more lower-level components breaches a corresponding budget threshold of a corresponding higher-level component, a labeled training data example comprising 1) historical consumption data corresponding to a set of low-level components to which power has been passed through a respective higher-level component and 2) a label that indicates a corresponding likelihood that the collective power consumption of the set of lower-level components breaches a respective budget threshold of the respective higher-level component;

determining, by the power management service based at least in part on output obtained from the machine-learning model, that the power consumption of the set of lower-level components will likely breach a budget threshold associated with a higher-level component corresponding to a second level of the power distribution hierarchy, the second level being higher in the power distribution hierarchy than the first level; and

transmitting, by the power management service, a power cap value and a timing value with which a timer is initiated, a lower-level component of the set of lower-level components storing the power cap value in memory while allowing a respective power consumption of the lower-level component to exceed the power cap value, until the timer expires, indicating that a time period corresponding to the timing value has elapsed.

2. The method of claim 1 , wherein determining that the power consumption of the set of lower-level components will likely breach the budget threshold associated with the higher-level component corresponding to the second level of the power distribution hierarchy further comprises determining a predicted power consumption of the set of lower-level components that is likely to occur in a future time period.

3. The method of claim 1 , wherein the output received from the machine-learning model indicates an amount by which the power consumption corresponding to the set of lower-level components is expected to change.

4. The method of claim 1 , wherein storing the power cap value in the memory while allowing the respective power consumption of the lower-level component to exceed the power cap value causes the set of one or more lower-level components to breach the budget threshold associated with the higher-level component for at least a portion of the time period corresponding to the timing value.

5. A system, comprising:

one or more processors; and

memory configured to store computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to:

identify a plurality of components that are arranged according to a power distribution hierarchy, the power distribution hierarchy comprising a plurality of nodes organized according to respective levels of a plurality of levels;

monitor power consumption of a set of lower-level components represented by a subset of nodes of a first level of the power distribution hierarchy, the set of lower-level components receiving power through a higher-level component corresponding to a second level of the power distribution hierarchy, the second level being higher in the power distribution hierarchy than the first level;

obtain a machine-learning model that has been previously trained using supervised learning and labeled training data examples to predict a likelihood that a collective power consumption of one or more lower-level components breaches a corresponding budget threshold of a corresponding higher-level component, a labeled training data example comprising 1) historical consumption data corresponding to a set of low-level components to which power has been passed through a respective higher-level component and 2) a label that indicates a corresponding likelihood that the collective power consumption of the set of lower-level components breaches a respective budget threshold of the respective higher-level component;

determine, based at least in part on output from the machine-learning model, that aggregate power consumption of the set of lower-level components will likely breach a budget threshold associated with the higher-level component; and

transmit a power cap value and a timing value with which a timer is initiated, wherein transmitting the power cap value and the timing value causes the set of lower-level components to breach the budget threshold until the timer expires indicating that a time period corresponding to the timing value has elapsed.

6. The system of claim 5 , wherein expiration of the timer triggers at least one lower-level component of the set of lower-level components to limit its respective power consumption based at least in part on the power cap value.

7. The system of claim 6 , wherein limiting the respective power consumption based at least in part on the power cap value is based at least in part on at least one of: dynamic frequency scaling or dynamic voltage scaling.

8. The system of claim 5 , wherein the higher-level component is a first higher-level component, wherein the second level of the power distribution hierarchy comprises a second higher-level component different from the first higher-level component, and wherein executing the instructions further causes the one or more processors to at least:

determine that there is an unutilized portion of power provisioned to the second higher-level component;

modify power consumption of a second lower-level component that is receiving power through the second higher-level component; and

transmit a cancellation signal that causes the timer to be canceled, wherein canceling the timer causes the lower-level component of the set of lower-level components to refrain from enforcing the power cap value.

9. The system of claim 5 , wherein the output further comprises a predicted aggregate power consumption for the set of lower-level components during a future time period, and wherein executing the instructions that determine that the aggregate power consumption of the set of lower-level components will likely breach the budget threshold associated with the higher-level component further causes the one or more processors to

compare the predicted aggregate power consumption for the set of lower-level components during the future time period to the budget threshold associated with the higher-level component.

10. The system of claim 5 , wherein the power cap value is determined based at least in part on determining an amount by which power consumption of the set of lower-level components will likely breach the budget threshold associated with the higher-level component.

11. A method, comprising:

monitoring, by a power management service, power consumption of a set of lower-level components of a power distribution system, the set of lower-level components receiving power through a higher-level component of the power distribution system;

determining, by the power management service and based at least in part on the monitoring, that an aggregate power consumption of the set of lower-level components will likely breach a budgeted power threshold associated with the higher-level component; and

responsive to determining that the aggregate power consumption of the set of lower-level components will likely breach the budgeted power threshold associated with the higher-level component, initiating a timer corresponding to a time period, wherein initiating the timer delays enforcement of a power cap of a lower-level component of the set of lower-level components for at least the time period corresponding to the timer, wherein the timer is initiated with a timing value that is determined based at least in part on at least one of: a rate of change of the aggregate power consumption of the set of lower-level components, a direction of change corresponding to the rate of change of the aggregate power consumption of the set of lower-level components, a tolerance to a power circuit associated with the higher-level component, or an expected time needed to initiate the power capping at each component in the set of lower-level components.

12. The method of claim 11 , wherein initiating the timer corresponding to the timing period further comprises transmitting, by the power management service, the timing value to an intermediate component from which the lower-level component receives power, the intermediate component receiving power from the higher-level component, wherein transmitting the timing value causes the intermediate component to generate the timer corresponding to the timing value, the timer being configured to expire based on expiration of the time period corresponding to the timing value.

13. The method of claim 12 , wherein the intermediate component triggers enforcement of the power cap on the lower-level component upon expiration of the timer.

14. A system, comprising:

one or more processors; and

memory comprising computer-executable instructions that, when executed by the one or more processors, causes the one or more processors to:

monitor power consumption of a set of downstream components of a power distribution system, the set of downstream components receiving power through an upstream component of the power distribution system;

determine, based at least in part on the power consumption, that an aggregate power consumption of the set of downstream components will breach a budgeted power threshold at a future time period, the budgeted power threshold being associated with the upstream component; and

responsive to determining that the aggregate power consumption of the set of downstream components will likely breach the budgeted power threshold associated with the upstream component, initiate a timer corresponding to a time period, wherein initiating the timer delays enforcement of a power cap of a downstream component of the set of downstream components for at least the time period corresponding to the timer, wherein the timer is initiated with a timing value that is determined based at least in part on at least one of: a rate of change of the aggregate power consumption of the set of downstream components, a direction of change corresponding to the rate of change of the aggregate power consumption of the set of downstream components, a tolerance to a power circuit associated with the upstream component, or an expected time needed to initiate power capping at each component in the set of downstream components.

15. The system of claim 14 , wherein executing the computer-executable instructions further causes the one or more processors to:

train a machine-learning model to identify a likelihood value that indicates a likelihood that corresponding aggregated power consumption of one or more downstream components will breach a power threshold of a corresponding upstream component;

provide historical power consumption data of the set of downstream components to the machine-learning model as input; and

receive output from the machine-learning model, the output indicating a corresponding likelihood that the corresponding aggregate power consumption of the set of downstream components will breach the budgeted power threshold associated with the upstream component.

16. The system of claim 14 , wherein executing the computer-executable instructions that initiate the timer further causes the one or more processors to transmit the timing value corresponding to the time period and a power cap value corresponding to the power cap, the timing value being used by an intermediate component to generate the timer, the power cap value being stored in memory of the downstream component of the set of downstream components while the enforcement of the power cap is delayed.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 21, 2024
From: KOCHAR, SUMEET; ZEIGHAMI, ROY MEHDI; GABRIELSON, JACOB ADAM
To: ORACLE INTERNATIONAL CORPORATION
Reel/Frame 066855/0238 →
Continuity (3)
Continuation 18202712 · May 26, 2023
Provisional Application 63409469 · Sep 23, 2022
Related Publication 20240231298A1 · Jul 11, 2024
References Cited (139)
US 5546568A · Bland et al. · 1996 [cited by applicant]
US 6487241B1 · Cole · 2002 [cited by applicant]
US 8006108B2 · Brey et al. · 2011 [cited by applicant]
US 8514215B2 · Cases et al. · 2013 [cited by applicant]
US 8694810B2 · Ahluwalia et al. · 2014 [cited by applicant]
US 8732503B2 · Okano · 2014 [cited by applicant]
US 8738193B2 · Furuichi et al. · 2014 [cited by applicant]
US 8843772B2 · Hormuth · 2014 [cited by applicant]
US 8914157B2 · Li et al. · 2014 [cited by applicant]
US 8930725B2 · Wang · 2015 [cited by applicant]
US 9146814B1 · van der Merwe et al. · 2015 [cited by applicant]
US 9262272B2 · Akers et al. · 2016 [cited by applicant]
US 9538689B2 · Dasario et al. · 2017 [cited by applicant]
US 9595070B2 · Matsuoka et al. · 2017 [cited by applicant]
US 9880599B1 · Allen-Ware et al. · 2018 [cited by applicant]
US 10075327B2 · Maltz et al. · 2018 [cited by applicant]
US 10460403B2 · Janssen et al. · 2019 [cited by applicant]
US 10608433B1 · McNamara et al. · 2020 [cited by applicant]
US 10643121B2 · Evans et al. · 2020 [cited by applicant]
US 11099628B2 · Ananthakrishnan et al. · 2021 [cited by applicant]
US 11106528B2 · Wolfson et al. · 2021 [cited by applicant]
US 11157380B2 · Sethi et al. · 2021 [cited by applicant]
US 11275429B2 · Singh et al. · 2022 [cited by applicant]
US 11287868B1 · Sturm et al. · 2022 [cited by applicant]
US 11349337B2 · Gyota · 2022 [cited by applicant]
US 11397457B2 · Jain et al. · 2022 [cited by applicant]
US 11397634B1 · Monga et al. · 2022 [cited by applicant]
US 11398729B1 · Upreti et al. · 2022 [cited by applicant]
US 11514354B2 · Rajnayak et al. · 2022 [cited by applicant]
US 11544676B2 · Ghosh et al. · 2023 [cited by applicant]
US 11561851B2 · Wolfson et al. · 2023 [cited by applicant]
US 11656928B2 · Monga et al. · 2023 [cited by applicant]
US 12007734B2 · Kochar et al. · 2024 [cited by applicant]
US 20030037150A1 · Nakagawa · 2003 [cited by applicant]
US 20030056125A1 · O'Conner et al. · 2003 [cited by applicant]
US 20030171851A1 · Brickfield et al. · 2003 [cited by applicant]
US 20040264124A1 · Patel et al. · 2004 [cited by applicant]
US 20050102544A1 · Brewer et al. · 2005 [cited by applicant]
US 20050138438A1 · Bodas · 2005 [cited by applicant]
US 20060028347A1 · Ziejewski et al. · 2006 [cited by applicant]
US 20080301473A1 · Perez et al. · 2008 [cited by applicant]
US 20080320322A1 · Green et al. · 2008 [cited by applicant]
US 20090070611A1 · Bower, III et al. · 2009 [cited by applicant]
US 20090210376A1 · Lorge · 2009 [cited by applicant]
US 20090240964A1 · Pfeiffer · 2009 [cited by applicant]
US 20110047390A1 · Bolan et al. · 2011 [cited by applicant]
US 20110090077A1 · Meyer et al. · 2011 [cited by applicant]
US 20110173465A1 · Akers et al. · 2011 [cited by applicant]
US 20110239010A1 · Jain · 2011 [cited by examiner]
US 20110301911A1 · VanGilder et al. · 2011 [cited by applicant]
US 20120017219A1 · Hsieh et al. · 2012 [cited by applicant]
US 20120109394A1 · Takagi et al. · 2012 [cited by applicant]
US 20120283888A1 · Mao et al. · 2012 [cited by applicant]
US 20120323382A1 · Kamel et al. · 2012 [cited by applicant]
US 20130268791A1 · Yamana · 2013 [cited by examiner]
US 20140001847A1 · Khandelwal · 2014 [cited by applicant]
US 20140006819A1 · Min et al. · 2014 [cited by applicant]
US 20140137107A1 · Banerjee et al. · 2014 [cited by applicant]
US 20150234879A1 · Baldwin et al. · 2015 [cited by applicant]
US 20150309560A1 · Liang et al. · 2015 [cited by applicant]
US 20160054779A1 · Bodas et al. · 2016 [cited by applicant]
US 20160102880A1 · Lovicott et al. · 2016 [cited by applicant]
US 20160291656A1 · Jenne et al. · 2016 [cited by applicant]
US 20160294211A1 · Tricarico et al. · 2016 [cited by applicant]
US 20170017288A1 · Bose et al. · 2017 [cited by applicant]
US 20170351232A1 · Chen et al. · 2017 [cited by applicant]
US 20190004579A1 · Allen-Ware et al. · 2019 [cited by applicant]
US 20190122132A1 · Rimini · 2019 [cited by examiner]
US 20190332164A1 · Sinha et al. · 2019 [cited by applicant]
US 20200073456A1 · Nguyen et al. · 2020 [cited by applicant]
US 20200136396A1 · Sun · 2020 [cited by applicant]
US 20200272889A1 · Evans et al. · 2020 [cited by applicant]
US 20200313434A1 · Khanna · 2020 [cited by examiner]
US 20200331636A1 · Mulholland et al. · 2020 [cited by applicant]
US 20200380295A1 · Natsumeda et al. · 2020 [cited by applicant]
US 20210042140A1 · Paul et al. · 2021 [cited by applicant]
US 20210081020A1 · Ghose · 2021 [cited by applicant]
US 20210081266A1 · Kern et al. · 2021 [cited by applicant]
US 20210190362A1 · Ko et al. · 2021 [cited by applicant]
US 20210262689A1 · Shinde et al. · 2021 [cited by applicant]
US 20210302043A1 · Dempsey · 2021 [cited by applicant]
US 20210303388A1 · George et al. · 2021 [cited by applicant]
US 20210318745A1 · Manousakis et al. · 2021 [cited by applicant]
US 20210349776A1 · Wolfson et al. · 2021 [cited by applicant]
US 20210397239A1 · Sethi et al. · 2021 [cited by applicant]
US 20210405727A1 · Singh et al. · 2021 [cited by applicant]
US 20220090804A9 · Magcale · 2022 [cited by applicant]
US 20220164186A1 · Pamidala et al. · 2022 [cited by applicant]
US 20220334558A1 · Huang et al. · 2022 [cited by applicant]
US 20220410171A1 · Ghose · 2022 [cited by applicant]
US 20230037609A1 · Gururaja et al. · 2023 [cited by applicant]
US 20230061136A1 · Abdollahian Noghabi et al. · 2023 [cited by applicant]
US 20230069177A1 · Albright et al. · 2023 [cited by applicant]
US 20230098687A1 · Maillot · 2023 [cited by examiner]
US 20230108991A1 · Sato et al. · 2023 [cited by applicant]
US 20230117225A1 · Porto Guedes et al. · 2023 [cited by applicant]
US 20230148090A1 · Mazur et al. · 2023 [cited by applicant]
US 20230153680A1 · Rohrkemper et al. · 2023 [cited by applicant]
US 20230208139A1 · Holveck et al. · 2023 [cited by applicant]
US 20230229216A1 · Lerer et al. · 2023 [cited by applicant]
US 20230236923A1 · Gowri et al. · 2023 [cited by applicant]
US 20230239809A1 · Mukherjee et al. · 2023 [cited by applicant]
US 20230259102A1 · Misra et al. · 2023 [cited by applicant]
US 20230259112A1 · Cheon et al. · 2023 [cited by applicant]
US 20230367378A1 · Vaysman et al. · 2023 [cited by applicant]
IN 202221026483 · 2022 [cited by applicant]
WO 2019213466A1 · 2019 [cited by applicant]
WO 2021214752A1 · 2021 [cited by applicant]
US 11,971,693 B2, 04/2024, Kochar et al. (withdrawn) [cited by applicant]
Active Power Management™ for Green Data Centers a Breakthrough Approach for Energy-efficient Operation of Your Servers, Cassatt Corporation, Available Online at: https://ftpdocs.broadcom.com/cadocs/IM_Documents/ecoMeter… [cited by applicant]
Cassatt Announces Strategy to Save Energy by Turning off Idle Servers in the Data Center, DatacenterDynamics, Available Online at: https://www.datacenterdynamics.com/en/news/cassatt-announces-strategy-to-save-energy-by-… [cited by applicant]
Intelligent Load Shedding |Optimal Load Preservation |Intelligent Load Restoration, Operation Technology, Inc., Available Online at: https://etap.com/solutions/load-shedding-system, Accessed from Internet on Jan. 4, 202… [cited by applicant]
Patentability Search Report mailed on Feb. 2, 2023, 18 pages. [cited by applicant]
Patentability Search Report mailed on Jan. 5, 2023, 19 pages. [cited by applicant]
Taking Automatic Corrective Action in Your Data Center, AVTECH Software Inc., Available Online at: https://avtech.com/articles/9054/taking-automatic-corrective-action-data-center, Accessed from Internet on Jan. 4, 2023,… [cited by applicant]
U.S. Appl. No. 18/202,712, Non-Final Office Action mailed on Sep. 15, 2023, 12 pages. [cited by applicant]
U.S. Appl. No. 18/202,712, Notice of Allowance mailed on Jan. 31, 2024, 5 pages. [cited by applicant]
U.S. Appl. No. 18/338,695, Non-Final Office Action mailed on Nov. 29, 2023, 21 pages. [cited by applicant]
U.S. Appl. No. 18/338,962, Non-Final Office Action mailed on Dec. 6, 2023, 48 pages. [cited by applicant]
U.S. Appl. No. 18/339,114, Non-Final Office Action mailed on Aug. 31, 2023, 22 pages. [cited by applicant]
Bhattacharya et al., The Need for Speed and Stability in Data Center Power Capping, International Green Computing Conference (IGCC), Available Online at: http://sdb.cs.berkeley.edu/sdb/files/publications/local/the_need_… [cited by applicant]
Chen et al., Dynamic Server Power Capping for Enabling Data Center Participation in Power Markets, IEEE/ACM International Conference on Computer-Aided Design (ICCAD), Available Online at: https://www.bu.edu/peaclab/file… [cited by applicant]
Fu et al., How Much Power Oversubscription is Safe and Allowed in Data Centers?, Proceedings of the 8th ACM International Conference on Autonomic Computing, ICAC'11, Jun. 2011, 10 pages. [cited by applicant]
Li et al., A Scalable Priority-Aware Approach to Managing Data Center Server Power, IEEE International Symposium on High-Performance Computer Architecture (HPCA), Available Online at: https://www.pdl.cmu.edu/PDL-FTP/Pow… [cited by applicant]
Li et al., CapMaestro: Exploiting Power Redundancy, Data Center-Wide Priorities, and Stranded Power for Boosting Data Center Performance, IBM Research Report RC25680, Mar. 28, 2018, 19 pages. [cited by applicant]
International Application No. PCT/US2023/068334, International Search Report and Written Opinion mailed on Oct. 11, 2023, 16 pages. [cited by applicant]
Sakalkar et al., Data Center Power Oversubscription with a Medium Voltage Power Plane and Priority-Aware Capping, Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languag… [cited by applicant]
Shokooh et al., Intelligent Load Shedding Need for a Fast and Optimal Solution, Institute of Electrical and Electronics Engineers PCIC, Jan. 2005, pp. 1-10. [cited by applicant]
Wu et al., Dynamo: Facebook's Data Center-Wide Power Management System, ACM/IEEE 43rd Annual International Symposium on Computer Architecture, Available Online at: http://ieeexplore.ieee.org/document/7551415/, Jun. 18-2… [cited by applicant]
U.S. Appl. No. 18/202,712 , “Corrected Notice of Allowability”, May 1, 2024, 2 pages. [cited by applicant]
U.S. Appl. No. 18/338,695 , Final Office Action, Mailed On Apr. 18, 2024, 23 pages. [cited by applicant]
U.S. Appl. No. 18/338,962 , Notice of Allowance, Mailed On Mar. 26, 2024, 24 pages. [cited by applicant]
U.S. Appl. No. 18/339,114 , Final Office Action, Mailed On Apr. 18, 2024, 23 pages. [cited by applicant]
U.S. Appl. No. 18/338,962, Corrected Notice of Allowability mailed on Oct. 21, 2024, 2 pages. [cited by applicant]
U.S. Appl. No. 18/339,114, Notice of Allowance mailed on Oct. 30, 2024, 5 pages. [cited by applicant]
U.S. Appl. No. 18/338,695, Non-Final Office Action mailed on Sep. 19, 2024, 26 pages. [cited by applicant]
U.S. Appl. No. 18/338,962, Notice of Allowance mailed on Sep. 4, 2024, 5 pages. [cited by applicant]
U.S. Appl. No. 18/339,114, Notice of Allowance mailed on Sep. 6, 2024, 7 pages. [cited by applicant]
U.S. Appl. No. 18/338,695, Notice of Allowance, mailed on Jun. 3, 2025, 13 pages. [cited by applicant]