JPH06301655A - Distributed processing system - Google Patents

Abstract

PURPOSE:To provide a distributed processing system capable of attaining distributed processing using priority without specifying the priority by a user or the like at the time of transmitting a message. CONSTITUTION:Respective computers constituting the distributed processing system are respectively provided with scheduling processing parts 1s, 2s, 3s capable of executing applied processing in accordance with the priority of processes and message communication processing parts 1c, 2c, 3c for transmitting a new message to which new priority corresponding to the priority of each process is added. Since the processing of the whole distributed processing system constituted of plural computers is executed in accordance with the same priority, the distributed processing system having a real time function can easily be constructed.

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 computers that execute a given program in multiple processes are connected to each other via a network, and more particularly to a real-time processing technology in the distributed processing system.

[0002]

2. Description of the Related Art In a computer system that requires real-time processing, a high priority is obtained by adding "priority", which is information for determining the order of execution of the processing, to the so-called "process" A method in which a process having a higher priority is processed preferentially is generally used.

By the way, in the distributed processing system,
In order for processes on other computers to communicate messages with each other and to perform intended processing, it is necessary to perform processing in consideration of the priority over the communicating processes. In general, in a distributed processing system, it is necessary to consider the priority of the processes related to the communication between the processes of a plurality of existing processes.

Therefore, for example, Japanese Unexamined Patent Publication No. 2-113362.
As described in Japanese Patent Publication No. JP-A-2003-264, priority is given to a message to be communicated between processes, and a computer receiving the message executes processing corresponding to the message according to the given priority. As a result, it is possible to perform the processing using the priority even for the processing across a plurality of computers.

[0005]

However, in the above-mentioned prior art, there is a problem that the sender must specify the processing priority of the destination at each time of message transmission. .

Further, if the priority is not properly given, there is a problem that the priority control is not uniformly performed in the entire distributed processing system having a plurality of computers.

[0007] Therefore, an object of the present invention is to provide a distributed processing system capable of realizing distributed processing using priority without the user or the like specifying the priority at the time of message transmission.

[0008]

[Means for Solving the Problems] In order to solve the above problems, the following means can be considered.

A plurality of computers that execute a plurality of processes in parallel are connected via a network, and
In a distributed processing system in which at least one or more processes perform processing of the processes while performing inter-process communication, each of the computers has a priority of a plurality of processes having priority, which is information that determines processing order. Scheduling processing means to be executed in descending order, and a new priority corresponding to the priority of the process is added to the message,
A message communication processing means for transmitting and receiving the message to which the new priority is added is sent to another computer via the network, and the scheduling processing means is further configured to add the new priority to the received message. It is a distributed processing system that gives a new priority corresponding to the received message to a process that executes a process corresponding to the received message.

Further, a plurality of computers that execute a plurality of processes in parallel are connected via a network, and at least one or more processes on each computer execute processing of the processes while performing inter-process communication. In the distributed processing system, each computer has a scheduling processing means for executing a plurality of processes having a priority, which is information for determining the processing order, in a descending order of priority, and a new priority corresponding to the priority of the process. A message communication processing means for executing transmission / reception processing of the message with the added priority according to the new priority, and the scheduling processing means corresponds to the new priority added to the received message. , A new priority is given to the process that executes the process corresponding to the received message. Processing system is also considered.

[0011]

As described above, according to the present invention, the scheduling means that enables each computer constituting the distributed processing system to execute given processing according to the priority of the process, and the priority corresponding to the priority of the process. The object is achieved by providing a message communication processing means for transmitting a message added with.

First, the scheduling means executes the program requested to be executed with "priority" designated at the time of execution request, designated by the program, or designated by the message communication processing means. As described above, the process is scheduled and the process is processed according to the priority.

Also, when a message transmission process to a process of another computer occurs in the program, the computer and the process of the transmission destination, the priority of the process being executed,
Message data, which is the content of the message to be transmitted, is specified and the message communication processing means is requested to transmit the message.

Further, the message communication processing means sends the message data to be sent and the designated priority as a message to the designated destination process.

The message communication processing means provided in the destination computer receives the message sent from the source, designates the priority included in the received message, and the scheduling means included in the computer. Ask to schedule.

Therefore, at the time of message transmission, it becomes possible to execute processing across a plurality of computers according to the priority without the user or the like specifying the priority on the computer of the message transmission destination.

[0017]

Embodiments of the present invention will be described below with reference to the drawings. First, an embodiment of the present invention will be described. As one embodiment of the present invention, a so-called object-oriented distributed processing system (a system for distributed processing of object-oriented programs) will be described. FIG. 1 is an explanatory diagram of a configuration example of an embodiment of the present invention.

A plurality of computers, that is, a computer 1, a computer 2, and a computer 3 are connected via a network 9.

The network 9 is realized by, for example, a LAN (local area network) system having a communication means such as an optical fiber.

Each of the computers 1, 2, 3 has a processor 1p,
2p, 3p, memories 1m, 2m, 3m, network adapters 1n, 2n, 3n, disk devices 1d, 2d, 3
It is configured with d.

Network adapters 1n, 2n, 3n
Is a means for transmitting / receiving various information including messages to / from another computer via the network 9. When using optical communication, the network adapter is realized by an electronic device such as a photoelectric conversion element and various CMOSs.

Each computer is provided with a different identifier called a "computer number", and by designating the computer number, communication of various information including messages through other computers via the network. Is possible.

In the memory, operating system (OS) programs 1o, 2o, 3 executed by the computer are executed.
o, object programs 11, 12, 21, 2
2, 31, 32, etc., and these are the processor 1
p, 2p, 3p are read out and a predetermined process is executed.
The memory is realized by, for example, a semiconductor element such as RAM.

The OS is software that manages execution of various programs and provides services to users. The OS is a scheduling processing unit 1s, 2s, 3s that schedules execution of a process, which is a unit of processing execution, on different computers. A message communication processing unit 1c having a function of transmitting and receiving information including a message between different processes,
2c and 3c are provided.

Further, the "procedure" constituting the program of each object is a process called "system call" for the OS to generate a file in the disk device, write a file to the disk device, Request processing such as reading a file from the device.

FIG. 2 shows the structure of software stored in one computer 2. The outline of the processing of the present invention will be described below with reference to this figure.

The objects 21, 22 and the like are a set of programs, and one object executes a process as one process.

A "process" is a series of processing execution units executed by a processor, and is also called a "task".

A process number is given to each process, and by specifying the process number, the process can be uniquely specified in the computer.

The OS in the embodiment of the present invention has a so-called multi-process function capable of executing a plurality of processes in parallel while appropriately switching them.

For example, Addison Wesley (Addiso
n-Wesley Publish Company), "The Design and Implementation of the 4.3B.
SD Unix Operating System (1989) (The Design and Implementation of
The 4.3BSD UNIX Operation System (1989)), which is a widely used UNIX operating system ("UNI").
"X" is the name of Unix System Laboratories (UN
IX System Laboratries, Inc.) is an operating system developed and licensed) has a multi-process function.
Multiple processes can be executed simultaneously on one computer.

In this embodiment, it is possible to specify the "priority" which is the information for determining the order of execution for the process, and the OS follows the specified priority.
It also has the function of preferentially executing processes with high priority.

These functions are performed by the OS stored in the memory.
It is realized by the scheduling processing unit 2s in the program.

Therefore, the processing of each object is executed according to the priority given to each.

Further, the objects execute processing while sending and receiving messages between the objects.

In the distributed processing system, a method of executing a process by combining a "client process" that requests a specific process and a "server process" that executes the requested process is widely used.

Each of the client process and the server process is one object, and the communication for requesting the processing from the client process to the server process and the communication for replying from the server process to the client process are messages. It is done by the exchange of.

It should be noted that one server process can request another server process for processing, that is, can function as a client process.

The OS program stored in the memory further includes a message communication processing unit 2c for transmitting and receiving information between different processes existing on different computers, and the object must issue a system call. By this, a message can be sent to an object existing in another computer.

Further, the message communication processing section has a function of transmitting a message to which a priority is added to the message. In the embodiment of the present invention, for example, the priority of the process that executes the process of the object that sends the message is added to the message and sent.

Furthermore, the priority to be added to the message is
It is also possible to give the message in a proportional relationship to the priority of the process that sends the message.

Now, each object waits for a processing request message from another object, and executes processing according to the processing request message sent thereto according to the priority added to the message.

In this processing, the message communication processing unit of the computer on the message receiving side receives the processing request message with priority sent, and schedules the destination object, priority, and message. Notify the department and request execution of the processing of the destination object.

The scheduling processing unit schedules and executes the process of the process corresponding to the received message of the notified object according to the given priority.

The outline of one embodiment of the present invention has been described above, and will be described in more detail.

In the embodiment of the present invention, the object is a program which is activated by receiving a message and executes a predetermined process.

Generally, an object is composed of a set of data and procedures related to the data.

As shown in FIG. 3, for example, the object 2
1 is data 210, procedure 1 (211), procedure 2
(212) and procedure 3 (213).

The message name of the received message for activating the processing is defined in each procedure.

For example, when a message having the message name "message e" is received, the procedure 1 is carried out, and when a message having the message name "message f" is received, the procedure 2 is carried out and the message name is "message f". When the message "message h" is received, the procedure 3 is defined to be started.

A message is a means for sending and receiving information between objects.

In this embodiment, since the OS has an interprocess communication function, an object uses a system call to request the OS to send a message, whereby message communication is executed.

An example of the data format of the message is shown in FIG.

The message 800 has a memory address 801 in which a character string representing a message name is stored, data 802 in which the number of arguments is stored, and memory addresses 803 and 804 in which each argument data is stored. Has been done.

Further, the character string of the message name is 801
It is represented by a sequence of character codes such as 1, 8012 (8019 is an end symbol). The actual data of the argument is 8031, 8041 according to the respective data types.
It is stored like.

The data type of the argument is defined in advance by the program of each object so that the sender object and the receiver object may match for each message. The argument of the message is used to process the procedure to be executed.

Similarly, the presence / absence of a reply, the type of reply data, and the like are also defined in advance.

The reply data is stored at the address indicated by the argument of the message.

Now, the processing of the object is started by the scheduling processing section.

Referring now to FIG. 5, the object 21
Taking 1000 as an example, the object processing 1000 will be described.

First, a system call is made to request reading of a message addressed to the object (step 1001).

The operation of the OS in response to the message read request will be described later.

The message can be received as data in the format referred to in FIG. Next, it is determined what the message name of the received message is (step 1002).

If the message name is "message e", the process of "procedure 1" is executed (step 100).
3) If "message f", the process of "procedure 2" is executed (step 1004), and if it is "message h", the process of "procedure 3" is executed (step 100).
5).

When a message having a message name for which the corresponding procedure does not exist is received, it is ignored and the process is not executed.

The objects execute processing in parallel while exchanging messages with each other through inter-object communication.

In addition, the object transmits a message to another object in the "procedure program" if necessary. To send a message, message data in the format shown in FIG. 4 may be generated and a system call may be requested to send the message.

Next, the message communication processing will be described.

Message communication between objects is executed by the message communication processing unit in the OS program stored in the memory.

As shown in FIG. 2, the message communication processing unit 2c includes a socket communication processing unit 2cc, which executes communication processing.

The socket communication processing unit is, for example, the above-mentioned “The Design and Implementation of
The inter-process communication function called a socket incorporated in the Unix operating system is used as described in "4.3 BDS Unix Operating System (1989)".

In the socket, interprocess communication becomes possible by designating the "socket address". The socket address is configured to have an address family number, a port number, and a computer address.

The address family number is a 16-bit (2-byte) integer representing the type of address. Note that communication between processes is performed via a port.

Each computer has a plurality of ports, and each port is given a port number in advance.

In one computer, the designated port can be determined by designating the port number.

Here, the port is designated by the port number represented by an integer having a data length of 16 bits (2 bytes).

In the present embodiment, one type of address is used, and the same address family number is always used. Therefore, interprocess communication becomes possible only by specifying the computer address and port number.

Further, one port is given to each object.

The object is called by the system call
When requesting message transmission processing, specify the computer address and port number of the destination object,
Add your own computer address, port number, and process number to send message data.
Ask.

FIG. 6 shows an example of the format of a message handled by the message communication processing section.

The message 900 includes data 901 representing the size (number of bytes) of the entire message, a computer address 902 of the transmission destination of the message, and a port number 9 of the transmission destination.
03, computer address 904 of sender of message, port number 905 of sender, priority 906, message name 907, data 908 indicating number of arguments, argument data 9
09 is included.

Further, the message name 907 is a sequence of character codes 9071, 90 representing a character string of the message name.
72 and the like. Also, the end code 9073 is added to the end of the character code sequence.

The argument data is composed of a combination of its size (number of bytes) and data, and is arranged for all arguments. The size of the first argument is 90.
91, first argument data 9092, second argument size 9093, second argument data 9093, and the like.

The operation of the message communication processing unit includes a message reception interrupt process activated when a message is received,
There are a message fetch system call process activated by a system call from an object and a message transmission system call process.

First, the message reception interrupt process will be described with reference to FIG.

Message reception interrupt processing (2000)
Is an interrupt process that is activated when the socket communication processing unit receives a message from another computer or in its own computer.

When the processing is activated, first, the received message data is received from the socket communication processing section (step 2001).

The format of the received data is the same as that shown in FIG.

Next, the received message is stored in the received message buffer 2cr shown in FIG. 2 (step 200
2) Based on the destination port number in the received message, the process of the object that should receive the message is obtained (step 2003), and the scheduling processing unit is activated (step 2004).

Next, the message retrieval system call processing will be described with reference to FIG. The message fetch system call processing (3000) is activated by a system call from the object, fetches a received message in the format shown in FIG. 6 from the received message buffer 2cr (step 3002), and converts it into message data in the format shown in FIG. Convert and pass the message data to the object (step processing 3003).
The message transmission system call process will be described with reference to FIG. The message transmission system call process (4000) is activated by a system call from the object.

First, the scheduling processing unit is inquired to obtain the priority of the process from the process number of the given object (step 4001).

Next, the message data of the format shown in FIG. 4 received from the object is converted into the message data of the format shown in FIG. 6 and stored in the transmission message buffer shown in FIG. 2 (step 4002). Here, FIG.
The priority in the message data of the format shown in
The process priority obtained in step 4001 is given.

Then, the socket communication processing section is activated (step 4003), and when the transmission processing is completed, the scheduling processing section is activated (step 4004) and the series of processing is completed.

Next, the scheduling process will be described.

The OS program stored in the memory is provided with a scheduling processing unit which enables a process having a high priority to be preferentially executed in accordance with the designated priority.

As shown in FIG. 2, the scheduling processing section 2s further includes an executable process queue 2sq.

As shown in FIG. 10, the executable process queue 2sq is a queue with priority, which stores executable processes for each priority.

In this embodiment, a priority represented by an integer from "0" to "128" can be used, and the smaller the number, the higher the priority.

In the example shown in FIG. 10, seven processes 10
Nos. 1 to 107 are ready to be executed and are in a waiting state.

Of these, process 103 and process 105
Indicates a priority “0”, the process 101 indicates a priority “2”,
Process 102, process 104, and process 107
The priority is “4” and the process 106 is the priority “7”.

Then, the processes having higher priorities are sequentially executed.

When a plurality of processes have the same priority, the processes are sequentially executed from the top, that is, the process on the left side of the drawing.

Therefore, unless an executable process is added in the future, the processes 103, 105, 101, 102, 104, 107 and 106 are sequentially taken out and executed.

When a new runnable process occurs, it is added as the last process of its priority. For example, when a process having a priority of 2 is newly placed in the executable state, it is added to the rear part of the process 101.

Next, the operation of the scheduling processing section will be described with reference to FIG.

The scheduling process (5000) is started when a message is received, when a message is sent, when the process of the object being executed shifts to a wait state, and the process execution is interrupted, or when the process ends. It

First, it is checked which of the above causes is the activation cause (step 5001), and if it is due to the message reception, the process of the object of the message transmission destination, that is, the object which should receive the message is executed in the process queue. Stored in (step 500
2), branch to step 5003.

Here, the priority of this process is the value of the priority 906 in the message data (the format shown in FIG. 6) of the received message. Therefore, the process priority of the received object has the same value as the process priority of the object that sent the message.

If the cause of the activation is message transmission or process interruption, starting from step 5003, the currently executing process is saved, the process is stored in the executable process queue (step 5003), and step 5 is executed.
Branch to 004.

If the cause of the process termination is the process termination, the process to be started next is started from step 5004, and the process to be executed next, that is, the process having the highest priority is taken out (a plurality of processes having the same priority are extracted). If it exists, the process at the head is taken out) (step 5004). Then, the processing of that process is activated and executed (step 5005).

FIG. 1 shows an example of execution of this embodiment.
2 will be described.

Within the computer 1, there are processes of OS1o, processes of object 11 and processes of object 12, and within the computer 2 processes of OS2o, processes of object 21, processes of object 22 and processes of object 23. Exists, and in the computer 3, the process of the OS3o, the object 31
Process of the object 32 exists.

At present, in the computer 1, the process of the object 11 is being executed with the priority "68" (process 10).
111), and the process of the object 12 exists in the executable process queue with the priority “72”.

In the computer 2, the object 22
Process is being executed with priority “81” (process 2022)
In 1), the process of the object 21 and the process of the object 23 are in the message waiting state.

Further, in the computer 3, the object 3
Process 1 is running with priority "56" (Process 3031)
In 1), it is also assumed that the process of the object 32 exists in the executable process queue with the priority "96".

Now, here, the object 11 existing in the computer 1 is the object 2 existing in the computer 2.
It is assumed that the processing request message is transmitted to 1.

That is, the object 11 issues a message transmission system call to
The message transmission process 10101 is started and the transmission process for the computer 2 is executed using the socket.

Here, in the computer 2 which is executing the process of the object 22, the message reception interrupt process 20201 by the OS 2o occurs, and the process of receiving the message transmitted from the computer 1 is performed.

In the computer 1, when the message transmission process 10101 of the OS 1o is completed, the object 11 shifts to the waiting state for the message reply, and as a result of the scheduling process, the object 1 having the priority "72" is obtained.
The second process 10121 is executed.

In the computer 2, when the message reception interrupt processing 20201 by the OS 2o ends, as a result of the scheduling processing, the processing 20211 of the object 21 which is the receiver of the received message has the priority "68".
Run on. This priority is equal to the priority of the object 11 that sent the message. Object 22
Since the priority is "81", the process of is interrupted.

Here, the object 31 of the computer 3 is
A message transmission system call is issued to transmit a processing request message to the object 23 of the computer 2, and O
It is assumed that the message transmission process 30301 of S3o is activated.

In response to this, the message reception interrupt processing 20202 by the OS 2o occurs in the computer 2, and the message transmitted from the computer 3 is received.

In the computer 3, when the message transmission process 30301 of the OS 3o ends, the object 31 shifts to the waiting state for the message reply, and as a result of the scheduling process, the process 30321 of the object 32 of priority "96" is executed. It

In the computer 2, when the message reception interrupt processing 20202 by the OS 2o is completed, as a result of the scheduling processing, the processing 20231 of the object 23 which is the recipient of the received message becomes the priority of the object 31 which is the sender of the message. They are executed with equal priority "56". Further, in this case, the processing of the object 21 is interrupted because the priority is “68”.

When the processing of the object 23 in the computer 2 is completed, the object 23 issues a system call and sends a processing reply message to the object 31 in the computer 3 which is the sender of the processing request message. Then, the process of the object 23 ends.

That is, first, the process 20231 of the object 23 is switched to the reply message transmission process 20203 by the OS 2o and executed. Then, in response to this, in the computer 3, the object 32
Processing 30321 is interrupted, and a reply message reception interrupt processing 30302 by the OS 3o occurs, and the reply message from the computer 2 is received.

In the computer 2, when the response message transmission processing 20203 of the OS 2o is completed, the process of the object 23 is completed, and as a result of the scheduling processing, the processing of the object 21 having the priority "68" is restarted ( Process 20212).

In the computer 3, when the reply message reception interrupt process 30302 by the OS 3o ends, as a result of the scheduling process, the process of the object 31 which is the receiver of the reply message is restarted (process 3031).
2) When the processing ends, as a result of the scheduling processing (processing 30303), the processing of the object 32 is restarted (processing 30322).

In the computer 2, the processing 2 of the object 21
When 0212 ends, the object 21 issues a system call, sends a process reply message to the object 11 on the computer 1 that is the sender of the process request message, and the process of the object 21 ends.

That is, the processing 202 of the object 21
From 12 to OS2o response message transmission processing 20
It is switched to 204 and executed.

In response to this, in the computer 1, the processing 10121 of the object 12 is interrupted and the reception interrupt processing 10102 of the reply message by the OS 1o occurs.
The reply message from the computer 2 is received.

When the reply message reception interrupt processing 10102 is completed, as a result of the scheduling processing, the object 1 which is the recipient of the reply message is received.
When the process of No. 1 is restarted (process 10112) and the process ends, the result of the scheduling process (process 10103) is
The processing of the object 12 is restarted (processing 1012).
2).

In the computer 2, when the reply message transmission process 20204 of the OS 2o is finished, the process of the object 21 is finished, and as a result of the scheduling process, the process of the object 22 is restarted (process 20).
222).

As described above, each object of each computer transfers the priority by sending a message, and each process is uniformly executed by using the priority in the entire system having all the computers. .

The embodiments of the present invention have been described above in detail.

According to the present invention, the object on the message sending side can perform the processing with the priority without the user or the like specifying the processing priority of the object on the message receiving side. Has the effect of being easy.

Further, each process of the entire distributed processing system having a plurality of computers is executed under the same priority control, and the distributed processing system executes the distributed processing according to the unified scheduling. This has the effect of realizing a system that does.

Next, another embodiment according to the present invention will be described.

In the above-described embodiment of the present invention, the priority range of the processing of the object and the priority added to the message, that is, the priority range in the message data are set to be the same, and the priorities of both are matched. However, it is not always necessary that the priority range of object processing be the same as the priority range in the message data.

In this case, the priority of processing the object may be converted into an appropriate priority in the message data in consideration of the range of the priority of both.

As the conversion method, for example, the relative value of the priority of the processing of the object with respect to the priority range of the processing of the object is calculated as the relative value of the priority of the message data with respect to the priority range of the message data. , Or a relative conversion method according to the priority range.

Here, matching the relative values of the priority means that the priority range of the processing of the object is "0" to "128", and the priority range in the message data is "0" to "128". In the case of 16 ", if the priority value of the processing of the object is" 64 ", the priority value of the message data is" 8 ", and if the priority value of the processing of the object is" 32 " It is possible to set the priority value in the message data to "4".

As a result, even in a distributed processing system in which the range of priority of execution of object processing and the range of priority of message data are different, distributed processing by unified priority control can be performed in the distributed processing system as a whole. The effect is that it can be done.

Further, by reducing the priority range in the message data to be smaller than the priority range of the processing of the object, the data length of the priority in the message data can be shortened and the message data amount can be reduced. The effect is that efficient message communication becomes possible.

In the above-mentioned embodiment of the present invention, the range of priorities available in the computer in which the sender object exists,
The same priority range can be used in the computer where the receiving side object exists, and the priorities of both sides are matched, but the priority range of the sending side computer and the priority range of the receiving side computer do not necessarily match. You don't have to.

In this case, a method of converting the priority of the transmitting side into an appropriate priority of the receiving side can be considered in consideration of the range of the priority of both. That is, it is sufficient that the priorities have a one-to-one correspondence within the range of both priorities.

As a conversion method, for example, the relative value of the transmission-side priority in the priority range of the transmission-side computer matches the relative value of the reception-side priority in the priority range of the reception-side computer. A method of doing so or a conversion method of relatively converting the priority to be added according to the range of the priority can be considered.

Matching the relative values of the priorities means, for example, that the priority range of the sending computer is "0" to "64" and that the receiving computer can take priority. The priority range, which is the range of degrees, ranges from “0” to “25.
In the case of “6”, if the priority value of the transmission side is “32”,
If the priority value of the receiving side is "128" and the priority value of the transmitting side is "16", the priority value of the receiving side is "64".
Means processing such as setting.

As a result, even in a distributed processing system having computers with different usable priority ranges, the distributed processing system as a whole has the effect of being able to perform distributed processing by uniform priority control.

In the above embodiment, the message communication process transmits the priority as data, but the communication process itself does not take the priority into consideration. However, a configuration is also conceivable in which the message communication processing unit performs communication processing according to the priority order.

For example, in the above embodiment, the transmission message buffer for storing the transmission message is
It is configured as a transmission message queue, which is a queue with the same priority as in FIG. 10, and the message transmission process is performed according to the priority added to the transmission message.
Schedule and run.

Further, the message transmission process may be scheduled according to the priority added to the process that transmitted the message.

As a result, it is possible to preferentially send a message having a high priority.

Therefore, not only the object processing but also the message transmission processing can be performed according to the same priority, and the distributed processing system as a whole can perform the distributed processing by the unified priority control. There is an effect that it becomes possible.

Furthermore, in another embodiment of the present invention in which the communication processing itself is given a priority, the range of priority that can be used in the processing of an object and the range of priority that can be used in the message communication processing are the same. Although the priorities of the two are matched, the priority range of the object processing and the priority range of the message communication processing do not necessarily have to be the same.

In this case, the priority of the processing of the object may be converted into an appropriate priority of the message communication processing in consideration of the range of the priority of both.

As the conversion method, for example, the relative value of the priority of the processing of the object to the priority range of the processing of the object is set to the relative value of the priority of the message communication processing to the priority range of the message communication processing. In addition, a method of making them coincident with each other, or a relative conversion method according to the range of priority can be considered.

Here, matching the relative values of the priority means, for example, that the range of the priority of the processing of the object is
When the priority range of the message communication processing is “0” to “128” and the priority range of the object communication processing is “64”, the priority of the message communication processing is “64”. If the value of is "16" and the value of the priority of the processing of the object is "32", the value of the priority of the message communication processing may be set to "8".

As a result, even in a distributed processing system having a computer in which the range of priority of execution of object processing and the priority of processing of message communication are different, unified priority is given to the entire distributed processing system. The effect is that distributed processing can be performed by controlling the degree.

In the above embodiment, the processing of the object, that is, the processing is fixed once determined, but the priority is set by the system call during the execution of the processing.
It is also possible to request the scheduling processing unit of S to change the priority and dynamically change the priority.

This has the effect of enabling flexible priority control according to the execution status. In the above embodiment, the priority of the processing of the object is fixedly treated regardless of the usage rate of the processor, but it is possible to perform the scheduling which is dynamically changed according to the usage rate of the processor. . This enables efficient scheduling in the entire distributed processing system.

In the above embodiment, one object is
It is executed as one process, but it may be a thread instead of a process. This makes it possible to reduce the overhead when switching processes.

In the above embodiment, one object is
Although only one process can be performed at a time, one object can enable a plurality of processes or a plurality of threads to execute processes for a plurality of request messages in parallel. As a result, there is an effect that it is possible to interrupt and process a message having a high priority.

In the above embodiment, the message communication is performed by calling the system call, but the message communication may be performed in the form of a remote procedure call.

As a result, there is an effect that the interprocess communication can be described in the same format as the procedure call in one process.

[0166]

The processing of the entire distributed processing system having a plurality of computers is executed according to the same priority, and a distributed processing system having a real-time function can be easily constructed.

Further, the program on the message sending side can perform distributed processing with priorities without explicitly designating the processing priority of the program on the message receiving side. It will be easy.

Furthermore, the execution of programs for the entire distributed processing system having a plurality of computers can be scheduled without providing means for centrally scheduling the entire system, and real-time processing is performed. A distributed processing system can be easily constructed.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram of an embodiment according to the present invention.

FIG. 2 is a software configuration diagram of an embodiment according to the present invention.

FIG. 3 is a diagram showing a structural example of an object.

FIG. 4 is a diagram illustrating a data structure example of a message handled by an object.

FIG. 5 is a flowchart showing an operation of an object.

FIG. 6 is a diagram showing an example of a data structure of a message handled by a message communication processing unit.

FIG. 7 is a flowchart showing an operation of message reception interrupt processing.

FIG. 8 is a flowchart showing the operation of a message retrieval system call.

FIG. 9 is a flowchart showing the operation of a message transmission system call.

FIG. 10 is a diagram showing a structure example of an executable process queue.

FIG. 11 is a flowchart showing an operation of a scheduling processing unit.

FIG. 12 is an explanatory diagram for explaining an execution example according to the present invention.

[Explanation of symbols]

1 ... Calculator, 2 ... Calculator, 3 ... Calculator, 1p ... Processor, 2p ... Processor, 3p ... Processor, 1n ... Network adapter, 2n ... Network adapter, 3
n ... network adapter, 1d ... disk device, 2d
... disk device, 3d ... disk device, 1m ... memory,
2m ... memory, 3m ... memory, 1o ... OS, 2o ... O
S, 3o ... OS, 1s ... Scheduling processing unit, 2s
... scheduling processing unit, 3s ... scheduling processing unit, 1c ... message communication processing unit, 2c ... message communication processing unit, 3c ... message communication processing unit, 11 ... object, 12 ... object, 21 ... object,
22 ... Object, 31 ... Object, 32 ... Object, 2sq ... Executable process queue, 2cc
... socket communication processing unit, 2cr ... receive message buffer, 2cs ... send message buffer

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Satoru Murata Satoshi Murata 7-1-1 Omika-cho, Hitachi City, Ibaraki Hitachi Ltd. Hitachi Research Laboratory (72) Inventor Tomoaki Nakamura 5-2 Omika-cho, Hitachi City, Ibaraki Prefecture No. 1 Stock company Hitachi Ltd. Omika factory

Claims (5)

[Claims] 1. A plurality of computers that execute a plurality of processes in parallel are connected via a network, and
In a distributed processing system in which at least one process performs inter-process communication and executes the process of the process, each of the computers has a plurality of processes having a priority, which is information that determines a processing order, as a priority. Scheduling processing means to be executed in descending order, a new priority corresponding to the priority of the process is added to the message, and the message to which the new priority is added is transmitted / received to / from another computer via the network. A process for executing a process corresponding to the received message with a new priority corresponding to the new priority added to the received message. A distributed processing system characterized by being provided to. 2. The message communication processing means according to claim 1, wherein the new priority added to the message and the priority of a process transmitting the message are matched, and the scheduling processing means A distributed processing system, wherein the new priority added to the received message and the new priority of the process executing the process corresponding to the message are matched. 3. The message communication processing means according to claim 1, wherein the first range in which a new priority added to the message can be set, and the second range in which the priority of a process for transmitting the message can be set. In the range of, the new priority having a value within the first range is determined in a one-to-one correspondence with the priority having a value within the second range. Processing system. 4. A plurality of computers that execute a plurality of processes in parallel are connected via a network, and
In a distributed processing system in which at least one process performs inter-process communication and executes the process of the process, each computer has a high priority among a plurality of processes having a priority that is information that determines the order of the process. The system further comprises scheduling processing means for executing in sequence, and message communication processing means for executing transmission / reception processing of a message with a new priority added corresponding to the priority of the process, according to the new priority. The distributed processing system, wherein the scheduling processing means gives a new priority corresponding to the new priority added to the received message to the process executing the processing corresponding to the received message. 5. A plurality of computers that execute a plurality of processes in parallel are connected via a network, and
In a distributed processing system in which at least one process performs inter-process communication and executes the process of the process, each computer has a high priority among a plurality of processes having a priority that is information that determines the order of the process. A scheduling processing means for executing in sequence, and a message communication processing means for executing transmission / reception processing of a message with a new priority added corresponding to the priority of a process with the same priority as the priority of the process. Further, the scheduling processing means gives a new priority corresponding to the new priority added to the received message to the process executing the processing corresponding to the received message. Distributed processing system.