Deep-charging power resources of power resource group having identifier corresponding to range within which modulo falls based on charging time

• US 10,193,358 B2
• Filed: 04/23/2012
• Issued: 01/29/2019
• Est. Priority Date: 04/23/2012
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: Hansen, Peter, Gaston, Darrel G, Holloway, Scott E
• Primary Examiner(s): Grant, Robert
• Assistant Examiner(s): Trischler, John
• Application Number:
  US14/396,378
• Publication Number:
  US 20150137765A1
• Time in Patent Office: 2,472 Days
• Field of Search: 320125
• CPC Class Codes: G06F 1/30 Means for acting in the event of power-supply failure or interruption, e.g. power-supply fluctuations for resetting only G06F1/24
• CPC Class Codes: G06F 1/324 by lowering clock frequency
• CPC Class Codes: H02J 7/0013 acting upon several batteries simultaneously or sequentially H02J7/1423 takes precedence
• CPC Class Codes: H02J 9/06 with automatic change-over , e.g. UPS systems
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

Systems, methods, and computer-readable and executable instructions are provided for moderating a charging for a number of power resources. Moderating a charging for a number of power resources can include calculating a distinct charging window for each of the number of power resources. Moderating a charging for a number of power resources can also include selecting a first power resource from the number of power resources based on a current time and the distinct charging window for the first power resource. Furthermore, moderating a charging for a number of power resources can include charging the first power resource within the distinct charging window before charging a second power resource.

Claims

1. A method comprising:

determining a total number of minutes that have elapsed since a reference time;

computing a product of a number of power resource groups and a time to charge, each power resource group comprising a plurality of power resources, the time to charge specifying a length of time to charge each power resource;

computing a modulo of the determined total number of minutes divided by the computed product;

deep-charging power resources of a given power resource group responsive to the computed modulo being inside a range based on a numeric identifier of the given power resource group and the time to charge;

determining that the given power resource group is within a threshold amount of time from a start or an end of a charging window associated with the given power resource group;

starting deep-charging of the given power resource group responsive to determining that the given power resource group is at the threshold amount of time from the start of the charging window; and

ending deep-charging of the given power resource group responsive to determining that the given power resource group is at the threshold amount of time from the end of the charging window.

2. The method of claim 1, further comprising:

float-charging the power resources of the given power resource group responsive to the computed modulo being outside the range.

3. The method of claim 1, further comprising:

sleep-charging the power resources of the given power resource group responsive to the computed modulo being outside the range.

4. The method of claim 1, wherein deep-charging the power resources comprises instructing chargers of the power resources to deep-charge the power resources.

5. The method of claim 1, wherein the range has a lower bound equal to a product of the time to charge and the numeric identifier.

6. The method of claim 5, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one.

7. The method of claim 5, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one, minus a predetermined length of time.

8. A system comprising:

a plurality of power resources organized into a number of power resource groups identified by numeric identifiers, the power resources having a time to charge specifying a length of time to charge the power resources; and

a controller to;

control charging of the power resources by deep-charging the power resources of the power resource group having the numeric identifier corresponding to a range within which a modulo falls,

wherein the controller is to determine the modulo of a total number of minutes that have elapsed since a reference time, divided by a product of the number of power resource groups and the time to charge;

determine that a particular power resource group is within a threshold amount of time from a start or an end of a charging window associated with the particular power resource group;

start deep-charging the particular power resource group responsive to determining that the particular power resource group is at the threshold amount of time from the start of the charging window; and

stop deep-charging the particular power resource group responsive to determining that the particular power resource group is at the threshold amount of time from the end of the charging window.

9. The system of claim 8, wherein the controller is to control the charging of the power resources by float-charging the power resources of the power resource group having the numeric identifiers corresponding to ranges outside of which the modulo falls.

10. The system of claim 8, wherein the controller is to control the charging of the power resources by sleep-charging the power resources of the power resource group having the numeric identifiers corresponding to ranges outside of which the modulo falls.

11. The system of claim 8, wherein the range has a lower bound equal to a product of the time to charge and the numeric identifier.

12. The system of claim 11, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one.

13. The system of claim 11, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one, minus a predetermined length of time.

14. A non-transitory computer-readable data storage medium storing computer-executable code that a controller for a plurality of power resources organized into power resource groups identified by numeric identifiers executes to:

determine a total number of minutes that have elapsed since a reference time;

compute a product of a number of the power resource groups and a time to charge specifying a length of time to charge each power resource;

compute a modulo of the determined total number of minutes divided by the computed product;

deep-charge the power resources of the power resource group having the numeric identifier corresponding to a range within which the modulo falls;

determine that the power resource group having the numeric identifier corresponding to a range within which the modulo falls is within a threshold amount of time from a start or an end of a charging window associated with the particular power resource group;

starting deep-charging the power resource group having the numeric identifier corresponding to a range within which the modulo falls responsive to determining that the particular power resource group is at the threshold amount of time from the start of the charging window; and

stop deep-charging the power resource group having the numeric identifier corresponding to a range within which the modulo falls responsive to determining that the particular power resource group is at the threshold amount of time from the end of the charging window.

15. The non-transitory computer-readable data storage medium of claim 14, wherein the controller executes the computer-execute code to further:

float-charge the power resources of the power resource group having the numeric identifiers corresponding to ranges outside of which the modulo falls.

16. The non-transitory computer-readable data storage medium of claim 14, wherein the controller executes the computer-execute code to further:

sleep-charge the power resources of the power resource group having the numeric identifiers corresponding to ranges outside of which the modulo falls.

17. The non-transitory computer-readable data storage medium of claim 14, wherein the range has a lower bound equal to a product of the time to charge and the numeric identifier.

18. The non-transitory computer-readable data storage medium of claim 17, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one.

19. The non-transitory computer-readable data storage medium of claim 17, wherein the range has an upper bound equal to a product of the time to charge and a sum of the numeric identifier and one, minus a predetermined length of time.