JPH1069392A - How the process runs - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide the process executing method for multiprocessing using common resources without spoiling the periodic drivability of a process which performs continuous media processing. SOLUTION: A process uses an abort inhibition function 21 first and aborts itself for inhibition. Then a preempt inhibition part 30 is used to perform preempt inhibition, and processing wherein common resources are used is entered. After the process for the common resources ends, the preempt inhibition part 30 is used immediately to enter a preempt ready state. After all processes end, an abort inhibition reset function 22 is used lastly to reset the abort inhibition. If the process is forcibly ended during the abort inhibition. The process is continuously executed until the abort inhibition is resets and after the abort inhibition is reset, the forcible ending process of the process is performed.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a method for executing a process in an operating system for controlling a computer, and more particularly to a method for executing a process using a shared resource in an operating system providing a multi-processing environment.

[0002]

2. Description of the Related Art In an operating system that provides a multiprocessing environment in which a plurality of processes (or tasks) are executed in parallel in a time-sharing manner, resources shared between processes (shared resources) cannot be allocated to a plurality of processes at the same time. It is necessary to execute a process while performing exclusive control as described above. In order to realize this exclusive control, a method called lock control is widely used in an operating system (OS).

In the lock control, a flag is provided for each shared resource to indicate that the corresponding shared resource is in use. When a process performs a process on a shared resource, it checks whether this flag has been set by another process. If the flag is not set by another process, the flag is set by this process to occupy the resource (this is called "lock"). And
When the process for the shared resource ends, the process resets the flag and releases the resource (this is called "unlock"). On the other hand, if the flag is set by another process, the OS puts this process in a waiting state until the shared resource is unlocked.

By the way, it is assumed that there are a low-priority process 1 and a high-priority process 2 which are executed in parallel, and there is a resource A shared by the two processes. Now, while the process 1 occupies the CPU, the shared resource A is locked, and the shared resource A is locked.
It is assumed that the computer enters a sleep state with the lock. in this case,
Process 2 to which the right to use the CPU is assigned is shared resource A
, The process 2 cannot use the shared resource A because the shared resource A is locked by another process. Therefore, the process 2 cannot be executed continuously.

[0005] The inversion of a high-priority process due to a lock acquired by a low-priority process is called a priority inversion problem. In the case of a conventional operating system, when a priority inversion problem occurs, a low-priority process is acquired by executing a low-priority process that is sleeping while holding a lock with the highest priority. It frees up resources so that high-priority processes can run as soon as possible.

[0006]

In the continuous media processing, the operation of a process for processing data such as moving image data has periodicity. A process scheduling method utilizing this property is provided in Japanese Patent Application No. 8-73673.

However, the priority inversion problem has an adverse effect on a process scheduling method using periodicity. For example, a process 1 for performing continuous media processing,
It is assumed that a process 2 exists and a resource A is shared between the two processes. When the process 1 and the process 2 exclusively control the shared resource A using the lock, there is a possibility that a priority inversion problem may occur, and if this occurs, the periodic driving of the process is impaired.

[0008] Further, when the priority inversion problem occurs, the process having the lock that caused the priority inversion is scheduled with the highest priority, so that another process that performs continuous media processing irrespective of the lock is performed. That is, it affects the periodic drive of the process.

Therefore, in a system for performing continuous media processing, a method of constructing a computer system without using any lock from the beginning to avoid the priority inversion problem can be considered. As a method of performing exclusive control in such a computer system, a process control method in which a process occupies the CPU while a shared resource is used, that is, no other process is scheduled while the shared resource is used, is considered. This can be realized by using the preemption control method provided in the invention of Japanese Patent Application No. 8-97997.
The preemption control method means that the execution of a running process is suspended (this is called "preemption").
In order to prevent this, an interface of “preemption prohibition” and “preemption prohibition release” is prepared, and another process is performed between the time the preemption is prohibited and the time the preemption prohibition is released (this is called “preemption prohibition section”). Even if the scheduling request is issued, the running process is not preempted and continues executing. By performing such control, it is possible to guarantee that only one process uses the shared resource at all times, so that exclusive control can be realized.

However, in this method, when a process running section using a shared resource extends for a long time, the periodic driving of other processes is impaired.

For example, consider a process of extracting resources from a free list that queues available resources shared in the system, initializing the resources, and connecting the resources to a resource allocation list of a certain process. Here, the shared resources requiring exclusive control are a free list and a resource allocation list.

If this process is performed only by setting a preemption prohibited section, the preemption prohibited section must be set from "before touching the free list" to "connecting resources to the resource allocation list". That is, (1) Pre-emption prohibition setting is performed. (2) Resource is taken out from the free list. (3) Resource initialization is performed. (4) Resource is linked to the process resource allocation list. (5) Pre-emption prohibition setting is released. It becomes. Here, the time required for the initialization of the resources is not always short. Actually, it takes several tens of ms to initialize the memory when allocating the memory in the operating system. In such a case, if exclusive control is performed only by setting the preemption prohibited section as described above, one process occupies the CPU for a long time. As a result, the real-time responsiveness is deteriorated, which affects the periodic drive of the continuous media processing.

Therefore, the above processing is performed by (1) setting the preemption prohibition (2) extracting the resource from the free list (3) releasing the setting of the preemption prohibition (4) initializing the resource (5) prohibiting the preemption (6) Connect resources to the resource allocation list of the process. (7) Release preemption prohibition setting. In this way, the requirements are satisfied only in terms of exclusive control. Moreover, the length of the preemption prohibited section is 10μ.
s, and the CPU use right can be transferred to another process during the process (4), so that real-time responsiveness is improved. However, a problem occurs when the process performing this process is forcibly terminated from the outside during the process (4).

A general computer system has a function of forcibly stopping and deleting a process from the outside in preparation for a program runaway. If the process performing the above process using this function is forcibly terminated by another process, etc., the resource initialized in (4) may become an unknown resource that does not belong to any management list. There is.
As a result, resources may not be reclaimed when the operating system kills the process, and the resources may become permanently unavailable. In order to avoid this, there is a method of initializing resources with the resources connected to the free list or the resource allocation list.
In this method, the length of the preemption prohibited section hardly differs from the method of covering the entire processing of the previous example with the preemption prohibited section. As another method, there is a method of separately preparing a list for managing the resources being initialized, and connecting to this list during the processing of (4). However, since the number of processings for changing the list increases, the overhead of the initialization processing is increased. Becomes larger.

The above method cannot be used even when the time required for acquiring the shared resources cannot be reduced to a short time.

Therefore, the present inventor has invented a process execution method that can perform processing of a shared resource by using a preemption control method without affecting the periodic drive of continuous media processing.

Accordingly, it is an object of the present invention to provide a method of executing a process using a shared resource of a computer system that performs continuous media processing.

[0018]

According to the present invention, when a process uses a shared resource, its own process cannot be forcibly terminated in advance (this is referred to as "not aborted", so that it is not aborted). "Abort prohibited"). Then, "preemption prohibited" is set so that the process of the own process is not interrupted. Then, when the use of the shared resource is finished, the preemption prohibition is released. When all the processing for the shared resource is completed, it declares that the own process may be forcibly terminated (this is called “abort inhibition release”). The section in which the process from declaring the abort prohibition to declaring the abort prohibition release cannot be forcibly terminated is called an abort prohibition section. If a forced termination request for the process is included in this abort prohibition section, Then, the execution of the process is continued until the abort prohibition section ends, and when the abort prohibition is canceled, the process is forcibly terminated.

When the use time of the shared resource is long, only one process dedicated to the processing is prepared in the system, and a queue for sending a request to the process is prepared. Then, the process for performing another continuous media process requests a dedicated process for processing before starting the periodic drive, and enters the periodic drive after the process for the shared resource is completed. The processing request is put in the previous queue. In the dedicated process, it is guaranteed that there is only one process for processing the shared resource in the system. Therefore, the process for the shared resource can be performed in a preemptable state, and operates in parallel with the periodic drive process. can do.

By combining these two process execution methods, in a multiprocessing environment in which a plurality of processes operate in parallel, a plurality of processes using a shared resource can be used without affecting other processes which are periodically driven. The process can be executed.

[0021]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail.

FIG. 1 shows a group of modules and data necessary for the present invention.

In FIG. 1, reference numeral 10 denotes a table for managing a process, in which an abort request flag 1 is set.
1, an abort inhibition flag 12, and a counter 13 for counting the abort inhibition nest. Reference numeral 20 denotes a process management unit that manages a process, reference numeral 21 denotes an interface function for performing abort prohibition, reference numeral 22 denotes an interface function for releasing abort prohibition, and reference numeral 200 denotes a process that requires processing of a shared resource. is there. The function 40 using the shared resources in the process 200 holds the work areas 23 and 37. Reference numeral 30 denotes a preemption control unit based on Japanese Patent Application No. 8-97997, which counts the scheduler 31, the preemption prohibition function 32, the preemption prohibition release function 33, the scheduling request flag 34, the preemption prohibition flag 35, and the nest of preemption prohibition. Is held.

FIG. 2 shows the flow of control for inhibiting abort and preemption in a process for realizing the present invention. When performing a process related to a shared resource, the function 40 in the process 200 that performs the process first uses the abort prohibition function 21 to prohibit the own process from being aborted (10
1). Then, immediately before using the shared resource, the own process is set to the preemption inhibition function 32 in the preemption inhibition unit 30.
, The preemption is prohibited (102), and the process for using the shared resource is started (103). As soon as the processing for the shared resource is completed, the preemption prohibition is released by using the preemption prohibition release function 33 in the preemption prohibition unit 30 (104). Here, the preemption prohibition section from the preemption prohibition to the prohibition release (102 to 104) can be set for a time that does not affect the periodic driving property, for example, 10% or less of the minimum unit time for managing the periodic driving. Limited to processing on shared resources that end in time. Until the next preemption is declared, preemption is possible, and processing that requires a long time for processing, such as initialization of allocated resources, is performed (105). During this time, another process may be scheduled and execution of the process 200 may be suspended. Then, when it becomes necessary to process the shared resource again, the process 200 sets its own process to the preemption prohibited state again (106). Then, after performing the process for the shared resource (107), the preemption prohibition is released (108). When all the processes are completed, the abort prohibition is finally released using the abort prohibition release function 22 (109).

In the example of FIG. 2, there are two preemption prohibited sections between the abort prohibition and the abort prohibition release, but the number of preemption prohibited sections actually present is three.
It may be more than one.

FIG. 3 is a flowchart showing in detail the internal processing of the abort prohibition procedure 101 in FIG. The process of FIG. 3 is performed by the abort prohibition function 21 shown in FIG. First, the abort prohibition function 21 executes the process 200
Is checked whether the abort prohibition flag 12 in the process management table 10 that manages the
0). If the abort prohibition flag 12 is OFF,
This is turned on (121). Thereafter, the value of the counter 13 is increased by one (122). The processing in FIG. 3 is performed inseparably as a whole.

FIG. 4 is a flowchart showing in detail the internal processing of the preemption prohibition procedures 102 and 106 in FIG. The processing in FIG. 4 is performed by the preemption prohibition function 31 shown in FIG. First, the preemption prohibition function 3
1 checks whether the preemption prohibition flag 35 in the preemption control unit 30 is in the OFF state (130).
If the abort prohibition flag 35 is OFF, it is turned ON (131). Then, the value of the counter 36 is set to 1
(132). The processing in FIG. 4 is performed inseparably as a whole.

FIG. 5 is a flowchart showing in detail the internal processing of the preemption prohibition canceling procedures 104 and 108 in FIG. The processing in FIG. 5 is performed by the preemption inhibition release function 32 shown in FIG. First, the preemption prohibition canceling function 32 checks whether the value of the nest of the function (described later) passed by the first argument matches the value of the counter 36 (140). If they do not match, abnormal processing is performed. If they match, the preempt control unit 30
The value of the counter 36 is decremented by one (141). As a result, if the value of the counter 36 is a positive value, the processing ends as it is (142). When the value becomes 0 or a negative value, the preemption inhibition flag is turned off (143). Next, the scheduling request flag 34 in the preemption control unit 30 is checked (144). If it is OFF, the process ends. If ON, the scheduler 31 is started (14
5) Enter the process scheduling process.

FIG. 6 is a flowchart showing in detail the internal processing of the abort inhibition release procedure 109 in FIG. The process of FIG. 6 is performed by the abort inhibition release function 22 shown in FIG. First, the abort prohibition canceling function 22 counts the value of the nest of the function (described later) passed as the first argument
A check is made to see if the value matches the value (step 150). If they do not match, abnormal processing is performed. If they match, the value of the counter 13 in the process management table 10 managing the process 200 is decremented by 1 (151). As a result, if the value of the counter 13 is a positive value, the process ends as it is (152). When it becomes 0 or a negative value, the abort prohibition flag is turned off (153). Next, the abort request flag 11 in the process management table 10 is checked (154). If it is OFF, the process ends. If it is ON, the process management unit 20 is started and the abort process of the process 200 is started (155).

In FIG. 6, when the process ends with the abort request flag 11 being OFF, the process management unit 20 sets the scheduler 3
1 and reschedule the process.

In FIG. 1, while the abort inhibition flag 12 is ON, that is, the abort inhibition function 21
Is called and the abort prohibition flag 12 is turned on, and the abort prohibition release function 22 is called and the abort prohibition flag 12 is turned off. The abort prohibition flag 12 is OFF when a process is generated, and is turned ON only when the abort prohibition function 21 is called. After the process 200 calls the abort prohibition function 21 to turn on the abort prohibition flag 12, if the process 200 is forcibly terminated in the abort prohibition section, that is, while the abort prohibition flag 12 is on, The management unit 20 performs only the process of turning on the abort request flag 11, and continues the process of the process 200. Then, when the process 200 calls the abort prohibition release function 22 and turns off the abort prohibition flag, the process 200 is forcibly terminated.

In FIG. 1, while the preemption inhibition flag 35 is ON, that is, after the preemption inhibition function 32 is called and the preemption inhibition flag 35 is turned ON, the preemption inhibition release function 3
3 is called and the preemption inhibition flag 35 is turned off
The period until the time is set to the preemption prohibited section. The preemption prohibition flag 35 is OFF when the system is started, and is turned ON only when the preemption prohibition function 32 is called. After the process 200 calls the preemption prohibition function 32 and turns on the preemption prohibition flag, the preemption prohibition flag 35 is turned off.
If a scheduling request to another process occurs during the period of N, the scheduler 31 performs only the process of turning on the scheduling request flag 34, does not perform scheduling of the other process, and executes the process 200.
Processing is continued. Then, when the process 200 calls the preemption prohibition release function 33 and turns off the preemption prohibition flag 35, the scheduler 31 turns off the scheduling request flag and sets the process 20
0 execution is interrupted and another process is scheduled.

In FIG. 2, 102-104 and 106
Since the period from to 108 is a preemption prohibited section and the CPU usage right is not transferred to another process, only the running process uses the shared resource. Therefore,
Other processes do not use the shared resource, exclusive processing of the resource can be realized, and multi-processing of continuous media processing using the shared resource can be performed. Also,
Since the abort section is prohibited between 101 and 109, the process disappears while acquiring the resources due to the forced termination.
Resources are never permanently unavailable.

Abort prohibition and cancellation of abort prohibition are performed by the following interfaces.

<Function name> abort_disable (* level) <Argument> level: The depth of the nest of a pair formed by this function and the function abort_enable is returned.

<Explanation> This function changes the running process to the abort prohibited state. This function and the function abort_enable may be issued as a pair in the interval from issuing this function to transition to the abort disabled state to issuing the function abort_enalbe and returning to the abort enabled state. That is,
The pair of this function and the function abort_enable can be nested. With this function and the function abort_enable issued inside the nest, the state transition between the abort disabled state and the abort enabled state is not performed. The argument level returns the depth of this nesting.

<Function name> abort_enable (level) <Argument> level: Specifies the nesting level returned by the function abort_disable that is paired with this function.

<Explanation> This function returns the running process to the abortable state. In the interval from issuing the function abort_disable to change to the abort disabled state and issuing this function to return to the abort enabled state, the function abor
t_disable and this function may be issued in pairs. That is, the pair of the function abort_disable and this function can be nested. The function abort_disable issued inside the nest and this function do not change the state between the abort disabled state and the abort enabled state. The argument level specifies the depth of this nesting, that is, the value of level obtained by issuing the paired function abort_disable. operating·
The system also holds this value. If the value does not match the nesting depth specified by the argument, an error return is returned.

When the function 40 in the process 200 uses the abort prohibition function 21, the current nest depth returned from the abort prohibition function 21 is set to the work area 2 in its own function.
3 is stored. Then, when issuing the abort prohibition release function 22, the value stored in the work area is specified as an argument of the function. The abort prohibition cancel function compares this value with the current nesting depth, and returns an error if they do not match. With this function, it is possible to easily detect a program error that there is no abort prohibition cancel function to be paired with the abort prohibition function.

Further, the preemption prohibition and the preemption prohibition release processing are performed using the preemption prohibition and preemption prohibition release interface invented in Japanese Patent Application No. 8-97997. That is, the following interface is used.

<Function Name> preempt_disable (* level) <Argument> level: The nesting depth of the pair formed by this function and the function preempt_enable is returned.

<Explanation> This function changes the running task to the preemption disabled state. In the interval from issuing this function and transiting to the preemption disabled state until issuing the function preempt_enable and returning to the preemption enabled state,
This function and the function preempt_enable may be issued as a pair. That is, the pair of this function and the function preempt_enable can be nested. This function and the function preempt_enable issued inside the nest do not change the state between the preemption disabled state and the preemption enabled state. level
Returns the nesting depth.

<Function Name> preempt_enable (level) <Argument> level: Specifies the nesting level returned by the function preempt_disable that is paired with this function.

<Explanation> This function returns the running task to the preemptible state. The function preempt_disable and this function may be issued as a pair during the period from issuing the function preempt_disable and transitioning to the preemption disabled state until issuing this function and returning to the preemption enabled state. That is, the pair of the function preempt_disable and this function can be nested. The function preempt_disable and this function issued inside the nest do not change the state between the preemption disabled state and the preemption enabled state. For level, specify the depth of this nesting, that is, the value of level obtained by issuing the paired function preempt_enable. The kernel also holds this nesting depth, and returns an error if it does not match the nesting depth specified by the argument.

When the function 40 in the process 200 uses the preemption prohibition function 31, the current depth of the nest returned from the preemption prohibition function 31 is stored in the work area 37 in the own function. Then, when issuing the preemption prohibition release function 32, the value stored in the work area is specified as an argument of the function. The preemption disable function compares this value with the current nesting depth,
If they do not match, an error is returned. With this function, it is possible to easily detect a program error that there is no preemption prohibition cancel function to be paired with the preemption prohibition function.

Next, when the use time of the shared resource is long,
An embodiment of a method of executing a process using a shared resource will be described.

In this embodiment of the process execution method, the process for performing the periodic driving is to acquire necessary resources by using the process execution method described below when the periodic driving is not performed before the start of the periodic driving. After the processing is completed, the periodic driving of the own process is started. After the start of periodic driving, resources are not obtained in the process execution method described below.

FIG. 7 shows a module group required for the present invention.

In FIG. 7, reference numerals 210 to 212 denote processes that want to use a shared resource, and reference numeral 220 denotes the only process that can perform processing on a specific shared resource. This process is hereinafter referred to as a serialization process. Serialization process 2
20 resides in the system. 300 is process 2
A processing request notification unit for notifying the serialization process 220 of the processing requests 10 to 212;
There is only one for 0 and the serialization process 220
As always, it resides in the system. 310-312
Sends a processing completion notification from the process 220 to the process 210
A process completion notification unit for notifying the processes 210 to 212, which is assigned when the processes 210 to 212 are generated or when a process request is generated. The processing request notification unit 300 and the processing completion notification units 310 to 312 each have a queue 40 inside.
0, 410-412.

Next, the processing of FIG. 7 will be described with reference to the flowcharts of FIGS.

FIG. 8 is a flowchart illustrating the processes of processes 210 to 212 that require a process for a shared resource. The processes 210 to 212 notify the processing request notifying unit 300 of the processing request in order to request the processing from the process 220 capable of performing processing on the shared resource (160). After the notification is completed, the process 210 that has performed the notification
.About.212 immediately wait for processing completion acceptance (161).
When the processing completion is notified from the processing completion notification units 310 to 312 (161), the processing completion notification is received from the queues 410 to 412 in the processing completion notification units 310 to 312 (16).
2) End the processing for the shared resource.

FIG. 9 is a flowchart for explaining the processing of the processing request notification unit 300. The processing request notification unit 300 is always waiting to receive a processing request notification (171).
When the notification of the processing request is received (170), the processing requests are put into the queue 400 in the order of reception (17).
1) The process 220 is notified that a processing request has occurred (172).

FIG. 10 is a flowchart illustrating the processing of the serialization process 220 that can perform processing on the shared resource. The serialization process 220 is also the processing request notification unit 3
Similar to 00, the process request notification is always waiting (180). When a notification of the occurrence of a processing request is received from the processing request notifying unit 300 (180), a processing request is received from the queue 400 in the processing request notifying unit 300 (181), and processing is performed on the shared resource corresponding to the request (182). ). After the processing is completed, the process 220 is executed by the process 21
The completion of the processing and the processing result are notified to the processing completion notifying sections 310 to 312 of 0 to 212 (183). The serialization process 220 checks whether the next request has been notified, and if so, performs the next request processing. If there is no notification, the next request is awaited (180).

FIG. 11 shows the processing completion notifying sections 310 to 312.
5 is a flowchart illustrating the process of FIG. The processing completion notification units 310 to 312 wait for completion notification reception at the same time as the processes 210 to 212 issue the processing request (19).
0). Then, when the processing completion is received from the serialization process 220 (190), the received processing completion notification and the processing result are put into the queues 410 to 412 (191), and the processes 210 to 212 are notified of the processing completion (192).

In the example of FIG. 7, the number of processes requesting the processing of the shared resource is three. However, the processing is the same even when the number of processes is two or less or four or more.

The serialization process 220 in FIG. 7 always operates in a preemptable state.

The processes 210 to 212 perform the above-described processing (FIG. 8) before the start of the periodic driving, that is, in a state irrelevant to the periodic driving. , To start periodic driving.

When the process execution method based on the serialization process as described above is used, there is no need to perform exclusive control of the shared resource because only one serialization process directly processes the shared resource. In addition, since the process for the shared resource is performed by a dedicated and independent preemptable process, it is possible to execute a process that does not affect the periodic drive of another process that performs continuous media processing.

[0059]

As described above, according to the present invention, in a multiprocessing environment using shared resources,
A shared resource can be used between processes without affecting the periodic driving of the process for performing continuous media processing or the like.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a module group and data according to the present invention.

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

FIG. 3 is a flowchart showing a processing procedure of an abort prohibition function 21 in FIG.

FIG. 4 is a flowchart showing a processing procedure of a preemption prohibition function 31 in FIG. 1;

FIG. 5 is a flowchart showing a processing procedure of a preemption prohibition canceling function 32 in FIG. 1;

FIG. 6 is a flowchart showing a processing procedure of an abort inhibition release function 22 in FIG. 1;

FIG. 7 is a configuration diagram of a module group according to another embodiment.

8 is a flowchart showing a processing procedure of processes 210 to 212 in FIG.

FIG. 9 is a flowchart illustrating a processing procedure of a processing request notifying unit 300 in FIG. 7;

FIG. 10 is a flowchart illustrating a processing procedure of a serialization thread 220 in FIG. 7;

FIG. 11 is a processing completion notifying unit 310 to 312 in FIG.
6 is a flowchart showing the processing procedure of FIG.

[Explanation of symbols]

10 process management table, 11 abort request flag, 12 abort prohibition flag, 20 process management unit, 21 abort prohibition function, 22 abort prohibition release function, 30 preempt control unit, 31 ...
... scheduler, 32 ... preemption prohibition function, 33
... Preemption prohibition release function, 34... Scheduling request flag, 35... Preemption prohibition flag, 2
20 .... Serialization process

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Takahiro Nakano 1099 Ozenji Temple, Aso-ku, Kawasaki City, Kanagawa Prefecture Inside the Hitachi, Ltd.System Development Laboratory (72) Inventor Kazuto Serizawa 1099 Ozenji Temple, Aso-ku, Kawasaki City, Kanagawa Prefecture Stock Company Hitachi, Ltd. System Development Laboratory

Claims (2)

[Claims] 1. A method for executing a process of acquiring a shared resource, operating a resource, and releasing a resource in a computer system in which a plurality of processes operate in parallel, wherein the process is prohibited from being aborted and the preemption is prohibited. After obtaining the shared resources used by the process, canceling the preemption prohibition of the process and operating the shared resources, disabling the process preemption, and releasing the shared resources by the process A method of canceling the preemption prohibition of the process and canceling the abort prohibition, and executing a forced termination request of the process generated during the abort prohibition after the cancellation of the abort prohibition. 2. A method of executing a process in a computer system in a multi-processing environment that periodically drives a process related to the process after the execution of the process for operating the shared resource is completed. Providing a queue of a requesting process, executing a process at the head of the queue requesting a process for the shared resource in a multi-processing environment, and after completion of the execution of the process, periodically driving a process related to the process. And sequentially executing the processes registered in the queue.