JPH06348666A - Program execution load distribution method in computer system - Google Patents

Abstract

(57) [Summary] [Object] The present invention distributes the load by automatically allocating and executing the method for each class to another computer with a low load when the application program is executed, and separates the method allocated at the end. Erase from the calculator. [Structure] A plurality of computers are connected via a communication medium 20. When a method is executed while the application program 22 is running on the OS 2110 of a certain computer 211, the load balancing unit 23 searches for a low-load computer if the class to which the method belongs is not assigned to any computer. , Allocate that class and transfer all methods belonging to that class. Then, when the class to which the method to be executed belongs is assigned to another computer, the method belonging to that class is requested to the other computer to execute, and when the class to which the method belongs is assigned to the own computer, the method belonging to that class For this, execute it on your own computer. When the application program 22 ends, the load distribution unit 23 deletes from the other computer all the methods belonging to the class assigned to the other computer.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a distributed computer system including a plurality of computers connected by a communication medium, and more particularly to a technique for distributing the load of application program execution in the distributed computer system. .

[0002]

2. Description of the Related Art Conventionally, as a technique for distributing the load of executing an application program in a distributed computer system in which a plurality of computers are connected by a communication medium, an application program is provided in advance in a plurality of computers in a system and There is known a technique in which a computer which is considered to have the highest execution efficiency among these plural computers is specified, and the computer is requested to execute application programs collectively.

In addition to this, Japanese Patent Laid-Open No. 3-42765 and
The technique described in JP-A-2-285460 is known.

According to the technique disclosed in Japanese Patent Laid-Open No. 2-285460, when an application program is executed, a computer that seems to have the highest execution efficiency among a plurality of computers in the system is specified, and at that time, the computer is identified. The application programs are collectively transferred to and requested to be executed.

In the technique disclosed in Japanese Patent Laid-Open No. 3-42765, an application program is divided into predetermined processing units in advance, and a plurality of computers in the system are provided with each processing unit in advance. Then, when the corresponding processing unit is called during the execution of the application program, the computer that seems to have the best execution efficiency is specified in consideration of the execution cost, etc., and the execution of that processing unit is executed for that computer. I'm requesting.

[0006]

However, these conventional methods have the following problems.

That is, in the technique of requesting the execution of the application program to another computer, this application program must be prepared in advance on the other computer to which the execution is requested. Therefore, since each application program that sufficiently distributes the load must be provided in each computer that constitutes the distributed computer system, the resource amount of each computer required for load distribution becomes excessive.

Further, in the technique disclosed in Japanese Patent Laid-Open No. 2-285460, when the scale of the application program becomes large, it becomes impossible to sufficiently distribute the load to each computer.

Further, in the technique disclosed in Japanese Patent Laid-Open No. 3-42765, the processing unit requested to be executed by the application program must be provided in advance in the other computer, and the resource amount of each computer required for load balancing. Will increase. Further, the processing execution cost in each computer for each processing unit must be specified before requesting the execution of the processing unit, but the contents of the table for managing this execution cost differ depending on the computer that executes the application program. It has to be a value. Therefore, when changing the computer that executes the application program from one computer to another computer, the contents of this table must be recreated. Therefore, it is not always suitable for load balancing of application programs that are desired to be used by any computer.

Therefore, an object of the present invention is to provide a distributed computer system capable of sufficiently distributing the load of application program execution without increasing the amount of resources of each computer required for load distribution. And

[0011]

In order to achieve the above-mentioned object, the present invention provides a computer system having two or more computers connected via a communication medium to reduce the load of execution of a program executed by a specific computer. A method of distributing to a plurality of computers including the specific computer, wherein a computer in which a processing unit that is a unit of processing configuring the program is assigned to the specific computer is registered in association with the assigned processing unit. The step of providing a table, the specific computer sequentially executes the processing unit, and when the specific computer executes the processing unit,
Referring to the table, a step of determining whether or not there is a computer to which the processing unit is assigned, and if it is determined that there is no computer to which the processing unit is assigned, Allocating to one of the plurality of computers, registering the allocated computer in the table in association with the allocated processing unit, and causing the allocated computer to transfer and execute the processing unit from the specific computer. Step, and when it is determined that there is a computer to which the processing unit is assigned, the step of causing the computer to execute the processing unit, and the specific computer when the specific computer finishes the execution of the program. Deleting all the processing units transferred from the other computer to the other computer and initializing the table. Providing program execution load distribution method in a computer system with symptoms.

[0012] Here, the table is associated with a registered computer, and a load amount required for execution of the processing unit assigned to the computer is set as a registerable table. At the end of the execution of, the load amount that has already been registered in association with the computer to which the processing unit is assigned is the value obtained by adding the load amount required for executing the method that has finished execution to the load amount. Further, the allocation of the processing unit to the computer is performed by assigning the processing unit to the computer having the smallest cumulative load of execution of the processing unit registered in association with the table. It may be performed by allocating.

[0013]

According to the program execution load distribution method of the present invention, since a processing unit is automatically assigned to each computer during execution of a program, it is not necessary to prepare the processing unit in another computer in advance. Therefore, the program creator and the user are not particularly aware of the distributed processing or the computer that actually performs the processing. In addition, since all the processing units assigned to other computers are deleted when the application program ends, waste of resources is eliminated.

Further, since the computer to be assigned is selected based on only the execution load of the processing unit at the time of executing the program, the load is distributed among the computers constituting the distributed computer system, and the program is similarly distributed on any computer of the system. It can be operated.

[0015]

DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the distributed computer system according to the present invention will be described below.

FIG. 1 shows the configuration of the distributed computer system according to this embodiment.

As shown, computers 211, 212,
A distributed computer system 213 is connected via the communication medium 20. Each computer 211, 212, 213
Is a standard computer including a processor, a storage device, a communication control device, and the like. Now, each computer 211, 212,
213 is an operating system (OS) 211
0, 2120, 2130, and executes the application program on the OS. For example, in the computer 211, the application program 22 is executed on the OS 2110. OS 2110, 2120, 213
0 includes load balancing means 23, 232, and 233, respectively, for balancing the load of execution of application programs. For example, the load distribution unit 23 transfers the processing unit of the application program 22 to the load distribution units 232 and 233 of the other computers 212 and 213 and requests execution. The load balancing units 232 and 233 of the other computers 212 and 213 execute the processing unit requested to be executed, and return the result to the load balancing unit 23 that made the request.

Next, the application program 22 will be described.

The application program 22 is a program written in an object-oriented programming language. In this embodiment, it is described by a programming language widely known as "C ++".

FIG. 2 shows the application program 22.
Indicates.

As shown in the figure, the application program 220 comprises class definitions 51, 52, 53 and a main program 54.

Classes will be described with reference to FIG.

As shown in FIG. 3, the class defined as the class X10 includes a data section 11 which is a set of data definitions and a method section 12 which is a set of methods which are operations for manipulating the data. The data section 11 includes class-specific data definitions 111 to 119, and the method section 12 is a method 121 which is a processing unit for operating the data.
~ 129.

Objects 13 and 14 in the figure are variables whose type is declared to be class X10. Since the objects 13 and 14 represent the instance of the class 10, the definition of the method and the data is common, but the data itself has its own.

Now, returning to FIG. 2, in this program,
First, class definitions 51, 52, and 53 define classes A, B, and C, respectively. In the main program 54, object declarations 541, 542, and 543 declare a class A object c1, a class B object c2, and a class C object c3, respectively.
Next, 544 specifies that the method func1 of the class A to which the object c1 belongs is executed for the object c1. Similarly, 545 specifies that the method func1 of the class B to which the object c2 belongs is executed on the object c2, and 546 executes the method func2 of the class A to which the object c1 belongs on the object c1. Is specified.

Now, the OS 2110 sequentially executes such an application program 22. At this time,
The load distribution means 23, 232, 233 realize the load distribution as described above.

FIG. 4 shows a functional configuration of the load distribution means 23. The load balancing means 232 and 233 also have the same configuration.

In FIG. 4, the communication control means 30 is connected to the communication medium 20 and performs communication between computers. The storage unit 31 stores an application program and an object to be executed on the own computer, a method part of a class assigned to the own computer by another computer, and data of an object sent to the own computer from another computer. . The class management unit 32 stores information on the class assigned to its own computer. The method execution means 33 executes the method in the storage unit 31 based on the information of the class management unit 32. The method execution request means 34 is the communication control means 3
The method execution is requested to the specified computer via 0 and the execution result is obtained. The class transfer means 35 is the communication control means 3
Transfer the method part of the class to the specified computer via 0. The class deletion request means 36 is the communication control means 30.
Request the deletion of the method part of the specified class to the specified computer via. Method proxy execution means 37
Is the method execution requesting means 3 via the communication control means 30.
The method execution means 33 is executed to execute the method requested by the method 4. The class storage unit 38 stores the method unit transferred by the class transfer unit 35 via the communication control unit 30 in the storage unit 31. The class deleting unit 39 deletes the method unit of the class designated by the class deleting requesting unit 36 from the storage unit 31 via the communication control unit 30. The load management unit 40 manages load information regarding the class to which the method executed by the method execution requesting unit 34 and the method executing unit 33 belongs. When the method in a certain class is called from the application program for the first time, the execution selection means 41 specifies a computer with a low load based on the information of the load management part 40, and calls the class transfer means 35 to transfer the method part of the class. , And when the method to be called from the application program when the class to which the method belongs has already been transferred by the class transfer means 35, which computer the class to which the method belongs to is specified based on the information of the load management unit 40. When the designated computer is the self computer, the method execution means 33 is called, and when the designated computer is another computer, the method execution requesting means 34 is called and the information of the load management unit 40 is updated. The program termination means 42 is the load management unit 40.
The class and the computer are designated based on the information of 1., the class deletion requesting unit 36 is called, and the class is deleted from the load management unit 40 until all the classes stored in the load management unit 40 are deleted.

The details of each part of the load distribution means shown in FIG. 4 will be described below.

First, the load management unit 40, as shown in FIG. 5, has a class name 401, a computer name 402 for executing a method of the class 401, and a processing time 403 which is the sum of execution times of all methods of the class 401. , A table storing an identification number 404 for identifying the class 401 by a computer.

As shown in FIG. 6, the class management unit 32 is composed of a table that stores a class name 321 and an identification number 322 of the class 321 in the computer.

Next, the execution selection means 41 is a means which is called with the method name to be executed and its class as arguments and performs the processing according to the flowchart shown in FIG.

That is, the execution selection means 41 first searches for a class from the class name 401 of the load management unit 40 (step 10010). It is checked whether or not the class name can be searched (10020). If the class name can be searched, the computer name 402 corresponding to the class name is obtained and the computer is specified (10).
070).

If the search is not successful, the load management unit 40
The sum of processing times 403 is calculated for each computer name 402 of
The computer with the smallest total processing time is specified (1003
0), it is checked whether it is the own computer (10040), and if it is not the own computer, the class transfer means 35 is called (10).
050) to request the transfer of the method part of the class to which the method to be executed belongs. Then, the class name of the transferred method part and the transferred computer name are registered in the class name 401 and the computer name 402 of the load management part 40, and the processing time 403
Are initialized (10060).

When the machine that executes the method can be specified, it determines whether it is the self-computer or another computer (1008).
0), if it is the own computer, the method execution means 33 is called and the method is executed by the own computer (10090), and if not, the method execution requesting means 34 is called and the method is executed by another computer (10100).

After that, since the method execution time is returned from the method execution means 33 or the method execution request means 34, it is added to the processing time 403 of the load management unit 40 corresponding to the method class (10110), Return the process to the caller.

Next, the class transfer means 35 is a means that is called with the partner computer name and the class name as arguments and executes the processing according to the flowchart shown in FIG.

That is, the class transfer means 35 firstly
The method part of the class is transferred from the storage part 31 to the class storage means 38 of the partner computer (15010), the returned identification number is returned as a return value (15020), and the process is returned to the calling source.

Next, the class storing means 38 is means for performing processing according to the flowchart shown in FIG.

That is, the class storage means 38 stores the method part transferred from another computer in the storage part 31 (13010), registers the class name of the method part in the class name 321 of the class management part 32, The corresponding identification number 322 is returned as a return value (13020), and the process is returned to the calling source.

Next, the method executing means 33 is a means that is called with the method name and the identification number for the computer to identify the class as an argument, and performs the processing according to the flowchart shown in FIG.

The method executing means 33 first selects a class name 321 corresponding to the method class from the identification number 322 of the class management section 32 and specifies the class (110).
10). Then, the method corresponding to the method name passed as the argument of the specified class stored in the storage unit 31 is executed using the object data stored in the storage unit 31 (11020). Then, the execution result and the execution time are set as return values (11030), and the process is returned to the calling source.

Next, the method execution requesting means 34 is a means which is called with the identification number for the computer to identify the name of the partner computer, the method name, and the class thereof, and executes the processing according to the flow chart shown in FIG.

That is, the method execution requesting means 34
First, the method proxy execution means 37 of the partner computer is called via the communication control means 30 with the method name and the class identification number as arguments (14010). Also, at this time,
The data (object data) required to execute the method is read from the storage unit 31 and passed to the method proxy execution unit 37. Then, from the method proxy execution means 37 of the partner computer, the returned execution result and execution time are returned as return values (14020), and the process is returned to the calling source.

Next, the method proxy execution means 37 is a means that is called with the method name and the number by which the other computer identifies the class as an argument, and performs the processing according to the flow chart shown in FIG.

The method proxy execution means 37 first stores the data (object data) necessary for executing the passed method in the storage portion 31, and calls the method execution means 33 with the identification number and the method name as arguments. (120
10). Then, when the execution result and the execution time are returned from the method execution means 33, this is set as a return value (1202
0), the process is returned to the calling source. At this time, the data (object data) necessary for executing the method stored in the storage unit 31 is deleted.

Next, the program terminating means operates as shown in FIG.
It is a means for performing processing according to the flowchart of FIG.

When called, the program terminating means 42 first obtains the class name 401, computer name 402, and identification number 404 of the load management unit 40 (16010), and while the class name exists (16020), the computer It is checked whether the name is the own computer (16030), and if it is the own computer, the class erasing means is called with the identification number as an argument (16040), otherwise, the class erasing request means 36 is called with the computer name and the identification number as the arguments ( 16050), class name 401 of load management unit 40, computer name 402, processing time 40
3, the identification number 404 is deleted (16050). When the class name is gone, the process is returned to the caller.

Next, the class erasing means 39 is a means which is called by using the identification number as an argument and performs processing in accordance with the flowchart shown in FIG.

That is, the class erasing means 39 retrieves the identification number from the identification number 322 of the class management section 32 and specifies the class from the corresponding class name 321 (1701).
0) If the class is assigned by another computer, the method part of the class transferred and stored in the storage unit 31 is deleted (17020). Further, the class and the identification number are deleted from the class name 321 and the number 322 of the class management unit 32 (17030), and the process is returned to the calling source.

Next, the class erasure request means 36 is a means which is called with the partner computer name and the identification number as arguments and performs the processing according to the flowchart shown in FIG.

That is, the class erasing request means 36 first calls the class erasing means 39 of the partner computer via the communication control means 30 (18010) and returns the process to the calling source.

The execution operation of the application program of the distributed computer system according to this embodiment will be described below.

First, FIG. 16 shows a processing procedure performed by the OS 2110 to execute the application program 22.

As shown in the figure, the OS 2110 first
The main program 54 of the application program 22 stored in the storage unit 31 is sequentially executed (190
40). If method execution occurs during processing (19
010), using the method name and the class name as arguments, the execution selection unit 41 of the load distribution unit 23 is called (19020).
When the main program ends (19030)
Calls the program terminating means 42 (19050).

The operation of each part when the application program 22 shown in FIG. 2 is executed by the operation of the OS 2110 is as follows.

First, the application program 22 main program 54 is sequentially executed. FIG. 17 shows the state of the distributed computer system immediately before the execution of the application program 22 is started.

First, object declarations 541 and 54
2 and 543, respectively, an object c1 of class A, an object c2 of class B, an object c of class C
3 is declared. Next, since 544 is a method, the execution selection means 41 is called. Since the method 544 is the method of the class A and the class A is not in the class name 6411 of the load management unit 641, the execution selection unit 41 determines the computer to which the class A is assigned.

Since the load management section 641 has no information, it is decided at random and assigned to the computer 611. Since the computer 611 is a computer executing the application program 22, it is not necessary to transfer the method of the class.

The class A and the computer 611 are connected to the load management unit 64.
A class name 6411 of 1 and a computer name 6412 are stored and the processing time 6413 is initialized. Then, the execution selection means 41 calls the method execution means 33. Method execution means 3
3 executes the method 544 and returns the execution result and the processing time. The execution selection unit 41 adds the returned processing time to the processing time 6413 of the load management unit 641 corresponding to the class A. The execution selection means returns the method execution result to the application program 22. FIG. 18 shows the state of the distributed computer system at this point.

Next, step 545 of FIG. 2 is executed. Since 545 is a method, the execution selection unit 41 is called. Since the method 545 is the method of the class B and the class B is not in the class name 6411 of the load management unit 641, the execution selection unit 41 determines the computer to which the class B is assigned. Since the processing time of the computers 612 and 613 is 0 from the computer name 6412 of the load management unit 641 and the processing time 6413, it is decided randomly from these two and assigned to the computer 613. The computer 613 is the application program 22.
Since it is not the computer 611 that is executing the above, the class transfer means 35 is called. The class transfer means 35 transfers the method part of the class B to the class storage means 38 of the computer 613 via the communication control means 30. Class storage means 3
8 stores the transferred method part in the storage part 653, stores the class B in the class name 6631 of the class management part 663, determines the identification number of the class B, stores it in the identification number 6632, and returns the value. The execution selection means 41 stores the returned identification number, class B and computer 613 in the identification number 6414, class name 6411 and computer name 6412 of the load management unit 641 and initializes the processing time 6413.

Then, the execution selecting means 41 calls the method execution requesting means 34. The method execution requesting means 34 calls the method proxy executing means 37 of the computer 613 via the communication control means 30. The method proxy execution means 37 specifies the method 545 and calls the method execution means. The method execution means executes the method 545 and returns the execution result and the processing time. The execution selection means 41 adds the returned processing time to the processing time 6413 of the load management unit 641 corresponding to the class B. The execution selection means returns the method execution result to the application program 22. FIG. 19 shows the state of the distributed computer system at this point.

Next, step 546 of FIG. 2 is executed. Since 546 is a method, the execution selection unit 41 is called. Since the method 546 is the method of the class A, the execution selection means 41 searches the class name 6411 and the computer name 6412 of the load management unit 641 and the method section of the class A finds the computer 61.
Know that it is assigned to 1. The computer 611 is the computer 6 that is executing the application program 22.
Since it is 11 (own computer), the execution selection means 41 calls the method execution means. Method executing means 33 is method 5
46 is executed and the execution result and the processing time are returned. The execution selection unit 41 adds the returned processing time to the processing time 6413 of the load management unit 641 corresponding to the class A. The execution selection means returns the method execution result to the application program 22. FIG. 20 shows the state of the distributed computer system at this point.

Next, 547 of FIG. 2 is executed. 547
Is a method, the execution selection means 41 is called. In the execution selection unit 41, the method 547 is a method of the class C, and the class C is the class name 6411 of the load management unit 641.
Since it does not exist, the computer to which class C is assigned is determined. Computer name 6412 of the load management unit 641, processing time 6413
Since the processing time of the computer 612 is 0, which is the lowest value, it is assigned to the computer 612. The computer 612 is the computer 611 executing the application program 22.
Therefore, the class transfer means 35 is called. The class transfer means 35 transfers the method part of the class C to the class storage means 38 of the computer 612 via the communication control means 30. The class storage means 38 stores the transferred method part in the storage part 653, stores the class C in the class name 6631 of the class management part 663, determines the identification number of the class C, stores it in the identification number 6632, and returns the value. The execution selection means 41 sets the returned identification number, class C, and computer 612 to the identification number 6414 of the load management unit 641 and class name 641.
1. Store in the computer name 6412 and initialize the processing time 6413. Then, the execution selecting means 41 calls the method execution requesting means 34. The method execution requesting means 34 calls the method proxy executing means 37 of the computer 612 via the communication control means 30. The method proxy execution means 37 specifies the method 545 and calls the method execution means. The method execution means executes the method 545 and returns the execution result and the processing time. The execution selection means 41 adds the returned processing time to the processing time 6413 of the load management unit 641 corresponding to the class B. The execution selection means returns the method execution result to the application program 22. FIG. 21 shows the state of the distributed computer system at this point.

Next, step 548 of FIG. 2 is executed. 548
Is a method, the execution selection means 41 is called. Since the method 548 is the method of the class B, the execution selection means 41 searches the load management unit 641 for the class name 6411 and the computer name 6412, and the method unit for the class B is the computer 6
Know that it is assigned to 13. Since the computer 613 is not the computer 611 executing the application program 22, the execution selecting means 41 calls the method execution requesting means 34. The method execution requesting means 34 calls the method proxy executing means 37 of the computer 613 via the communication control means 30. The method proxy execution means 37 specifies the method 545 and calls the method execution means. The method execution means executes the method 545 and returns the execution result and the processing time. The execution selection means 41 adds the returned processing time to the processing time 6413 of the load management unit 641 corresponding to the class B. The execution selection means returns the method execution result to the application program 22. FIG. 22 shows the state of the distributed computer system at this point.

As described above, the execution of the main program 54 of the application program 22 of FIG. 2 is completed, so that the program terminating means 42 is called. The program terminating means 42 retrieves the class name 6411 and computer name 6412 of the load management section 641 and the method section of class A finds the computer
Know that it is assigned to 11. The computer 611 is the computer 61 that is executing the application program 22.
Since it is 1 (own computer), the identification number 6414 is designated and the class erasing means 39 is called. The class erasing means 39 deletes the class name 321 and the identification number 322 of the class management unit 32 corresponding to the designated identification number.

The program terminating means 42 is a load management unit 64.
The computer name 6412 corresponding to the class name 6411 of 1, the processing time 6413, and the identification number 6414 are deleted and the search is continued, and it is known that the method part of class B is assigned to the computer 613. Since the computer 613 is not the computer 611 executing the application program 22, the computer name 6412 and the identification number 6414 are designated and the class deletion requesting means 36 is called.

The class deletion request means 36 is the communication control means 3
The class erasing means 39 of the computer 613 is called via 0. The class erasing means 39 uses the class name 321 and the identification number 322 of the class management unit 32 corresponding to the designated identification number.
To delete. The program ending means 42 is a load management unit 64.
The computer name 6412 corresponding to the class name 6411 of 1, the processing time 6413, and the identification number 6414 are deleted and the search is continued, and it is known that the method part of class C is assigned to the computer 612.

Since the computer 612 is not the computer 611 executing the application program 22, the computer name 6412 and the identification number 6414 are designated and the class deletion request means 36 is called. The class deletion request means 36 calls the class deletion means 39 of the computer 612 via the communication control means 30. The class deleting unit 39 deletes the method of the class corresponding to the specified identification number from the storage unit 31 and deletes the class name 321 and the identification number 322 of the corresponding class management unit 32. The program terminating means 42 is a computer name 64 corresponding to the class name 6411 of the load management unit 641.
12, the processing time 6413, the identification number 6414 are deleted, the search is continued, and it is found that the class is no longer stored in the class name 6411, and the processing ends. FIG. 23 shows the state of the distributed computer system at this point in time, and it can be seen that all the methods of the application program 22 have been deleted from the distributed computer system.

In the above description, the application program 22 is executed on the computer 211. However, if the application program 22 is executed on the computers 212 and 213, similarly, the load is automatically distributed depending on the state of the computer system at that time. The classes are assigned as in the above, and the same execution result is obtained.

In the above description, the application program written in the programming language C ++ has been described. For example, the application program written in another object-oriented language such as a programming language known as smalltalk. The mechanism shown in this embodiment can also be applied to the application program.

As described above, according to the present embodiment, according to the present invention, it is possible to automatically distribute the load to each computer constituting the distributed computer system by the method part of the class so that the load is distributed when the application program is executed. Since it is allocated in advance, it is not necessary to prepare the entire application or a part thereof in each computer in advance. Further, since all the method groups assigned to another computer at the end of the application program are deleted, waste of resources is eliminated.

[0073]

As described above, according to the present invention, it is possible to sufficiently distribute the load of application program execution without increasing the resource amount of each computer required for load distribution. A system can be provided.

[Brief description of drawings]

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

FIG. 2 is an explanatory diagram showing a configuration of an application program.

FIG. 3 is an explanatory diagram showing a class configuration.

FIG. 4 is a block diagram showing a configuration of a load distribution unit according to an exemplary embodiment of the present invention.

FIG. 5 is an explanatory diagram showing a table stored in a load management unit according to an embodiment of the present invention.

FIG. 6 is an explanatory diagram showing a table stored in a class management unit according to an embodiment of the present invention.

FIG. 7 is a flowchart showing a processing procedure performed by execution selection means according to an embodiment of the present invention.

FIG. 8 is a flowchart showing a processing procedure of a class transfer means according to an embodiment of the present invention.

FIG. 9 is a flowchart showing a processing procedure performed by a class storage unit according to an embodiment of the present invention.

FIG. 10 is a flowchart showing a processing procedure performed by a method executing means class storing means according to an embodiment of the present invention.

FIG. 11 is a flowchart showing a processing procedure performed by a method execution requesting unit according to an embodiment of the present invention.

FIG. 12 is a flowchart showing a processing procedure performed by a method proxy execution unit according to an embodiment of the present invention.

FIG. 13 is a flowchart showing a processing procedure performed by a program terminating means according to an embodiment of the present invention.

FIG. 14 is a flowchart showing a processing procedure performed by a class erasing means according to an embodiment of the present invention.

FIG. 15 is a flowchart showing a processing procedure performed by a class deletion requesting means according to an embodiment of the present invention.

FIG. 16 is a flowchart showing an application program execution procedure of the operating system according to the embodiment of the present invention.

FIG. 17 is an explanatory diagram showing a state immediately before execution of an application program of the distributed computer system according to an embodiment of the present invention.

FIG. 18 is an explanatory diagram showing a state during execution of an application program of the distributed computer system according to an embodiment of the present invention.

FIG. 19 is an explanatory diagram showing a state during execution of an application program of the distributed computer system according to an embodiment of the present invention. It is a state diagram at one point in time of a distributed computer system.

FIG. 20 is an explanatory diagram showing a state during execution of an application program of the distributed computer system according to an embodiment of the present invention. It is a state diagram at one point in time of a distributed computer system.

FIG. 21 is an explanatory diagram showing a state during execution of an application program of the distributed computer system according to an embodiment of the present invention. It is a state diagram at one point in time of a distributed computer system.

FIG. 22 is an explanatory diagram showing a state during execution of an application program of the distributed computer system according to an embodiment of the present invention.

FIG. 23 is an explanatory diagram showing a state after execution of an application program in the distributed computer system according to an embodiment of the present invention.

[Explanation of symbols]

 20 ... communication medium 22 ... application program 23 ... load distribution means 30 ... communication control means 31 ... storage section 32 ... class management section 33 ... method execution means 34 ... method execution request means 35 ... class Transfer means 36 ...... Class deletion requesting means 37 ...... Method proxy execution means 38 ...... Class storage means 39 ...... Class deletion means 40 ...... Load management unit 41 ...... Execution selection means 42 ...... Program termination means 211, 212, 213 ... computer 231,232,233 ... load balancing means

Claims (5)

[Claims] 1. In a computer system having two or more computers connected via a communication medium, a method of distributing a load of execution of a program executed by a specific computer among a plurality of computers including the specific computer. In the specific computer, a step of providing a table for registering a computer to which a processing unit, which is a unit of processing that constitutes the program, is registered in association with the allocated processing unit, and the specific computer is A step of sequentially executing the processing units, and, when the specific computer executes the processing units, refer to the table to determine whether or not there is a computer to which the processing unit is assigned. And when it is determined that there is no computer to which the processing unit is assigned, the processing unit is assigned to one of the plurality of computers. A step of registering the allocated computer in the table in association with the allocated processing unit, transferring the processing unit to the allocated computer from the specific computer and executing it, and the computer to which the processing unit is allocated. If determined to exist, the step of causing the computer to execute the processing unit, and the specific computer, when the execution of the program is completed, the processing unit transferred from the specific computer to another computer All of the above are erased from the other computer, and the table is initialized, the program execution load balancing method in the computer system. 2. A program execution load balancing method in a computer system according to claim 1, wherein the table is associated with a registered computer,
It is a table that can register the amount of load required to execute the processing unit assigned to the computer, and at the end of the execution of the processing unit, is already registered in association with the computer to which the processing unit is assigned. The method further comprises the step of updating the loaded load amount to a value obtained by adding to the load amount the load amount required to execute the method whose execution has ended, the allocation of the processing unit to the computer is performed in the table. A program execution load balancing method in a computer system, which is performed by assigning the processing unit to a computer having the smallest cumulative load of execution of the processing unit registered in association with. 3. A computer system having two or more computers connected via a communication medium, wherein a load of execution of a program executed on a specific computer is distributed to a plurality of computers including the specific computer. In the particular computer, a step of providing a table for registering a computer to which a class, which is a unit of a processing group constituting the program, is registered in association with the assigned processing unit, and the specific computer is A step of sequentially executing a method that is a process belonging to the class, and when the specific computer executes the arbitrary method, the class to which the arbitrary method belongs is assigned by referring to the table. Determining whether or not there is a computer that exists, and that there is no computer to which the class to which the arbitrary method belongs is assigned. If it is determined that the class is assigned to one of the plurality of computers, the assigned computer is associated with the assigned class and registered in the table, and the assigned computer belongs to the class Method of transferring the method from the specific computer, to execute the arbitrary method, and if it is determined that there is a computer to which the class to which the arbitrary method belongs is assigned, the arbitrary method to the computer. And the specific computer, when the specific computer finishes the execution of the program, erases all the methods transferred from the specific computer to another computer from the other computer, and saves the table. And a step of initializing the program execution load balancing method in a computer system. 4. The program execution load balancing method in the computer system according to claim 3, wherein the table is associated with a registered computer,
It is a table that can register the amount of load required to execute the class assigned to the computer, and at the end of the method execution, the class to which the method belongs is associated with the computer to which it is already registered. The method further comprises the step of updating the loaded amount to a value obtained by adding the loaded amount required to execute the method to the loaded amount, and the assignment of the class to the calculator is associated with the table. A method for distributing program execution load in a computer system, wherein the method is performed by assigning the class to a computer that has the smallest accumulated load of execution of the registered method. 5. A computer system comprising a communication medium and a plurality of computers connected to each other via the communication medium, wherein the computer stores a storage unit storing a method of a program to be executed and a program to be executed. A computer to which a class, which is a unit of processing to be configured, is allocated, and a load management unit that stores the load amounts of execution of all methods belonging to the class in association with the allocated processing unit, and a method requested to be executed. The method execution means for executing the method to be executed and reporting the load amount required for executing the method to the request source, and the method execution means for executing the method requested to be executed, and the load amount Method execution method that relays the report of the request to the request source and method execution method of another computer that executes the method requested to be executed Method execution requesting means for requesting and relaying the load amount report to the request source, class storing means for storing the transferred method in the storage section, and storing all methods belonging to the requested transfer class Class transfer means for transferring from the copy to the class storage means of another computer, and when processing any of the methods, check the computer to which the class to which the arbitrary method belongs is assigned from the stored contents of the load management section. However, when there is no computer to which the class to which the arbitrary method belongs is assigned, the computer with the smallest accumulated load of execution of the method stored in association with the load management unit is the arbitrary method. The class to which the arbitrary method belongs is determined as the computer to which the class to which the arbitrary method belongs belongs, Requesting the transfer of the method, and when the class to which the arbitrary method belongs is assigned to the local computer, the method executing means is requested to execute the arbitrary method, and the class to which the arbitrary method belongs is stored in another computer. When assigned to the other computer, the method execution requesting unit is requested to execute the arbitrary method to the other computer, and the load management unit notifies the load management unit of the load charge by that time. Execution selection means for storing the load amount required for executing the method belonging to each class in the load management unit in association with the computer to which the class unit is assigned, and the method belonging to the class requested to be deleted from the storage unit. Class erasing means for erasing and initializing storage contents of the load management unit according to a request; erasing of a class requested to be erased; and the load management unit A class deletion requesting unit that requests the class deletion unit of another computer to initialize the storage content, and a class deletion unit that loads the load according to the storage content of the load management unit when the execution of the program is completed. A computer system comprising: a program terminating means for requesting initialization of the storage contents of the management section and for requesting the class erasing request means to request the class erasing means of another device to erase the class.