| CPC G06F 9/485 (2013.01) [G06F 7/57 (2013.01); G06F 9/505 (2013.01)] | 20 Claims |
|
1. A method executed by a computer comprising:
executing a plurality of subtasks by using either an inexpensive execution unit or an expensive execution unit according to an inexpensive executability table indicating an inexpensive remaining quantity of tasks which may be executed by the inexpensive execution unit at each time of a day based on a simultaneous execution quantity and a completion date and time when the plurality of subtasks should be completed, wherein:
the simultaneous execution quantity is a quantity of the subtasks at each time of the day based on resources used by each of the subtasks during execution at each time of the day, available resources at each time of the day, a load on the resources used, and a remaining amount of the available resources at each time of the day,
the load on the resources used is caused by executing the subtasks,
the inexpensive execution unit may be forcibly stopped during its execution,
the expensive execution unit is never forcibly stopped during its execution,
a usage fee for using the inexpensive execution unit to execute the subtasks is inexpensive,
a usage fee for using the expensive execution unit to execute the subtasks is expensive,
the usage fee for using the expensive execution unit is higher than the usage fee for using the inexpensive execution unit, and
the executing is further to:
execute, by the inexpensive execution unit, subtasks of the subtasks within a limit of the simultaneous execution quantity so that a quantity of executions of the subtasks by the inexpensive execution unit becomes a maximum quantity which does not exceed the inexpensive remaining quantity; and
execute, by the expensive execution unit, remaining subtasks of the subtasks of the simultaneous execution quantity.
|