Information processing apparatus, control method of information processing apparatus, and control program of information processing apparatus

• US 20090089795A1
• Filed: 08/28/2008
• Published: 04/02/2009
• Est. Priority Date: 09/27/2007
• Status: Abandoned Application

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Sakiyama, Nobuo, Kimura, Tetsuro, Yoshida, Hideki
• Application Number:
  US12/230,452
• Publication Number:
  US 20090089795A1
• Time in Patent Office: Days
• US Class Current: 718/107
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

According to an embodiment of the invention, a computer readable storage medium that stores a software program causing a computer system to perform a scheduling process for executing a plurality of application programs in every processor cycles, the scheduling process includes: allocating, during a current processor cycle, processor times of a next processor cycle to each of the application programs to be executed in the next processor cycle; storing the allocated processor times of the next processor cycle; determining whether or not the application programs executed in the current processor cycle include an uncompletable application program; calculating processor idle time of the next processor cycle; and allocating an additional processor time of the next processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the next processor cycle.

Claims

1. A computer readable storage medium that stores a software program causing a computer system to perform a scheduling process for executing a plurality of application programs in every processor cycles, the scheduling process comprising:

allocating, during a current processor cycle, processor times of a next processor cycle to each of the application programs to be executed in the next processor cycle;

storing the allocated processor times of the next processor cycle;

determining whether or not the application programs executed in the current processor cycle include an uncompletable application program that will not be completed within the current processor cycle;

calculating processor idle time of the next processor cycle from a difference between a sum of the stored processor times of the next processor cycle and a length of the processor cycle, when determined that the uncompletable application program is included in the application programs, executed in the current processor cycle; and

allocating an additional processor time of the next processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the next processor cycle.

2. The computer readable storage medium according to claim 1, wherein the scheduling process further comprising:

allocating, during previous processor cycle, processor times of the current processor cycle to each of the application programs to be_executed in the current processor cycle;

storing the allocated processor times of the current processor cycle;

calculating processor idle time of the current processor cycle from a difference between a sum of the stored processor times of the current processor cycle and a length of the processor cycle, when determined that the uncompletable application program is included in the application programs executed in the current processor cycle; and

allocating an additional processor time of the current processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the current processor cycle.

3. The computer readable storage medium according to claim 2, wherein the processor idle time of the next processor cycle is allocated to the uncompletable application program when the processor idle time in the current processor cycle is not available.

4. The computer readable storage medium according to claim 1, wherein, when the determining step, processor time spent for the application programs executed in the current processor cycle and degree of progress of the application programs executed in the current processor cycle are referred for the determination.

5. The computer readable storage medium according to claim 1, wherein at least one of the application programs executed in the current processor cycle lets the computer system perform the determining step.

6. The computer readable storage medium according to claim 5, wherein at least one of the application programs includes a loop code for performing a repeat process, and

wherein, in the determining step, processor time spent for the application programs executed in the current processor cycle and number of executions of the repeat process in the current processor cycle are referred for the determination.

7. The computer readable storage medium according to claim 6, wherein at least one of the application programs is configured to indicate degree of progress of the one of the application programs, and

wherein, in the determining step, the indicated degree of progress is referred for the determination.

8. A control method of an information processing apparatus to perform a scheduling process for executing tasks for a plurality of application programs in every processor cycles, the control method comprising:

allocating, during a current processor cycle, processor times of a next processor cycle to each of the application programs to be executed in the next processor cycle;

storing the allocated processor times of the next processor cycle;

determining whether or not the application programs executed in the current processor cycle include an uncompletable application program that will not be completed within the current processor cycle;

calculating processor idle time of the next processor cycle from a difference between a sum of the stored processor times of the next processor cycle and a length of the processor cycle, when determined that the uncompletable application program is included in the application programs executed in the current processor cycle; and

allocating an additional processor time of the next processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the next processor cycle.

9. An information processing apparatus comprising:

a processor that executes a plurality of application

programs in every processor cycles; and

a memory that stores processor times,

wherein the processor operates;

allocating, during a current processor cycle, processor times of a next processor cycle to each of the application programs to be executed in the next processor cycle;

storing the allocated processor times of the next processor cycle to the memory;

determining whether or not the application programs executed in the current processor cycle include an uncompletable application program that will not be completed within the current processor cycle;

calculating processor idle time of the next processor cycle from a difference between a sum of the stored processor times of the next processor cycle and a length of the processor cycle, when determined that the uncompletable application program is included in the application programs executed in the current processor cycle; and

allocating an additional processor time of the next processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the next processor cycle.

10. An information processing apparatus comprising:

a processor that executes a plurality of application programs in every processor cycles;

a first allocation unit that allocates processor times of next processor cycle to each task of next application programs to be executed in the next processor cycle during the current processor cycle;

a storing unit that stores the allocated processor times of the next processor cycle;

a determination unit that determines whether or not the application programs executed in the current processor cycle include an uncompletable application program that will not be complete within the current processor cycle;

a calculation unit that calculates processor idle time of the next processor cycle from a difference between a sum of the stored processor times of the next processor cycle and a length of the processor cycle, when determined that the uncompletable application program is included in the application programs executed in the current processor cycle; and

a second allocation unit that allocates an additional processor time of the next processor cycle to the uncompletable application program, the additional processor time being set not to exceed the calculated processor idle time of the next processor cycle.