JPH025135A - Message schedule system - Google Patents

Abstract

PURPOSE:To obtain a message schedule system for parallel object directional language by registering a message for a variable causing the disablement of message execution due to no determination of a value when the execution of the message is impossible, and when the execution of the message is possible, sending the message to a message receiving part. CONSTITUTION:An execution probability deciding part 3 decides whether the received message includes a variable or not, and when the variable exists, decides whether the message whose value is not determined can be executed or not. When the message includes the variable and its execution is impossible until its value is determined, a variable dependending relation control part 4 registers the message in the variable causing the disablement of message execution due to no determination of its value. When the execution of the message is possible, the message is transferred to a message execution control part 5. Thus, the message schedule system for the parallel object directional language constituted of paralleism in each message can be obtained.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a message scheduling method, in particular, a message scheduling method in which a processing entity called an object sends messages in parallel, so that multiple objects that receive messages proceed with processing in parallel. This paper relates to a message scheduling method for pseudo-parallel processing on a sequential computer in the execution method of parallel object-oriented languages.

[Conventional technology]

In parallel object-oriented languages, in order to realize parallelism in units of objects, which are the main processing entities, messages exchanged between objects are non-identical. (Reference: Akinori Yonezawa et al./Object-oriented parallel information processing model AB CM/1 and its description language ABCL/1. Computer Software Vol. 23, No. 3, 1986).

For example, when a first object sends an asynchronous message to a second object, the first object after sending the asynchronous message and the second object that receives the asynchronous message operate in parallel. , and the execution of the object itself proceeds sequentially. This processing method is widely used because parallelism in object units is a natural concept.

[Problem to be solved by the invention]

Conventional parallel object-oriented languages assume parallelism in units of objects, but do not consider parallelism in units of messages. As a result, it is necessary to deal with two problems: scheduling of object 1- and scheduling of message, and there is a drawback that a complicated processing method is required.

SUMMARY OF THE INVENTION An object of the present invention is to provide a message scheduling method for a parallel object-oriented language based on parallelism in units of messages, which eliminates the above-mentioned drawbacks.

[Means to solve the problem]

In the message scheduling method of the present invention, a first processing entity simultaneously sends a plurality of messages to other processing entities, so that the plurality of processing entities that have received the messages proceed with processing in parallel, and the first processing entity sends a plurality of messages to other processing entities simultaneously. In an execution method of a parallel object-oriented language, the first processing entity waits for the result of a processing request made by the message by causing the entity to have a variable whose value is not determined in the message,
A time management section that manages virtual time for scheduling, a message storage section that collectively manages multiple messages to be executed simultaneously according to the time specified by this time management section, and messages retrieved from this message storage section. an executable determination unit that determines whether it is necessary to wait for other variables to be determined in order to execute the message and whether or not the variable is determined; a variable dependency management unit that registers the message for the variable that caused the message to be unable to be executed; a message execution management unit that sends the message to the message recipient if the message can be executed; and a message execution management unit that executes the message. and a message restorage control section that transfers a message that becomes executable by determining a new value to the message storage section.

[Effect]

The time T specified by the time management section is given to the message storage section, and the message group stored in the entry corresponding to the time T is retrieved. Messages belonging to this message group are to be executed at the same time, and messages are sequentially extracted from this message group and handed over to the execution possibility determination section. The executable determination unit determines whether the received message includes a variable, and if so, determines whether the message cannot be executed unless the value is determined. If the message contains a variable and cannot be executed unless the value is determined, the variable dependency management unit registers the message to the variable for which the message could not be executed because the value is not determined. I'll keep it. On the other hand, if the message can be executed, it is delivered to the message execution management section and the message is executed. Normally, by executing a message, another message is generated and additionally stored in the entry corresponding to time T+1 in the message storage section. In addition, for variables newly confirmed by executing a message, if a message has been registered for the confirmed variable, the registered message is transferred to the message restorage management section, and the message restorage management section additionally stores the message in the entry corresponding to time T+1 in the message storage section. The time management unit updates the time and executes processing.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a configuration diagram showing one embodiment of the present invention, and FIG.
FIG. 2 is a configuration diagram showing an example of a time management section 1 and a message storage section 2 in the figure. In FIG. 2, the time management section 1 consists of a current time holding section 10 and a time update processing section 11, and the output of the current time holding section instructs an entry in a circular structure section (hereinafter referred to as time ring) 20 that stores messages. do. The time ring 20 is made up of a plurality of entries, and messages to be executed simultaneously are connected to each of the entries 210 to 213 corresponding to each time.

FIG. 3 is a format diagram of each message, which is composed of processing contents, an object that is the recipient of this message, and zero or more variable fields.

As shown in FIG. 4, the variable field is comprised of a wait mode flag indicating that the message containing the variable field can be executed only when the variable to be stored is determined, a variable, and a message waiting to be executed. . In Figure 4, the wait mode flag is used to determine whether there is a determined value in the value column, and the message column waiting for execution contains messages that may become executable when the value of the variable is determined. Store.

5(a) and (b) are flowcharts showing the processing procedure of the present invention.Hereinafter, this embodiment will be explained with reference to the flowchart of FIG. The current time of 10 is updated to time T (
Step 101).

It is determined whether there is a message group stored in the entry 211 of the time ring 20 indicated by the time T, and if there is not, the process branches to step 101. If there is a message group to be processed, the feasibility determining section 3 extracts the message group (step 102), and performs the following processing on all messages. That is, step 103゜10 takes out one message from the message group.
4) Check whether there is a variable in wait mode (step 105). This can be seen by looking at the message format variable column shown in Figure 3. If there is a wait mode variable, the wait mode flag column in FIG. 4 is checked to see if the value is fixed (step 106). If it is in the waiting mode and has not been determined, the variable dependency relationship management unit 4 adds the message to the waiting message column of this variable (step 107). Alternatively, if the wait mode variable has been determined, the message can be executed and is passed to the message execution management section 5. The message management section 5 stores the messages received in the form of a queue (step 108). The above process is performed on all the messages retrieved in step 102, and when there are no more messages in step 103, the messages stored in the queue are executed in step 108 (step 109).
. Additionally, if a new variable is determined during message execution, the value is stored in the variable value field (step 110), and the waiting message field is checked to see if there is a message waiting for the variable to be determined (step 110). Step 111).

If there are any waiting messages, all the waiting messages are added to the end of the entry in the time ring 20 corresponding to time T+1, which is one unit ahead of the current time.

〔Effect of the invention〕

As described above, according to the present invention, it is possible to provide a message scheduling method for the parallel object-oriented language C, which is based on parallelism on a message-by-message basis.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram showing one embodiment of the present invention, and FIG.
FIG. 3 is a format diagram of the message used in FIG. 1, FIG. 4 is a format diagram of variables in FIG. 3, and FIG.
The figure is a flowchart of an embodiment of the invention. 1... Time management section, 2... Message storage section, 3.
... Executable determination section, 4... Variable dependency management section, 5
Message execution management unit, 6 Message restorage control unit, 10 Current time holding unit, 11 Time update processing unit, 20 Cyclic structure (time ring) for storing messages. , 210-213... Entries corresponding to each time.

Claims (1)

[Claims] When the first processing entity simultaneously sends multiple messages to other processing entities, the multiple processing entities that received the messages proceed with processing in parallel, and the first processing entity has an undetermined value. a time management unit that manages virtual time for scheduling in an execution method of a parallel object-oriented language in which the first processing entity waits for a processing request result according to the message by including a variable in the message; There is a message storage section that collectively manages multiple messages to be executed simultaneously according to the time specified by this time management section, and a message storage section that requires waiting for other variables to be determined before executing a message retrieved from this message storage section. an executable determination unit that determines whether the message exists or not and whether the variable has been determined; A variable dependency management unit that registers messages, a message execution management unit that sends messages to message receivers when messages can be executed, and messages that become executable by executing messages and determining new values. A message scheduling method, comprising: a message restorage control section that causes the message to be transferred to the message storage section.