JP2019003415A - Information processing device, information processing method, and information processing program - Google Patents

Abstract

To provide an information processing device and the like that can prevent deadlock from occurring by unrequired exclusive control during the execution of a task.SOLUTION: An information processing device comprises: initialization means for, for each lock information created in order to exclude resources accessing during the execution of a task, creating counters corresponding to each of the processors capable of executing the task, and initializing the counter values; and execution means for, as to the execution of the processing occupying the resources during the task, when the counter values of the processors assigned to executing the task are initial values, obtaining the lock information and executing the processing by counting up the counter values of the processors, and for, when the counter values of the processors are not initial values, executing the processing by counting up the counter values of the processors without obtaining the lock information.SELECTED DRAWING: Figure 1

Description

  The present invention relates to an information processing apparatus, an information processing method, and an information processing program that perform exclusive control by spin lock.

  As a method of exclusive control between a task, which is the minimum execution unit in software, and an interrupt that occurs during the execution of the task, a spin lock (Spinlock) is generally used. In the spin lock, one lock variable is prepared in the memory for one resource (spin lock initialization). Of the CPU (Central Processing Unit) or CPU core that executes the task, only the CPU or CPU core that can acquire the lock variable (acquire spin lock) can access the resource.

  The CPU or CPU core releases the lock variable when the access to the resource is completed (spin lock release). As a result, other CPUs or CPU cores can access the resources. If another CPU or CPU core is accessing the resource, the CPU or CPU core keeps waiting until the resource is released while looping until the lock variable can be acquired. In the following description, acquisition or release of a lock variable is also expressed as acquisition or release of a spin lock, respectively.

  FIG. 15 is a diagram for explaining the processing of the functions A and B. As shown in FIG. 15, in the functions A and B, since the processes A and B are processes that need to be excluded, the spin lock is acquired and released before and after the processes A and B, respectively.

  FIG. 16 is a diagram for explaining the execution of the functions A and B. In FIG. 16, the direction indicated by the arrow t indicates the passage of time during the execution of each function. When the function B is executed during the execution of the function A, the acquisition of the spin lock in the function B waits while looping until the spin lock acquired in the function A is released. Therefore, a plurality of processes for acquiring the same spin lock are not executed simultaneously. In addition, other tasks and interrupts are not executed in the CPU or CPU core that is executing processing by acquiring the spin lock.

  Here, Patent Document 1 discloses an electronic control device that can reduce the processing load of a microcontroller by exclusive control and efficiently use processing performance while reliably executing exclusive control on a shared resource.

JP2006-081204

  FIG. 17 is a diagram illustrating an example in which a deadlock occurs during execution of task 1 included in a certain software. Task 1 includes functions A and B. In the function A, after the spin lock is acquired, the function B is called. When the function B is called, the function B executes a process for acquiring a spin lock. At this time, since the spin lock has been acquired by the function A, processing for acquiring the same spin lock multiple times occurs in the task 1, and execution of software stops due to deadlock. Thus, a deadlock that occurs in a certain task is also referred to as a self deadlock.

  If the function call tree changes due to a change in the structure of the software, as described above, a deadlock may occur due to the occurrence of processing to acquire the same spin lock multiple times, and there is a possibility that execution of the software may stop There is.

  Patent Document 1 discloses that the processing time for exclusive control is shortened by changing the execution order of arithmetic processing, but does not disclose a technique for preventing the occurrence of deadlock due to unnecessary exclusive control. .

  The present invention has been made in view of the above problems, and has as its main object to provide an information processing apparatus and the like that can prevent the occurrence of deadlock due to unnecessary exclusive control during task execution.

  The information processing apparatus according to an aspect of the present invention creates a counter corresponding to each processor capable of executing the task for each lock information created to exclude resources accessed during the execution of the task, In the execution of the initialization unit that initializes the value of the counter and the processing dedicated to the resource in the task, when the value of the counter of the processor assigned to the execution of the task is an initial value, the lock information And the process is executed by counting up the counter value of the processor. If the counter value of the processor is not the initial value, the counter value of the processor is counted up without acquiring the lock information. And executing means for executing the processing.

  An information processing method according to an aspect of the present invention creates a counter corresponding to each processor capable of executing a task for each lock information created to exclude resources accessed during the execution of the task, When the counter value of the processor assigned to execute the task is an initial value in the execution of the process dedicated to the resource in the task, the counter value is acquired and the lock information is acquired. The processor counter is incremented to execute the process. When the processor counter is not the initial value, the processor counter is incremented without acquiring the lock information. Run.

  An information processing program according to an aspect of the present invention creates a counter corresponding to each processor capable of executing the task for each lock information created to exclude resources accessed during execution of the task, The lock information is acquired when the counter value of the processor to which the execution of the task is assigned is the initial value in the process of initializing the value of the counter and the process dedicated to the resource in the task. At the same time, the value of the counter of the processor is counted up and the process is executed. If the value of the counter of the processor is not the initial value, the value of the counter of the processor is counted up without acquiring the lock information. The computer executes the process for executing the process.

  According to the present invention, it is possible to prevent the occurrence of deadlock due to unnecessary exclusive control during task execution.

It is a block diagram which shows the structure of the information processing apparatus which concerns on the 1st Embodiment of this invention. It is a figure which shows typically the structure of the information processing apparatus which concerns on the 2nd Embodiment of this invention. It is a functional block diagram which shows the structure of the information processing apparatus which concerns on the 2nd Embodiment of this invention in a functional unit. It is a figure which shows an example of the hardware constitutions of the computer apparatus which implement | achieves the information processing apparatus shown to each embodiment of this invention. It is a flowchart explaining the initialization process of the spin lock by the information processing apparatus which concerns on the 2nd Embodiment of this invention. It is a figure which shows the example of the counter produced by the information processing apparatus which concerns on the 2nd Embodiment of this invention. It is a flowchart explaining the spin lock acquisition process by the information processing apparatus which concerns on the 2nd Embodiment of this invention. It is a flowchart explaining the spin lock release process by the information processing apparatus which concerns on the 2nd Embodiment of this invention. It is a figure which shows typically the structure of the spin lock and counter produced in the information processing apparatus which concerns on the 2nd Embodiment of this invention. FIG. 4 is a diagram for explaining a flow of processing in a task T. It is a figure which illustrates the value of each counter of each core before execution of a spin lock acquisition process in function A, and after execution. It is a figure which illustrates the value of each counter of each core before execution after execution of a spin lock acquisition process in function B. It is a figure which illustrates the value of each counter of each core before execution of a spin lock release process in function B, and after execution. It is a figure which illustrates the value of each counter of each core before execution of a spin lock release process in function A and after execution. It is a figure explaining processing of functions A and B. It is a figure explaining execution of processing of functions A and B. It is a figure explaining the example which a deadlock generate | occur | produces.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

First Embodiment FIG. 1 is a diagram showing a configuration of an information processing apparatus 100 according to a first embodiment of the present invention. As illustrated in FIG. 1, the information processing apparatus 100 includes an initialization unit 110 and an execution unit 120.

  The initialization unit 110 creates a counter corresponding to each processor (core) capable of executing a task for each lock information created to exclude resources accessed during the execution of the task, and sets the value of the counter. initialize.

  The execution unit 120 acquires lock information and counts the value of the processor counter when the value of the counter of the processor to which the execution of the task is assigned is an initial value in the execution of the process dedicated to resources in the task. If the processor counter value is not the initial value, the processor counter value is counted up and the process is executed without acquiring lock information.

  Note that the initialization unit 110 and the execution unit 120 are realized as an example by a spin lock initialization unit 220 and a task execution unit 230 described in the following embodiments, respectively.

  By adopting the above configuration, according to the first embodiment, when lock information is acquired in a task during task execution, processing can be executed without acquiring multiple lock information. Thus, it is possible to prevent the occurrence of deadlock due to unnecessary exclusive control during task execution.

Second Embodiment FIG. 2 is a diagram schematically showing a configuration of an information processing apparatus 200 according to a second embodiment of the present invention. As illustrated in FIG. 2, the information processing apparatus 200 includes a CPU 501. The CPU 501 has a multi-core configuration in which a plurality of processors numbered 1 to N (hereinafter also referred to as “cores”) operate.

  The software 520 is assumed to be software created by a user or the like. An OS (Operating System) 530 controls the operation of the information processing apparatus 200. The software 520 and the OS 530 may be stored in, for example, a storage device of the information processing apparatus 200 described later. The software 520 is executed on the OS 530 by the CPU 501 including cores numbered 1 to N (hereinafter also referred to as “core 1 to core N”).

  FIG. 3 is a functional block diagram showing the configuration of the information processing apparatus 200 shown in FIG. 2 in functional units. As illustrated in FIG. 3, the information processing apparatus 200 includes a spin lock initialization unit 220, a task execution unit 230, and a counter storage unit 240.

  The task execution unit 230 includes a spin lock acquisition unit 231, a processing unit 232, a spin lock release unit 233, and a core number storage unit 234. The task execution unit 230 has a function of executing a task that is a minimum execution unit of a program included in the software 520.

  FIG. 4 is a diagram illustrating an example of a hardware configuration of a computer apparatus 500 that realizes the information processing apparatus according to the present embodiment and the other embodiments. Each component of the information processing apparatus can be realized by any combination of a computer apparatus 500 and software as shown in FIG. 4, for example.

  As shown in FIG. 4, the computer device 500 includes a CPU 501, a ROM (Read Only Memory) 502, a RAM (Random Access Memory) 503, a storage device 505, a drive device 507, a communication interface 508, an input / output interface 510, and a bus 511. Prepare.

  The storage device 505 stores a program 504. The program 504 includes the created software 520 and the OS 530 shown in FIG. The drive device 507 reads and writes the recording medium 506. The communication interface 508 is connected to the network 509. The input / output interface 510 performs data input / output. A bus 511 connects each component.

  As shown in FIG. 2, the CPU 501 has a multi-core configuration. The CPU 501 executes the program 504 using the RAM 503. The program 504 may be stored in the ROM 502. The program 504 may be recorded on the recording medium 506 and read by the drive device 507, or may be transmitted from the external device via the network 509. A communication interface 508 exchanges data with an external device via the network 509. The input / output interface 510 exchanges data with peripheral devices (keyboard, mouse, display device, etc.). The communication interface 508 and the input / output interface 510 can function as means for acquiring or outputting data. Data such as output information may be stored in the storage device 505 or may be included in the program 504.

  When the software 520 illustrated in FIG. 2 is executed by the CPU 501 on the OS 530, the software 520 generates a task that is a minimum execution unit of the program. The software 520 designates a function to be executed by the task and an execution priority when the task is generated. The execution priority is a number greater than or equal to 0, for example, and may be set such that the lower the number, the higher the priority. For each created task, the OS 530 designates a core that executes the task. The task is executed by any one of the cores 1 to N designated by the OS 530.

  The spin lock initialization unit 220 and the spin lock acquisition unit 231, the processing unit 232, and the spin lock release unit 233 of the task execution unit 230 illustrated in FIG. 3, for example, receive software 520 (program code) from the cores 1 to 1 of the CPU 501. Any one of the cores N is realized by reading into the RAM 503 of the information processing apparatus 200 and executing it. Further, the counter storage unit 240 and the core number storage unit 234 illustrated in FIG. 3 may be realized by the RAM 503, for example.

  The task execution unit 230 executes the task on the OS 530 while performing exclusive control by spin lock.

  In exclusive control using spin lock, lock information for exclusive use of resources accessed during task execution by the task execution unit 230 is created. Creating lock information to exclude resources is also referred to as creating (or initializing) a spin lock. Only the core that can acquire the spin lock (lock information) can access the resource.

  FIG. 5 is a flowchart for explaining spin lock initialization processing by the spin lock initialization unit 220 of the task execution unit 230 in the information processing apparatus 200. With reference to FIG. 5, a spin lock initialization process by the spin lock initialization unit 220 will be described. It is assumed that the core number assigned to the execution of the task by the OS 530 is stored in the core number storage unit 234 during the task execution.

  The spin lock initialization unit 220 initializes the spin lock before accessing the resource by the task (step S110).

  Subsequently, the spin lock initialization unit 220 creates counters corresponding to each of the operating CPU cores, initializes them to 0, and stores them in the counter storage unit 240 (step S120). The counter has a value indicating an integer of 0 or more. FIG. 6 is a diagram illustrating an example of a counter created by the spin lock initialization unit 220. As illustrated in FIG. 6, for example, the spin lock initialization unit 220 creates counters of initial values 0 of the cores 1 to N at addresses 1 to N of the RAM 503, respectively.

  FIG. 7 is a flowchart for explaining spin lock acquisition processing by the spin lock acquisition unit 231 of the task execution unit 230.

  The task execution unit 230 executes a spin lock acquisition process shown in FIG. 7 in the spin lock acquisition unit 231 when executing a process exclusive to a certain resource (referred to as process E) during task execution.

  The spin lock acquisition unit 231 acquires the number of the core in which the own task is operating from the core number storage unit 234 (step S210). The spin lock acquisition unit 231 determines the counter value of the acquired core number stored in the counter storage unit 240.

  When the counter value is “0” (initial value) (Yes in Step S220), the spin lock acquisition unit 231 acquires the spin lock (Step S230). Then, the spin lock acquisition unit 231 adds (counts up) “1” to the counter value of the operating core stored in the counter storage unit 240 (step S240).

  On the other hand, when the counter value is not “0” (No in step S220), the spin lock acquisition unit 231 does not acquire the spin lock and stores the counter value of the operating core in the counter storage unit 240 as “ Add 1 ”.

  When the counter value is “0” in the process S220, the spin lock acquisition unit 231 acquires the spin lock and adds “1” to the counter value, and then the processing unit 232 executes the process E. If the counter value is not 0 in step S220, the same spin lock has already been acquired. Therefore, the spin lock acquisition unit 231 adds “1” to the counter value without performing the spin lock acquisition process, and then the processing unit 232 Performs process E.

  FIG. 8 is a flowchart for explaining spin lock release processing by the spin lock release unit 233 of the task execution unit 230. With reference to FIG. 8, the spin lock releasing process by the spin lock releasing unit 233 will be described.

  When the access to the exclusive resource by the processing unit 232 is completed, the spin lock releasing unit 233 acquires the core number in which the task is operating from the core number storage unit 234 (step S310).

  Subsequently, the spin lock release unit 233 reads out the counter value of the acquired core number from the counter storage unit 240 and makes a determination. If the counter value is “0” (Yes in step S320), the spin lock releasing unit 233 ends the process. This is a process considering the case where the spin lock release process is executed when the spin lock is not acquired.

  When the counter value is not “0” (No in Step S320), the spin lock release unit 233 subtracts (counts down) “1” from the counter value of the active core stored in the counter storage unit 240 (Step S320). (S330), the counter value is determined again (step S340).

  When the counter value is “0” (Yes in Step S340), the spin lock release unit 233 releases the spin lock (Step S350). On the other hand, when the counter value is not “0”, the spin lock release unit 233 does not release the spin lock. Thereafter, the task execution unit 230 continues the execution of the task.

Here, FIG. 9 is a diagram schematically illustrating the configuration of the spin lock and the counter created in the information processing apparatus 200. When the number of necessary spin locks is M (M is an integer), M spin locks are created by the OS 530. In FIG. 9, for example, spin lock 1 and spin lock M are spin locks created to exclude resource 1 and resource 2, respectively. Each time a spin lock is created, the software 520 creates counters corresponding to the cores 1 to N, respectively.
[Concrete example]
The operation described above will be described using a specific example. FIG. 10 is a diagram illustrating the flow of processing in task T. In FIG. 10, the direction indicated by the arrow t indicates the passage of time during function execution. The task T includes functions A and B. Functions A and B include processes that require exclusive control of resources that are accessed together.

  In the function A, after the spin lock is acquired, the function B is called. When the function B is called, the spin lock is again acquired in the function B. For this reason, in the case of the flow of FIG. 10, a self deadlock occurs when the spin lock in the function B is acquired. However, since the spin lock acquisition in the function B is executed while the spin lock is acquired in the function A, the acquisition and release of the spin lock in the function B is considered to be an unnecessary process.

  Therefore, in the present embodiment, the spin lock initialization, acquisition, and release processes are performed as described below so that the spin lock acquisition process and the release process that are considered unnecessary as described above are not performed. Will be explained.

  Here, an example in which the task T illustrated in FIG. 10 is executed in the core 1 among the cores 1 to N will be described. At this time, it is assumed that “1” is stored in the core number storage unit 234 of the information processing apparatus 200 as the number of the core assigned to execute the task T.

  Further, it is assumed that before the task T is executed, as shown in FIG. 5, the spin lock initialization unit 220 initializes the spin lock and creates the counters of the cores 1 to N. FIG. 11 is a diagram illustrating the values of the counters of the cores 1 to N before and after the execution of the spin lock acquisition process in the function A shown in FIG. Before the execution of the spin lock acquisition process in the function A, the counter values of all the cores including the core 1 are “0”. Assume that these counters are stored in the counter storage unit 240 of the information processing apparatus 200.

  In executing the function A in the task T, the spin lock acquisition unit 231 executes a spin lock acquisition process shown in FIG. 7 in order to exclude resources to be accessed. That is, as shown in process S210, the spin lock acquisition unit 231 acquires the number of the core in which the task T is operating. Here, the spin lock acquisition unit 231 acquires “1”.

  Subsequently, as illustrated in process S <b> 210, when the spin lock acquisition unit 231 determines the counter value of the core 1 stored in the counter storage unit 240, the counter value of the core 1 is “0”. Therefore, the spin lock acquisition unit 231 acquires the spin lock as shown in the process S230 and adds “1” to the counter value of the core 1. As a result, as shown in FIG. 11, the counter value of the core 1 after execution of the spin lock acquisition process of the function A becomes “1”.

  After the spin lock is acquired, the function A is called in the function A as shown in FIG. FIG. 12 is a diagram illustrating the values of the counters of the cores 1 to N before and after the execution of the spin lock acquisition process in the function B. As shown in FIG. 12, the counter value of the core 1 before the execution of the spin lock acquisition process of the function B is “1”. When the function B is executed in this state, the spin lock acquisition unit 231 executes the spin lock acquisition process shown in FIG.

  The core number acquired in step S210 is “1”, and the counter value of the core 1 at this time is “1” as shown in FIG. Accordingly, since the counter value is not 0 in the process S220, the spin lock acquisition unit 231 does not acquire the spin lock and adds “1” to the counter. As a result, the counter value of the core 1 becomes “2”. Thus, since the same spinlock acquisition process as that acquired by the function A is not performed in the function B, no self deadlock occurs.

  In the function B, the process B is executed by the processing unit 232 without acquiring the spin lock. In the process B, when the access to the resource is completed, the spin lock release unit 233 executes the spin lock release process shown in FIG. FIG. 13 is a diagram illustrating the values of the counters of the cores 1 to N before and after the execution of the spin lock release process in the function B shown in FIG. As shown in FIG. 13, the counter value of the core 1 before the execution of the spin lock release process of the function B is “2”.

  The core number acquired in step S310 is “1”, and the counter value of the core 1 at this time is “2” as shown in FIG. Therefore, since the counter value is not “0” in the process S320, the spin lock releasing unit 233 subtracts “1” from the counter value of the operating core as shown in the process S330. As a result, the counter value of the core 1 becomes “1”.

  Also in the process S340, since the counter value of the core 1 is not “0”, the spin lock release unit 233 does not release the spin lock.

  Subsequently, in the task T illustrated in FIG. 10, the process A is returned to the execution of the function A, and the processing A in the function A is executed by the processing unit 232. Thereafter, the spin lock release unit 233 executes a spin lock release process.

  FIG. 14 is a diagram illustrating the values of the counters of the cores 1 to N before and after the execution of the spin lock release process in the function A shown in FIG. As shown in FIG. 14, the counter value of the core 1 before the execution of the spin lock release process of the function A is “1”.

  The core number acquired in step S310 is “1”, and the counter value of the core 1 at this time is “1” as shown in FIG. Therefore, since the counter value is not “0” in the process S320, the spin lock releasing unit 233 subtracts “1” from the counter value of the operating core as shown in the process S330. As a result, the counter value of the core 1 becomes “0”. Therefore, as shown in process S350, the spin lock releasing unit 233 releases the spin lock.

  Thereby, the process for accessing the exclusive resource is completed, and the process in the function A is subsequently executed.

  As described above, according to the second embodiment, the spin lock initialization unit 220 creates a counter corresponding to each core and initializes the value every time a spin lock is created. When executing a process that occupies resources during task execution, if the value of the counter of the core in which the task is operating is not “0”, the task execution unit 230 obtains the value of the counter without acquiring a spin lock. Count up and execute the above process.

  By adopting the above configuration, according to the second embodiment, when the counter value is not “0”, that is, in the core where the task is operating, the spin lock has already been acquired in the task. In some cases, the process proceeds without acquiring multiple spin locks. As a result, it is possible to prevent the occurrence of deadlock due to unnecessary exclusive control during task execution.

  In addition, since the deadlock can be prevented, even if the call tree of the function is changed due to a software change or the like, there is an effect that it is unnecessary to reconfirm or correct the presence or absence of exclusive control.

  Since a spin lock counter is prepared for each core, when a process that requires exclusive control by spin lock is executed in a different core, the spin lock is acquired for each core.

  There are various modifications to the method for realizing the information processing apparatus in each of the above embodiments. For example, the information processing apparatus can be realized by a combination of a plurality of apparatuses.

  Further, as described above, the spin lock initialization unit 220, the spin lock acquisition unit 231, the processing unit 232, and the spin lock release unit 233 in the information processing apparatus may be realized by the CPU 501 that executes processing according to program control, for example. Good.

  Also, the category of each embodiment includes a processing method in which a program for operating these functions is recorded in the recording medium 506, the program recorded in the recording medium 506 is read as a code, and executed in a computer. . That is, a computer-readable recording medium 506 is also included in the scope of each embodiment. In addition to the recording medium 506 on which the above-described program is recorded, the program itself is included in each embodiment.

  The present invention has been described above with reference to the above-described embodiment. However, the present invention is not limited to the above-described embodiment. That is, the present invention can apply various modes that can be understood by those skilled in the art, such as various combinations and selections of the various disclosed elements, within the scope of the present invention.

100, 200 Information processing device 110 Initialization unit 120 Execution unit 220 Spin lock initialization unit 230 Task execution unit 231 Spin lock acquisition unit 232 Processing unit 233 Spin lock release unit 234 Core number storage unit 240 Counter storage unit 500 Computer device 504 Program 505 Storage device 506 Recording medium 507 Drive device 508 Communication interface 509 Network 510 Input / output interface 511 Bus

Claims (9)

For each lock information created to exclude resources to be accessed during the execution of a task, an initialization unit that creates a counter corresponding to each processor capable of executing the task and initializes the value of the counter;
In the execution of the process dedicated to the resource in the task, if the value of the counter of the processor assigned to the execution of the task is an initial value, the lock information is acquired and the value of the counter of the processor is counted Execution means for executing the processing by counting up the counter value of the processor without acquiring the lock information when the counter value of the processor is not an initial value. Information processing equipment. The execution means counts down the value of the counter of the processor to which the execution of the task is assigned when the access to the resource is completed in the execution of the process dedicated to the resource in the task. The information processing apparatus according to claim 1, wherein when the value is an initial value, the lock information is released and the execution of the task is continued. The information processing apparatus according to claim 2, wherein the execution unit continues the execution of the task without releasing the lock information when a value of the counted down counter is not an initial value. For each lock information created to exclude resources accessed during task execution, create a counter corresponding to each processor capable of executing the task, initialize the value of the counter,
In the execution of the process dedicated to the resource in the task, if the value of the counter of the processor assigned to the execution of the task is an initial value, the lock information is acquired and the value of the counter of the processor is counted An information processing method for executing the processing by counting up the value of the counter of the processor without acquiring the lock information when the value of the counter of the processor is not an initial value. In the execution of the process dedicated to the resource in the task, when access to the resource is completed, the value of the counter of the processor assigned to execute the task is counted down, and the value of the counter that has been counted down is the initial value. The information processing method according to claim 4, wherein if there is, the lock information is released and the execution of the task is continued. The information processing method according to claim 5, wherein when the counted down counter value is not an initial value, the execution of the task is continued without releasing the lock information. For each lock information created to exclude resources to be accessed during the execution of a task, a process corresponding to each processor capable of executing the task is created, and a process for initializing the value of the counter;
In the execution of the process dedicated to the resource in the task, if the value of the counter of the processor assigned to the execution of the task is an initial value, the lock information is acquired and the value of the counter of the processor is counted And executing the process by counting up the value of the processor counter without obtaining the lock information when the counter value of the processor is not an initial value.
An information processing program to be executed by a computer. In the execution of the process dedicated to the resource in the task, when access to the resource is completed, the value of the counter of the processor assigned to execute the task is counted down, and the value of the counter that has been counted down is the initial value. If there is, processing to release the lock information and continue execution of the task,
The information processing program according to claim 7, which is executed by a computer. In the execution of the process dedicated to the resource in the task, when the access to the resource is completed, the value of the counter of the processor assigned to execute the task is counted down, and the value of the counter that has been counted down is not the initial value The information processing program according to claim 8, wherein the computer executes the task without releasing the lock information.

Images