JPH07295840A - Event management system for multiprogramming system - Google Patents

Abstract

PURPOSE:To improve the using efficiency of resources and also to improve the productivity and the maintenance performance in a multiprogramming system by decreasing the storage areas and the program steps used by the OS of the system which is applied to a built-in system. CONSTITUTION:An event management system includes a task management means 1, a task attached event management means 2, a task attached event wait management means 3, a task control block group 4, an under-execution task 5, an execution wait task group 6, an event wait task group 7, an interruption handler 8, an event establishment condition storage area group 9, and an event wait condition storage area group 10. The information included in the task 5, the groups 6 and 7, and the handler 8 are stored in a program storage part 50. Then the information included in the groups 4, 9 and 10 are stored in a data storage part 51.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an event management system in multi-programming, and more particularly to an OS for switching a plurality of tasks for each event in a telephone and a facsimile which require an interface between a microcomputer and peripheral hardware. The present invention relates to an event management method in multi-programming applied to a system in which an application program running on the OS is stored and incorporated as firmware such as ROM.

[0002]

2. Description of the Related Art Conventionally, an event management method in multi-programming (hereinafter referred to as a multi-programming system) that functions as a management program for operating a plurality of tasks in parallel is a task which is a unit of a small work for a complicated control system. Is used to improve productivity and maintainability by clarifying the relationship between the tasks and the relationship between the tasks and the input / output (external system). For example, a separate interface bootstrap NO. 6, also C
Q Publisher's interface December 1992 issue, NEC's real-time OS for 78K / 0 series R
X78K / 0 Basic Edition Material No. EED-912A (Second
Version) and 78K / 3 real-time O of NEC Corporation
S application document number EEA-611A (second
Version) etc., multiple tasks are assigned to a CPU with only one, and time and inputs from external systems are used as factors (events) for task switching, The management program is realized by distributing the CPU allocation time to each of the two. Such a management program is also called a multi-task OS or a real-time OS.

FIG. 14 is an internal block diagram of a multi-programming system showing an example using a conventional OS.
As shown in FIG. 14, in this conventional example, the task management means 1 and the task control blocks 4-1, 4-2, ..., 4-
Task control block group 4 including n and running task 5
, A waiting task group 6 including the waiting tasks 6-1, 6-2, ..., 6-n, and waiting tasks 7-1, 7-
2, ..., 7-n, the waiting task group 7, the interrupt handler 8, the mail box 12-1, the event flag 12-2, the time waiting timer 12-3 and the wakeup request counter 12-4. An event state storage area 12 including
The event waiting management means 13 is provided. The running task 5, the waiting task group 6, the event waiting task group 7 and the interrupt handler 8 are a set of programs for controlling the entire system, and all of them are stored in the program storage unit 50. There is. A ROM or the like is used as an example of the program storage unit 50.
Further, the task control block group 4 and the event state storage area 12 are included in the data storage section 51 in which information for controlling the tasks stored in the program storage section 50 is stored. An example of this data storage unit 51 is R
AM or the like is used.

In FIG. 14, a running task 5 is a program stored in the program storage unit 50,
It means the contents of the program being processed by the CPU at the present time. The state in which the running task 5 is being processed is called the running state (RUN state). The execution waiting task group 6 is a program that is ready to be executed at any time, but is a program waiting for the CPU to be released from the executing task 5, and this waiting state is in the execution waiting state (READY). State) or ready state. The event waiting task group 7 is a program waiting for the establishment of an event,
This waiting state is called an event waiting state (WAIT state). The interrupt handler 8 means a set of programs for controlling the entire system, and is stored in the program storage unit 50.

Information for controlling the program storage unit 50 is stored in the task control block group 4 and the event state storage area 12, and is contained in the data storage unit 51, each of which is formed by a RAM or the like. It The task control block 4 stores information of a range in which the continuation of the task can be executed again when the execution of the task is interrupted, and is also called TCB. The execution waiting task group 6 and the event waiting task group 7 in the program storage unit 50 are programs that are managed by the task persistent address included in the task control block 4 and are grouped into one group, and the structure thereof is waiting. It is called a queue. The event state storage area 12 includes a mail box 12-1, an event box 12-2,
Time waiting timer 12-3 and wakeup request counter 12-
4 is an area in which information indicating the current state such as a message as a condition of an event, an event, a time, and a wakeup request is stored.

The task management means 1 and the event wait management means 13 store a task including an executing task 5, an execution wait task group 6 and an event wait task group 7 stored in the program storage section 50 and an interrupt handler 8. , A means having a function of controlling based on the information stored in the data storage unit, and the task management means 1 therein is included in the running task 5 in the running state and the waiting task group 6. It has a function to select one task from the existing tasks according to a certain agreement and shift it to the execution state. The above operation by the task management means 1 is called scheduling, and the task management means 1 itself is called a scheduler. Now, as an example,
When one task is selected from the execution waiting task group 6 by the task management means 1, the executing task 5 which is currently in the execution state transits to the execution waiting state and the execution waiting state which is in the waiting state. One of the tasks in the task group 6 transits to the running state. Transition status (switching status) of this task
Is called dispatch, and the operation of saving the state of registers etc. when the running task 5 is suspended (context saving) and the register etc. when the task in the waiting state is suspended It means a state that is combined with the operation of restoring the state (context restoration). As a scheduling method of the task management means 1, a priority order execution method in which priorities are given to the respective tasks and the tasks are executed in descending order of priority, and a first-come-first-served execution method is executed in the order of waiting for execution. There is a time slicing method in which an executable time is provided for each task and switching is performed when the time elapses, but these methods are often used in an appropriate combination. In the following description, a method of combining the priority order method and the first-come-first-served method will be described as an example.

The event control information 603 output from the running task 5 is a signal or data transmitted from the task in the running state to another task, and is an event flag having 1-bit flag information and 1 It contains messages, which are data groups of more than bytes, and is used for synchronizing tasks. The event control information 601 output from the interrupt handler 8 is a signal including a signal for setting an event and data, is input to the task management means 1, and is involved in the control action by the task management means 1. The event control information 602 input to the event wait management unit 13 is a signal including a timer interrupt signal input from an external circuit or a timer of a CPU (not shown), and is used for time management of the OS in the event wait management unit 13. Is used as a reference timer. Event waiting management means 1
3 is the above event control information 601, 602 and 603.
Is a means for selecting a task to be released from event waiting from the event waiting task group 7 and moving it to the execution waiting task group 6. When the task to be released from this event waiting is moved to the execution waiting task group 6, the task management means 1 is used.
Scheduling equivalent to the scheduling performed in 1. is performed.

In the entire system of the multi-programming system, the task management means 1 normally operates by frequently switching between the running task 5 and the waiting task group 6. However, if the tasks are frequently switched in this way, it takes a long time to save and restore the context, which results in shortening the task execution time per certain time. In order to deal with this problem, an event waiting management means 13 having a function of excluding a task from switching targets until a certain event occurs is provided.

The operation of the running task 5 transitioning to the event waiting state by the event waiting management means 13 will be described below with reference to FIGS. 14 and 15A. First, when an event wait occurs in the execution task 5, the control action by the event wait management means 13 is entered, and the registered contents are written in the event state storage area group 12 in step B1. Next, in step B2, the executing task 5 is moved to the event waiting task group 7, and the executing task 5 is placed in the event waiting state. After the movement of the executing task 5 is completed, the control action is transferred to the task management means 1 and scheduling is performed, and the task with the higher priority from the execution waiting task group 6 is transferred to the executing task 5.

Next, with reference to FIGS. 14 and 15 (b), the operation of the task of the event waiting task group 7 shifting to the execution waiting state by the event waiting managing means 13 will be described. Event control information 60 generated by timer interrupt
2, or task 5 being executed and interrupt bundler 8
Event control information 603 and 6 respectively generated in
By 01, the control shifts to the event wait management means 13, and in step B3, it is checked whether or not a task waiting for the occurred event exists in the event wait task group 7. In the determination processing of step B3, when the task is not present in the event waiting task group 7, control is returned to the task management means 1 and the processing ends. If the task exists in the event waiting task group 6, in step B4, the target event included in the event waiting task group 7 is moved to the execution waiting task group 5 and put in the execution waiting state. After the movement of the target event, control is transferred to the task management means 1,
Scheduling is performed, and a task with a high priority is moved from the waiting task group 6 to the executing task 5.

FIG. 16 shows an example of forming an event queue including an execution queue 45, a time queue 46, an event queue 47 and a message queue 48 when using a conventional OS. Pointers 400, 402, 4
04 and 406 are defined as the task connection address of the task control block at the head of the event queue including the execution queue 45, the time queue 46, the event queue 47 and the message queue 48, respectively. It is a pointer. When there are no waiting tasks, these pointers are set to impossible addresses such as null pointers. In addition, pointers 401 ₁ and 40
1 _2, 401 _3, 403 _1, 403 ₂ and 405,
A pointer to the next task control block. Among them, the pointer 401 _2, 403 ₂ and 405 are terminators, for example, it is set to the address impossible null pointer or the like. In the internal configuration diagram of the conventional multi-programming system of FIG. 14, the event waiting management means 1
3 rewrites this pointer when a task in the event queue, including the time queue 46, event queue 47 and message queue 48 of FIG. 16 moves to the execution queue 45 shown in FIG. When an executing task, which is realized by the above, moves to a task in the event queue including the time queue 46, the event queue 47 and the message queue 48, the time queue 46, the event queue 47 , Or by rewriting the pointer at the head or tail of the message queue 48.

Next, the operation will be described together with the example of the control structure of the OS shown in FIG. application·
From the viewpoint of the program, an OS control function called a system call 14 is provided between the task management means 1 and the event wait management means 13 as an application program and task management means 1 / event wait management means 13. Have a room between. For example, when a new task is to be added to the execution waiting task group 6 of FIG. 14, first, the task control block group 4 is generated by making a task generation system call, and then the task activation system is generated. -By issuing a call, a task is added to the end of the pending task group 6. Further, when it is desired to change the priority order of the activated task, the priority order number included in the task control block group 4 is changed by issuing a system call for changing the priority order. As described above, in the currently executing task 5, control is transferred to the task management means 1 and the event wait management means 13 according to the issued system call or the event control information 602 managed by the OS itself. . In the task management means 1, the tasks in the execution waiting task group 6 are sequentially switched and executed in order from the task having the highest priority. If the event waiting management unit 13 newly moves a task from the event waiting task group 7 to the execution waiting task group 6, the task has a higher priority than the task of the executing task 5. If so, the task being executed is interrupted and the moved task is executed.

In the event state storage area 12, a mail box 12-1 for storing the information of the message queue 48 described in FIG. 16, an event flag 12-2 for storing the information of the event queue 47, A time waiting timer 12-3 for storing information on the time queue 46 and a wakeup request counter 12-4 for storing information on the wakeup queue
But at least it exists. In the following, in connection with the problems in the conventional example, the above-mentioned mail box 1
2-1, event flag 12-2, time waiting timer 1
The operation of the event waiting management unit 13 when the 2-3 and the wakeup request counter 12-4 are used will be described.

The operation of the event waiting management means 13 when using the mail box 12-1 will be described. First, the event information 603 is transmitted from the running task 5 to the event waiting management unit 13, and in response to this, the event waiting management unit 13 transmits the content of the event information 603, in this case, a message. When it is judged that
The event waiting management means 13 allows the mail box 12-
1 is the message delivered to mailbox 1
2-1 is written. Furthermore, in the event queue in the mail box 12-1, that is, in the information of the task waiting for the message of the event waiting task group 7,
Event waiting tasks 7-1, 7-2, ..., Task 7-n
If the information included in the item 1 exists, the event waiting management unit 13 moves one of the event waiting tasks to the execution waiting task group 6. Conversely, the event information 603 requesting a message is transmitted from the running task 5 to the event wait management means 13, and the event wait management means 13 transmits the content of the event information, in this case, the mail box number. If there is no message in the mail box 12-1, the running task 5 is moved to the event waiting task group 7. At that time,
When a task waiting for a message already exists in the event waiting task group 7, the task connection address in the task control block corresponding to the event waiting task is rewritten.

Next, the operation of the event waiting management means 13 when the event flag 12-2 is used will be described. First, the event information 603 is transmitted from the running task 5 to the event wait management means 13, and in response to this, the content of the event information 603, in this case, the event number is transmitted to the event wait management means 13. If it is determined that the event flag 1
The state of the event flag transmitted to 2-2 is written in the event flag 12-2. Furthermore, in the event queue in the event flag 12-2, that is, in the information of the task waiting for the event of the event waiting task group 7, the event waiting tasks 7-1, 7-2, ...
..., if the information included in the task 7-n exists, the event waiting management unit 13 moves one or more event waiting tasks to the execution waiting task group 6. Conversely, the event information 603 that waits until the event flag is set is transmitted from the running task 5 to the event wait management means 13, and the event wait management means 13 indicates the content of the event information, in this case the event number. When it is determined that the event flag 12-2 is transmitted, if the event flag of the target number is not set in the event flag 12-2, the running task 5 is moved to the event waiting task group 7. At this time, if a task waiting for an event already exists in the event waiting task group 7, the task connection address in the task control block corresponding to the event waiting task is rewritten.

Next, the operation of the event waiting management means 13 when the time waiting timer 12-3 is used will be described. First, event control information 602 generated by a timer interrupt from the outside is transmitted to the event wait management means 13, and in response to this, by the control of the event wait management means 13,
When there is a task waiting for time in the time waiting timer 12-3, the time counter corresponding to the time waiting timer 12-3 is counted up. Then, when the time requested by the timer interrupt has elapsed, one or more event waiting tasks among the tasks waiting for the time in the event waiting task group 7 are processed by the event waiting management means 13 in the execution waiting task group. Moved to 6. On the contrary, the event information 603, which is a time waiting request, is transmitted from the running task 5 to the event waiting management unit 13, and the event waiting management unit 13 transmits the content of the event information, in this case the time information. If it is determined that the task is being executed, the executing task 5 is moved to the event waiting task group 7. At this time, if a task waiting for time is already present in the event waiting task group 7, the task connection address in the task control block corresponding to the event waiting task is rewritten.

Next, the operation of the event waiting management means 13 when using the wakeup request counter 12-4 will be described. First, the event information 603 is transmitted from the running task 5 to the event wait management means 13, and in response to this, the event wait management means 13 transmits the content of the event information 603, in this case, the wakeup request destination task number. If it is determined that the wakeup request counter 12 is prepared, the wakeup request counter prepared for each wakeup request destination task number transmitted to the wakeup request counter 12-4 is incremented. Furthermore, in the information on the task waiting to wake up in the wakeup request counter 12-4 or in the information on the task waiting for time in the time waiting timer 12-3,
If there is information related to the event waiting tasks 7-1, 7-2, ..., 7-n, the event waiting management means 1
3, the task waiting for an event therein is moved to the task group 6 waiting for execution. Conversely, the running task 5 transmits event information 603, which is a wake-up waiting request, to the event waiting management means 13, and the event waiting management means 13 waits until the content of the event information, in this case, a wake-up request comes. When it is determined that the task is being transmitted, the event waiting management unit 13 moves the running task 5 to the event waiting task group 7. At this time, if a task waiting to wake up already exists in the event waiting task group 7, the task connection address in the task control block corresponding to the event waiting task is rewritten.

As described above, in the conventional multi-programming system, the event information stored in the event state storage area 12 is classified by type (message, event, time, wakeup request, etc.). , The procedure for managing each storage area by the event waiting management means 13 becomes complicated, and particularly when the multi-programming system is applied to an embedded system, the executing task 5, the waiting task group 6 and the waiting task group Due to the restriction of the storage area of the program storage unit 50 including 7 and the like, it is difficult for the event waiting management means 13 to perform management processing corresponding to all types. Further, since the event state storage area 12 stores a pointer defined as a task connection address for forming a queue, the task control block 4 and the event state are stored when the embedded system is supported. There is a problem that the storage area required for the data storage unit 51 including the storage area 12 is significantly increased.

FIGS. 18 (a), 18 (b) and 18 (c) are timing charts showing a procedure when a multi-programming system using an OS is realized as an embedded system in a tape recording type answering machine. .
The answering machine program that responds to incoming calls utters a reply message to the other party and records the other party's voice after the utterance, and monitors and controls the operating state of the tape control circuit every 2 ms. The tape control handler 31 for performing the operation and the key monitoring task 32 for monitoring the state of the key and the handset in the remaining time of the response task 30 and the tape control handler 31 operate in parallel. Among these tasks, the table control handler 31 has the highest priority, and the response task 30 and the key monitoring task 32 have the lowest priority. Then, in each task, a process (hereinafter, referred to as a sequence) to be executed according to a predetermined order is prepared. Each of the above tasks transfers execution authority to another task when it enters the event wait state or when an event of another task with a high priority is established, and becomes a pseudo multi-task operation state. There is.

FIGS. 18A, 18B and 18C are timing charts showing an example of the sequence of the response task 30, the tape control handler 31 and the key monitoring task 32, respectively. As the timing for transferring the execution right in the response task 30, a timing T ₁ for waiting for a telephone call, a timing T ₂ for waiting for the end of utterance of a response message, and an allowable time (30 seconds) for recording the voice of the other party.
There is a timing T ₃ for waiting the passage of time and a timing T ₄ for waiting for recording the recorded date / time on the tape. In sequence 30 _1, incoming return from the event waiting state at the time of the detected, by saying a response message, is set in a wait state in the utterance end wait. In the sequence 30 _2, utterance end is restored from the event waiting state at the time it was detected, to the wait state at the time waiting for 30 seconds after recording the voice of the other party. Sequence 3
In 0 ₃ , the state returns from the waiting state when 30 seconds have elapsed, the date and time are recorded, and the recording end waiting state is set. In sequence 30 ₄ , the date
It returns from the waiting state when the time recording is completed, and is set to the waiting state when waiting for an incoming call. Sequence 31
In sequence 31 _{7 1,} the tape operation control in a cycle of 2 ms (recording, playback and stop) are carried out.
Further, in the sequence 32 ₁ to the sequence 32 ₇ , the operation is performed when the operation between the sequence 30 ₁ and the sequence 30 ₄ is not performed, and the states of the key and the handset are constantly monitored. For example, a sequence for forcibly ending the response task 30 is included when the handset is picked up during the response operation. It is necessary to operate at least about every 100 ms so that the person does not feel uncomfortable.

In the period from the timing T ₁ to the timing T ₂ in FIG. 18, if the event that the other party hangs up is not detected in addition to the event that the utterance of the response message is finished, the utterance of the response message is detected. It is not possible to move to the next sequence until the end.
Further, in the period from the timing T ₂ to the timing T ₃ , if the event that the other party hangs up is not detected in addition to the event that the allowable time (30 seconds) for recording the voice of the other party has passed, Recording will continue even if the phone is hung up. Furthermore, from timing T ₃ to timing T 4 During the period, there is a possibility that the tape full event will occur during recording.

As described above, when it is necessary to detect a plurality of events, one method of dealing with the conventional multi-programming system is to set the execution state as much as possible without shifting to the event waiting state, and prioritize it. A method is adopted in which only high-ranked tasks are executed by interruption. 19 (a), (b) and (c) are timing charts showing an example of the sequence of the response task 30, the tape control handler 31 and the key monitoring task 32, respectively. ) And (c), the event that the telephone was hung up in FIG. 18 above,
A timing diagram is shown in an implementation where it is necessary to detect multiple event waits by adding the event that the tape is full during recording. In order to detect the timing T ₁ and the timing T ₂ , the response task 30 operates when the high priority tape control handler 31 is not executed. In this example, since the timing T ₁ or T ₂ is detected without waiting for an event, the key monitoring task 32 having a lower priority than the response task 30 cannot operate, and the response message is reproduced. Then, until the other party's voice recording is completed or the other party hangs up, it cannot detect that the handset is picked up.

As another coping method when it is necessary to detect a plurality of events, an event waiting task is newly activated for each event and the task wakes up to the responding task 30. Alternatively, there is a method of transmitting an event, a message, or the like. 20 (b) and (c)
Is a tape control handler 31 and a key monitoring task 32.
2 is a timing diagram showing an example of the sequence of FIG.
Realization of the case where it is necessary to detect a plurality of event waits by adding to 0 (a) the event that the telephone is hung up in FIG. 18 and the event that the tape is full during recording. The timing diagram in the example is shown.

In this case, in the sequence 30 ₁ , the end waiting sequence 38 or the disconnect waiting sequence 43 is activated as a task, and at the timing T ₂ ,
The reply task 30 receives the wake-up request from the end wait sequence 38 or the disconnect wait sequence 43, and at the timing T ₃ , the reply task 30 wakes up from the elapsed wait sequence 39, the disconnect wait sequence 43, or the error wait sequence 44. In terms of receiving the request, FIG.
Is different from the timing diagram of. The end wait sequence 38 requests the reply task 30 to wake up at the time when the end of the utterance of the response message is detected, and the elapsed wait sequence 39 passes the allowable time (30 seconds) for recording the voice of the other party. At some time, the response task 30 is requested to wake up. The disconnection waiting sequence 43 requests the response task 30 to wake up when the other party hangs up. The abnormality waiting sequence 44 requests the task 30 such as response to wake up when the tape is full during recording. Incidentally, the response wait sequence 38 and the elapsed wait sequence 39 until it is terminated in the sequence 30 _2, wait for event task group 7, is stored in the execution waiting task group 6 or running task 5, the elapsed waiting sequence 39 cutting wait sequence 43 and abnormal wait sequence 44, in the sequence 30 _2, until it is terminated, wait for event task group 7, execution waiting task group 6,
Alternatively, it is stored in the running task 5.

In the present embodiment, at timing T _2, waiting for response sequence 38, wakes up request to the response task 30, also at the timing T _3, the elapsed waiting sequence 39, a wakeup request to the response task 30 The operation example in the case of doing is shown. In this example, since it is necessary to frequently perform processing such as task activation, forced termination, and termination, task management becomes complicated and the program capacity tends to increase. Further, there is a problem that a large amount of storage area corresponding to the event queue is consumed due to starting a plurality of tasks.

[0026]

In the above-mentioned conventional multi-programming system, since a queue is formed for each event, the storage including the event state storage area is associated with the pointer connection of the queue. There is a drawback that the area increases and becomes complicated, and that when the queue is frequently created / erased, a large amount of processing execution time is required depending on the frequency of use.

Furthermore, when a system call for releasing a wait (especially a system call for releasing an event wait) is called, many program steps are required, and the program is stored in a ROM-like file.
When it is applied to an embedded system that is equipped with hardware and is found in RAM with a limited storage area, the number of events is limited, and almost all of it is consumed by OS-related processing and data. There is a drawback that the applicability of the multi-programming system to an embedded system is seriously hindered.

Further, when there are many time sequences such as an answering machine, it is required to judge a plurality of events at the same time in the branch of the sequence, but for that purpose, the method to be realized becomes complicated and the reverse method is required. One of the purposes of applying a multi-programming system to a product is the drawback of deteriorating productivity.

[0029]

The event management method in the multi-programming of the first invention is a type of an executable condition (hereinafter, referred to as an event) of the task which is set for each task in which the program is subdivided ( (At least include waiting for events, waiting for messages, waiting for time, waiting for getting up, etc.)
And an event satisfaction condition storage means for storing a satisfaction condition of a state (including at least an event waiting status, an event completion status, etc.), and an event wait corresponding to a time when the event stored in the event satisfaction condition storage means is satisfied. Event wait condition storage means for storing a release condition, a task control block for storing control information for controlling the task, and each time an event of the task occurs, the event is stored in the event satisfaction condition storage means. Compare and collate with the stored event satisfaction conditions,
A task adjunct event management unit that detects whether or not the target event is established, and the detection function of the task adjunct event management unit that receives the control information transitions the task in the event waiting state to the event waiting state. In addition, when the event wait release condition for the task in the event wait state is satisfied, the task adjunct event wait management means for transitioning the task to the execution wait state and the task adjunct event wait management means wait for the event An event-waiting task storage means for temporarily storing a task that has been transited to a state, an execution-waiting task storage means for temporarily storing a task that has been transited to an execution-waiting state by the task-attached event-waiting management means, and a predetermined task The CPU (central processing unit) of the executing task storing means for storing the task being executed and the control information, And executing task, it is characterized in that it comprises at least, a task management means for selecting one of the tasks makes a transition to the execution state from among the execution waiting tasks stored in the execution waiting task storing means.

The event management method in the multi-programming of the second invention is the type of conditions (hereinafter, referred to as an event) that can be executed by the task, which is set for each task that divides the program (waiting for an event, message). Waiting, waiting for time, including at least waiting for getting up, etc.) and status (including at least waiting for event, including completion of event, etc.)
Event satisfaction condition storage means for storing a satisfaction condition of the event, an event satisfaction condition table for storing a satisfaction condition for a type of a specific event that is frequently used, and an event wait condition content corresponding to the type, and the event satisfaction condition Storage means or event waiting condition storage means for storing an event wait release condition corresponding to the time when the event stored in the event satisfaction condition table is satisfied, and task control for storing control information for controlling the task A task attachment that detects whether or not the target event is established by comparing the event with the event establishment condition stored in the event establishment condition storage means for each occurrence of the event of the block and the task Upon receiving the event management means and the control information, the detection function of the task adjunct event management means causes the task in the event waiting state to transition to the event waiting state. At the same time, when the event wait release condition for the task in the event wait state is satisfied, the task adjunct event wait management means for transitioning the task to the execution wait state and the task adjunct event wait management means Event-waiting task storage means for temporarily storing the task transitioned to, execution-waiting task storage means for temporarily storing the task transitioned to the execution-waiting state by the task-attached event wait management means, and a predetermined task A CPU (Central Processing Unit), which receives a task being executed and which stores a task being executed, and the control information,
It is characterized by at least comprising a task managing means for selecting one task from among the task in execution and the task waiting for execution stored in the task storing means for execution and transitioning to a running state. .

[0031]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.

FIG. 1 is an internal block diagram showing a first embodiment of the present invention. As shown in FIG. 1, in this embodiment, a task management unit 1, a task adjunct event management unit 2, a task adjunct event wait management unit 3, and a task control block 4-
, 4-2, ..., 4-n, a task control block group 4, an in-execution task 5, and waiting tasks 6-1 and 6-
, ..., 6-n, waiting task group 6; event waiting tasks 7-1, 7-2, ..., 7-n including task waiting task group 7; interrupt handler 8; Event storage condition storage area group 9 including condition storage areas 9-1, 9-2, ..., 9-n, and event wait condition storage areas 10-1, 1
An event waiting condition storage area group 10 including 0-2, ..., 10-n. The information contained in the running task 5, the waiting task group 6, the event waiting task group 7 and the interrupt handler 8 is stored in the program storage unit 50, and the task control block group 4 and the event establishment are performed. The information included in the condition storage area group 9 and the event waiting condition storage area group 10 is stored in the data storage unit 51. 2A and 2B are flowcharts showing the event management processing procedure in this embodiment.

In FIG. 1, the event satisfaction condition storage area group 9
Of the events used in the corresponding executing task 5, execution waiting task group 6 and event waiting task group 7,
Stores the types of events in the waiting state, the contents of the wait corresponding to the types, and the results of satisfying the conditions, in the numbers used in the running task 5, the waiting task group 6, and the waiting task group 7, respectively. This is the area to be used. In addition, the event waiting condition storage area 10 includes a condition (AND and OR, etc.) for returning from the event waiting state when a plurality of conditions are stored in the event satisfaction condition storage area 9 and a condition for returning. This is an area for storing information as to whether or not the event has been restored depending on the event establishment condition.
It has a function of updating the contents of the event satisfaction condition storage area 9 when an event of the event satisfaction condition storage area 9 occurs. The task-attached event wait management means 3 plays a role of migrating the event wait task group 7 to the execution wait task group 6 when the event wait release condition shown in the event wait condition storage area 10 is satisfied.

First, referring to FIGS. 1 and 2A,
A processing procedure for the running task 5 to shift to the event waiting state by the task adjunct event management means 2 and the task adjunct event wait management means 3 will be described. When an event wait occurs in the running task 5, the task incidental event management means 2
The control moves to step A1, and in step A1, the task adjunct event management means 2 writes and stores the registered content in the event satisfaction condition storage area 9. Then, the process proceeds to step A2, and if there is registration content to be written continuously, the process returns to step A1 and the registration content is again written and stored in the event satisfaction condition storage area 9. This processing procedure is continuously performed until the registered contents are exhausted. After that, when the registered contents are lost, control is transferred to the task incidental event waiting management means 3, and step A
In 3, the task-attached event wait management means 3 moves the running task 5 to the event wait task group 7. Then, after the moving task 5 is moved, the task management means 1
The control is transferred to the task management means 1 and scheduling is performed by the task management means 1, and a task having a higher priority from the task group 6 to be executed is newly set as the executing task 5.

Next, referring to FIGS. 1 and 2B,
A processing procedure in which a task included in the event waiting task group 7 moves to the execution waiting task group 5 will be described. Receiving any event control information including event control information 602 generated by a timer interrupt from an external circuit or CPU, event control information 603 generated in the executing task 5, and event control information 601 generated in the interrupt handle 8. Then, control is transferred to the task adjunct event management means 2, and first in step A4, the task adjunct event management means 2
Thus, it is determined whether or not the generated event exists in the event satisfaction condition storage area group 9. If the event does not exist in the event condition storage area group 9, the control returns to the task management means 1 and the processing procedure ends. If the event exists in the event satisfaction condition storage area group 9,
In step A5, it is determined whether or not the registered condition of the event is satisfied, and if not satisfied, control is returned to the task management means 1 and the processing procedure is ended. If the registered condition is satisfied, it is determined in step A6 whether or not the condition in the event wait condition storage area is satisfied. If not, the task management means 1 The control returns to and the processing procedure ends. If the registered condition is satisfied, the target task is moved from the event waiting task group 7 to the execution waiting task group 6 in step A7. Then, after the movement of the target task, control is transferred to the task management means 1, scheduling is performed by this task management means 1, and a task with a high priority is newly executed from the task group 6 waiting for execution. It is set as task 5.

FIG. 3 shows an event satisfaction condition storage area 9-i (i included in the event satisfaction condition storage area group 9 in this embodiment.
= 1, 2, ..., N) and the event wait condition storage area 10-i (i =) included in the event wait condition storage area group 10.
It is a block diagram which shows one structural example of 1, 2, ..., N). Registration contents 1, registration contents 2, ..., Registration contents m are stored in the event establishment condition storage area 9-i, respectively. A registered event number 100 including registered event numbers 1, 2, ..., M is assigned to each of these registered contents, and when the system call is referred to and registered, the registered event number 100 is registered. The content is determined. A condition identification number 101 and a wait release result 102 are stored in the event wait condition storage area group 10-i.

The event waiting condition storage area group 10 is such that when all the events registered in the event establishment condition storage area group 9 are satisfied (AND condition: 1), when any event is satisfied (OR condition: 2). ), Or when a certain event is established (single condition: 0), the condition identification number 102 that stores the condition for returning the waiting state and the last waiting state when the waiting state is released. It is composed of a wait release result 103 that stores the released registration event number.

4 (a), (b), (c), (d),
(E) and (f) are block diagrams showing a configuration example of registered contents of the event satisfaction condition storage area group 9 in the present embodiment. The type of event is an example in the case of waiting for an event, waiting for a message, waiting for a message with a reception buffer, waiting for a message with a range specification, waiting for a time, and waiting for waking up. Each of these events is composed of 3-byte data, and the first byte 100a
2nd byte 100b corresponding to the event type identification number
Then, the wait condition is stored in the third byte 100c.
As shown in FIG. 4A, when the first byte 100a is the event identification number, the second byte 100b
The flag address is stored in the third byte 100c
The bit position is stored in the upper position, and the current event state is stored in the lower position. Further, as shown in FIG. 4B, when the first byte 100a is the message identification number, the second byte 100b stores the waiting message and the third byte 100c stores the received message. It Similarly, if the first byte 100a is a message identification number with a reception buffer, 2
The buffer address is stored in the byte 100b,
The buffer size is stored in the third byte 100c (see FIG. 4C). If the first byte 100a is the message identification number with range designation, the second byte 1
The upper limit of the waiting message is stored in 00b, the lower limit of the waiting message is stored in the third byte 100c, and the received message is overwritten and stored (see FIG. 4 (d)). When the first byte 100a is the time identification number, the remaining waiting time is stored in the second byte 100b and the third byte 100c (FIG. 4).
(See (e)). The waiting time is counted down for each timer interrupt of the OS, and when it reaches 0, it is considered that the waiting time has elapsed. 1
If the byte number 100a is the wakeup identification number, 2
A wakeup request counter is stored in the byte 100b and the third byte 100c (see FIG. 4 (f)). When the wakeup request counter is at the maximum value, an error is returned to the task that issued the wakeup request system call without counting up. In the present embodiment, a dedicated area for an event is not provided, a 1-bit flag area is statically arranged, and the address and bit position of the flag area are stored as registered contents.

In the case of memory-mapped I / O, it is possible to assign flags to input ports and output ports. Furthermore, by designating the previous state and active of the event, it becomes possible to activate the task by edge detection. This eliminates the need for processing the state of the port and setting / resetting the event flag as is conventionally done. However, when the event flag is assigned to a region that changes outside the OS management such as an input port, that is, a region where the flag changes without using a system call, it is detected by a timer interrupt of the OS. For messages, no mailbox is provided and the message is sent directly to the task. By setting the message length to 1 byte, the overhead when storing the pointer and the like is reduced, and by waiting for the reception of the message by the designated message or the range designation, the frequency of the task being executed is reduced. Also, conventionally,
The time waiting is canceled when the system call for the wakeup request is issued during the time waiting, but in the present embodiment, it is also possible to prevent the time waiting from being canceled unless the wakeup waiting is set.

FIG. 5 is an example of a flowchart showing a processing procedure until the task adjunct event waiting management means 3 is activated upon receipt of an OS time interrupt from an external circuit or a CPU in this embodiment, and FIG. 7 and FIG. 7, in response to the system call of the task adjunct event management means 2,
It is an example of a flowchart showing a processing procedure until the task attached event wait management means 3 is activated.

In FIG. 5, OS time interrupt 200
Is interrupted during processing of a task or the like at regular time intervals, for example, at 1 ms intervals. In response to this, in step 204, it is determined whether or not there is a task waiting for time, and if there is no task, the process proceeds to step 208, and if it exists, the time is counted in step 205, and the task waits for time. The remaining time of the event content of the task performing is decremented. Next, in step 206, it is judged whether or not the time is UP, and the time is UP.
If not, the process proceeds to step 208, and if it is UP, the time waiting is canceled in step 207, the process returns to step 204 again, and the subsequent processing procedure is repeatedly executed.

Steps 204 and 20 above
When the determination condition is not satisfied in the processing procedure of No. 6, the process proceeds to step 208, but steps 208 and 209.
The processing procedures 210 and 210 are processing procedures for managing the establishment of an event when an event flag is assigned to a region that changes outside the OS management such as an input port. In this case, when the change is made in a time shorter than the timer interrupt period of the OS, the above step 20 is performed.
By operating the processing procedures of Nos. 8, 209 and 210 in a shorter cycle, the accuracy of the processing can be improved. First, at step 208, it is judged whether or not there is a task waiting for an event, and if there is no task waiting for an event, the task adjunct event waiting management means 3 is activated in response to this. If there is a task waiting for an event, it is determined in step 209 whether the event is satisfied,
If not satisfied, the task adjunct event waiting management means 3 is activated in response to this. If the event is satisfied, the waiting for the event is released in step 210, the process returns to step 208, and the subsequent processing procedure is continuously executed.

In FIG. 6, in response to the system call 201 for transmitting a message, it is first determined in step 211 whether or not a destination task exists, and if there is no other destination task, Step 217
Then, a transmission error is returned to the issue destination of the system call and the system returns. Also, step 211
If there is a task of the transmission destination in, the process proceeds to the next step 212. Note that the subsequent steps 212,
If the judgment conditions are not satisfied in the judgment processes of 213 and 214, the process similarly goes to step 217 in any case, and a transmission error is returned to the issue destination of the system call to return. Step two
In 12, it is determined whether or not the sending task is waiting for a message. If the sending task is waiting for a message,
In the next step 213, it is determined whether or not the transmission message and the waiting message are the same, and if they are the same, it is determined in step 214 whether or not there is a free area in the buffer, and the buffer is stored in the buffer. If there is a free area, the process moves to step 215 and the message is written in the receiving buffer of the destination. Next, in step 216, the message waiting is released, and in response to this, the task adjunct event waiting management means 3 is activated.

Next, in FIG. 7A, in response to the system call 202 for setting an event, step 2
In 18, it is determined whether or not there is a task having the same event flag address. If the task does not exist, the process proceeds to step 222, and the event error is issued to the system call issue destination. It will be returned and will be in a return state. If there is a task having the same event flag address in step 218, it is determined in step 219 whether or not the event is satisfied. If not, the process proceeds to step 221. If it is satisfied, the wait for the event is released in step 220. In step 221, it is judged whether or not there is a task having the same event, and if there is a task, step 2
Returning to step 19, the subsequent processing procedure is continuously executed. If the task does not exist, the task adjunct event waiting management means 3 is activated in response to this.

Further, in FIG. 7B, step 223 is executed in response to the system call 203 requesting to wake up.
At, it is determined whether or not the task of the wakeup request destination exists, and if not, the process proceeds to step 226.
A wakeup request error is returned to the system call issuer and returns. If the wakeup request destination task exists in step 223, it is determined in step 224 whether or not the wakeup request counter has the maximum value. If the task has the maximum value, the process proceeds to step 226. ,
A wakeup request error is returned to the system call issuer and returns. If it is not the maximum value, step 2
In 25, the wakeup request counter is incremented,
Next, at step 227, the wake-up request waiting state is released. Then, in response to this, the task adjunct event waiting management means 3 is activated.

FIG. 8 is an example of a flowchart showing the processing procedure in the task adjunct event wait management means 3 in this embodiment. First, at step 228, it is judged whether or not there is a task in the event queue in the event waiting task group 7. If there is no task in the event queue, control is transferred to the task management means 1 and the operation of the task-attached event wait management means 3 ends. If there is a task in the event queue, step 229
At, it is determined whether or not the event waiting is canceled as a result of the waiting condition. If it is not canceled in step 229, the control is transferred to the task managing means 1 and the operation of the task adjunct event waiting managing means 3 ends.
If the wait condition is released, the event queue in the event wait stack group 7 in which the event is released is moved to the execution queue in the execution wait stack group 6 in step 230. To do. This is already apparent from the flowcharts shown in FIGS. 5, 6 and 7 described above. However, in this case, the event queue is moved to the execution queue in step 230 only when the event wait condition indicated by the condition identification number is satisfied in the determination process of step 229. To do. Then step 23
In 1, the registered event number of the released event is written in the wait release result. Further, the task moved to the execution waiting task group 6 transits to the execution state in the task management means 1 as necessary.

FIG. 9 is a diagram showing an example of a system call relating to event waiting in this embodiment. system·
The call set-phe and wai-phe are the system for setting the event type and the event content specified in the registration content 100 including the registration content 1, registration content 2, ..., Registration content n shown in FIG. This is call and this set-p
Multiple conditions are specified by he, and wai-phe
Specifies the last condition and condition identification number 102, and enters the event waiting state. Also, clr-phe is
It is a system call that cancels unnecessary registration contents 100 among the events set by the above set-phe or wai-phe, and pol-phe is used depending on which event occurs when the event wait is canceled. This is a system call that informs whether or not it has been canceled by returning the registration event number specified in each registration content 100. And get-phe is a system call to retrieve the current state of each event registration content 100. For example, when a message is waiting, the received message is returned, and when waiting for a time, the remaining time is returned. In the present embodiment, the last three characters of the system call name are phe at the beginning of the English character that means the phenomenon.

Although the present invention is applied to various built-in systems, as an example, when the present embodiment is applied to an answering machine system, the program storing section 50 stores the entire answering machine system. Is stored, and in particular, the operating task 5, the waiting task group 6 and the event waiting task group 7 store operation information of the answering machine. The interrupt handler 8 stores external information that needs to be constantly monitored (for example, monitored every 10 ms). The data storage unit 51 also stores the execution state of the answering machine. Especially for the event condition storage area group 9, the event waiting task group 7
The event waiting condition storage area group 10 stores combination information of two or more transition timings. The task control block 4 includes a task 5 in execution and a task group 6 waiting for execution.
Information for controlling the execution state of the event waiting task group 7 is stored. FIG. 10 is an internal configuration diagram showing the second embodiment of the present invention. As shown in FIG. 10, in this embodiment, the task management means 1 and the task incidental event management means 2 are included.
, Task-dependent event wait management means 3, a task control block group 4 including task control blocks 4-1, 4-2, ..., 4-n, an executing task 5, and an execution waiting task 6-
Pending task group 6 including 1, 6-2, ..., 6-n
, Event wait task group 7 including event wait tasks 7-1, 7-2, ..., 7-n, interrupt handler 8, and event satisfaction condition storage areas 9-1, 9-2 ,. Event satisfaction condition storage area group 9 including -n and event wait condition storage area 1
An event waiting condition storage area group 10 including 0-1, 10-2, ..., 10-n and an event satisfaction condition table 11 are provided. The running task 5, the waiting task group 6, the event waiting task group 7, and the interrupt handler 8 are executed.
The information contained in the event establishment condition table 11 is stored in the program storage unit 50, and the information contained in the task control block group 4, the event establishment condition storage area group 9, and the event waiting condition storage area group 10 is , Stored in the data storage unit 51. As is apparent from the comparison between FIG. 1 and FIG. 10, the difference between this embodiment and the above-described first embodiment is that the event satisfaction condition table 11 is provided inside the program storage unit 50 in this embodiment. It is newly added. 11A and 11B are flowcharts showing the event management processing procedure in this embodiment.

In FIG. 10, the newly added event establishment condition table 11 is a constant that indicates the type of event in the first embodiment of FIG. 1 and the wait contents corresponding to the type that are used frequently. It is stored as a table and is arranged in the ROM area in the embedded system. This is the difference in operation from the first embodiment. When an event wait is requested in the task 5 in the execution state, if the event satisfaction condition table number in the event satisfaction condition table 11 is specified, the task incidental event management The registration content is registered by the means 3 as an event establishment condition. After that,
The operation is performed similarly to the case of the first embodiment. By creating a table of events including the registered content 100 stored in the event satisfaction condition storage area group 9 shown in FIG. 3 in advance and describing the condition description in the system call by a table number to simplify the program, -The number of steps can be reduced.

In FIG. 11A, the running task 5 includes a task adjunct event management means 2 and a task adjunct event wait management means 3.
Shows the processing procedure to wait for an event, and Fig. 1
1 (b) shows a processing procedure in which a task in the event waiting task group 7 moves to the execution waiting task group 6. The difference between the processing procedure in the present embodiment and the processing procedure in the first embodiment described above is clear in the present embodiment, as is clear from the comparison between FIG. 11 (a) and FIG. 2 (a). , Fig. 11
In step A8 and step A9 in (a), the event satisfaction condition is read from the event satisfaction condition table 11 and written in the event satisfaction condition storage area 9. Further, events of a plurality of conditions are registered in advance in the event satisfaction condition table 11, and after step A9, step A
It is also conceivable to shift to step A3 without performing the processing in 2. Other steps A1, A2, A3, A4, A5,
The processing contents in each processing procedure including step A6 and step A7 are the same as in the case of the first embodiment.

FIG. 12 is a block diagram showing a configuration example of the event establishment condition table 11 in this embodiment. 12
In, the number of registered events 300 indicates the number of registered contents 301 including registered contents 1, ..., Registered contents n. These registration contents 301 are tabulated with the event types and event conditions set in the event satisfaction condition storage area 9 shown in FIG. 3 as initial values. When the registration event table number is designated by the system call set-phe or wai-phe shown in FIG. 9, the corresponding registration content 301 is extracted and written in the event satisfaction condition storage area group 9. 13 (a), (b),
(C), (d), (e) and (f) are block diagrams showing a configuration example of registered contents of the event satisfaction condition table 11 in the present embodiment, and are equivalent to the registered contents shown in FIG. However, since it is the ROM area, 3 in FIG.
The byte position 301c is an empty area, and FIG.
Only the lower limit of the waiting message is stored in the third byte 301c of (d), and further, the third byte 30 of FIG.
The initial value of the wakeup request counter is stored in 1c,
The difference is that the message receiving area and event status area are not taken into consideration.

As in the case of the first embodiment, when this embodiment is applied to an answering machine system, the program storage unit 50 stores information for controlling the entire answering machine system. In particular, the operating task 5, the waiting task group 6 and the event waiting task group 7 store operation information of the answering machine. The event establishment condition table 11 stores combination information of the events frequently used in the answering machine, among the event establishment conditions. The interrupt handler 8 needs to be constantly monitored (for example, every 10 ms). External information is stored. The data storage unit 51 also stores the execution state of the answering machine. In particular, at least one transition timing information is stored in the event waiting task group 7 for the event satisfaction condition storage area group 9, and a combination of two or more transition timings is stored in the event waiting condition storage area group 10. Information is stored. The task control block 4 stores information for controlling the execution states of the running task 5, the waiting task group 6 and the event waiting task group 7.

[0053]

As described above, according to the present invention, by providing the task adjunct event management means and the task adjunct event wait management means, the queue included in the event waiting task group can be simplified. , The execution time when frequently creating, starting, terminating, and deleting event waiting tasks,
The effect is that the required program steps can be reduced.

Further, by applying the present invention to a system such as an answering machine, which has a lot of sequence and condition judgment processing, it is possible to judge a plurality of events extremely easily, and unnecessary tasks are eliminated. As well as being killed
There is an effect that the structured design of the system in consideration of the relationship between the sequence and the condition determination becomes easy, and the productivity and maintainability of the system can be improved.

[Brief description of drawings]

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

FIG. 2 is a diagram showing a flowchart of a processing procedure in the first embodiment.

FIG. 3 is a block diagram showing an event satisfaction condition storage area group and an event waiting condition storage area group of the first embodiment.

FIG. 4 is a diagram showing a configuration example of registered contents in an event satisfaction condition storage area group of the first embodiment.

FIG. 5 is a diagram showing a flowchart of a processing procedure in a task incidental event management means of the first embodiment.

FIG. 6 is a diagram showing a flowchart of a processing procedure in the task incidental event management means of the first embodiment.

FIG. 7 is a diagram showing a flowchart of a processing procedure in the task incidental event management means of the first embodiment.

FIG. 8 is a diagram showing a flowchart of a processing procedure in the task adjunct event waiting management means of the first embodiment.

FIG. 9 is a diagram showing an example of a system call relating to event waiting in the first embodiment.

FIG. 10 is a block diagram showing a second embodiment of the present invention.

FIG. 11 is a diagram showing a flowchart of a processing procedure in the second embodiment.

FIG. 12 is a block diagram showing an event satisfaction condition storage area group and an event waiting condition storage area group of the second embodiment.

FIG. 13 is a diagram showing a configuration example of registered contents in an event satisfaction condition storage area group of the second embodiment.

FIG. 14 is a block diagram showing a conventional example.

FIG. 15 is a diagram showing a flowchart of a processing procedure in a conventional example.

FIG. 16 is a diagram showing an example of queue formation in a conventional example.

FIG. 17 is a block diagram showing a control structure in a conventional example.

FIG. 18 is a timing diagram when the conventional example is applied to an answering machine.

FIG. 19 is a timing diagram in the case of realizing waiting for a plurality of events in the conventional example.

FIG. 20 is a timing diagram of another case in which waiting for a plurality of events is realized in the conventional example.

[Explanation of symbols]

1 task management means 2 task attached event management means 3 task attached event wait management means 4 task control block group 4-1 to 4-n task control block 5 running task 6 execution waiting task group 6-1 to 6-n execution wait Task 7 Event wait task group 7-1 to 7-n Event wait task 8, 22, 31 Interrupt handler 9 Event satisfaction condition storage area group 9-1 to 9-n Event satisfaction condition storage area 10 Event wait condition storage area group 10 -1 to 10-n event waiting condition storage area 11 event establishment condition table 12 event state storage area 12-1, 12-2 mail box 12-3 time waiting timer 12-4 wakeup request counter 13 event waiting management area 14, 201-203 system call 30 response task 31 tape control handler 32 key monitoring task 30 ₁ to 30 ₇ , 31 ₁ ~ 31 ₇ , 32 ₁ ~ 32 ₇
Sequence 38 Voice end waiting sequence 39 Elapsed waiting sequence 43 Disconnection waiting sequence 44 Abnormal waiting sequence 45 Execution queue 46 Time queue 47 Event queue 48 Message queue 50 Program storage unit 51 Data storage unit 100 Registration contents 1 to registration contents m 100 _a, 300 _a 1 byte 100 _b, 300 _b 2 byte 100 _c, 300 _c 3 byte 101 conditions identification number 102 wait release results 204~233, A1 ~A7, B1 ~B4 step 300 registered event number 301 registered contents 1 registration contents _{m 400,401 1 ~401 3, 402,403 1} , 40
3 ₂ , 404 to 406 pointers 601 to 603 event control information

Claims (2)

[Claims] 1. A type of an executable condition (hereinafter referred to as an event) of a task that is set for each task obtained by subdividing a program (including at least an event wait, a message wait, a time wait, a wakeup wait, etc.), and Event satisfaction condition storage means for storing a satisfaction condition of a state (including at least event waiting, event completion completed, etc.), and event wait release corresponding to the time when the event stored in the event satisfaction condition storage means is satisfied Event waiting condition storage means for storing a condition, a task control block for storing control information for controlling the task, and each time a task event occurs, the event is stored in the event satisfaction condition storage means And a task adjunct event management means for detecting whether or not a target event is established by comparing and collating with the established event establishment condition. The detection function of the task adjunct event management means changes the task in the event wait state to the event wait state, and executes the task when the event wait release condition for the task in the event wait state is satisfied. Task adjunct event wait management means for transitioning to the wait state, event wait task storage means for temporarily storing the task transitioned to the event wait state by the task adjunct event wait management means, and task adjunct event wait management means An execution-waiting task storage means for temporarily storing the task transitioned to the execution-waiting state, an executing task storage means for storing a task executed in a predetermined CPU (central processing unit), Upon receiving control information, the task under execution and the task waiting for execution stored in the task waiting for execution storage unit Event management system in multiprogramming, characterized in that it comprises at least, a task management means for selecting one of the tasks makes a transition to the execution state from among the. 2. A type of executable condition (hereinafter, referred to as an event) of the task, which is set for each task that divides the program (including at least an event wait, a message wait, a time wait, a wakeup wait, etc.), and Event fulfillment condition storage means for storing the fulfillment condition of a state (including at least event waiting, event established), the fulfillment condition for a type of a specific event that is frequently used, and the content of the event wait corresponding to the type And an event wait condition storage means for storing an event wait release condition corresponding to the time when the event stored in the event satisfaction condition storage means or the event satisfaction condition table is stored, A task control block that stores control information for controlling the task, and a task control block that stores the event each time a task event occurs. A task adjunct event management unit that compares and collates with an event establishment condition stored in the standing condition storage unit to detect whether or not a target event is established; and a task adjunct event management unit that receives the control information. A task that transitions a task in the event wait state to the event wait state by the detection function and transitions the task to the execution wait state when the event wait release condition for the task in the event wait state is satisfied. An adjunct event wait management means, an event wait task storage means for temporarily storing the task transitioned to the event wait state by the task adjunct event wait management means, and an execution wait state by the task adjunct event wait management means An execution-waiting task storage means for temporarily storing the transitioned task, and execution by a predetermined CPU (central processing unit) Executing task storage means storing a task to be executed, receiving one of the control information, and selecting one task from among the executing task and the execution waiting task stored in the execution waiting task storage means. An event management method in multi-programming, comprising at least a task management means for selecting and transitioning to an execution state.