Parallel distributed processing and operation processors

Claim 2

A parallel distributed processing system as set forth in claim 1, wherein said referring means is comprised of a local referring means provided in a proces receiving a call for a computation object or its facility for showing for the computation object or its facility which is called the correspondence between an identification number of the computation object or its facility and an execution address of the computation object or its facility and a remote referring means provided in a process originating a for a computation object or its facility for showing for the computation object or its facility which it calls the correspondence between a name or identifier of the computation object or its facility and an identification number of the computation object or its facility, a process originating a call uses the name or identifier of the computation object or its facility which it calls as a key to obtain a corresponding identification number from the remote referring means and sends a message containing the identification number to the process receiving the call for the computation object or its facility, and the process receiving the call uses the identification number contained in the message sent from the process originating the call as a key to obtain the execution address of the computation object or its facility which is called from the local referring means and executes the computation object or its facility which is called based an the execution address.

Claim 3

A parallel distributed processing system as set forth in claim 1, wherein a computation space is prescribed which is composed of a set of any of the one or a plurality of computation objects or their facilities and in which uniqueness of names or identifiers of the computation objects or their facilities is required in only the set; and the referring means gives location information on a computation object or its facility by using the name or identifier of the computation object or its facility in the computation space as a key.

Claim 4

A parallel distributed processing system as set forth in claim 1, wherein each operation processing node has: a process allocating means for allocating a program module at a predetermined operation processing node and generating a process at an operation processing node receiving the allocation based on allocation information indicating correspondence between location information of the program module for realizing the process and information of the operation processing node receiving the allocation or the program module and a reference information generating means for generating the reference information of the computation objects or their facilities which the program modules for realizing a process refers to each other based on the allocation information and the reference relationship among the computation objects or their facilities described in the program module in each process.

Claim 5

A parallel distributed processing system as set forth in claim 1, wherein a computation space is prescribed which is composed of a set of any of the one or a plurality of computation objects or their facilities and in which uniqueness of names or identifiers of the computation objects or their facilities is required in only the set; comprising a plurality of reference converting means for converting logical reference information specifying a computation object or its facility in a computation space to either of similar logical reference information and system reference information corresponding to the location information or reference information of a combination of the same, and a conversion control means for recursively inputting the input logical reference information and the logical reference information converted and generated in the reference converting means to any one of the plurality of reference converting means based on the logical reference information and converting the input logical reference information to the system reference information; and converting the logical reference information of the process receiving the communication to system reference information by said reference converting means through said conversion control means and performing communication among processes.

Claim 6

A parallel distributed processing system as set forth in claim 2, wherein the message includes a time indicated by a timer used in the process originating a call.

Claim 7

A parallel distributed processing system as set forth in claim 2, wherein when a plurality of messages are sent from processes originating calls to a process receiving the call, the plurality of facility calls corresponding to these messages are sequentially made according to a priority order for processing at the process receiving the call included in the messages.

Claim 8

A parallel distributed processing system as set forth in claim 2, wherein the message includes a time when the facility which is called is to be executed in the process receiving the call.

Claim 9

A parallel distributed processing system as set forth in any one of claims 1 to 8, wherein said computation object or facility is any one of a file, function, class, instance, method, and global variable.

Claim 10

A parallel distributed processing system as set forth in claim 5, wherein said plurality of reference converting means is comprised of a first reference converting means for convecting the logical reference information to the system reference information, a second reference converting means for converting the logical reference information to a set of the system reference information, a third reference converting means for converting the logical reference information to other logical reference information, a fourth reference converting means for converting the logical reference information to a set of the other logical reference information, and a fifth converting means for converting the logical reference information to a set of the system reference information and the logical reference information; and the conversion control means inputs the input logical reference information and the logical reference information generated by conversion to any one of the first reference converting means to the fifth reference converting means based on the contents of the logical reference information.

Claim 11

A parallel distributed processing system as set forth in any one of claims 1 to 10, wherein when a new computation object or facility is registered, the computation object or facility which will be called from the process and which the process will call are analyzed and the reference information are dynamically prepared based on the result of the analysis.

Claim 12

An operation processor having for executing a process provided with one or a plurality of computation objects and connected with other operation processors through a network, comprising: a process generating means for generating a first process corresponding to a first program module, a reference information generating means for generating reference information relating to a location information directly specifying a computation object or its facility on a network referred to by a program module for realizing a process based on a reference relationship among the computation objects or their facilities described in the program module, a reference information holding means for holding said reference information, a reference inquiry means for making an inquiry to said reference information holding means using a name or identifier of said computation object or its facility as a key thereby obtaining the execution address of the computation object or its facility on the network from said reference information when said first process calls and executes a computation object or its facility provided in a second process corresponding to a second program module, and a message communicating means for tranmitting and receiving a message including the location information obtained by said reference inquiry means between said first process and said second process and performing processing for calling the computation object or its facility provided by said first process and said second process.

Claim 13

An operation processor having for executing a process provided with one or a plurality of computation objects and connected with other operation processors through a network, comprising: a process allocating means for substantially generating the process by indicating the allocation of a program module and a generation of a process corresponding to said program module with respect to a predetermined operation processor based on an allocation information indicating correspondence between location information of a program module for realizing the process and information of the operation processor receiving the allocation of the program module, a reference information generating means for substantially generating reference information by indicating the generation relating to the location information directly specifying a computation object or its facility to which a plurality of program modules refer each other with respect to said process which is generated corresponding to the program module based on a reference relationship among the computation objects or their facilities described in the program module, and a message communicating means for indicating an allocation of the process with respect to said operating processor and indicating the generation of said reference information with respect to the process.

Claim 14

A parallel distributed processing method in a network wherein a plurality of operation processing nodes for executing processes provided with one or more computation objects are connected with each other, wherein when calling and executing a computation object or its facility provided in a first process by a second process, said second process obtains location information directly specifying the computation object or its facility on the network from reference information using as a key a name or identifier of the computation object or its facility, transmits this location information to the first process, and calls up the computation object or its facility provided by the first process.

Claim 15

A parallel distributed processing method as set forth in claim 14, wherein said reference information comprises local reference information provided in a process receiving a call for a computation object or its facility for showing for the computation object or its facility which is called the correspondence between an identification mumber of the computation object or its facility and an execution address of to computation object or its facility and remote reference information provided in a process originating a call for a computation object or its facility for showing for the computation object or its facility which it calls the correspondence between a name or identifier of the computation object or its facility and an identification number of the computation object or its facility, a process originating a call uses the name or identifier of the computation object or its facility which it calls as a key to obtain a corresponding identification number from the remote referring means and sends a message containing the identification number to the process receiving the call for the computation object or its facility, and the process receiving the call uses the identification number contained in the message sent from the process originating the call as a key to obtain the execution address of the computation object or its facility which is called from the local referring means and executes the computation object or its facility which is called based on the execution address.

Claim 16

A parallel distributed processing method as set forth in claim 14, wherein a computation space is prescribed which is composed of a set of any of the one or a plurality of computation objects or their facilities and in which uniqueness of names or identifiers of the computation objects or their facilities is required in only the set; and the reference information gives location information on a computation object or its facility by using the name or identifier of the computation object or its facility in the computation space as a key.

Claim 17

A parallel distributed processing system as set forth in claim 14, wherein each operation processing node allocates a program module at a predetermined operation processing node and generates a process at an operation processing node receiving the allocation based on allocation information indicating correspondence between location information of the program module for realizing the process and information of the operation processing node receiving the allocation of the program module and generates the reference information of the computation objects or facilities which the program modules for realizing a process refers each other to based on the allocation information and the reference relationship among the computation objects or facilities described in the program module in each process.

Claim 18

A parallel distributed processing method as set forth in claim 14, comprising defining a computation space which is composed of a set of any of the one or a plurality of computation objects or their facilities and in which uniqueness of names or identifiers of the computation objects or their facilities is required in only the set; determining the reference conversion method for the logical reference information specifying a computation object or its facility receiving the communication of the process in the computation space based on its content; converting the logical reference information receiving the communication to either of other logical reference information and system reference information directly specifying an object on the computation network or a combination of the same by the determined reference conversion method; determining the method of the reference conversion again for the logical reference information among the reference information resulting from the conversion based on the logical reference information; performing the conversion again by the determined method reference information; repeatedly perforning the determination of the reference conversion method with respect to the logical reference information and the conversion based on this until all elements of the reference information resulting from the conversion become the system reference information and, when all elements become the system reference information, communicating among processes based on the reference information ; whereby the processes perform distributed processing substantially linked up.

Claim 19

A parallel distributed processing method as set forth in claim 15, wherein the message includes a time indicated by a timer used in the process originating a call.

Claim 20

A parallel distributed processing method as set forth in claim 15, wherein when a plurality of message are sent from processes originating calls to a process receiving the call, the plurality of facility calls corresponding to these messages are sequentially made according to a priority order for processing at the process receiving the call included in the messages.

Claim 21

A parallel distributed processing method as set forth in claim 15, wherein the message includes a time when the facility which is called is to be executed in the process receiving the call.

Claim 22

A parallel distributed processing method as set forth in any one of claims 14 to 23, wherein the computation object or its facility is any one of a function, class, instance, method, global variable, and file.

Claim 23

A parallel distributed processing method as set forth in claim 18, wherein the method of the reference conversion is determined from among a first method for converting logical reference information to the system reference information, a second method for converting the logical reference information to a set of the system reference information, a third method for converting the logical reference information to other logical reference information, a fourth method for converting the logical reference information to a set of the other logical reference information, and a fifth method for converting the logical reference information to a set of the system reference information and the logical reference information based on the contents of the input logical reference information and the logical reference information generated by conversion.

Claim 24

A parallel distributed processing method as set forth in any one of claims 14 to 23, wherein when a new computation object or facility is registered, the computation object or facility which will be called from the process and which the process will call are analyzed and the reference information are dynamically prepared based on the result of the analysis.