JPH1125060A - Distributed processing system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To attain a distributed processing system capable of preventing a response time to the processing of a specific computer from being too much prolonged and efficiently operating the system itself. SOLUTION: A service information storing part 4 stores service description, a service providing program identifier(ID) and IDs of computers including a service providing program. A service allocation information storing part 7 stores the processing capacity indexes of computers and the value of an allocation counter indicating whether several service providing programs are permitted to be executed or not in response to the IDs of the computers. When a service retrieving request is outputted from a service use program, a service retrieving part 5 extracts the IDs of computers including the service providing program. A service allocation part 6 outputs a computer having the minimum processing capacity index/allocation counter value as a retrieved result out of the computers extracted by the retrieving part 5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a distributed processing system in which a plurality of computers are connected by a communication network and the computers cooperate to perform processing.

[0002]

2. Description of the Related Art A computer system in which a plurality of computers are connected by a communication network is called a distributed processing system. In such a distributed processing system,
Programs executed on different computers cooperate with each other to realize one function.

On one computer, a plurality of programs are executed virtually simultaneously. Here, "simultaneously" means that when one program is executed on the computer for a certain period of time, the program enters a waiting state, and the other waiting programs are executed again for a certain period of time. is there.

When the number of programs that are virtually simultaneously executed by one computer increases, the time from when the program can be executed to when the execution is completed (called response time) increases. Some distributed processing systems include
Many computers with the same or different processing capabilities to execute programs are included. In this computer, if many programs are assigned to some computers and few programs are assigned to other computers, the response time is long in the computers assigned many programs, and the programs are assigned few. Response time is faster on computers without it.

[0005] However, if a number of programs proportional to the processing capacity of each computer are allocated to all the computers included in the distributed processing system, the response times of all the programs are equalized, and some of the programs are used. You can avoid having to experience long response times.

Conventionally, in load distribution in a distributed processing system, the response time of a program has not been lengthened by averaging program allocation among computers. For example, as a document showing such a load distribution method, N.A. G. Shivaratri, P .; Krueger,
M. “Load Distributing for Locally Distri” by Singhal
buted Systems ”, IEEE Computer, vol. 25, no. 12, 1
There is December 992.

[0007]

However, when programs distributed in a plurality of computers request / provide processing mutually and provide one processing as a whole, the program is not always required. How computers are assigned to computers does not determine the load on each computer. The program (server) requested to be processed does not affect the response time of other programs unless there is a request because it is in a waiting state until a request is made. That is, if the frequency of requesting the process increases, the influence on the response time increases.

In a distributed processing system in which a program to which a request is sent is dynamically assigned each time a program requests a process, even if the assignment of a program to a computer is changed as in the prior art, the program is dynamically assigned. If the destinations of the requests to be allocated are concentrated, the response time will be delayed again.

In view of the above, it has been desired to realize a distributed processing system in which the response time of processing on a specific computer does not increase and the system can be operated efficiently.

[0010]

The present invention employs the following structure to solve the above-mentioned problems. <Structure of Claim 1> Distributed processing in which a plurality of service providing programs for executing a preset service and a service using program for requesting a service to the service providing program exist in any of a plurality of computers. In the system, a service information holding unit that stores information of a service providing program that provides the service and information of a computer where the service providing program exists, corresponding to a service description indicating an arbitrary service content, and information of the computer. A service allocation information holding unit indicating a value of an allocation counter indicating how many service providing programs are permitted to be executed in the computer; Any service request from The service search unit extracts the service providing program and computer information corresponding to the service from the service description corresponding to the service by referring to the service information storage unit, and the service allocation information storage unit. The processing unit obtains the processing capacity index and the value of the allocation counter corresponding to the information of the computer extracted by the search unit, and divides the value of the allocation counter by the processing capacity index to find the computer having the smallest value as a search result to the service use program. And a service allocating unit for outputting.

<Explanation of Claim 1> A distributed processing system based on the invention of claim 1 is provided if at least one service using program and one service providing program exist on different computers. Two or more programs of the same type exist on the same computer,
Alternatively, the service using program and the service providing program may exist on the same computer.

In such a distributed system, according to the first aspect of the present invention, a relationship between service contents, a service providing program for providing the service, and a computer on which the service providing program exists is stored in advance. The computer also stores the processing capability index of the computer and the value of the assignment counter. When a certain service is requested from the service using program, the service providing program corresponding to the service and computer information are extracted in order to determine a service providing program to execute the service. here,
When a plurality of pieces of information are extracted, a service providing program having the smallest value of (allocation counter / processing capacity index), that is, a service providing program existing in a computer having the highest margin of processing is output as a search result. I do.

Therefore, the service providing program having the fastest response time at that time can execute the service, and as a result, the processing time of the service using program can be shortened. In addition to the service search mechanism,
Another advantage is that a special mechanism for distributing the load is not required.

<Structure of Claim 2> In claim 1, when there is a registration request from an arbitrary service providing program, a service description corresponding to the service content of the service providing program, information of the service providing program, A service registration unit for registering information of a computer in which the service providing program exists in a service information holding unit, and when an arbitrary computer is output as a search result, the value of an allocation counter of the computer is increased by one and an arbitrary service is added. A service allocating unit configured to decrease a value of an allocation counter corresponding to information of a computer included in the use completion request by one when a use completion request of the service providing program is output from the used program. It is a distributed processing system.

<Explanation of Claim 2> According to the invention of claim 2, in the invention of claim 1, in response to a registration request from the service providing program, the service description, the information of the service providing program, the information of the computer, Is registered in the service information holding unit, and when the service is allocated to a certain computer, the value of the allocation counter is incremented by one, and when the service is completed, the value is decreased by one. As a result, a series of processes of service registration, search, and use completion can be reliably performed, and the distributed processing system can be operated more efficiently.

[0016]

Embodiments of the present invention will be described below in detail with reference to the drawings. << Specific Example >><Configuration> FIG. 1 is a configuration diagram showing a specific example of the distributed processing system of the present invention. The illustrated system includes a plurality of computers 10a to 10e.
a to 10 e are connected via a communication path 11.

Each computer can realize the functions of a service use program 12, a service providing program 13, and a service search server 1. In the illustrated example, the computer 10a has a service use program 12a, and the computer 10b has a service use program 12b. The service providing program 13a is assigned to the computer 10c, the service providing program 13b is assigned to the computer 10c, the service search server 1 is assigned to the computer 10d, and the service providing programs 13c and 13d are assigned to the computer 10e. Hereinafter, configurations and operations common to the computers 10a to 10e, the service use programs 12a and 12b, and the service provision programs 13a to 13d will be described as the computer 10, the service use program 12, and the service provision program 13.

Here, the service using program 12 is a client that requests a certain service from the service providing program 13.
Is a server that executes a process requested by the service use program 12. Further, the service search server 1
Is a functional unit which is a feature of this specific example, and as shown in detail in the figure, a request receiving unit 2, a service registering unit 3, a service information holding unit 4, a service searching unit 5, a service allocating unit 6, It comprises a service allocation information holding unit 7 and a search result returning unit 8.

The request receiving unit 2 is a functional unit that receives a registration request or a search request from the service use program 12 or the service providing program 13. Service registration part 3
Is a functional unit that performs registration in the service information holding unit 4 based on the registration request received by the request receiving unit 2. The service information holding unit 4 is a functional unit that indicates a service providing program and information on a computer in which the service providing program exists for the service content.

FIG. 2 is an explanatory diagram of the contents of the service information holding unit. As shown, the service information holding unit 4 includes a service description 20 indicating the content of the processing provided by each service providing program 13 and a service providing program which is an identifier of the service providing program 13 providing the service of the service description 20. The information of the identifier 21 and the computer identifier 22 for indicating the computer 10 on which the service providing program 13 is running are stored.

When the service search request from the service use program 12 is received by the request receiving unit 2, the service search unit 5 searches the service information holding unit 4 based on the request, and sends the search result to the service allocation unit 6. It is a functional unit. The service allocating unit 6 has a function of allocating the service providing program 13 with reference to the service allocation information holding unit 7 based on the search result from the service searching unit 5. The service allocation information holding unit 7 is a functional unit that indicates a processing capability index for a computer and a value of an allocation counter.

FIG. 3 is an explanatory diagram of the contents of the service allocation information holding unit 7. The service allocation information holding unit 7 includes a computer identifier 22 indicating each computer 10 as shown in FIG.
And a processing capability index 23 indicating the performance of the computer.
And information on an allocation counter 24 indicating how many service use programs 12 are permitted to use the service providing program 13 operating on the computer.

Returning to FIG. 1, the search result returning unit 8 is a functional unit that outputs information of the service providing program 13 and the computer 10 allocated by the service allocating unit 6 as search results.

<Operation> The service search server 1 provides three processes to another program. The three processes are “service registration”, “service search”, and “service use completed”, and these processes will be described below in order.

The service registration process is performed by the service providing program 13
Request to the service search server 1. When it becomes possible to provide the service provided by the service providing program 13, the service providing program 13 requests the service search server 1 to register a service description 20 indicating the content of the service provided by itself.

In the service search server 1, the request receiving unit 2 receives this registration request. The request receiving unit 2 determines that the request is a service registration request, and transfers the request to the service registration unit 3. The service registration unit 3 stores the corresponding service description 20, the service providing program 13, and the information of the computer identifier 22 indicating the operating computer 10 on the basis of the service description 20 of the service providing program 13 that is the request source. Register in Part 4. In this manner, the information of the service providing program identifier 21 and the computer identifier 22 for the various service descriptions 20 are registered.

Service Search Processing In the service search processing, the service use program 12 requests the service search server 1. When a certain service use program 12 uses a desired service, it requests the service search server 1 to search for a service providing program 13 that provides the service.

In the service search server 1, when the request receiving unit 2 receives the search request, the request receiving unit 2 determines that the request is a service search request, and transfers the request to the service search unit 5. The service search unit 5 searches for information in the service information holding unit 4 using the service description 20 included in the request. That is, the service providing program 13 that provides a service conforming to the service description 20
And a computer identifier 22 of the computer 10 on which the service providing program 13 is running.

At this time, there is a possibility that there are a plurality of service providing programs 13 that provide services conforming to the service description 20. Here, the service providing program 1
In the case where a plurality of service providing programs 3 exist, the service search unit 5 transfers the service providing program identifiers 21 of all the service providing programs 13 and their computer identifiers 22 to the service allocating unit 6.

In the service allocating unit 6, the service searching unit 5
Using the computer identifiers 22 transferred from the server as indices, the corresponding processing capability index 23 and the value of the allocation counter 24 are read from the service allocation information holding unit 7. Then, all the read allocation counters 2
4 is divided by the value of the corresponding processing capability index 23, the computer identifier 2 of the set having the smallest value is set.
Select 2. The service allocating unit 6 sets the value of the allocation counter 24 corresponding to the selected computer identifier 22 to 1
At the same time, the selected service providing program identifier 21 and computer identifier 22 are transferred to the search result returning unit 8 as search results.

The search result returning unit 8 notifies the service use program 12 that is the service search request source of the set of the service providing program identifier 21 and the computer identifier 22 assigned by the service assigning unit 6. Thus, the service using program 12 can use the service specified by the service search request using the notified service providing program identifier 21.

● Service Use Completion Processing The service use completion processing is performed by the service use program 12
However, when the use of the service providing program 13 acquired in the service search process described above is completed, a request is made to the service search server 1. The service use completion request includes the computer identifier 22 indicating the computer 10 on which the service providing program 13 whose use has been completed exists. When the service use completion request is received by the request reception unit 2 of the service search server 1, the request reception unit 2 determines that this is a service use completion request, and transfers the request to the service allocation unit 6. The service allocating unit 6 decreases the value of the allocation counter 24 corresponding to the computer identifier 22 included in the request from the information held by the service allocation information holding unit 7 by one.

<Effects> As described above, according to the specific example,
When assigning a service providing program 13 for providing a service to a certain service, the assignment is made in consideration of the processing capability of the computer on which the service providing program 13 operates and the execution state of the service. The processing can be performed with the shortest response time when the service using program 12 requests the processing of the service providing program 13. Therefore, the processing time of the service use program 12 can be shortened.

When selecting a service providing program 13 for providing a required service, the state of the computer is also taken into consideration. Therefore, a mechanism for distributing a dedicated load is provided in addition to the service search mechanism. Not
The computer load in the system is averaged, and as a result, the response time to the service request of the service providing program can be shortened, and the system can be operated efficiently.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a specific example of a distributed processing system of the present invention.

FIG. 2 is an explanatory diagram of a service information holding unit in a specific example of the distributed processing system of the present invention.

FIG. 3 is an explanatory diagram of a service allocation information holding unit in a specific example of the distributed processing system of the present invention.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 service search server 3 service registration unit 4 service information storage unit 5 service search unit 6 service allocation unit 7 service allocation information storage unit 10 a to 10 e computer 11 communication path 12 a, 12 b service use program 13 a to 13 d service provision program

Claims (2)

[Claims] 1. A distributed processing system in which a plurality of service providing programs for executing a preset service and a service using program for requesting the service to the service providing program exist in any of a plurality of computers. A service information holding unit that stores information of the service providing program that provides the service and information of a computer where the service providing program exists, in response to a service description indicating an arbitrary service content; In response to the information, a processing capability index indicating the capability of the computer, and in the computer, a service allocation information holding unit indicating the value of an allocation counter indicating how many service providing programs are permitted to be executed, From the service usage program A service search unit that extracts information of a service providing program and a computer corresponding to the service from a service description corresponding to the service by referring to the service information holding unit when an arbitrary service request is received; A computer having the smallest value obtained by dividing the value of the allocation counter by the processing capability index by obtaining the processing capability index and the value of the allocation counter corresponding to the information of the computer extracted by the service search unit with reference to the allocation information holding unit. And a service allocating unit for outputting a search result as a search result to the service using program. 2. A service providing program according to claim 1, wherein when a registration request is received from an arbitrary service providing program, a service description corresponding to the service content of the service providing program, information of the service providing program, and the service providing program A service registration unit for registering information of a computer in which the computer exists in a service information holding unit; and when an arbitrary computer is output as a search result, the value of an allocation counter of the computer is increased by 1 and an arbitrary service use program is used. A service allocating unit that, when a use completion request of a service providing program is output, decreases a value of an allocation counter corresponding to information of a computer included in the use completion request by one. system.