JPS63113636A - Event control system - Google Patents

Abstract

PURPOSE:To easily remove unnecessary event information by deleting event information when the effective time of the event information is behind the current time. CONSTITUTION:The event information whose effective time is specified by a task A in an arithmetic circuit 1a is passed to a task controller 2a to judge which of arithmetic circuits 1a, 1b... its event is registered in and which task should be controlled. Then, when this event information is to control a task B, namely,, when the event information is passed to the task registered in the arithmetic circuit 1a, the task controller 2a reads the effective time of the event information specified by an area 3a indicating the effective time and compares the effective information with the current time. When the effective time is before the current time, the event information is passed to the task B, but when the effective time is after the current time, this event is deleted in the system. The deletion is carried out by removing the event information from an event registration table.

Description

DETAILED DESCRIPTION OF THE INVENTION [Object of the Invention] (Industrial Application Field) The present invention relates to an event management method that can efficiently control tasks processed within one or more computers.

(Prior art) In recent years, with the diversification of requirements and the advancement of technology in the fields of electric power systems, systems have tended to become larger and more complex. There is an increasing demand for processing systems that perform.

In a general computer system, when a task occurs or disappears or information is exchanged between tasks, a requesting task generates an event containing task control information, and the operating system sequentially interprets this and passes it to the target task, thereby controlling the task. is executed.

Therefore, in order to execute these tasks, it is necessary to improve the efficiency of task control information that exists in one or more computers.

(Problems to be Solved by the Invention) Some of the event information exchanged between tasks as described above becomes unnecessary after its effective time due to event execution delays due to processing congestion or the like. In this case, event information that is no longer needed will remain in the system. Therefore, there is a need for processing that can deal with event information that remains in the system even after the valid time has passed. In the conventional event management system, as described above, processing of events that are no longer needed, that is, events that are executed after the effective time, is performed by controlling and managing each task.

However, there is a problem that the processing at that time becomes complicated.

Another problem is that the event processing efficiency is extremely low.

The present invention has been developed in response to these circumstances, and allows events that have passed their effective time to be no longer needed to be easily eliminated without the user being aware of them, and also improves task control efficiency. It aims to provide an event management method.

[Structure of the Invention] (Means for Solving Problems) The event management method of the present invention includes a task execution means that has at least one task and processes these tasks, and a task execution means that is connected to the task execution means. and an event information exchange means between tasks processed by the same or different task execution means, wherein the format of the event information has an area indicating a valid time of the event information, and I.
The information exchange means is characterized in that it has means for comparing the valid time of the event information with the current time and erasing the event information when the valid time exceeds the current time.

(Function) In the event management method of the present invention, the format of the event information has an area indicating the valid time of the event information, and the event information exchange means compares the valid time of the event information with the current time and determines the valid time. Since it has a means for erasing event information when the current time has passed, there is no need to process event information within a task that has passed its effective time and is no longer needed. Event information that is no longer needed will no longer be exchanged. Therefore, event information that is no longer needed after its valid time can be easily eliminated, and task control efficiency can be improved.

(Example) Hereinafter, details of an example of the present invention will be described based on the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention.

In this event management system, task control devices 2a, 2b, . . ., which serve as event exchange means 2, are connected to arithmetic circuits 1a, 1b, . . ., which serve as task execution means 1, respectively.
is connected in the - column, and the arithmetic circuits 1a, 1
The task is executed by b..., and the event information that occurred during this processing is stored in the task control bag r! 12a, 2b...
The format of the event information, as shown in FIG. 2, is composed of an area 3a indicating the effective time of the event information and an area 3b of the event information body.

In this event management method, for example, the arithmetic circuit 1a
When task A in the middle generates event information that controls tasks B and t in the same arithmetic circuit la, or task C in another arithmetic circuit lb, the valid event information is displayed in area 3a indicating the valid time of the above event information. By specifying a time, only events that arrive before this effective time↑ will be processed by the task control device 2a or 2b, and event information that arrives after the specified effective time will be processed before reaching task B or task C. is deleted by the task control device 2a or 2b.

This is accomplished by the task control devices 2a, 2b, . . . operating as shown in FIG.

First, event information for which a valid time has been specified for task A in the arithmetic circuit la is passed to the task control device 2a, and the task control device receives this event information from the arithmetic circuits 1a, 1b, . . .
Determine which tasks registered within should be controlled.

If this event information is to control task B, that is, if the event information is to be passed to a task registered in the arithmetic circuit la, this task control device 2a
reads the valid time specified in the area 3a indicating the valid time of the event information (step 401), compares this valid time with the current time (step 402), and if the valid time is before the current time, task B The event information is passed to (step 403), but if the valid time exceeds the current time, the event is deleted from the system to make it disappear (step 404).

Deletion is performed by deleting the event information from the event registration table.

Further, if this event information is to control task C, that is, if event information is to be passed to task C registered in another arithmetic circuit 1b, first, this task control device 2a indicates the valid time of the event information. Read the valid time specified in area 3a (step 401), compare this valid time with the current time (step 402),
If the valid time is before the current time, this event information is passed to the task control device 2b (step 403),
If the valid time exceeds the current time, this first event information report is deleted (step 404). Next, the task control device 2b that received this event information reads the valid time specified in the area 3a indicating the valid time of the event information (step 401), compares this valid time with the current time (step 402), and reads the valid time specified in the area 3a indicating the valid time of the event information. If the time is before the current time, task C is activated and event information is passed to it (step 403), but if the effective time exceeds the current time, this event information is deleted (step 404).
.

Therefore, event information that is no longer needed after the valid time is deleted within the task control devices 2a, 2b, etc.
It is no longer necessary to process such event information within the task of receiving and receiving event information, and it is always easy to eliminate such event information. In addition, such event information is eliminated after each task control device 2a, 2b, etc. that receives the event information determines whether or not it has exceeded its effective time and is no longer needed. Event information that is no longer needed is transferred to the arithmetic circuits 1a, 1b... and other task control devices 2a, 2.
b..., and task control efficiency can be improved.

Note that when a task controls an unspecified number of tasks and controls its own operations according to the results, it waits for events generated by the unspecified number of tasks until a specified effective time, and By processing the event information that arrived before and causing the event information that arrived after Manako's time, that is, the event information whose specified valid time exceeds the current time, to be deleted by this task Ill tall device. Eliminating event information in the above-described embodiment is extremely easy, and task control efficiency is greatly improved! ! ? It will be written by i.

[Effects of the Invention] As explained above, according to the event management method of the present invention, event information that has passed its effective time and is no longer needed can be easily eliminated, and task control efficiency can be improved. become.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a diagram that does not show the format of the event I-+N report of this embodiment, and FIG. 3 is a diagram showing tasks in the arithmetic circuit of this embodiment. , FIG. 4 is a flowchart showing the operation of this embodiment. 1...Task Execution Means 2...Task Exchange Means Applicant: Toshiba Corporation Patent Attorney Satoshi Suyama - Figure 1 Figure 2 Figure 3a 3b Figure 3 Figure 4

Claims (1)

[Claims] (1) A task execution means that has at least one task and processes these tasks, and a system for controlling each other between different tasks connected to this task execution means and executed by the same or other task execution means. In an operating system comprising an event information (hereinafter abbreviated as event information) exchange means for exchanging event information, the format of the event information has an area indicating a valid time of the event information, and the event information An event management system characterized in that the exchange means has means for comparing the valid time of the event information with the current time and erasing the event information when the valid time exceeds the current time.