Process scheduling system that allocates CPU time with priority to interactive type processes

Claim 2

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as either interactive type or non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for storing the action status of each process in which the results of the monitoring of the action status of each process by said means for monitoring the action status of each process are stored; and wherein, when said means for monitoring the action status of each process starts operation at a time of process switching, the CPU time used by the process that was being executed before said switching since the last process switching is computed, and a result of said computation is added to a value stored in a cumulative CPU time storage location, corresponding to said process within said means for storing the action status of each process, and the result of the addition is stored in said location as a new cumulative CPU time value.

Claim 3

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for storing the action status of each process in which the results of the monitoring of the action status of each process by said means for monitoring the action status of each process are stored; and wherein, when the process to which the CPU has been allocated starts a period of idle time, said means for monitoring the action status of each process stores said sleep start time in the idling start time storage location corresponding to said process within said means for storing the process action status.

Claim 4

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for storing the action status of each process in which the results of the monitoring of the action status of each process by said means for monitoring the action status of each process are stored; and wherein, when the process to which the CPU has been allocated starts a period of idle time, said means for monitoring the action status of each process stores said sleep start time in the idling start time storage location corresponding to said process within said means for storing the process action status.

Claim 5

A process scheduling system as described in claim 2 wherein, when the period of idle time of a process ends, said means for monitoring the process action status starts up, finds the difference between said idling end time and the idling start time stored in the idling start time storage location corresponding to said process within said means for monitoring the process action status, and clears a value of the cumulative CPU time storage location corresponding to said process in said means for monitoring the action status of each process to zero when said difference exceeds a predetermined value.

Claim 6

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for storing the action status of each process in which the results of the monitoring of the action status of each process by said means for monitoring the action status of each process are stored: and wherein, said means for determining the process type compares the cumulative CPU time used by each process stored in said means for storing the process action status and a predetermined threshold value and, classifies a process as the interactive type when the corresponding CPU time is smaller than the threshold value, and as the non-interactive type in the opposite case.

Claim 7

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for storing the action status of each process in which the results of the monitoring of the action status of each process by said means for monitoring the action status of each process are stored: and wherein, said means for determining the process type compares the cumulative CPU time used by each process stored in said means for storing the process action status and a predetermined threshold value and, classifies a process as the interactive type when the corresponding CPU time is smaller than the threshold value, and as the non-interactive type in the opposite case.

Claim 8

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for controlling the priority of non-interactive type processes, with which the CPU is allocated to said non-interactive type processes; and means for controlling the priority of interactive type processes, with which the CPU is allocated to said interactive type processes.

Claim 9

A computer system for processing a plurality of processes on a time-sharing basis, comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as one of an interactive type and a non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for controlling the priority of non-interactive type processes, with which the CPU is allocated to said non-interactive type processes; and means for controlling the priority of interactive type processes, with which the CPU is allocated to said interactive type processes.

Claim 10

A process scheduling system as described in claim 7, further comprising: an interactive type process queue in which the interactive type processes, the priorities of which are controlled by said means for controlling the priority of interactive type processes, are queued in order of said priorities, and a non-interactive type process queue in which the non-interactive type processes the priorities of which are controlled by said means for controlling the priority of non-interactive type processes, are queued in order of said priorities.

Claim 11

A process scheduling system as described in claim 6 further comprising: means for selecting the process having the highest priority from among said processes that are queued in said interactive type process execution queue at the time of queuing, and for selecting the process having the highest priority from among said processes that are queued in said non-interactive type process execution queue at the time of queuing; and means for allocating the CPU to said selected process.

Claim 12

A process scheduling system as described in claim 5 further comprising an execution queue containing both the interactive type processes of which the priorities are controlled by said means for controlling the priority of interactive type processes, and the non-interactive type processes of which the priorities are controlled by said means for controlling the priority of non-interactive type processes, and in which said interactive type processes are queued within a higher priority range than said non-interactive type processes.

Claim 13

A process scheduling system as described in claim 8 further comprising: means for selecting a process having the highest priority from among the interactive type processes and the non-interactive type processes queued in said execution queue; and means for allocating the CPU to said selected process.

Claim 14

A computer system for processing a plurality of processes on a time-sharing basis comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as either interactive type or non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for controlling the priority of processes independently of the determination of process type by said means for determining the process type; means of process queuing for storing interactive type processes in the interactive type process execution queue and storing non-interactive type processes in the non-interactive type process execution queue, based on the results of priority control by said means of process priority control and the determination of the process type by said means for determining the process type; means for selecting the process of highest priority from among the processes stored in said interactive type process execution queue when such interactive type processes are stored in the queue, and selects the process of highest priority from among the processes stored in said non-interactive type process execution queue when there are no interactive type processes queued in the interactive type process execution queue; and means for allocating the CPU to said selected process.

Claim 15

A computer system for processing a plurality of processes on a time-sharing basis comprising: means for monitoring an action status of each of said plurality of processes; means for determining a process type by classifying each of said plurality of processes as either interactive type or non-interactive type, based on the results of monitoring by said means for monitoring the action status of each process; means for controlling the priority of processes independently of the determination of process type by said means for determining the process type; means of process queuing for storing interactive type processes in the interactive type process execution queue and storing non-interactive type processes in the non-interactive type process execution queue, based on the results of priority control by said means of process priority control and the determination of the process type by said means for determining the process type; means for selecting the process of highest priority from among the processes stored in said interactive type process execution queue when such interactive type processes are stored in the queue, and selects the process of highest priority from among the processes stored in said non-interactive type process execution queue when there are no interactive type processes queued in the interactive type process execution queue; and means for allocating the CPU to said selected process.

Claim 16

A process scheduling method for use in a computer system that processes a plurality of processes on a time-sharing basis, comprising the steps of: computing, at the time of process switching, the CPU time used by the process that was being executed before said switch, since the last process switch; adding the result of said computation to the value read out from the cumulative CPU time storage location corresponding to said process within a means of storage of the process action status, and storing the result of the addition in said location in place of an old value; when the process starts a period of idle time, storing said idling start time in the idling start time storage location corresponding to said process in said means for storing process action status; when a period of idle time of a process ends, finding the difference between said idling end time and the idling start time stored in the idling start time storage location corresponding to said process in said means for storing the process action status; when said difference exceeds a certain threshold value, clearing the value in the cumulative CPU time storage location corresponding to said process within said means for storing process action status to zero; comparing the value stored in the cumulative CPU time storage location within said means for storing process action status with a predetermined threshold value; classifying the process to which said cumulative CPU time storage location corresponds as an interactive type process when the value stored in the cumulative CPU time storage location is similar, as a non-interactive type process when the opposite is true; and preferentially allocation of the CPU of said computer system to a process classified as an interactive type process.

Claim 17

A process scheduling method for use in a computer system that processes a plurality of processes on a time-sharing basis, comprising the steps of: computing, at the time of process switching, the CPU time used by the process that was being executed before said switch, since the last process switch; adding the result of said computation to the value read out from the cumulative CPU time storage location corresponding to said process within a means of storage of the process action status, and storing the result of the addition in said location in place of an old value; when the process starts a period of idle time, storing said idling start time in the idling start time storage location corresponding to said process in said means for storing process action status; when a period of idle time of a process ends, finding the difference between said idling end time and the idling start time stored in the idling start time storage location corresponding to said process in said means for storing the process action status; when said difference exceeds a certain threshold value, clearing the value in the cumulative CPU time storage location corresponding to said process within said means for storing process action status to zero; comparing the value stored in the cumulative CPU time storage location within said means for storing process action status with a predetermined threshold value; classifying the process to which said cumulative CPU time storage location corresponds as an interactive type process when the value stored in the cumulative CPU time storage location is similar, as a non-interactive type process when the opposite is true; and preferentially allocation of the CPU of said computer system to a process classified as an interactive type process.

Claim 18

A process scheduling method as described in claim 11 wherein: said preferentially allocation of the CPU step further comprising the steps of: assigning CPU allocation priorities to said non-interactive type processes; assigning CPU allocation priorities to said interactive type processes; queuing said interactive type processes in an interactive type process execution queue in order of said priorities; queuing said non-interactive type processes in an interactive type process execution queue in order of said priorities; when processes are queued in said interactive type process execution queue, selecting the process having the highest priority from among said queued processes; when no processes are queued in said interactive type process execution queue, selecting the process having the highest priority from among the processed queued in said non-interactive type process execution queue; and allocating the CPU to said selected process.

Claim 19

A process scheduling method as described in claim 11 wherein: said preferentially allocation of the CPU step further comprising the steps of: assigning CPU allocation priorities to said non-interactive type processes; assigning CPU allocation priorities to said interactive type processes that are a higher range of priorities than those assigned to said non-interactive processes; queuing said interactive type processes in said execution queue in order of said priorities; queuing said non-interactive type processes in an execution queue in order of said priorities; when at least one process is queued in said execution queue, selecting the process having the highest priority from among the processed said queued processes; and allocating the CPU to said selected process.