KR100372886B1 - Real time scheduling method by standby process - Google Patents

Abstract

It is an object of the present invention to provide a real-time scheduling method for a user by processing a process of creating and destroying user processes through a standby process on a real-time operating system in which a plurality of processes exist. According to the present invention, a structure of a program from an operator is provided. According to the request to start the creation and management of the desired number of waiting processes, create the number of waiting processes, configure the waiting process column for storing information about the generated waiting process, and then the waiting process sequence to the user block A first step of connecting; A second step of, when a program execution request message is input from a user, preparing to perform the waiting process and executing the waiting process prepared for execution; And a third step of stopping, if the program termination request message is input from the user while the second step is in progress, and inserting the waiting process in the waiting process row. And a fourth step of extinguishing the waiting process and deleting a waiting process row storing information on the waiting process when an operation stop of management of the waiting process is requested from an operator while performing the waiting process. A real time scheduling method is provided.

Description

Real time scheduling method by standby process {Real time scheduling method by standby process}

The present invention relates to a real-time scheduling method through a standby process, and more particularly, to a method for providing real-time scheduling to a user by processing through a standby process of creating and destroying user processes on a real-time operating system in which a plurality of processes exist. .

In systems such as exchanges, the creation and destruction of processes frequently occurs during routine operations such as call processing, so the management of these processes has a significant impact on the performance and service response time of the entire system. For this reason, many existing real-time operating systems have tried to minimize the code of the operating system used to create and destroy the processor. In this case, the technique used was a simple performance improvement task of directly minimizing the code performed at the time of generation and destruction through omission and fixation. Alternatively, a technique is used to shorten the overall creation and destruction time by using a smaller process (thread) than the general process.

The present invention has been made to solve the problems of the prior art as described above, by introducing the concept of the standby process to enable real-time scheduling by reducing the creation and destruction time of processes frequently occurring on the real-time operating system, the user As with the method, the purpose is to provide a process control interface transparently and simply, and to provide a method for creating and destroying a process with very little code execution in the operating system.

1 is a configuration diagram of a hardware system to which the present invention is applied;

2 is an internal configuration diagram of an operating system 200 operating in a hardware system to which the present invention is applied.

3 is a flowchart illustrating a real-time scheduling method through a waiting process according to an embodiment of the present invention.

FIG. 4 is a flowchart further embodying a real-time scheduling method through the waiting process illustrated in FIG. 3.

♠ Explanation of symbols for the main parts of the drawing ♠

100: hardware system (system in which the operating system of the present invention operates)

101: CPU (Central Processing Unit)

102: main memory

103: serial device (for input and output of the operating system)

104: Ethernet device (used for loading and debugging protocols of the operating system)

105: SCSI (Small Computers System Interface) Device (save and load files)

106: timer device (used for time management of the operating system)

200: operating system (operating system to which the present invention is applied)

201: SCSI server (SCSI Server, server controlling the SCSI device)

202: serial server (server controlling serial devices)

203: Ethernet Server (Ethernet Server, Server Controlling Ethernet Device)

204: process management (module to which the present invention is applied)

205: semaphore (module for inter-process synchronization)

206: message queue (module for inter-process communication)

207: Memory management (module that provides independent memory space for each user through MMU (Memory Management Unit) control)

208: CPU control (module for central processing unit control)

209: time management (server controlling the timer device)

According to the present invention for achieving the object as described above, when the creation and management start of the desired number of waiting processes is requested from the operator according to the structure of the program, the number of waiting processes are generated, and A first step of configuring a waiting process row for storing information, and then connecting the waiting process row to a user block; A second step of, when a program execution request message is input from a user, preparing to perform the waiting process and executing the waiting process prepared for execution; And a third step of stopping, if the program termination request message is input from the user while the second step is in progress, and inserting the waiting process in the waiting process row. And a fourth step of destroying the waiting process and deleting a waiting process row storing information on the waiting process when an operation stop of the waiting process is requested from an operator during the waiting process. A real time scheduling method is provided.

In addition, when the management start of the standby process is input to the computer, a first step of performing a standby process, and then configuring a standby process sequence belonging to the user block; A second step of controlling an operation of a waiting process according to a state of a corresponding queue among waiting queues configured in the first step when a process creation and destruction request message is input; And a third step of erasing the corresponding waiting processes and deleting the waiting process row when a management stop message of the waiting process is input. If a request for interruption of the management of the waiting process is requested by an operator while the waiting process is being performed, a fourth step of destroying the waiting process and deleting the waiting process row storing information about the waiting process may be executed. A computer readable recording medium having recorded thereon a program is provided.

In the following, with reference to the accompanying drawings, a preferred embodiment according to the present invention will be described in detail.

1 is a configuration diagram of a hardware system to which the present invention is applied. The CPU 101 and the main memory 102 are present in the hardware system 100 in which the program of the present invention is executed. Serial Device (103), Ethernet Device (104) used for loading and debugging protocols of the operating system, SCSI used for storing and loading user files (SCSI: Small Computers System Interface, 105) ) And a timer device 106 used for time management of a real-time operating system.

2 is an internal configuration diagram of an operating system 200 operating in a hardware system to which the present invention is applied. The operating system 200 includes a SCSI server 201 providing a file system function, a serial server 202 managing input / output, There are functional blocks such as an Ethernet server 203 providing an external communication function, a process manager 204 managing a process in an operating system, a semaphore 205 and a message queue 207 for interprocess synchronization and communication.

There is also a time manager 209 for the real-time function, a memory manager 207 and a CPU controller 208 for controlling hardware dependent parts.

3 is a flowchart illustrating a real-time scheduling method through a waiting process according to an embodiment of the present invention.

First, in step S301, the user requests management of the waiting process and the operating system generates a waiting process according to the request value, and then configures a waiting process row belonging to the corresponding user block, and in step S302, after this point in time Process creation and destruction of the user program that occurs occurs in conjunction with the management of the standby process. That is, upon creation and destruction of a process request from the user, the operation of the waiting process is controlled according to the state of the corresponding queue. Subsequently, in step S303, the user program repeats while performing the control of the processor, and when the user's program ends, it receives the interruption of management of the standby process, destroys the corresponding standby processes, and initializes the data structure for managing the standby process. Done.

FIG. 4 is a detailed flowchart illustrating the real-time scheduling method through the waiting process illustrated in FIG. 3, which will be described in detail as follows.

First, in step S401, when the operating system is requested to start standby process management from the user, in step S402, as many waiting processes as the user wants are created. At this time, the desired number is closely related to the operation structure of the program. For example, if the number of processes that must be alive at the same time in a particular user program is three to four, you can reset the number of waiting processes to four, in which case the original waiting processes are continuously replaced and replaced. To do the work. In other words, assuming that a particular program executes or destroys a process 1000 times, and assumes that 4 processes are alive at the same time, when operating in the process of waiting process, 4 processes are created and destroyed and 2000 times. You will need to switch process execution. This value is very small compared to the time taken to create 1000 processes and destroy them 1000 times.

Subsequently, in step S403, a process of forming a waiting process row is connected to the user block to start management, and in step S404, a process instruction for executing and terminating a program received from the user after starting management of the waiting process is described. To judge.

As a result of the determination in step S404, if it is a program execution instruction, in step S405, the queue of the user block that has requested an input at the time of process creation is checked, and in step S406, it is determined whether there is a waiting process that can be allocated in the future. .

As a result of the determination in step S406, if there is a waiting process, the process proceeds to the execution process of the waiting process in step S407. In step S408, after switching to the corresponding user code, the process returns to step S404. The time used here is very short compared to the creation time of the process.

As a result of the determination in step S406, if no waiting process exists, in step S409, an arbitrary process is generated and ready to be executed, and then the flow advances to step S408. At this time, it is created and executed in the same way as the existing process management.

On the other hand, if the determination result in step S404 is a program termination command, it is determined in step S410 whether the process to be extinguished is a waiting process.

As a result of the determination in step S410, if the process to be extinguished is not a waiting process, in step S411, the process of the user block is destroyed and the process proceeds to step S412. If the determination in step S410 indicates that the process to be extinguished is a standby process In step S412, it is determined whether there is a request to stop management of the waiting process. If the determination in step S412 indicates that there is no request for stopping management of the waiting process, in step S413, the operation of the waiting process is stopped and the process is in the queue of the corresponding block. After the insertion, the process returns to the above step S404.

As a result of the determination in step S412, if there is a waiting process management stop request, the waiting process of the user block is extinguished in step S414, and in step S415, the waiting process sequence associated with the user block is deleted and then terminated.

In the normal repeating program, steps S401 to S403 are executed only once at an initial time, and the steps S404 to S413 are repeated. For this reason, if the execution time is shortened in steps S404 to S413, the execution time can be shortened as a whole.

The present invention as described above is recorded on a computer-readable recording medium, and can be processed by a computer.

As described in detail above, the present invention does not perform the creation and destruction of a processor by using a standby process that has been created in accordance with the program structure of the user in advance, rather than performing the creation and destruction of the processor whenever a user requests. By transparently providing the user with the process of creating and destroying the process simply by changing the code execution location, users can expect very fast processing speed by using the same structure as the existing process control interface. In this case, the present invention has a great effect on improving the performance of the system and reducing the response time in a place such as a call processing program of an exchange, in which a process generation and destruction frequently occur during the execution of a program, since the use of a more effective system is possible. .

In addition, since the process of creating and destroying the process is less than that of the existing process control method, it is also effective to minimize the fragmentation of the memory used for process management.

The technical spirit of the present invention has been described above with reference to the accompanying drawings, but this is by way of example only and not by way of limitation to the present invention. In addition, it is obvious that any person skilled in the art may make various modifications and imitations without departing from the scope of the technical idea of the present invention.

Claims (5)

When an operator requests creation and management of a desired number of waiting processes according to the structure of a program, an operator creates a waiting process number, configures a waiting process column for storing information about the created waiting process, and then waits for the waiting process. Linking columns to user blocks; A second step of, when a program execution request message is input from a user, preparing to perform the waiting process and executing the waiting process prepared for execution; A third step of stopping, if the program termination request message is input from the user while the second step is in progress, and inserting the program into a waiting process row; And a fourth step of destroying the waiting process and deleting a waiting process row storing information on the waiting process when an operation stop of the waiting process is requested from an operator during the waiting process. Real time scheduling method. The method of claim 1, The second step, Real-time scheduling by examining the state of the waiting process row of the user block and preparing to perform the waiting process if there is an assignable waiting process, and creating a new process if the assignable waiting process does not exist. Way. The method of claim 1, The third step, Determining whether the process to be destroyed is a waiting process, if the waiting process is stopped, inserting the running waiting process into the waiting process row, and if not, the corresponding process is destroyed. delete On your computer, When an operator requests creation and management of a desired number of waiting processes according to the structure of a program, an operator creates a waiting process number, configures a waiting process column for storing information about the created waiting process, and then waits for the waiting process. Linking columns to user blocks; A second step of, when a program execution request message is input from a user, preparing to perform the waiting process and executing the waiting process prepared for execution; A third step of stopping, if the program termination request message is input from the user while the second step is in progress, and inserting the program into a waiting process row; If a request for interruption of the management of the waiting process is requested by an operator while the waiting process is being performed, a fourth step of destroying the waiting process and deleting the waiting process row storing information about the waiting process may be executed. A computer-readable recording medium that records a program.