# Patent

## Title
Power control apparatus, electronic computer, and power control method

## Abstract

A power control apparatus includes a processor configured to collect first information related to operation of a performing unit configured to perform data processing and information related to operation of a bus configured to transfer data; determine an operating frequency and an operating voltage for the performing unit, based on the collected information; estimate based on the collected information, a period elapsing until the performing unit suspends operation and a period elapsing until the bus suspends operation; derive a discriminant that obtains a difference of total power consumption and power consumption pre-switching; and execute a switching of an operating frequency and an operating voltage of the performing unit, based on a value of the discriminant.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application is a continuation application of International Application PCT/JP2011/076330, filed on Nov. 15, 2011 and designating the U.S., the entire contents of which are incorporated herein by reference.


FIELD
The embodiments discussed herein are related to a power control apparatus, an electronic computer, and a power control method.
BACKGROUND
Conventionally, in a multiprocessor system having multiple processors, a method of reducing power consumption by executing programs using the lowest possible frequency and source voltage (dynamic voltage and frequency scaling (DVFS)) is employed. For example, according to one method, at least the frequency of the processors or the source voltage is controlled within a range of satisfying performance constraints of programs executed by the processors (for example, refer to Japanese Laid-Open Patent Publication No. 2008-287592).
Nonetheless, with conventional DVFS, when the frequency and the source voltage of the processors are changed, power consumption during the period elapsing until suspension of the data processing by the processing unit or suspension of the bus is not considered. Therefore, a problem arises in that irrespective of switching to low frequency or low source voltage by DVFS, after adding the power consumed during the period until the data processing or the bus is suspended, the power consumption after the switch may be greater than before the switch.
SUMMARY
According to an aspect of an embodiment, a power control apparatus includes a processor configured to collect first information related to operation of a performing unit configured to perform data processing and second information related to operation of a bus configured to transfer data; determine an operating frequency and an operating voltage for the performing unit, based on the first information and the second information; estimate based on the first information and the second information, a first period elapsing until the performing unit suspends operation and a second period elapsing until the bus suspends operation; derive a discriminant that obtains a difference of total power consumption and power consumption pre-switching, where the total power consumption is power consumed in a case of switching the operation of the performing unit based on the determined operating frequency and operating voltage plus power consumed during the estimated first and second periods; and execute a switching of an operating frequency and an operating voltage of the performing unit, based on a value of the discriminant.
The object and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the claims.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not restrictive of the invention.



BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram of a configuration of a power control apparatus according to a first embodiment;
FIG. 2 is a flowchart of a power control method according to the first embodiment;
FIG. 3 is a block diagram of a hardware configuration of an electronic computer according to a second embodiment;
FIG. 4 is a block diagram of a functional configuration of the electronic computer according to the second embodiment;
FIG. 5 is a diagram of operations until data processing is suspended at all CPUs in the electronic computer according to the second embodiment;
FIG. 6 is a diagram of operations until a suspension of one CPU in the electronic computer according to the second embodiment;
FIG. 7 is a diagram of operations until a suspension of a bus in the electronic computer according to the second embodiment;
FIG. 8 is a flowchart of the power control method according to the second embodiment;
FIG. 9 is a block diagram of a hardware configuration of the electronic computer according to a third embodiment; and
FIG. 10 is a diagram of operations until data processing is suspended at all of the CPUs in the electronic computer according to the third embodiment.



DESCRIPTION OF EMBODIMENTS
Embodiments of a power control apparatus, an electronic computer, and a power control method will be described in detail with reference to the accompanying drawings. In the description of the embodiments, identical components are given the same reference numerals and redundant explanation is omitted. Furthermore, the present invention is not limited by the embodiments.
FIG. 1 is a block diagram of a configuration of a power control apparatus according to a first embodiment. As depicted in FIG. 1, a power control apparatus 1 includes a collecting unit 2, a determining unit 3, a deriving unit 4, and an executing unit 5. The collecting unit 2, the determining unit 3, the deriving unit 4, and the executing unit 5 may be implemented, for example, by executing on a processor, a program that implements the power control method described hereinafter.
The collecting unit 2 collects information related to the operation of a processing unit (performing unit, not depicted) that performs data processing. For example, information related to processing unit operation may include information concerning the load of a task under execution by the processing unit. Further, the collecting unit 2 collects information related to the operation of a bus (not depicted) that transmits data. For example, information related to bus operation may include information indicating whether the bus is being operated for direct memory access and information concerning the data volume transferred by 1 direct memory access.
The determining unit 3 determines the post-switching operating frequency and the post-switching operating voltage of the processing unit, based on the information related to the processing unit operation and the information related to the bus operation, collected by the collecting unit 2.
The deriving unit 4 estimates the period that elapses until the processing unit suspends operation, based on the information related to the processing unit operation collected by the collecting unit 2. The deriving unit 4 estimates the period that elapses until the bus suspends operation, based on the information related to the bus operation collected by the collecting unit 2. The deriving unit 4, based on the operating frequency and the operating voltage determined by the determining unit 3, calculates the total power consumption by adding the power consumed during the period estimated to elapse until the processing unit and the bus are suspended, to the power consumed in the case of the operation of the processing unit being switched. The deriving unit 4 derives a discriminant that obtains the difference of the calculated total power consumption and the pre-switching power consumption.
The executing unit 5 executes a switching of the operating frequency and of the operating voltage of the processing unit, based on the value of the discriminant. For example, the executing unit 5 may execute the switch when the value obtained by subtracting the pre-switching power consumption from the total power consumption, which is the power consumed in the case of switching the operation of the processing unit plus the power consumed during the period estimated to elapse until the processing unit and the bus are suspended, is less than 0.
FIG. 2 is a flowchart of the power control method according to the first embodiment. As depicted in FIG. 2, in the power control apparatus 1, when the power control method is started, the collecting unit 2 collects information related to the processing unit operation and information related to the bus operation (step S1). The determining unit 3 determines the post-switching operating frequency and the post-switching operating voltage of processing unit, based on the information related to the processing unit operation and the information related to the bus operation collected by the collecting unit 2 (step S2).
The deriving unit 4 estimates the period that elapses until the processing unit and the bus are suspended. The deriving unit 4 obtains the total power consumption, which is the power consumed in the case of switching the operation of the processing unit plus the power consumed during the period estimated to elapse until the operations are suspended. The deriving unit 4 derives a discriminant that obtains the difference of the total power consumption and the pre-switching power consumption (step S3).
If the value of the discriminant satisfies a switching condition (step S4: YES), the executing unit 5 executes a switching of the operating frequency and the operating voltage of the processing unit to the operating frequency and the operating voltage determined by the determining unit 3 (step S5), ending a series of operations. On the other hand, for example, if the value of the discriminant does not satisfy the switching condition (step S4: NO), the executing unit 5 does not execute a switching of the operating frequency or the operating voltage, and ends a series of operations.
According to the first embodiment, whether power consumption will decrease consequent to switching can be estimated by adding to the post-switching power consumption, the power consumed during the period estimated to elapse until the processing unit and the bus are suspended. Therefore, increases in power consumption consequent to switching can be prevented by not executing a switch when the total power consumption, which is the post-switching power consumption plus the power consumed during the period estimated to elapse until the processing unit and the bus are suspended, is greater than the pre-switching power consumption. Further, power consumption can be reduced by executing a switch when the total power consumption is less than the pre-switching power consumption.
A second embodiment is an example in which the power control apparatus according to the first embodiment is applied to an apparatus that controls DVFS of an electronic computer. Examples of the electronic computer include, for example, computers such as a personal computer and a work station, and mobile information devices such as personal digital assistants (PDAs). Further examples include mobile terminals such as mobile telephones and so-called smartphones that have combined functions of a mobile telephone and a mobile information terminal, various types of instruments, and various types of electronic-apparatus-embedded systems.
FIG. 3 is a block diagram of a hardware configuration of the electronic computer according to the second embodiment. As depicted in FIG. 3, an electronic computer 11 includes a coprocessor 12 and N central processing units (CPUs) (#1, #2, . . . , #N) 13 to 15 as an example of the processing units. N is an integer of 2 or more. In FIG. 3, although 3 or more CPUs are depicted, the number of CPUs may be 2.
The coprocessor 12 controls DVFS with respect to the CPUs (#1, #2, . . . , #N) 13 to 15. For example, the coprocessor 12 issues a data processing suspension instruction for the CPUs (#1, #2, . . . , #N) 13 to 15, when the operating frequency and/or the operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15 is/are switched by DVFS. Further, for example, the coprocessor 12 issues an operation suspension instruction for a bus 20, when the operating frequency and/or the operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15 is/are switched by DVFS.
The CPUs (#1, #2, . . . , #N) 13 to 15 process in parallel, tasks assigned thereto. Task assignment may be performed by a scheduler implemented by an execution of an operating system (OS) on a CPU. Here, description is given assuming that the CPU#1_13 executes the OS. The CPUs (#1, #2, . . . , #N) 13 to 15 may be, for example, microprocessors of a multiprocessor system, or cores of a multicore processor.
The electronic computer 11 is a distributed-memory-type computing device and for example, may be independent of the coprocessor 12, the CPU#1_13, the CPU#2_14, . . . , and the CPU#N_15, and connected to memory 16 to 19. The memory 16 to 19 are used as work areas by the coprocessor 12 and the CPUs (#1, #2, . . . , #N) 13 to 15. Random access memory (RAM) may is an example of the memory 16 to 19.
The coprocessor 12, the CPUs (#1, #2, . . . , #N) 13 to 15, and the memory 16 to 19 are connected to the bus 20. A bus arbiter 21, a peripheral (peripheral apparatus) 22 and a direct memory access controller (DMAC) 23 are connected to the bus 20. The bus 20 transmits data between the components 12 to 19, and 21 to 23 connected to the bus 20.
The peripheral 22 may be, for example, an input apparatus such as a keyboard, a keypad, a touch panel, a mouse, a microphone, etc., an output apparatus such as display, a speaker, a motor for oscillation, etc., and an external memory apparatus such as various types of memory cards. The DMAC 23 controls direct memory access between the memory 16 to 19 and the peripheral 22. The bus arbiter 21 arbitrates use privileges of the bus 20 between the CPUs (#1, #2, . . . , #N) 13 to 15, which are bus masters, and the DMAC 23.
FIG. 4 is a block diagram of a functional configuration of the electronic computer according to the second embodiment. As depicted in FIG. 4, in the electronic computer 11, the power control apparatus 1 is implemented by executing a privileged program 31, which is software, by the coprocessor 12, which is hardware. Execution of the privileged program 31 implements the collecting unit 2, the determining unit 3, the deriving unit 4, and the executing unit 5.
The information collected by a request from the collecting unit 2 may be sent directly to the determining unit 3, or may be initially sent to the collecting unit 2 and sent from the collecting unit 2 to the determining unit 3. Here, description will be given assuming that the collected information is directly sent to the determining unit 3. The collecting unit 2 has a frequency/voltage collecting unit 32 and a power consumption collecting unit 33.
The frequency/voltage collecting unit 32 requests information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15 from an OS 38 executed by the CPU#1_13. In response to the request from the frequency/voltage collecting unit 32, the OS 38 provides to the determining unit 3, the information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15.
Examples of the information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15 include a deadline period, which is the remaining time given to complete a task at the CPUs (#1, #2, . . . , #N) 13 to 15, and information concerning the longest execution period of a task to be executed. The longest execution time of a task may be preliminarily obtained for each task, by simulation, for example.
The power consumption collecting unit 33 requests information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15 from the OS 38 and requests information related to the operation of the bus 20 from the bus arbiter 21 and the DMAC 23. In response to the request from the power consumption collecting unit 33, the OS 38 provides to the determining unit 3, the information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15. In response to the request from the power consumption collecting unit 33, the bus arbiter 21 and the DMAC 23 provide to the determining unit 3, the information related to the operation of the bus 20.
Examples of the information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15 include information concerning the average execution period until completion of a task under execution at the CPUs (#1, #2, . . . , #N) 13 to 15, and information concerning the load of a task under execution. Examples of the information related to the operation of the bus 20 include information indicating whether direct memory access is in progress, and information concerning the period occupied by the bus 20 for 1 direct memory access. Information indicating whether direct memory access is in progress is obtained from the bus arbiter 21, for example. Information concerning the occupied period of the bus 20 is obtained from the DMAC 23, for example. If the information related to the operation of the CPUs (#1, #2, . . . , #N) 13 to 15 and of the bus 20 is recorded in the OS 38, the frequency/voltage collecting unit 32 and the power consumption collecting unit 33 can obtain the information from the OS 38.
The determining unit 3, for example, determines the post-DVFS switching operating frequency and the post-DVFS switching operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15, based on a deadline period of the CPUs (#1, #2, . . . , #N) 13 to 15 and/or information concerning the longest execution period of a task. For the CPUs (#1, #2, . . . , #N) 13 to 15, a low operating frequency and a low operating voltage within a range satisfying the deadline period are, for example, determined by the determining unit 3. For example, in the case of a complementary metal oxide semiconductor (CMOS) circuit, power consumption is proportional to the operating frequency multiplied by the square of the operating voltage and therefore, if the operating frequency and the operating voltage are low, the power consumption has a possibility of being reduced.
The deriving unit 4 has a CPU suspension period estimating unit 34, a bus suspension period estimating unit 35, and a discriminant synthesizing unit 36.
The CPU suspension period estimating unit 34 estimates standby periods arising at the CPUs (#1, #2, . . . , #N) 13 to 15. The standby periods are from an issuance of a data processing suspension instruction by the coprocessor 12, until the data processing is suspended by all of the CPUs (#1, #2, . . . , #N) 13 to 15.
The bus suspension period estimating unit 35 estimates the period required from the issuance of an operation suspension instruction for the bus 20 by the coprocessor 12, until the bus 20 suspends operation. A method of estimating the operation suspension period for the bus 20 will be described hereinafter.
The discriminant synthesizing unit 36 obtains an estimated value of power consumption for a case where DVFS is executed and an estimated value of power consumption for a case where DVFS is not executed. The discriminant synthesizing unit 36 derives based on the obtained estimated values of power consumption, a discriminant for judging whether DVFS is to be executed, and obtains a value. A discriminant derivation method will be described hereinafter.
The executing unit 5 determines whether DVFS is to be executed based on the value of the discriminant. For example, the executing unit 5 executes DVFS when the estimated value of power consumption in a case where DVFS is executed is less than the estimated value of power consumption in a case where DVFS is not executed. For example, the executing unit 5 does not execute DVFS when the estimated value of power consumption in a case where DVFS is executed is greater than the estimated value of power consumption in a case where DVFS is not executed. If DVFS is to be executed, the executing unit 5 issues a suspension instruction for suspending data processing at the CPUs (#1, #2, . . . , #N) 13 to 15 and issues a suspension instruction for suspending operation of the bus 20.
The coprocessor 12 includes a changing unit 37. If the executing unit 5 determines that DVFS is to be executed, the changing unit 37 changes the operating frequency and the operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15 to the operating frequency and the operating voltage determined by the determining unit 3. In FIG. 4, although the changing unit 37 is depicted to change the operating frequency and the operating voltage of the CPU#1_13, the changing unit 37 also changes the operating frequency and the operating voltage of the non-depicted CPUs (#2, . . . , #N) 14, 15.
FIG. 5 is a diagram of operations until data processing is suspended at all the CPUs in the electronic computer according to the second embodiment. As depicted in FIG. 5, in the architecture of the second embodiment, parent/child relations among the coprocessor 12, the CPU#1_13, the CPU#2_14, . . . , and the CPU#N_15 are assumed. Further, messages are assumed to be sent only between a processor regarded as a parent and a processor regarded as a child.
In the example depicted, the coprocessor 12 is regarded as the parent of the CPU#1_13 and the CPU#1_13 is regarded as the child of the coprocessor 12. Further, a CPU#[N−1] (not depicted) is regarded as the parent of the CPU#N_15 and the CPU#N_15 is regarded as the child of the CPU#[N−1].
When DVFS is to be executed, the coprocessor 12 first issues to the CPU#1_13 regarded as the child, a data processing suspension instruction and gives notification of a suspension of data processing (step S11). The coprocessor 12 suspends operation (step S12). After the suspension of the operation, the period until the data processing of all the CPUs (#1, #2, #N) 13 to 15 is suspended is a standby period 41 of the coprocessor 12.
The CPU#1_13, upon receiving notification of the data processing suspension from the coprocessor 12, notifies the CPU#2_14 regarded as the child, of the suspension of data processing (step S13). The CPU#1_13 suspends the data processing (step S14). After the suspension of the data processing, the period until the data processing at the remaining CPUs (#2, . . . , #N) 14, 15 processing data is suspended is a standby period 42 of the CPU#1_13.
The CPU#2_14, upon receiving notification of the data processing suspension from the CPU#1_13, notifies the CPU#3 (not depicted) regarded as the child, of the suspension of data processing (step S15). The CPU#2_14 suspends the data processing (step S16). After the suspension of the data processing, the period until the data processing by the remaining CPUs (#3, . . . , #N) 15 processing data is a standby period 43 of the CPU#2_14.
The same operations are performed by the CPU#3 and subsequent CPUs. When the last remaining CPU processing data, the CPU#N_15, has been suspended data processing, all applications are suspended (step S17). Therefore, no standby period arises for the CPU#N_15. During the standby periods 41 to 43 of the coprocessor 12 and the CPUs (#1, #2, . . . , #[N−1]) 13, 14, power is wastefully consumed.
FIG. 6 is a diagram of operations until a suspension of one CPU in the electronic computer according to the second embodiment. Although the operations until a CPU suspends data processing are the same for each of the CPUs (#1, #2, . . . , #N) 13 to 15, description will be given taking the CPU#113 as an example.
As depicted in FIG. 6, for example, the CPU#1_13 is assumed to recursively execute task #1, task #2, and task #3, sequentially. For example, upon receiving a CPU suspension interrupt during execution of a given cycle of task #1_51, the CPU#1_13 suspends operation at the point in time when the task #1_51, which is under execution when the interrupt is received, is completed.
The input timing of the CPU suspension interrupt to the CPU#1_13 during the execution of the task #1_51 is arbitrary. Therefore, the average time from the input of the CPU suspension interrupt to the CPU#1_13, until the CPU#1_13 is suspended may be regarded as the time assigned for task #1_51 by the OS 38, i.e., 1⁄2 the time of a time slice.
Assuming that the load of the task #1_51 is S(1), the average time from the input of the CPU suspension interrupt to the CPU#1_13, until the suspension of the CPU#1_13 can be estimated as αS(1), where α is the constant of proportionality.
Since the input timing of the CPU suspension interrupt to the CPU#1_13 is arbitrary, if the CPU#1_13 receives the CPU suspension interrupt during execution of the task #2 or task #3, the same is true. Therefore, the average time from the receipt of a CPU suspension interrupt by the CPU#1_13, until the suspension of the CPU#1_13 is expressed by equation (1).

αS(1)·(S(1)/(S(1)+S(2)+S(3)))+αS(2)·(S(2)/(S(1)+S(2)+S(3)))+αS(3)·(S(3)/(S(1)+S(2)+S(3)))  (1)

Where, the load of each task #1 to #m assigned to the k-th CPU (CPU#k) is S(1)k, . . . , S(m)k; and m is an integer of 2 or more, and may vary according to the value of k. “k” is an integer of 1 to N. A period Sk from the input of a CPU suspension interrupt to the CPU#k, until the suspension of the data processing of the CPU#k is expressed by equation (2), where, i and j are integers of 1 to m.




  
    
      
        
          S
          k
        
        =
        
          
            ∑
            i
          
          ⁢
          
            
          
          ⁢
          
            {
            
              α
              ⁢
              
                
              
              ⁢
              
                
                  S
                  
                    
                      (
                      i
                      )
                    
                    ⁢
                    k
                  
                
                ·
                
                  (
                  
                    
                      S
                      
                        
                          (
                          i
                          )
                        
                        ⁢
                        k
                      
                    
                    /
                    
                      
                        ∑
                        j
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        S
                        
                          
                            (
                            j
                            )
                          
                          ⁢
                          k
                        
                      
                    
                  
                  )
                
              
            
            }
          
        
      
    
    
      
        (
        2
        )
      
    
  




Therefore, for the k-th CPU (CPU#k), a standby period TCPU_k from the suspension of the data processing, until all applications are suspended is a sum of the periods until the [k+1]-th to the N-th CPUs suspend data processing and is expressed by equation (3). Where, for the sake of simplicity, when the coprocessor 12 is indicated as the 0-th CPU, i.e., the CPU#0, equation (3) further includes the standby period of the coprocessor 12. In other words, in equation (3), k is an integer of 0 to N.




  
    
      
        
          T
          
            CPU
            ⁢
            
              
            
            ⁢
            _
            ⁢
            
              
            
            ⁢
            k
          
        
        =
        
          {
          
            
              
                
                  
                    ∑
                    
                      i
                      =
                      
                        k
                        +
                        1
                      
                    
                    N
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    S
                    i
                  
                
              
              
                
                  (
                  
                    k
                    ≠
                    N
                  
                  )
                
              
            
            
              
                0
              
              
                
                  (
                  
                    k
                    =
                    N
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




FIG. 7 is a diagram of operations until the bus is suspended in the electronic computer according to the second embodiment. As depicted in FIG. 7, when the coprocessor 12 issues an operation suspension instruction for the bus 20 during an execution of direct memory access (DMA) 52, the bus 20 suspends operation at the point in time when the DMA, which is under execution when the suspension instruction is issued, is completed.
The timing at which a suspension instruction for the bus 20 is issued during the execution of DMA 52 is arbitrary. Therefore, assuming the period occupied by the bus 20 for 1 direct memory access is TDMA, an expected value of the period required from an issuance of a bus suspension instruction during the execution of DMA 52, until the bus 20 is suspended is [TDMA/2]. If a bus suspension instruction is issued when DMA is not under execution, the bus 20 immediately suspends operation. Assuming the period required from the issuance of a suspension instruction for the bus 20, until the suspension of the bus 20 is TBUS, TBUS is expressed by equation (4).




  
    
      
        
          T
          BUS
        
        =
        
          {
          
            
              
                
                  
                    T
                    DMA
                  
                  /
                  2
                
              
              
                
                  (
                  
                    DMA
                    ⁢
                    
                      
                    
                    ⁢
                    IN
                    ⁢
                    
                      
                    
                    ⁢
                    PROGRESS
                  
                  )
                
              
            
            
              
                0
              
              
                
                  (
                  ELSE
                  )
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




In equation (4), “else” includes cases when DMA is not under execution. Here, TDMA is proportional to the data transfer volume for 1 DMA. The data transfer volume for 1 DMA is expressed by equation (5). Equation (5) indicates that the data transfer volume for 1 DMA is the smaller of an upper limit of the data transfer volume transferred by 1 DMA and the data transfer volume requested of the DMAC by the CPU.

min{UPPER LIMIT OF DATA TRANSFER VOLUME FOR 1 DMA}  (5)

Here, the discriminant derivation method will be described. The power of the CPU#0 (the coprocessor 12), the CPU#1_13, . . . , the CPU#N_15 before execution of DVFS is assumed to be P0_high, P1_high, . . . , PN_high, respectively. The power of the CPU#0 (the coprocessor 12), the CPU#1_13, . . . , the CPU#N_15 after execution of DVFS is assumed to be P0_low, P1_low, PN_low, respectively.
Where, [Pi_high≧Pi_low] is assumed to be satisfied for an integer i of 1 or more, and the power of the coprocessor 12 is assumed to be constant. In other words, when i is 0, [P0_high=P0_low] is assumed.
1. Power Consumption when DVFS is not Executed
In the CPU#i whose power consumption before DVFS execution is Pi_high, the average time until a task under execution is completed with the power Pi_high is assumed to be Ti_high. In this case, the total power consumed by all of the CPUs until the task is completed in the CPU#i, is estimated to be P1 expressed in equation (6). In other words, the power consumption of all the CPUs (including the coprocessor 12) when DVFS is not executed is estimated to be P1.




  
    
      
        
          P
          1
        
        =
        
          
            ∑
            
              i
              =
              0
            
            N
          
          ⁢
          
            
          
          ⁢
          
            
              P
              
                i
                ⁢
                
                  
                
                ⁢
                _
                ⁢
                
                  
                
                ⁢
                high
              
            
            ⁢
            
              T
              
                i
                ⁢
                
                  
                
                ⁢
                _
                ⁢
                
                  
                
                ⁢
                high
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




2. Power Consumption when DVFS is Executed
In the CPU#i, the average time from a lowering of the power to Pi_low, until the task under execution is completed is assumed to be Ti_low. In this case, the total power consumed by all of the CPUs, from an issuance of a CPU suspension instruction by the coprocessor 12, until the completion of the task at the CPU#i, is estimated to be P2 expressed in equation (7). In other words, the power consumption of all the CPUs (including the coprocessor 12) when DVFS is executed is estimated to be P2.




  
    
      
        
          P
          2
        
        =
        
          
            
              ∑
              
                i
                =
                0
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                P
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  _
                  ⁢
                  
                    
                  
                  ⁢
                  low
                
              
              ⁢
              
                T
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  _
                  ⁢
                  
                    
                  
                  ⁢
                  low
                
              
            
          
          +
          
            
              ∑
              
                i
                =
                0
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                P
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  _
                  ⁢
                  
                    
                  
                  ⁢
                  high
                
              
              ⁡
              
                (
                
                  
                    T
                    
                      CPU
                      ⁢
                      
                        
                      
                      ⁢
                      _
                      ⁢
                      
                        
                      
                      ⁢
                      i
                    
                  
                  +
                  
                    T
                    
                      BUS
                      ′
                    
                  
                
                )
              
            
          
          +
          Const
        
      
    
    
      
        (
        7
        )
      
    
  




On the right side of equation (7), the first term expresses the power consumed by all of the CPUs for task execution; the second term expresses the power consumed by all of the CPUs during preparation for DVFS execution; and “Const” of the third term expresses the power consumption for DVFS. The sum of the power consumption expressed by the second and third terms is the overhead for executing DVFS.
TCPU_i is the period from an issuance of a CPU suspension instruction by the coprocessor 12, until the suspension of the CPU#i. TBUS′ is the period from the suspension of all of the CPUs, until the suspension of the bus 20. TBUS′ is expressed by equation (8). In other words, TBUS′ is the larger value among 0 and, TBUS less the largest value of TCPU_k. If the value of TBUS′ is 0, a state is indicated where the bus 20 has suspended operation while a CPU performing data processing is present.

TBUS′=max{0,TBus−max {TCPU_k|k=0,1, . . . ,N}}  (8)

3. Discriminant Synthesis
The discriminant may be, for example, an equation subtracting the power consumption P1 when DVFS is not executed from the power consumption P2 when DVFS is executed. In this case, a value D of the discriminant is expressed by equation (9).




  
    
      
        D
        =
        
          
            
              P
              2
            
            -
            
              P
              1
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  0
                
                N
              
              ⁢
              
                (
                
                  
                    
                      P
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        _
                        ⁢
                        
                          
                        
                        ⁢
                        low
                      
                    
                    ⁢
                    
                      T
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        _
                        ⁢
                        
                          
                        
                        ⁢
                        low
                      
                    
                  
                  -
                  
                    
                      P
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        _
                        ⁢
                        
                          
                        
                        ⁢
                        high
                      
                    
                    ⁢
                    
                      T
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        _
                        ⁢
                        
                          
                        
                        ⁢
                        high
                      
                    
                  
                
                )
              
            
            +
            
              
                ∑
                
                  i
                  =
                  0
                
                N
              
              ⁢
              
                
                  P
                  
                    i
                    ⁢
                    
                      
                    
                    ⁢
                    _
                    ⁢
                    
                      
                    
                    ⁢
                    high
                  
                
                ⁡
                
                  (
                  
                    
                      T
                      
                        CPU
                        ⁢
                        
                          
                        
                        ⁢
                        _
                        ⁢
                        
                          
                        
                        ⁢
                        i
                      
                    
                    +
                    
                      T
                      
                        BUS
                        ′
                      
                    
                  
                  )
                
              
            
            +
            Const
          
        
      
    
    
      
        (
        9
        )
      
    
  




4. Judgment of Whether to Execute DVFS
When the value D of the discriminant is less than 0, power consumption is estimated to be lower with execution of DVFS than without execution of DVFS and therefore, DVFS may be executed. When the value D is 0 or more, power consumption is considered to not change or increase even with execution of DVFS and therefore, DVFS need not be executed.
FIG. 8 is a flowchart of the power control method according to the second embodiment. As depicted in FIG. 8, in the electronic computer 11, when the power control method is started, the collecting unit 2, for example, periodically requests the OS 38, the bus arbiter 21, and/or the DMAC 23 to provide information used in judging whether to execute DVFS. Consequently, at the determining unit 3, information concerning, for example, the deadline period for task completion, the longest execution period of a task, the average execution period for task completion, the loads of the CPUs (#1, #2, . . . , #N) 13 to 15 and whether DMA is in progress, is collected (step S21).
Based on the collected information, the determining unit 3 determines the operating frequency and the operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15 for a case where DVFS is executed (step S22). If the determined operating frequency and operating voltage do not change for any of the CPUs (#1, #2, . . . , #N) 13 to 15, i.e., values thereof are the same as the current values (step S22: no change), the flow returns to step S21.
If a CPU is present for which the determined operating frequency and operating voltage are less than the current values thereof and no CPU is present for which the values are greater than the current values (step S22: less than and nothing greater than), the deriving unit 4 derives a discriminant and calculates the value D thereof (step S23). If the value D of the discriminant is greater than 0 (step S23: D>0), the flow returns to step S21.
If the value D of the discriminant is less than 0 (step S23: D<0), the executing unit 5 issues a suspension instruction for suspending the data processing at the CPUs (#1, #2, . . . , #N) 13 to 15 and issues a suspension instruction for suspending operation of the bus 20 (step S24). Consequently, the data processing at all of the CPUs (#1, #2, . . . , #N) 13 to 15 and the operation of the bus 20 are suspended.
Thereafter, the changing unit 37 executes DVFS, upon receiving notification that suspension of all of the CPUs (#1, #2, . . . , #N) 13 to 15 and the bus 20 has been completed (step S25). Consequently, the operating frequency and the operating voltage of the CPUs (#1, #2, . . . , #N) 13 to 15 are switched to the operating frequencies and the operating voltages determined at step S22. The executing unit 5 issues an instruction to the CPUs (#1, #2, . . . , #N) 13 to 15, to resume the applications (step S26). Consequently, the CPUs (#1, #2, . . . , #N) 13 to 15 resume data processing. The flow returns to step S21 and the series of operations are repeated.
If a CPU is present for which the operating frequency and the operating voltage determined by the determining unit 3 are greater than the current values thereof (step S22: greater than), the operation at step S23 is omitted and the flow proceeds to step S24. In this case, for a CPU for which the operating frequency and the operating voltage are greater than the current values thereof, the operating frequency and the operating voltage thereof are switched to values that are greater than the current values by DVFS because continuation of the data processing at the current operating frequency and operating voltage cannot satisfy the deadline period and therefore, data processing has to be performed faster than the current speed.
As example where power consumption can be reduced more when DVFS is not executed than in a case where DVFS is executed, will be described as an example of an effect of the second embodiment. For simplicity, in the configuration depicted in FIG. 3, the electronic computer 11 is assumed to have 2 CPUs (#1, #2) 13, 14.
For example, the tasks #A and #B are assumed to be under execution by the CPU#1_13 and the tasks #0 and #D are assumed to be under execution by the CPU#2_14. Further, the time slice for the tasks #A and #B is assumed to be 2 msec; and the time slice for the tasks #0 and #D is assumed to be 1 msec. The power consumption of the coprocessor 12 is assumed to be 10 mW; the power consumption of the CPU#1_13 is assumed to be 100 mW; and the power consumption of the CPU#2_14 is assumed to be 50 mW. The period until the tasks #A and #B are completed is 10 msec and the period until the tasks #0 and #D are completed is 5 msec.
With the operation state above, the power consumption for completion of all the tasks in a case where DVFS is not executed is expressed by equation (10). In equation (10), the first term on the left side expresses the power consumption of the coprocessor 12; the second term expresses the power consumption of the CPU#1_13; and the third term expresses the power consumption of the CPU#2_14.
Power consumption if DVFS not executed:

10 (mW)×10 (msec)+100 (mW)×10 (msec)+50 (mW)×5 (msec)=1350 (mW×msec)  (10)

Next, the determining unit 3 is assumed to half the frequency of the CPU#2_14 and accordingly, is further assumed to lower the power to 20 mW. In this case, since the frequency of the CPU#2_14 has been halved, the period until the tasks #0 and #D are completed becomes 10 msec, 2 times the 5 msec above. Therefore, the power consumption for completion of all the tasks in a case where DVFS is executed is expressed by equation (11). In equation (11), the first term on the left side expresses the power consumption of the coprocessor 12; the second term expresses the power consumption of the CPU#1_13; and the third term expresses the power consumption of the CPU#2_14.

10 (mW)×10 (msec)+100 (mW)×10 (msec)+20 (mW)×10 (msec)=1300 (mW×msec)  (11)

In a simple comparison of equations (10) and (11), power consumption when DVFS is executed decreases more than in a case where DVFS is not executed. However, when DVFS is executed, overhead arises and therefore, consideration of overhead power consumption is also desirable.
When DVFS is executed, the CPU#1_13 and the CPU#2_14 are suspended. The average time from an issuance of a CPU suspension instruction by the executing unit 5, until suspension of the CPU#1_13 is expected to be 1⁄2 the time slice assigned to the tasks by the OS 38. The same is true for the CPU#2_14. Therefore, the period consumed from the issuance of the CPU suspension instruction, until the suspension of the CPU#1_13 and the CPU#2_14 is expressed on average by equation (12).

2 (msec)×1/2+1 (msec)×1/2=1.5 (msec)  (12)

From equation (12), in the present example, the period consumed from the issuance of the CPU suspension instruction, until the suspension of the CPU#1_13 and the CPU#2_14 is 1.5 msec on average. In other words, at the coprocessor 12, a standby period of 1.5 msec on average arises and at the CPU#1_13, a standby period of 0.5 msec on average arises. The power consumed during these standby periods is expressed by equation (13).

10 (mW)×1.5 (msec)+100 (mW)×0.5 (msec)=65 (mW×msec)  (13)

Therefore, the power consumption in a case where DVFS is executed is a sum of the value of equation (11) and the value of equation (13), and is expressed by equation (14). From equation (14), execution of DVFS with consideration of DVFS overhead results in greater power consumption than in a case where DVFS is not executed. In this case, it is better to not execute DVFS. Of course, if the power consumption for a case where DVFS is executed is less than that for a case where DVFS is not executed, it is better to execute DVFS.
Power consumption if DVFS executed:

1300 (mW×msec)+65 (mW×msec)=1365 (mW×msec)  (14)

In the discriminant, since an estimated value (expected value) is used, the value of discriminant does not necessarily reflect increases/decreases in power consumption properly. In other words, although judgment of whether to execute DVFS is based on the value D of the discriminant DVFS, the power consumption may increase. However, power consumption can be reduced the greater the number of times judgment of whether to execute DVFS is made based on the value D of the discriminant, as compared to a case where no judgment of whether to execute DVFS is made based on the value D of the discriminant. The validity of this is explained below.
A case where judgment of whether to execute DVFS is made based on the value D of the discriminant is assumed to be case 1 and a case where no judgment of whether to perform DVFS is made based on the value D of the discriminant is assumed to be case 2. Comparison of the power consumption when case 1 and case 2 have been implemented n times, respectively indicates that when n is large, the total power consumption when case 1 is implemented n times less the total power consumption when case 2 is implemented n times is less than 0. “n” is a positive integer.
The power consumption for case 2 less the power consumption for case 1 is assumed to be a random variable Xi. The total power consumption when case 1 is implemented n times less the total power consumption when case 2 is implemented n times is expressed by equation (15). Therefore, it suffices to indicate that the value of equation (15) is less than 0. In equations (15) to (18), i is an integer of 1 to n.




  
    
      
        
          
            ∑
            
              i
              =
              1
            
            n
          
          ⁢
          
            X
            i
          
        
        =
        
          
            X
            1
          
          +
          
            X
            2
          
          +
          ...
          +
          
            X
            n
          
        
      
    
    
      
        (
        15
        )
      
    
  




If the expected value of X is expressed as E[X], equation (16) holds. When the distribution of X is expressed as V[X], E[Xi] is replaced by μi, and V[Xi] is replaced by σi2, μi is 0 or less. Here, taking the average and distribution of ΣXi/n (in Σ, i can take a value of 1 to n), equations (16) and (17) hold.




  
    
      
        
          E
          ⁡
          
            [
            
              
                ∑
                
                  i
                  =
                  1
                
                n
              
              ⁢
              
                
                  X
                  i
                
                /
                n
              
            
            ]
          
        
        =
        
        ⁢
        
          
            
              E
              ⁡
              
                [
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    n
                  
                  ⁢
                  
                    X
                    i
                  
                
                ]
              
            
            /
            n
          
          =
          
          ⁢
          
            
              
                ∑
                
                  i
                  =
                  1
                
                n
              
              ⁢
              
                
                  μ
                  i
                
                /
                n
              
            
            <
            0
          
        
      
    
    
      
        (
        16
        )
      
    
  
  
    
      
        
          V
          ⁡
          
            [
            
              
                ∑
                
                  i
                  =
                  1
                
                n
              
              ⁢
              
                
                  X
                  i
                
                /
                n
              
            
            ]
          
        
        =
        
        ⁢
        
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                V
                ⁡
                
                  [
                  
                    X
                    i
                  
                  ]
                
              
              /
              
                n
                2
              
            
          
          =
          
          ⁢
          
            
              
                ∑
                
                  i
                  =
                  1
                
                n
              
              ⁢
              
                
                  σ
                  i
                  2
                
                /
                
                  n
                  2
                
              
            
            ->
            
              0
              ⁢
              
                (
                
                  n
                  ->
                  ∞
                
                )
              
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




Therefore, when n is large, equation (18) holds.




  
    
      
        
          
            ∑
            
              i
              =
              1
            
            n
          
          ⁢
          
            
              X
              i
            
            /
            n
          
        
        <
        0
      
    
    
      
        (
        18
        )
      
    
  




Equation (18), indicates that the value of equation (15) becomes less than 0. By setting a given number y of 0 or more and transforming equation (18), equation (19) is obtained. By further transforming equation (19), equation (20) is obtained and therefore, the greater n becomes, the greater the difference between case 1 and case 2 becomes.




  
    
      
        
          
            ∑
            
              i
              =
              1
            
            n
          
          ⁢
          
            
              X
              i
            
            /
            n
          
        
        <
        
          -
          y
        
      
    
    
      
        (
        19
        )
      
    
  
  
    
      
        
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              X
              i
            
          
          <
          
            -
            ny
          
        
        ->
        
          -
          
            ∞
            ⁡
            
              (
              
                n
                ->
                ∞
              
              )
            
          
        
      
    
    
      
        (
        20
        )
      
    
  




According to the second embodiment, in the electronic computer 11 that is, for example, of a distributed memory type and has parent/child relationships among all of the CPUs (#1, #2, . . . , #N) 13 to 15 including the coprocessor 12, effects identical to those of the first embodiment are obtained.
FIG. 9 is a block diagram of a hardware configuration of the electronic computer according to a third embodiment. As depicted in FIG. 9, the electronic computer 11 according to the third embodiment is a shared-memory-type computing device and has a shared memory discriminant synthesizing unit connected to the bus 20. Otherwise, hardware and functional configurations of the electronic computer 11 are identical to those of the second embodiment and description thereof is omitted.
FIG. 10 is a diagram of operations until data processing is suspended at all of the CPUs in the electronic computer according to the third embodiment. As depicted in FIG. 10, in the architecture of the third embodiment, there are no parent/child relations among the coprocessor 12, the CPU#1_13, the CPU#2_14, . . . , and the CPU#N_15. The coprocessor 12 and the CPUs (#1, #2, . . . , #N) 13 to 15 can send messages to one another via shared memory 24.
When DVFS is to be executed, the coprocessor 12 issues a data processing suspension instruction for all of the CPUs (#1, #2, . . . , #N) 13 to 15 and gives notification of a suspension of data processing (step S31). The coprocessor 12 suspends operation (step S32).
The CPUs (#1, #2, . . . , #N) 13 to 15, upon receiving notification of the data processing suspension from the coprocessor 12, respectively suspend data processing (step S33 to step S35). After the CPUs (#1, #2, . . . , #N) 13 to 15 have suspended data processing, the periods until the data processing at the remaining CPUs processing data is suspended are the standby periods 41, 42, and 44 of the coprocessor 12 and the CPUs (#1, #2, . . . , #N) 13 to 15.
When the last remaining CPU processing data (the CPU#2_14 in the depicted example) suspends data processing, all applications are suspended (step S36). No standby period arises for the CPU that suspends data processing last, e.g., the CPU#2_14. During the standby periods 41, 42, and 44 of the coprocessor 12 and the CPUs (#1, . . . , #N) 13, 15, power is wastefully consumed.
The operations depicted in FIG. 10 are the same in a case where mutual messaging is possible in a distributed-memory-type electronic computer, without parent/child relations between the coprocessor 12 and the CPUs (#1, #2, #N) 13 to 15. Therefore, in the third embodiment, the description hereinafter includes an example of the distributed-memory-type electronic computer in which mutual messaging is possible.
Depending on how time slices are assumed to be assigned to tasks, the standby periods of the CPUs can be estimated by, for example, the following 3 methods.
First Estimation Method
At the CPUs (#1, #2, #N) 13 to 15, the load of the software under execution is assumed to be equivalent and therefore, the time slices assigned for each of the tasks are equivalent and assumed to be T.
In this case, if the period Xk until the CPUs (#1, #2, #N) 13 to 15 are suspended is regarded as a random variable, each period Xk independently follows a uniform distribution of [0,T]. In other words, the period Xk has an equivalent probability of taking a value between 0 to T; and no dependency relation is present between Xi and Xj (where, i≠j). Assuming the probability of the random variable X being a constant x or less to be P(X<x), for mutually independent X and Y, by a theorem, equation (21) holds.

P(X<x)P(Y<y)=P(X<x and Y<y)  (21)

The probability that the period Xk until the suspension of the CPU that is suspended at the latest timing is the constant x or less is expressed by equations (22) to (24) according to the range of x.




  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                1
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              0
            
            <
            x
            <
            T
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                
                                  
                                    X
                                    i
                                  
                                  |
                                  i
                                
                                =
                                1
                              
                              ,
                              2
                              ,
                              ...
                              ⁢
                              
                                
                              
                              ,
                              N
                            
                            }
                          
                        
                        <
                        x
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          
                            
                              
                                X
                                1
                              
                              <
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  2
                                
                              
                              <
                            
                          
                        
                        
                          
                            
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                ...
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  N
                                
                              
                              <
                              x
                            
                          
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            1
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            2
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    ...
                    ·
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            N
                          
                          <
                          x
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      x
                      N
                    
                    /
                    
                      T
                      N
                    
                  
                
              
            
          
        
      
    
    
      
        (
        22
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                2
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              x
            
            ≤
            0
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          
                            
                              X
                              i
                            
                            |
                            i
                          
                          =
                          1
                        
                        ,
                        2
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        N
                      
                      }
                    
                  
                  <
                  x
                
                )
              
            
            =
            0
          
        
      
    
    
      
        (
        23
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                3
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              x
            
            ≥
            T
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          
                            
                              X
                              i
                            
                            |
                            i
                          
                          =
                          1
                        
                        ,
                        2
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        N
                      
                      }
                    
                  
                  <
                  x
                
                )
              
            
            =
            1
          
        
      
    
    
      
        (
        24
        )
      
    
  




The probability distribution of X is obtained by the derivative of P(X<x) and therefore, assuming the probability distribution of [max{Xi|i=1, 2, . . . , N}] as f(x), from equations (22) to (24), equation (25) is obtained.




  
    
      
        
          f
          ⁡
          
            (
            x
            )
          
        
        =
        
          {
          
            
              
                
                  
                    Nx
                    
                      N
                      -
                      1
                    
                  
                  /
                  
                    T
                    N
                  
                
              
              
                
                  (
                  
                    0
                    <
                    x
                    <
                    T
                  
                  )
                
              
            
            
              
                0
              
              
                
                  (
                  
                    x
                    ≤
                    
                      0
                      ⁢
                      
                        
                      
                      ⁢
                      or
                      ⁢
                      
                        
                      
                      ⁢
                      x
                    
                    ≥
                    T
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        25
        )
      
    
  




Here, if the expected value of X is expressed as E(X), from the definition of the expected value, equation (26) is obtained.




  
    
      
        
          
            
              
                E
                ⁡
                
                  [
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          
                            
                              X
                              i
                            
                            |
                            i
                          
                          =
                          1
                        
                        ,
                        2
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        N
                      
                      }
                    
                  
                  ]
                
              
              =
              
              ⁢
              
                
                  ∫
                  
                    -
                    ∞
                  
                  ∞
                
                ⁢
                
                  
                    xf
                    ⁡
                    
                      (
                      x
                      )
                    
                  
                  ⁢
                  
                    d
                    x
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∫
                  0
                  T
                
                ⁢
                
                  
                    
                      Nx
                      N
                    
                    /
                    
                      T
                      N
                    
                  
                  ⁢
                  
                    d
                    x
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    [
                    
                      
                        
                          Nx
                          
                            N
                            +
                            1
                          
                        
                        /
                        N
                      
                      +
                      1
                    
                    ]
                  
                  0
                  T
                
                /
                
                  T
                  N
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                NT
                /
                
                  (
                  
                    N
                    +
                    1
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        26
        )
      
    
  




Further, from the linearity of the expected value, equation (27) holds and therefore, TCPU_k is expressed by equation (28).




  
    
      
        
          E
          ⁡
          
            (
            
              X
              +
              Y
            
            )
          
        
        =
        
          
            E
            ⁡
            
              (
              X
              )
            
          
          +
          
            E
            ⁡
            
              (
              Y
              )
            
          
        
      
    
    
      
        (
        27
        )
      
    
  
  
    
      
        
          
            
              
                T
                
                  CPU
                  ⁢
                  
                    
                  
                  ⁢
                  _
                  ⁢
                  
                    
                  
                  ⁢
                  k
                
              
              =
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    
                      max
                      ⁢
                      
                        {
                        
                          
                            
                              
                                X
                                i
                              
                              |
                              i
                            
                            =
                            1
                          
                          ,
                          2
                          ,
                          ...
                          ⁢
                          
                            
                          
                          ,
                          N
                        
                        }
                      
                    
                    -
                    
                      X
                      k
                    
                  
                  ]
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  E
                  ⁡
                  
                    [
                    
                      max
                      ⁢
                      
                        {
                        
                          
                            
                              
                                X
                                i
                              
                              |
                              i
                            
                            =
                            1
                          
                          ,
                          2
                          ,
                          ...
                          ⁢
                          
                            
                          
                          ,
                          N
                        
                        }
                      
                    
                    ]
                  
                
                -
                
                  E
                  ⁡
                  
                    [
                    
                      X
                      k
                    
                    ]
                  
                
              
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




For an arbitrary element iε{1, 2, . . . , N}, expected values of X are [E(Xi)=T/2] and [E(X0)=0]. Therefore, from equations (26) and (28), TCPU_k is expressed by equation (29), where the coprocessor 12 is assumed as the 0-th CPU and therefore, TCPU_0 is the standby period of the coprocessor 12.




  
    
      
        
          T
          
            CPU
            ⁢
            
              
            
            ⁢
            _
            ⁢
            
              
            
            ⁢
            k
          
        
        =
        
          {
          
            
              
                
                  
                    NT
                    /
                    
                      (
                      
                        N
                        +
                        1
                      
                      )
                    
                  
                  -
                  
                    T
                    /
                    2
                  
                
              
              
                
                  (
                  
                    k
                    >
                    0
                  
                  )
                
              
            
            
              
                
                  NT
                  /
                  
                    (
                    
                      N
                      +
                      1
                    
                    )
                  
                
              
              
                
                  (
                  
                    k
                    =
                    0
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        29
        )
      
    
  




Second Estimation Method
At the CPUs (#1, #2, #N) 13 to 15, the load of the applications under execution is assumed to be equivalent and the time slices of the application under execution by the CPU#k are all assumed to be Tk. In other words, it is assumed that the time slices of the application under execution by the CPU#1_13 are T1; the time slices of the application under execution by the CPU#2_14 are T2; and T1 and T2 need not be equivalent.
In this case, if the period Xk until the CPUs (#1, #2, #N) 13 to 15 are suspended is regarded as a random variable, each Xk independently follows a uniform distribution of [0,Tk]. This is without loss of generality even for T1<T2< . . . <TN.
The probability that the period Xk until the suspension of the CPU that is suspended at the latest timing is the constant x or less is expressed by equations (30) to (32) according to the range of x for T1 and T2.




  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                1
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              x
            
            ≤
            0
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          
                            
                              X
                              i
                            
                            |
                            i
                          
                          =
                          1
                        
                        ,
                        2
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        N
                      
                      }
                    
                  
                  <
                  x
                
                )
              
            
            =
            0
          
        
      
    
    
      
        (
        30
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                2
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              0
            
            <
            x
            <
            
              T
              1
            
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                
                                  
                                    X
                                    i
                                  
                                  |
                                  i
                                
                                =
                                1
                              
                              ,
                              2
                              ,
                              ...
                              ⁢
                              
                                
                              
                              ,
                              N
                            
                            }
                          
                        
                        <
                        x
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          
                            
                              
                                X
                                1
                              
                              <
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  2
                                
                              
                              <
                            
                          
                        
                        
                          
                            
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                ...
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  N
                                
                              
                              <
                              x
                            
                          
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            1
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            2
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    
                      ...
                      .
                    
                    ·
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            N
                          
                          <
                          x
                        
                        )
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        31
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                3
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              
                T
                1
              
            
            <
            x
            <
            
              T
              2
            
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                
                                  
                                    X
                                    i
                                  
                                  |
                                  i
                                
                                =
                                1
                              
                              ,
                              2
                              ,
                              ...
                              ⁢
                              
                                
                              
                              ,
                              N
                            
                            }
                          
                        
                        <
                        x
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          
                            
                              
                                X
                                1
                              
                              <
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  2
                                
                              
                              <
                            
                          
                        
                        
                          
                            
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                ...
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  N
                                
                              
                              <
                              x
                            
                          
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            2
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    ...
                    ·
                  
                
              
            
            
              
                
                  
                  ⁢
                  
                    P
                    ⁢
                    
                      (
                      
                        
                          X
                          N
                        
                        <
                        x
                      
                      )
                    
                    ⁢
                    
                      (
                      
                        
                          ∵
                          
                            P
                            ⁡
                            
                              (
                              
                                
                                  X
                                  1
                                
                                <
                                x
                              
                              )
                            
                          
                        
                        =
                        1
                      
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        32
        )
      
    
  




In general, the probability that Xk is the constant x or less is expressed by equations (33) and (34) according to the range of x for Ti and Ti+1.




  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                4
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              
                T
                i
              
            
            <
            x
            <
            
              
                T
                
                  i
                  +
                  1
                
              
              ⁡
              
                (
                
                  
                    i
                    =
                    0
                  
                  ,
                  1
                  ,
                  2
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    N
                    -
                    1
                  
                
                )
              
            
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                
                                  
                                    X
                                    i
                                  
                                  ⁢
                                  i
                                
                                =
                                1
                              
                              ,
                              2
                              ,
                              ...
                              ⁢
                              
                                
                              
                              ,
                              N
                            
                            }
                          
                        
                        <
                        x
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          
                            
                              
                                X
                                1
                              
                              <
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  2
                                
                              
                              <
                            
                          
                        
                        
                          
                            
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                ...
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  N
                                
                              
                              <
                              x
                            
                          
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            
                              i
                              +
                              1
                            
                          
                          <
                          x
                        
                        )
                      
                    
                    ·
                    ...
                    ·
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            X
                            N
                          
                          <
                          x
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      x
                      
                        N
                        -
                        i
                      
                    
                    /
                    
                      
                        ∏
                        
                          j
                          =
                          
                            i
                            +
                            1
                          
                        
                        N
                      
                      ⁢
                      
                        
                          T
                          j
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            
                              Where
                              ⁢
                              
                                
                              
                              ⁢
                              
                                T
                                0
                              
                            
                            =
                            0
                          
                          )
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        33
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                (
                5
                )
              
              ⁢
              
                
              
              ⁢
              If
              ⁢
              
                
              
              ⁢
              
                T
                N
              
            
            <
            x
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                
                                  
                                    X
                                    i
                                  
                                  |
                                  i
                                
                                =
                                1
                              
                              ,
                              2
                              ,
                              ...
                              ⁢
                              
                                
                              
                              ,
                              N
                            
                            }
                          
                        
                        <
                        x
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          
                            
                              
                                X
                                1
                              
                              <
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  2
                                
                              
                              <
                            
                          
                        
                        
                          
                            
                              
                                x
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                ...
                                ⁢
                                
                                  
                                
                                ⁢
                                and
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  X
                                  N
                                
                              
                              <
                              x
                            
                          
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  1
                
              
            
          
        
      
    
    
      
        (
        34
        )
      
    
  




If the probability distribution of [max{Xi|i=1, 2, . . . , N}] is assumed as f(x), from equations (30) to (34), equation (35) is obtained.




  
    
      
        
          f
          ⁡
          
            (
            x
            )
          
        
        =
        
          {
          
            
              
                
                  
                    (
                    
                      N
                      -
                      i
                    
                    )
                  
                  ⁢
                  
                    
                      x
                      
                        N
                        -
                        i
                        -
                        1
                      
                    
                    /
                    
                      
                        ∏
                        
                          j
                          =
                          
                            i
                            +
                            1
                          
                        
                        N
                      
                      ⁢
                      
                        T
                        j
                      
                    
                  
                
              
              
                
                  (
                  
                    
                      T
                      i
                    
                    <
                    x
                    <
                    
                      T
                      
                        i
                        +
                        1
                      
                    
                  
                  )
                
              
            
            
              
                0
              
              
                
                  (
                  
                    0
                    ≤
                    
                      x
                      ⁢
                      
                        
                      
                      ⁢
                      or
                      ⁢
                      
                        
                      
                      ⁢
                      x
                    
                    ≥
                    
                      T
                      N
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        35
        )
      
    
  




Here, if the expected value of X is expressed as E(X), equation (36) is obtained.




  
    
      
        
          E
          ⁡
          
            [
            
              max
              ⁢
              
                {
                
                  
                    
                      
                        X
                        i
                      
                      |
                      i
                    
                    =
                    1
                  
                  ,
                  2
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  N
                
                }
              
            
            ]
          
        
        =
        
          
            
              ∫
              
                -
                ∞
              
              ∞
            
            ⁢
            
              
                xf
                ⁡
                
                  (
                  x
                  )
                
              
              ⁢
              
                d
                x
              
            
          
          =
          
            
              ∑
              
                i
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
                [
                
                  
                    (
                    
                      N
                      -
                      i
                    
                    )
                  
                  ⁢
                  
                    
                      x
                      
                        N
                        -
                        i
                        +
                        1
                      
                    
                    /
                    
                      {
                      
                        
                          (
                          
                            N
                            -
                            i
                            +
                            1
                          
                          )
                        
                        ⁢
                        
                          
                            ∏
                            
                              j
                              =
                              
                                i
                                +
                                1
                              
                            
                            N
                          
                          ⁢
                          
                            T
                            j
                          
                        
                      
                      }
                    
                  
                
                ]
              
              
                T
                i
              
              
                T
                
                  i
                  +
                  1
                
              
            
          
        
      
    
    
      
        (
        36
        )
      
    
  




For an arbitrary element iε{1, 2, . . . , N}, the expected values of X are [E(Xi)=Ti/2] and [E(X0)=0]. Therefore, from equations (28) and (36), TCPU_k is expressed by equation (37), where the coprocessor 12 is assumed as the 0-th CPU and therefore, TCPU_0 is the standby period of the coprocessor 12.




  
    
      
        
          T
          
            CPU
            ⁢
            
              
            
            ⁢
            _
            ⁢
            
              
            
            ⁢
            k
          
        
        =
        
          {
          
            
              
                
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        [
                        
                          
                            (
                            
                              N
                              -
                              i
                            
                            )
                          
                          ⁢
                          
                            
                              x
                              
                                N
                                -
                                i
                                +
                                1
                              
                            
                            /
                            
                              {
                              
                                
                                  (
                                  
                                    N
                                    -
                                    i
                                    +
                                    1
                                  
                                  )
                                
                                ⁢
                                
                                  
                                    ∏
                                    
                                      j
                                      =
                                      
                                        i
                                        +
                                        1
                                      
                                    
                                    N
                                  
                                  ⁢
                                  
                                    T
                                    j
                                  
                                
                              
                              }
                            
                          
                        
                        ]
                      
                      
                        T
                        i
                      
                      
                        T
                        
                          i
                          +
                          1
                        
                      
                    
                  
                  -
                  
                    
                      T
                      k
                    
                    /
                    2
                  
                
              
              
                
                  (
                  
                    k
                    >
                    0
                  
                  )
                
              
            
            
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      [
                      
                        
                          (
                          
                            N
                            -
                            i
                          
                          )
                        
                        ⁢
                        
                          
                            x
                            
                              N
                              -
                              i
                              +
                              1
                            
                          
                          /
                          
                            {
                            
                              
                                (
                                
                                  N
                                  -
                                  i
                                  +
                                  1
                                
                                )
                              
                              ⁢
                              
                                
                                  ∏
                                  
                                    j
                                    =
                                    
                                      i
                                      +
                                      1
                                    
                                  
                                  N
                                
                                ⁢
                                
                                  T
                                  j
                                
                              
                            
                            }
                          
                        
                      
                      ]
                    
                    
                      T
                      i
                    
                    
                      T
                      
                        i
                        +
                        1
                      
                    
                  
                
              
              
                
                  (
                  
                    k
                    =
                    0
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        37
        )
      
    
  




Third Estimation Method
Here, it is assumed that time slices may vary according to CPU#k and that at the CPUs (#1, #2, #N) 13 to 15, time slices may vary according to task. The time slice of a task under execution by the CPU#k is assumed to be T(1)k, . . . , T(m)k, where m is an integer of 2 or more and may vary according to the value of k. “k” is an integer of 1 to N.
In this case, the period Xk until the CPUs (#1, #2, #N) 13 to 15 are suspended is regarded as a random variable. Further, if each Y(i)k is assumed to independently follow a uniform distribution of [0,T(i)k], Xk is expressed by equation (38). Therefore, the expected value E[Xk] is expressed by equation (39).

Xk=Y(1)k(T(1)k/(T(1)k+T(2)k+ . . . +T(m)k))+ . . . +Y(m)k(T(m)k/T(1)k+T(2)k+ . . . +T(m)k))  (38)

E[Xk]=(T(1)k2+ . . . +T(m)k2)/{2(T(1)k+ . . . +T(m)k)}  (39)

If Xk is approximated by uniform distribution, Xk follows a uniform distribution of [0,Tk], where Tk in this case is expressed by equation (40). This is without loss of generality even for T1<T2< . . . <TN.

E[Xk]=(T(1)k2+ . . . +T(m)k2)/(T(1)k+ . . . +T(m)k)  (40)

Similar to the equation derivation method in the second estimation method, when TCPU_k is obtained, equation (37) is obtained, where in equation (37), Tk is obtained by equation (40).
In the third embodiment, explanation of the results of recursive judgment concerning DVFS execution, using the method of estimating the operation suspension period of the bus, the discriminant derivation method, the power control method and the discriminant is the same as that in the second embodiment and is therefore omitted.
According to the third embodiment, with a shared memory configuration or a configuration without parent/child relations between the CPUs (#1, #2, #N) 13 to 15 including the coprocessor 12, such as in the electronic computer 11 configured to have distributed memory, effects identical to those of the first embodiment are obtained.
The power control apparatus, the electronic computer, and the power control method of the embodiments enable power consumption to be reduced.
All examples and conditional language provided herein are intended for pedagogical purposes of aiding the reader in understanding the invention and the concepts contributed by the inventor to further the art, and are not to be construed as limitations to such specifically recited examples and conditions, nor does the organization of such examples in the specification relate to a showing of the superiority and inferiority of the invention. Although one or more embodiments of the present invention have been described in detail, it should be understood that the various changes, substitutions, and alterations could be made hereto without departing from the spirit and scope of the invention.

## Claims

1. A power control apparatus comprising
a processor configured to:
collect first information related to operation of a performing unit configured to perform data processing and second information related to operation of a bus configured to transfer data;
determine an operating frequency and an operating voltage for the performing unit, based on the first information and the second information;
estimate based on the first information and the second information, a first period elapsing until the performing unit suspends data processing that is being performed and a second period elapsing until the bus suspends data transmission that is being conducted;
derive a discriminant that obtains a difference of total power consumption and power consumption pre-switching, the total power consumption being power consumed in a case of switching the operation of the performing unit based on the determined operating frequency and operating voltage plus power consumed during the estimated first and second periods; and
execute a switching of an operating frequency and an operating voltage of the performing unit, based on a value of the discriminant.

2. The power control apparatus according to claim 1, wherein
the first information includes third information concerning a load of a task under execution by the performing unit, and
the processor estimates the first period, based on the third information.

3. The power control apparatus according to claim 1, wherein
the second information includes fourth information indicating whether the bus is being operated for direct memory access and fifth information concerning a data volume transferred by one direct memory access, and
the processor estimates the second period, based on the fourth information and the fifth information.

4. The power control apparatus according to claim 1, further comprising
a changing unit configured to change the operating frequency and the operating voltage of the performing unit, wherein
the processor executes the switching when the value of the discriminant is less than zero, and
the changing unit changes any one among the operating frequency and the operating voltage of the performing unit to the operating frequency or the operating voltage determined for the performing unit by the processor, if the processor executes the switching.

5. The power control apparatus according to claim 1, wherein
the processor collects for each performing unit among a plurality of the performing units, the first information,
the processor determines for each performing unit among the plurality of performing units, the operating frequency and the operating voltage,
the processor estimates for each performing unit among the plurality of the performing units, the first period, determines for each performing unit among the plurality of the performing units, power consumed during the estimated first period, and sums the power as the total power consumption, and
the processor executes the switching when among the plurality of the performing units, a performing unit is present for which a post-switching operating frequency and a post-switching operating voltage are less than a pre-switching operating frequency and a pre-switching operating voltage and for other performing units among the plurality of the performing units, the post-switching operating frequency and the post-switching operating voltage are less than or equal to the pre-switching operating frequency and the pre-switching operating voltage.

6. An electronic computer comprising:
a performing unit configured to perform data processing; and
a bus configured to transfer data; and
a processor configured to:
collect first information related to operation of the performing unit and second information related to operation of the bus;
determine an operating frequency and an operating voltage for the performing unit, based on the first information and the second information;
estimate based on the first information and the second information, a first period elapsing until the performing unit suspends data processing that is being performed and a second period elapsing until the bus suspends data transmission that is being conducted;
derive a discriminant that obtains a difference of total power consumption and power consumption pre-switching, the total power consumption being power consumed in a case of switching the operation of the performing unit based on the determined operating frequency and operating voltage plus power consumed during the estimated first and second periods; and
execute a switching of an operating frequency and an operating voltage of the performing unit, based on a value of the discriminant.

7. The electronic computer according to claim 6, wherein
the first information includes third information concerning a load of a task under execution by the performing unit, and
the processor estimates the first period, based on the third information.

8. The electronic computer according to claim 6, wherein
the second information includes fourth information indicating whether the bus is being operated for direct memory access and fifth information concerning a data volume transferred by one direct memory access, and
the processor estimates the second period, based on the fourth information and the fifth information.

9. The electronic computer according to claim 6, further comprising
a changing unit configured to change the operating frequency and the operating voltage of the performing unit, wherein
the processor executes the switching when the value of the discriminant is less than zero, and
the changing unit changes any one among the operating frequency and the operating voltage of the performing unit to the operating frequency or the operating voltage determined for the performing unit by the processor, if the processor executes the switching.

10. The electronic computer according to claim 6, wherein
the processor collects for each performing unit among a plurality of the performing units, the first information,
the processor determines for each performing unit among the plurality of performing units, the operating frequency and the operating voltage,
the processor estimates for each performing unit among the plurality of the performing units, the first period, determines for each performing unit among the plurality of the performing units, power consumed during the estimated first period, and sums the power as the total power consumption, and
the processor executes the switching when among the plurality of the performing units, a performing unit is present for which a post-switching operating frequency and a post-switching operating voltage are less than a pre-switching operating frequency and a pre-switching operating voltage and for other performing units among the plurality of the performing units, the post-switching operating frequency and the post-switching operating voltage are less than or equal to the pre-switching operating frequency and the pre-switching operating voltage.

11. A power control method comprising:
collecting first information related to operation of a performing unit configured to perform data processing and second information related to operation of a bus configured to transfer data;
determining an operating frequency and an operating voltage for the performing unit, based on the first information and the second information;
estimating based on the first information and the second information, a first period elapsing until the performing unit suspends data processing that is being performed and a second period elapsing until the bus suspends data transmission that is being conducted;
deriving a discriminant that obtains a difference of total power consumption and power consumption pre-switching, the total power consumption being power consumed in a case of switching the operation of the performing unit based on the determined operating frequency and operating voltage plus power consumed during the estimated first and second periods; and
executing a switching of an operating frequency and an operating voltage of the performing unit, based on a value of the discriminant, wherein
the power control method is executed by a processor.

12. The power control method according to claim 11, wherein
the first information includes third information concerning a load of a task under execution by the performing unit, and
the estimating includes estimating the first period, based on the third information.

13. The power control method according to claim 11, wherein
the second information includes fourth information indicating whether the bus is being operated for direct memory access and fifth information concerning a data volume transferred by one direct memory access, and
the estimating includes estimating the second period, based on the fourth information and the fifth information.

14. The power control method according to claim 11, wherein
the executing includes executing the switching when the value of the discriminant is less than zero, and
further comprising changing any one among the operating frequency and the operating voltage of performing unit to the operating frequency or the operating voltage determined for the performing unit at the determining, if the switching is executed.

15. The power control method according to claim 11, wherein
the collecting includes collecting for each performing unit among a plurality of the performing units, the first information,
the determining includes determining for each performing unit among the plurality of performing units, the operating frequency and the operating voltage,
the estimating includes estimating for each performing unit among the plurality of the performing units, the first period,
the power control method further comprising:
determining for each performing unit among the plurality of the performing units, power consumed during the estimated first period; and
summing the power as the total power consumption, wherein

the executing includes executing the switching when among the plurality of the performing units, a performing unit is present for which a post-switching operating frequency and a post-switching operating voltage are less than a pre-switching operating frequency and a pre-switching operating voltage and for other performing units among the plurality of the performing units, the post-switching operating frequency and the post-switching operating voltage are less than or equal to the pre-switching operating frequency and the pre-switching operating voltage.