JP2003067204A - Computer system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve a problem which the design review of the entire code of a program is required. SOLUTION: A computer system where plural programs are operated in parallel is provided with a shared resource access information record table 106, a resource access collecting means 103 which collects a shared resource access time quantity, a shared resource access information collecting means 110 which records the shared resource access time quantity into the shared resource access information record table, a parallel execution management table 107, an execution sequence initialization means 105 which refers to the shared resource access information record table and initializes the parallel execution management table, and a parallel execution management means 104 which updates the parallel execution management table after receiving the completion notice of the execution from each function and authorizes the function to be carried out next by referring to the parallel execution management table. As a result, the system decreases the conflict of access to the shared resource as much as possible and optimizes the access.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer system for optimizing parallel processing of a plurality of programs operating in parallel while sharing computer system resources.

[0002]

2. Description of the Related Art In a conventional parallel processing optimization method for a computer system, loop processing and matrix processing in individual programs are divided and each divided processing is allocated to each parallelized processor. In addition, it optimizes the parallelization of processing within individual programs.

[0003]

In the conventional parallel processing optimization method for a computer system described above, only specific processing in individual programs is parallelized, and a plurality of programs operating in parallel are to be parallelized. The means for optimizing the parallelism has been implemented by the program designer visually confirming the code of the program. As a result, when a program created without assuming parallelization is changed to be executed in parallel, the program designer has reviewed the design of the entire code of the program.

Further, in the conventional parallel processing optimization method for a computer system, the optimizing means is the optimization by dividing the processing, which is the optimization of the processing as seen from the collision with the shared access resource in the computer system. Therefore, there is a problem that there is a limit to the improvement of the throughput of all the programs executed in parallel.

The present invention has been made to solve the above-mentioned problems, and when a plurality of programs execute, it is possible to reduce the contention of access to a shared resource shared by each program as much as possible. An object of the present invention is to obtain a computer system capable of optimizing access when a plurality of programs are executed in parallel.

[0006]

A computer system according to the present invention is a computer system having a computer system shared resource group composed of a plurality of shared resources and having a plurality of functions and a plurality of programs operating in parallel. A shared resource access information record table having a function of the program and a shared resource access information column for each shared resource; and shared resource access information when the function of the program accesses the shared resource. Resource access collection means, shared resource access information collection means incorporated in each function for recording the collected shared resource access information in the shared resource access information column of the shared resource access information recording table, and each shared resource A parallel execution management table that records the execution order of each function in the Table, the execution order initialization means for initializing the parallel execution management table based on the shared resource access information, the execution completion notifying means incorporated in each function for notifying execution completion, and Parallel execution management means for updating the parallel execution management table in response to a notification of completion of the execution from a function and for giving an execution right to a function to be executed next by referring to the parallel execution management table Is.

The computer system according to the present invention is
The program further includes a program priority table that defines the priority of each program, and the execution order initialization means refers to the shared resource access information recording table and the program priority table, the shared resource access information, and the priority. The parallel execution management table is initialized based on the frequency.

The computer system according to the present invention is
The shared resource access information is a shared resource access time amount.

The computer system according to the present invention is
The shared resource access information is a shared resource access size.

The computer system according to the present invention is
A computer system having a computer system shared resource group configured of a plurality of shared resources and having a plurality of functions, in which a plurality of programs operate in parallel, and the functions of the programs and shared resource access for each of the shared resources A shared resource access priority table in which priorities are recorded, a parallel execution management table in which the execution order of each function is recorded for each of the shared resources, and the shared resource access priority table is referred to to identify the shared resource access priority table. And an execution order initialization means for initializing the parallel execution management table, an execution completion notifying means incorporated in each function for notifying completion of execution, and a notification of completion of the execution from each function. The parallel execution management table is updated and the execution right is given to the function to be executed next by referring to the parallel execution management table. Those having an execution management unit.

Further, in the computer system according to the present invention, the parallel execution management table further has a shared resource access time limit defining an access time limit for each of the shared resources, and the parallel execution management means is the By referring to the shared resource access time limit of the parallel execution management table, the execution right is transferred from the function that has exceeded the access time limit to each shared resource to the next function in the execution order.

[0012]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiment 1. A computer system according to Embodiment 1 of the present invention will be described with reference to the drawings. 1 is a diagram showing the overall configuration of a computer system according to Embodiment 1 of the present invention. In each figure, the same reference numerals indicate the same or corresponding parts.

In FIG. 1, 101 is a computer system shared resource group, which comprises a LAN controller connected to a LAN, a disk controller, a disk device, a memory, an input / output controller, a system bus and the like.

Further, in the figure, 102 is an operating system, and 103 is a resource access collecting means incorporated in the operating system 102. Reference numeral 104 denotes a parallel execution management unit that operates under the control of the operating system 102 in the computer system, and 1
Reference numeral 05 is an execution order initialization means, 106 is a shared resource access information recording table, and 107 is a parallel execution management table.

Further, in the figure, reference numeral 108 denotes a plurality of program groups (programs A to M) operating under the control of the parallel execution management means 104 in the computer system,
109 is a function incorporated in the program (function A1
-Function AN, ..., Function M1 to Function MN), 110 is shared resource access information collection means incorporated in the function, 11
Reference numeral 1 denotes an execution completion notifying means incorporated in the function.

FIG. 2 is a diagram showing a detailed structure of means and tables related to the shared resource access information collecting means of the program function of the computer system according to the first embodiment of the present invention. Further, FIG. 2 shows the operation at the stage of collecting shared resource access information of the computer system.

In FIG. 2, 101 is a computer system shared resource group, 102 is an operating system, 10
Reference numeral 3 is a resource access collecting means incorporated in the operating system 102, and 106 is a shared resource access information recording table recorded by the shared resource access information collecting means 110 incorporated in the function of the program described later.

In the figure, 108 is a program operating under the control of the parallel execution management means 104, 109 is a function incorporated in the program 108, and 110 is a function 1.
The shared resource access information collecting means incorporated in 09 is shown.

Further, in the figure, 201 is an information recording means for recording the shared resource access information of the function in the shared resource access information recording table 106, and 202 is an instruction to the resource access collecting means 103 to start the information collection. Information collection start means 203, resource access collection means 10
3 is an information collection ending means for instructing the end of the information collection. The information recording means 201, the information collection start means 202, and the information collection end means 203 constitute the shared resource access information collection means 110.

FIG. 3 is a diagram showing a detailed configuration of means and tables related to the execution order initialization means and the parallel execution management means of the computer system according to the first embodiment of the present invention. Further, FIG. 3 shows the operation of a plurality of programs of the computer system before and after the operation stage.

In FIG. 3, reference numeral 104 denotes a parallel execution management table, which will be described later, upon receipt of notification of completion of execution from the execution completion notifying means 111 incorporated in each function, and the execution right is given to the function to be executed next. Parallel execution management means for giving 1
06 is a shared resource access information recording table, 108 is a program that operates under the control of the parallel execution management means 104,
109 is a function incorporated in the program 108, 105
Is an execution order initialization means for creating a parallel execution management table described later by referring to the shared resource access information recording table 106, 107 is a parallel execution management table recorded and referenced by the parallel execution management means 104, and 111 is the function 109 Is an execution completion notifying means for notifying the parallel execution management means 104 of the completion of the execution of the function 109 after the execution.

FIG. 4 is a diagram showing rearrangement of functions in a plurality of programs operating in parallel by the execution order initialization means of the computer system according to the first embodiment of the present invention.

In FIG. 4, 401 is each function (A1, A
2, ..., D2, D3) and 402 are respective programs (programs A, B, C, D). Further, 403 is a function sequence (shared resource a) of the access queue (parallel execution management table 107) after rearrangement, which is grouped by the execution order initializing unit 105 in the order of the shared resource with the largest access time.
Access array, ..., Shared resource d access array).

FIG. 5 is a diagram showing the structure of the shared resource access information recording table of the computer system according to the first embodiment of the present invention.

In FIG. 5, 501 is a program identifier, 502 is a function identifier, and 503 is a shared resource access time amount. Further, 504 is one shared resource a existing in the computer system, and in the line indicated by 505, 300 is assigned to the shared resource a by the function A1 of the program A,
It indicates that the access time amount was 0 for other shared resources. The shared resource access time amount shown in FIG. 5 shows an example in which the function A1 accesses only the shared resource a for the sake of simplification of description, but it may access a plurality of shared resources.

FIG. 6 is a diagram showing the structure of the parallel execution management table of the computer system according to the first embodiment of the present invention.

In FIG. 6, each row 601 corresponds to each shared resource (a, b, c, d, ...). Except for the queue type (1, 2, 3, ...) column in the first row, the columns of 602 are arranged in the order in which the function identifiers (A1, A2, ...) Are executed from the left, and elements that are not used are It has a value of 0.

Next, the operation of the computer system according to the first embodiment will be described with reference to the drawings.

FIG. 7 is a flow chart showing the processing of the information collection starting means of the program function of the computer system according to the first embodiment of the present invention.

In step 701 of FIG. 7, the information collection starting means 202, as shown in FIG. 2, instructs the resource access collecting means 103 of the operating system 102 to start measuring the access time of all shared resources. .

FIG. 8 is a flow chart showing the processing of the information collection end means of the program function of the computer system according to the first embodiment of the present invention.

In step 801 of FIG. 8, the information collection end means 203 instructs the resource access collection means 103 of the operating system 102 to end the measurement of access times of all shared resources, as shown in FIG. .

FIG. 9 is a flow chart showing the processing of the information recording means of the program function of the computer system according to the first embodiment of the present invention.

In step 901 of FIG. 9, the information recording means 201 uses the program identifier and the function identifier as keys, and the program identifier column 501 and the function identifier of the shared resource access information recording table 106 shown in FIG. The corresponding line is searched from the column 502, and the corresponding position is determined as the recording position. Then, in step 902,
The access time amount of all shared resources is read from the resource access collection means 103 of the operating system 102. Next, in step 903, the access time amount of all shared resources is calculated as the shared resource access information recording table 10.
It is added to the current value of the element defined as the recording position of the shared resource access time amount column 503 of No. 6.

FIG. 10 is a flow chart showing the processing of the execution completion notifying means of the function of the program of the computer system according to the first embodiment of the present invention.

In step 1001 of FIG. 10, the execution completion notifying means 111 uses the program identifier of each program to which each head function of the other rows than the row (queue) on the parallel execution management table 107 to which the function 109 belongs, ,
The program identifier of the program 108 to which the function 109 belongs is compared, and if they match in step 1002, in step 1003, the program identifier and the program identifier and function identifier to be executed next are passed, and the parallel execution management means is passed. Notify the completion of the function to 104. If they do not match in step 1002, step 1003 is not executed and the process ends.

FIG. 11 is a flow chart showing the processing of the execution sequence initialization means of the computer system according to the first embodiment of the present invention.

In step 1101 of FIG. 11, the execution order initialization means 105 refers to the shared resource access information recording table 106 shown in FIG. 5 and sets the number of existing shared resource rows as shown in FIG. The parallel execution management table 107 having the number of columns of existing functions is created, and all the elements are initialized to 0.

Next, at step 1102, a work pointer is set in the shared resource access information recording table 106 shown in FIG. 5 and the parallel execution management table 107 shown in FIG. That is, the pointer is set to the first column of the shared resource access information recording table 106, and the pointer is set to the parallel execution management table 107.

Next, in step 1103, it is judged whether or not the scanning of all the rows of the shared resource access information recording table 106 is completed. If completed, the processing is terminated. To step 1104 of.

Next, in step 1104, the shared resource having the largest access time amount is obtained for the line pointed to by the current work pointer in the shared resource access information recording table 106.

Next, at step 1105, the pointer on the parallel execution management table 107 is set to the leftmost vacant element in the row of the shared resource obtained at step 1104 on the parallel execution management table 107.

Next, in step 1106, the function identifier pointed to by the pointer of the shared resource access information recording table 106 is copied to the position obtained in step 1105 on the parallel execution management table 107.

Next, at step 1107, the pointer of the shared resource access information recording table 106 is advanced by one in the row direction.

After that, the processing of steps 1103 to 1107 is repeated.

FIG. 12 is a flow chart showing the processing of the parallel execution management means of the computer system according to the first embodiment of the present invention.

In step 1201 of FIG. 12, the parallel execution management means 104 causes the execution completion notifying means 11 of FIG.
In step 1, it is checked whether or not there is an execution completion notification from the function. When the execution completion notification is not received from the function, the execution completion notification from the function is waited again.

Next, at step 1202, it is judged whether all the functions have been completed (whether the queue (the parallel execution management table 107 shown in FIG. 6) is empty), and if all the functions have been completed, the parallel processing is executed. The execution management means 104 ends the process. On the other hand, if all functions are not completed yet,
Proceed to the next step 1203.

Next, at step 1203, the function notified of the completion of execution is queued (parallel execution management table 10
Remove from 7) and fill the contents of the queue to the beginning (left).

Next, in step 1204, as shown in FIG.
The element on the parallel execution management table 107 corresponding to the program identifier and the function identifier to be executed next, which is passed from the execution completion notifying means 111, is pointed to. That is, the parallel execution management table 107 is scanned to determine whether the function is a request function for execution request notification. If the function is a request function for execution request notification, the process proceeds to the next step 1205.

Then, in step 1205, if found, the function identifier of the function is moved to the head of the line (queue) to fill the space.

As described above, according to the first embodiment, the access status to the shared resource of each function is stored in the shared resource access information recording table 106 at the stage of collecting the shared resource access information, which is the first execution. Since the information is recorded and the processing order is changed based on the information, the functions of accessing the same shared resource operate in parallel, and it is possible to suppress the deterioration of performance. Further, although the execution order of the functions is exchanged, the execution order of the functions in the original program is maintained, so that the result of the program does not change.

Embodiment 2. A computer system according to Embodiment 2 of the present invention will be described with reference to the drawings. The basic configuration of the computer system according to the second embodiment is the same as that of the first embodiment. However, the means and table for collecting the shared resource access time, which is the shared resource access information, is unnecessary.

FIG. 13 is a diagram showing a detailed configuration of means and tables related to the execution order initialization means and the parallel execution management means of the computer system according to the second embodiment of the present invention. Further, FIG. 13 shows the operation of a plurality of programs of the computer system before and after the operation stage.

In FIG. 13, reference numeral 1301 denotes a shared resource access priority table storing the definition of access priority for each shared resource of each function of each program. Since the other configurations are the same as those in the first embodiment, the duplicated description will be omitted.

FIG. 14 is a diagram showing the structure of the shared resource access priority table of the computer system according to the second embodiment of the present invention.

In FIG. 14, 1401 is a program identifier and 1402 is a function identifier column. Reference numeral 1403 is a column storing the shared resource access priority corresponding to each shared resource of the function. In the line 1404, the function of the function identifier A1 of the program identifier A indicates that the access priority to the shared resource a is 6. The larger the priority, the higher the priority, but the opposite case is also possible.

FIG. 15 is a diagram showing the structure of the parallel execution management table of the computer system according to the second embodiment of the present invention.

In FIG. 15, each row 1501 corresponds to each shared resource (a, b, c, d, ...). 1502
Except for the queue type (1, 2, 3, ...) column in the first row, the function identifiers are arranged in order from the left with the highest priority of access to the shared resource, and the unused elements are 0. Contains the value of.

Next, the operation of the computer system according to the second embodiment will be described.

FIG. 16 is a flow chart showing the processing of the execution sequence initialization means of the computer system according to the second embodiment.

In step 1601 of FIG. 16, the execution order initialization means 105 creates the parallel execution management table 107 shown in FIG. 15 by referring to the shared resource access priority table 1301 shown in FIG.

Next, in step 1602, all rows are scanned from the top row (queue) of the parallel execution management table 107 created in step 1601.

Then, in step 1603, the shared function access priority table 1301 is referred to and the function columns to be executed in each row (queue) are rearranged in descending order (higher priority order). The basic processing of the execution order initialization means 105 according to the second embodiment is similar to the processing of the execution order initialization means 105 according to the first embodiment shown in FIG. Recording table 1
Instead of 06, the shared resource access priority table 13
Refer to 01.

As described above, according to the second embodiment, in addition to the effect that the functions for accessing the same shared resource in the first embodiment do not operate in parallel and the performance is not deteriorated, On the other hand, it is possible to obtain the effect that the function requiring a higher priority can be preferentially executed.

Third Embodiment A computer system according to Embodiment 3 of the present invention will be described with reference to the drawings. The basic configuration of the computer system according to the third embodiment is the same as that of the first embodiment.

FIG. 17 is a diagram showing a detailed structure of means and tables related to the execution order initialization means and the parallel execution management means of the computer system according to the third embodiment of the present invention. Further, FIG. 17 shows the operation of a plurality of programs of the computer system before and after the operation stage.

In FIG. 17, reference numeral 1701 denotes a program priority table which stores the definition of the execution priority of each program. Since the other configurations are the same as those in the first embodiment, the duplicated description will be omitted.

FIG. 18 is a diagram showing the structure of the program priority table of the computing system according to the third embodiment of the present invention.

In FIG. 18, 1801 is a column storing the program identifiers (A, B, C, D, E) of each program, and 1802 is the execution priority (1
0, 9, 8, 7, 6).

FIG. 19 is a diagram showing the structure of the parallel execution management table of the computer system according to the third embodiment of the present invention.

In FIG. 19, each row 1901 corresponds to each shared resource (a, b, c, d, ...). 1902
Except for the queue type (1, 2, 3, ...) column in the first row, the function identifiers are arranged in order from the left with the highest priority of the program, and 0 is entered for unused elements. ing.

Next, the operation of the computer system according to the third embodiment will be described.

FIG. 20 is a flow chart showing the processing of the execution sequence initialization means of the computer system according to the third embodiment.

In step 2001 of FIG. 20, the execution order initialization means 105 refers to the shared resource access information recording table 106 and the program priority table 1701 shown in FIG. 18 to refer to the parallel execution management table 107 shown in FIG. To create.

Next, in step 2002, all rows are scanned from the top row (queue) of the parallel execution management table 107 created in step 2001.

Then, in step 2003, referring to the program priority table 1701, the function columns to be executed in each row (queue) are rearranged in descending order (higher priority order). The basic processing of the execution order initialization means 105 according to the third embodiment is the same as the processing of the execution order initialization means 105 according to the first embodiment shown in FIG. Reference numeral 1701 (first key) and the shared resource access information recording table 106 (second key).

As described above, according to the third embodiment, in addition to the effect that the functions for accessing the same shared resource in the first embodiment do not operate in parallel and the performance is not lowered, a high priority is given. The effect that the function belonging to the requested program can be preferentially executed is obtained. The third embodiment can also be applied to other embodiments.

Fourth Embodiment A computer system according to Embodiment 4 of the present invention will be described with reference to the drawings. The basic configuration of the computer system according to the fourth embodiment is the same as that of the first embodiment.

FIG. 21 is a diagram showing the structure of the parallel execution management table of the computer system according to the fourth embodiment of the present invention.

In FIG. 21, each row 2101 corresponds to each shared resource (a, b, c, d, ...). 2102
In each column, except for the queue type (1, 2, 3, ...) column in the first row, the function identifiers (A1, ...) Are arranged in the order of execution, and the unused elements have a value of 0. There is. 21
Column 03 indicates the time during which one function for each shared resource is allowed to access the shared resource in one execution, and the shared resource access time limit (10, 9, 8, 7, ...).

Next, the operation of the computer system according to the fourth embodiment will be described.

FIG. 22 is a flow chart showing the processing of the parallel execution management means of the computer system according to the fourth embodiment.

In step 2201 of FIG. 22, the parallel execution management means 104 reads the interrupt interval (shared resource access time limit) of the parallel execution management table 107 shown in FIG. 21 and sets a timer so that an interrupt will be issued to itself. To do. Since it is set individually for a plurality of shared resources, in the example shown in FIG.
The timer is started at 9, 8, 7, ....

Next, in step 2202, an event is awaited, and in the case of completion notification from the function, the same processing as the parallel execution management means 104 according to the first embodiment shown in FIG. 12 is performed, and the previous step 2201 is executed. When the timer set in step 1 is started, the process proceeds to the next step 2203.

Next, in step 2202, it is checked which shared resource queue should be processed.

Next, in step 2204, it is checked whether or not there is an unprocessed shared resource at this interrupt. If there is no shared resource, the process returns to step 2202, and if a plurality of shared resources must be processed, the process is executed. The following steps 2205 to 2207 are repeated by the number of times.

In step 2205, the interruption notification indicating that the shared resource access time limit has been reached is transmitted to the function currently being executed to interrupt the execution.

In step 2206, the function is moved to the end of the queue, and the entire queue is moved to the left.

In step 2207, the parallel execution management means 104 gives the execution right to the function that has newly become the head of the queue.

In the computer system according to the fourth embodiment, the parallel execution management table 107 has a shared resource access time limit defining a time limit for access to each shared resource of each function 109 of each program 108. The execution management unit 104 refers to the shared resource access time limit and transfers the execution right from the function that has exceeded the time limit to each shared resource, so that the specific function monopolizes the specific shared resource. I did not try to do it. In addition, it can be applied to other embodiments.

As described above, according to the fourth embodiment, in addition to the effect that the functions for accessing the same shared resource in the first embodiment do not operate in parallel to reduce the performance, the parallel execution management means The 104 refers to the shared resource access time limit in the parallel execution management table 107, and transfers the execution right from the function of which the time limit has been reached to another function to each shared resource, so that the specific function is identified. The effect of not monopolizing shared resources is obtained.

Embodiment 5. A computer system according to Embodiment 5 of the present invention will be described with reference to the drawings. The basic configuration of the computer system according to the fifth embodiment is similar to that of the first embodiment. The operation is similar to that of the first embodiment, and the shared resource access size is used instead of the shared resource access time amount as the shared resource access information.

FIG. 23 is a diagram showing the structure of the shared resource access information recording table of the computer system according to the fifth embodiment of the present invention.

In FIG. 23, 2301 is a program identifier and 2302 is a function identifier. Reference numeral 2303 is a column storing a shared resource access size corresponding to each shared resource of the function. In the line 2304, the function having the function identifier A1 of the program identifier A indicates that the access size to the shared resource a is 1024.

In the computer system according to the fifth embodiment, each function 109 of each program 108 sets the access size when operating the shared resource of the computer system in the execution of the collection stage of the shared resource access information. Collected by the resource access collection means 103 incorporated in the system 102, and record the access size as shared resource access information in the shared resource access information recording table 106 shown in FIG. The fifth embodiment can also be applied to each of the above embodiments.

As described above, according to the fifth embodiment, it is possible to classify the access competition for the shared resource between the parallel processes from the viewpoint of the access size, and to perform the process of mass accessing a certain shared resource. The effect that it is possible to avoid operating in parallel is obtained.

[0098]

As described above, the computer system according to the present invention includes a computer system shared resource group composed of a plurality of shared resources, and has a plurality of functions and a plurality of programs operating in parallel. And a shared resource access information recording table having a function of the program and a shared resource access information column for each shared resource, and shared resource access information when the function of the program accesses the shared resource. Resource access collecting means, a shared resource access information collecting means incorporated in each function for recording the collected shared resource access information in the shared resource access information column of the shared resource access information recording table, and the shared resource A parallel execution management table that records the execution order of each function for each, and the shared resource access information And the execution order initializing means for initializing the parallel execution management table on the basis of reference to the shared resource access information recording table, and execution completion notification means incorporated in each function of notifying that the execution has been completed,
Parallel execution management means for updating the parallel execution management table in response to the notification of completion of the execution from each function, and for giving an execution right to the function to be executed next by referring to the parallel execution management table Therefore, it is possible to reduce the contention for access to the shared resource as much as possible, and it is possible to optimize the access when a plurality of programs execute in parallel.

Further, the computer system according to the present invention is
As described above, the program priority table that defines the priority of each program is further provided, and the execution order initialization means refers to the shared resource access information recording table and the program priority table to access the shared resource. Since the parallel execution management table is initialized based on the information and the priority, it is possible to reduce the contention for access to the shared resource as much as possible and give priority to the processing of a specific program. .

The computer system according to the present invention is
As described above, since the shared resource access information is the shared resource access time amount, it is possible to reduce the contention for access to the shared resource as much as possible, and optimize the access when a plurality of programs execute in parallel. The effect that it can be achieved is produced.

Further, the computer system according to the present invention is
As described above, since the shared resource access information is the shared resource access size, contention for access to the shared resource can be reduced as much as possible, and the access is optimized when a plurality of programs execute in parallel. There is an effect that can be.

Further, the computer system according to the present invention is
As described above, it has a computer system shared resource group composed of a plurality of shared resources and has a plurality of functions.
A computer system in which a plurality of programs operate in parallel, the functions of the programs, and a shared resource access priority table in which the shared resource access priority is recorded for each shared resource, and execution of each function for each shared resource A parallel execution management table that records the order, an execution order initialization unit that refers to the shared resource access priority table and initializes the parallel execution management table based on the shared resource access priority, and that execution is completed The execution completion notifying means incorporated in each function for notifying the execution of the notification, and updating the parallel execution management table upon receiving notification of completion of the execution from each function, and executing the next execution by referring to the parallel execution management table. Since it has a parallel execution management means for giving execution right to the function to be executed, it is possible to reduce the contention of access to the shared resource as much as possible. High functionality of access priority with respect to each shared resource there is an effect that it is possible to preferentially executed.

Further, in the computer system according to the present invention, as described above, the parallel execution management table further has a shared resource access time limit defining an access time limit for each shared resource, and the parallel execution is performed. The management means refers to the shared resource access time limit of the parallel execution management table and transfers the execution right from the function that has exceeded the access time limit to each shared resource to the next function in the execution order. It is possible to reduce the contention of access of the device as much as possible and prevent a specific function from monopolizing a specific shared resource.

[Brief description of drawings]

FIG. 1 is a diagram showing an overall configuration of a computer system according to a first embodiment of the present invention.

FIG. 2 is a diagram showing a related configuration of a shared resource access information collection unit of the computer system according to the first embodiment of the present invention.

FIG. 3 is a diagram showing a related configuration of an execution order initialization unit and a parallel execution management unit of the computer system according to the first embodiment of the present invention.

FIG. 4 is a diagram showing a process of rearranging the functions of the execution order initialization means of the computer system according to the first embodiment of the present invention.

FIG. 5 is a diagram showing a configuration of a shared resource access information recording table of the computer system according to the first embodiment of the present invention.

FIG. 6 is a diagram showing a configuration of a parallel execution management table of the computer system according to the first embodiment of the present invention.

FIG. 7 is a flowchart showing the processing of the information collection starting means of the shared resource access information collecting means of the computer system according to the first embodiment of the present invention.

FIG. 8 is a flowchart showing the processing of the information collection end means of the shared resource access information collection means of the computer system according to the first embodiment of the present invention.

FIG. 9 is a flowchart showing the processing of the information recording means of the shared resource access information collecting means of the computer system according to the first embodiment of the present invention.

FIG. 10 is a flowchart showing a process of an execution completion notifying means of the computer system according to the first embodiment of the present invention.

FIG. 11 is a flowchart showing the processing of the execution order initialization means of the computer system according to the first embodiment of the present invention.

FIG. 12 is a flowchart showing a process of parallel execution management means of the computer system according to the first embodiment of the present invention.

FIG. 13 is a diagram showing a related configuration of an execution order initialization unit and a parallel execution management unit of the computer system according to the second embodiment of the present invention.

FIG. 14 is a diagram showing a configuration of a shared resource access priority table of the computer system according to the second embodiment of the present invention.

FIG. 15 is a diagram showing a configuration of a parallel execution management table of the computer system according to the second embodiment of the present invention.

FIG. 16 is a flowchart showing the processing of the execution sequence initialization means of the computer system according to the second embodiment of the present invention.

FIG. 17 is a diagram showing a related configuration of an execution order initialization unit and a parallel execution management unit of the computer system according to the third embodiment of the present invention.

FIG. 18 is a diagram showing the structure of a program priority table of the computer system according to the third embodiment of the present invention.

FIG. 19 is a diagram showing a configuration of a parallel execution management table of a computer system according to the third embodiment of the present invention.

FIG. 20 is a flowchart showing the processing of the execution sequence initialization means of the computer system according to the third embodiment of the present invention.

FIG. 21 is a diagram showing a configuration of a parallel execution management table of a computer system according to the fourth embodiment of the present invention.

FIG. 22 is a flowchart showing the processing of the parallel execution management means of the computer system according to the fourth embodiment of the present invention.

FIG. 23 is a diagram showing a structure of a shared resource access information recording table of the computer system according to the fifth embodiment of the present invention.

[Explanation of symbols]

101 computer system shared resource group, 102 operating system, 103 resource access collecting means,
104 parallel execution management means, 105 execution order initialization means, 106 shared resource access information recording table, 10
7 Parallel execution management table, 108 programs, 10
9 functions, 110 shared resource access information collection means, 1
11 execution completion notifying means, 201 information recording means, 20
2 information collection start means, 203 information collection end means, 1
301 shared resource access priority table, 1701
Program priority table.

Claims (6)

[Claims] 1. A computer system comprising a computer system shared resource group composed of a plurality of shared resources and having a plurality of functions, in which a plurality of programs operate in parallel, the functions of the programs and the shared resources. A shared resource access information recording table having a shared resource access information column for each, a resource access collecting unit for collecting shared resource access information when the function of the program accesses the shared resource, and the collected shared resource A shared resource access information collecting unit incorporated in each function for recording access information in the shared resource access information column of the shared resource access information recording table, and parallel execution management for recording the execution order of each function for each shared resource. And a table based on the shared resource access information with reference to the shared resource access information recording table. The execution order initialization means for initializing the parallel execution management table by the above, the execution completion notifying means incorporated in each function for notifying the completion of execution, and the notification of the completion of the execution from each function. A computer system comprising: a parallel execution management unit that updates the parallel execution management table and gives an execution right to a function to be executed next by referring to the parallel execution management table. 2. A program priority table defining the priority of each program is further provided, and the execution order initialization means refers to the shared resource access information recording table and the program priority table to access the shared resource. The computer system according to claim 1, wherein the parallel execution management table is initialized based on information and the priority. 3. The shared resource access information is a shared resource access time amount.
The described computer system. 4. The shared resource access information is a shared resource access size.
The described computer system. 5. A computer system comprising a computer system shared resource group composed of a plurality of shared resources and having a plurality of functions, wherein a plurality of programs operate in parallel, the functions of the programs and the shared resources. A shared resource access priority table recording the shared resource access priority for each, a parallel execution management table recording the execution order of each function for each shared resource, and the shared resource access priority table for referencing the shared resource Execution order initialization means for initializing the parallel execution management table based on access priority, execution completion notification means incorporated in each function for notifying completion of execution, and completion of the execution from each function Is notified, the parallel execution management table is updated, and the parallel execution management table is referred to the next function to be executed. Computer system is characterized in that a parallel execution management means for providing a row right. 6. The parallel execution management table further has a shared resource access time limit defining an access time limit for each of the shared resources, and the parallel execution management means has a shared resource access time limit of the parallel execution management table. 6. The execution right is transferred to the next function in the execution order from the function that has exceeded the access time limit for each shared resource with reference to the time limit. Computer system.