JPS5819958A - Degenerating method for computer - Google Patents

Abstract

PURPOSE:To eliminate a heavy fault of a system, by giving an execution priority level to tasks preliminarily on a basis of their classifications and inhibiting the execution of a task having the lowest exeuction priority level when the load of the computer attains high abnormally. CONSTITUTION:One unit of the work to be executed in a computer is defined as a task; and each time the execution request of a task is generated, an execution request generation order and an execution priority level predetermined for this task are given, and the task is registered in a task queue 1. The queue is inspected by a task response scheduler 2, and a task having the first execution request generation order out of tasks stored in the queue is executed by a task execution scheduler 3. The task for which execution is terminated is erased from the queue 1. If the total number of tasks registered in the queue 1 attains a prescribed value, the response scheduler 2 erases a task, which has the lowest execution priority level and the last execution request generation order, out of tasks registered in the queue 1.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a computer degeneration method for efficiently operating a computer when the load on the computer becomes abnormally high.

When designing a computer system, the system should be designed to have enough processing power to cause no problems in normal operation! When external conditions change or when an abnormal situation occurs, the load on the computer becomes abnormally high and the computer cannot handle the processing, resulting in a serious system failure.

This invention was made in order to eliminate the above-mentioned drawbacks of conventional devices.
sk)) is assigned an execution priority in advance according to the type of task, and if the load on the computer becomes abnormally high, the execution of tasks with lower execution priority is stopped, thereby avoiding serious system failures. The purpose is to provide a computer degeneracy method that allows

Hereinafter, the present invention will be described in detail with reference to the drawings. The drawing is a block diagram showing an embodiment of the present invention, in which (1) is a task queue (2)
is a task response scheduler.
5ehedulsr (3) Fi task execution scheduler
).

Next, the operation will be explained. A processing unit of work in a computer system is called a task, and when a request for execution of one task occurs, the task response scheduler (2) registers it in the task queue (1). That is, write to memory. This registration is executed by the task response scheduler (2) when an execution request is issued.
The task is executed in the order responded by k, that is, in the order in which the execution request was generated, and the task is executed with a predetermined execution priority given to the task. The simplest example of this execution priority is to divide it into priorities 1 and 2, with priority 1 tasks being tasks that must be executed regardless of the computer load, and priority 2 tasks.
These tasks should not cause serious failures even if they are executed frequently. Whether the load on the computer has exceeded a predetermined value is determined by the fact that the total number of tasks registered in the task queue (1) K has exceeded a predetermined value (hereinafter referred to as N).

The task response scheduler (2) examines the task queue (11), and causes the task execution scheduler (3) to execute the task that is first in the order of execution requests among the registered tasks. When execution is completed, the completed task is deleted from the task queue (1).

When the total number of tasks registered in the task queue (1) reaches N, the task response scheduler (2) selects the task with the lowest execution priority from among the K registered tasks in the task queue (1). Delete the last task in the order of execution requests. Therefore, the total number of tasks registered in the task queue (11) is maintained at (N-1)K.As in the example explained earlier, the execution priority is divided into two levels, 1 and 2. Then, when the total number of tasks registered in the task queue (1) is (N-1), when a request for execution of a task with priority 2 (hereinafter referred to as task person) occurs, this task AFi
The tasks are registered in the task queue (1), but at that time the total number of tasks is N, so the task response scheduler (2)
) deletes task A, which was last registered with priority 2, which has the same result as task A not being registered.

Further, when the total number of tasks is (N-1), when a request for execution of a task with priority f1 occurs, this task is registered and one task with priority 2 is deleted in its place.

Since priority 2 tasks are tasks that will not cause a major system failure even if their execution is omitted, abnormally high loads on the computer can be avoided by omitting their execution and degenerating the computer.

As described above, according to this invention, when the load on a computer becomes abnormally large, the computer is automatically degenerated as planned in advance, thereby avoiding a serious system failure. Therefore, under normal operating conditions, the system of the present invention can be designed with less hardware than conventional systems when the tasks to be handled are the same.

[Brief explanation of the drawing]

The drawing is a block diagram showing an embodiment of the present invention. (1)...Task queue, (2)...Task response scheduler, (3)...Task execution scheduler. Agent Shin Kuzuno −

Claims (1)

[Claims] One unit of work to be executed by a computer is defined as a task, and when a task execution request occurs, the order of occurrence of the execution request is attached to the request, and a predetermined execution priority is attached to the task. There is a step of registering a task in the queue, and a task response scheduler checks the queue of the above tasks, neutralizes the queue, executes the task whose execution request is first in the order of occurrence among the stored tasks, and executes this task with the task execution scheduler. a step of deleting the task whose execution has been completed from the task queue; and when the total number of tasks registered in the task queue reaches a predetermined value, the task response scheduler is registered in the task queue. (1) A method for degenerating a computer, which includes the step of deleting the task with the lowest execution priority and the last task in the order of execution requests.