System, method and apparatus for handling power limit restrictions in flash memory devices

• US 9,235,665 B2
• Filed: 03/14/2013
• Issued: 01/12/2016
• Est. Priority Date: 10/10/2012
• Status: Active Grant

• Current Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Original Assignee: Sandisk Technologies Incorporated (Western Digital Corporation)
• Inventors: Stelmakh, Konstantin
• Primary Examiner(s): Fernandez Rivas, Omar
• Assistant Examiner(s): Mapar, Bijan
• Application Number:
  US13/829,426
• Publication Number:
  US 20140100838A1
• Time in Patent Office: 1,034 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 1/3206 Monitoring of events, devices or parameters that trigger a change in power modality
• CPC Class Codes: G06F 1/3275 Power saving in memory, e.g. RAM, cache
• CPC Class Codes: G06F 30/33 Design verification, e.g. functional simulation or model checking
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A system, method and apparatus for dynamic power management including creating a model for each task of multiple tasks performed by a circuit, the model including a corresponding power requirement value for each task, selecting each task for execution, executing the selected task when the corresponding power requirement value does not exceed an average power consumption cap of an execution window, determining an actual power consumption of the selected task during execution of the selected task and storing the actual power consumption corresponding to the selected task as the corresponding power requirement value for the selected task. A memory system can include a memory die, a data bus coupled to the memory die, a power supply coupled to the memory die, a power monitor coupled to the memory die and the power supply and a controller coupled to the data bus and the memory die.

Claims

1. A method for dynamic power management comprising:

creating a model for each task of a plurality of tasks performed by a circuit, the model including a corresponding power requirement value for each task of the plurality of tasks, wherein the power requirement value for each task is equal to a corresponding average power consumed during a duration of the respective task;

executing a selected task of the plurality of tasks when a sum of the corresponding power requirement value of the selected task and a corresponding power requirement value of all other simultaneously executed tasks of the plurality of tasks does not exceed an average power consumption cap of a sliding execution window, wherein the selected task has a duration less than the sliding execution window;

determining an actual power consumption of the selected task during execution of the selected task;

storing the actual power consumption corresponding to the selected task as the corresponding power requirement value for the selected task after the execution of the selected task is completed;

incrementing the sliding execution window forward an increment equal to the selected task'"'"'s duration of execution when the execution of the selected task is completed; and

repeating the steps of executing, determining, storing and incrementing for each task of the plurality of tasks.

2. The method of claim 1, wherein creating the model for each task of the plurality of tasks includes storing the model of each of the plurality of tasks in a reference table.

3. The method of claim 2, wherein creating the model for each task of the plurality of tasks includes:

selecting one of the tasks of the plurality of tasks;

determining an estimated maximum power requirement of the selected task is equal to a corresponding average power consumed during the duration of the respective task;

assigning a task identifier corresponding to the selected task; and

storing the task identifier and the estimated maximum power requirement corresponding to the selected task in a reference table, the corresponding estimated maximum power requirement value being stored as the corresponding power requirement value in the reference table.

4. The method of claim 3, wherein the estimated maximum power requirement includes a worst case execution power requirement for the selected task.

5. The method of claim 1, wherein the sliding execution window includes a selected duration.

6. The method of claim 1, wherein the selected task is one a plurality of tasks and a first one of the plurality of tasks has a first duration and a second one of the plurality of tasks has a second duration, wherein the first duration is not equal to the second duration.

7. The method of claim 1, wherein storing the actual power consumption corresponding to the selected task in the corresponding power requirement value includes storing the actual power consumption corresponding to the selected task in the corresponding power requirement value for every iteration of a plurality of iterations of the selected task.

8. The method of claim 1, wherein determining the actual power consumption of the selected task during execution of the selected task includes determining the actual power consumption due to at least one of an actual workload, an actual age, an actual temperature of the circuit performing the task.

9. The method of claim 1, further comprising delaying execution of the selected task when the sum of the corresponding power requirement value of the selected task and the corresponding power requirement value of all other simultaneously executed tasks of the plurality of tasks exceeds the average power consumption cap of the sliding execution window.

10. The method of claim 9, wherein delaying execution of the selected task includes executing the selected task in a subsequent sliding execution window.

11. The method of claim 1, wherein at least one of the plurality of tasks is a controller task.

12. The method of claim 1, wherein at least one of the plurality of tasks is a memory task consisting of:

a sense memory circuit task;

an erase memory circuit task;

or

a program memory circuit task.

13. The method of claim 1, wherein the selected task is one a plurality of tasks and an execution of a first one of the plurality of tasks overlaps an execution of a second one of the plurality of tasks.

14. A memory system comprising:

a memory die;

a data bus coupled to the memory die;

a power supply coupled to the memory die;

a power monitor coupled to the memory die and the power supply;

a controller coupled to the data bus and the memory die; and

a dynamic power consumption model for each one of a plurality of tasks stored in a non-transitory computer readable medium and being accessible by the controller, the dynamic power consumption model for each one of the plurality of tasks includes a power requirement value for each task is equal to a corresponding average power consumed during a duration of the respective task;

the controller including logic embodied in a non-transitory computer readable medium to monitor the execution of each task and logic embodied in a non-transitory computer readable medium to update an actual power consumed by the executed task as the corresponding power requirement value after the execution of the selected task is completed;

wherein the controller further includes;

logic embodied in a non-transitory computer readable medium for executing a selected task of the plurality of tasks when a sum of the corresponding power requirement value of the selected task and a corresponding power requirement value of all other simultaneously executed tasks of the plurality of tasks does not exceed an average power consumption cap of a sliding execution window, wherein the selected task has a duration less than the sliding execution window;

logic embodied in a non-transitory computer readable medium for determining an actual power consumption of the selected task during execution of the selected task;

logic embodied in a non-transitory computer readable medium for storing the actual power consumption corresponding to the selected task as the corresponding power requirement value for the selected task after the execution of the selected task is completed;

logic embodied in a non-transitory computer readable medium for incrementing the sliding execution window forward an increment equal to the selected task'"'"'s duration of execution when the execution of the selected task is completed; and

logic embodied in a non-transitory computer readable medium for repeating the steps of executing, determining, storing and incrementing for each task of the plurality of tasks.

15. The memory system of claim 14, wherein the controller is included on the memory die.

16. The system of claim 14, wherein at least one of the plurality of tasks is a flash memory task.

17. The system of claim 14, wherein at least one of the plurality of tasks is a controller task.

18. The system of claim 14, wherein the plurality of tasks includes at least one a flash memory task and at least one controller task.

19. A method for dynamic power management of a memory circuit comprising:

identifying a corresponding power requirement value for each task of a plurality of tasks performed by the memory circuit;

executing a selected task of the plurality of tasks when a sum of the corresponding power requirement value of the selected task and a corresponding power requirement value of all other simultaneously executed tasks of the plurality of tasks does not exceed an average power consumption cap of a present sliding execution window, wherein the selected task has a duration less than the present sliding execution window, wherein executing the selected task does not include reducing a voltage or a frequency of the operation of the memory circuit;

determining an actual power consumption of the selected task during execution of the selected task; and

updating the corresponding power requirement value for the selected task by storing the actual power consumption corresponding to the selected task as the corresponding power requirement value of the selected task, after the selected execution of the selected task is completed;

incrementing the sliding execution window forward an increment equal to the selected task'"'"'s duration of execution when the execution of the selected task is completed; and

repeating the steps of executing, determining, storing and incrementing for each task of the plurality of tasks.