WO1997035262A1

WO1997035262A1 - Method for automatically generating program and method for controlling execution

Info

Publication number: WO1997035262A1
Application number: PCT/JP1996/000677
Authority: WO
Inventors: Chisato Konno; Katsuro Kikuchi
Original assignee: Hitachi, Ltd.
Priority date: 1996-03-15
Filing date: 1996-03-15
Publication date: 1997-09-25

Abstract

In an information system in which a plurality of computers are connected to each other through a composite large-scale network, an information table in which information called 'Passport' including bibliographic items, such as the destinations, purposes, and times and dates of visits, departure times and dates, etc., required to move a program which is moved from one computer to another to perform given processing is written, is incorporated in the program, and the handling of the program itself while the program visits a server is determined based on the passport information. The program has electronic money and uses the money as the change for the use of a resource on the server. Depending upon the processing, a child program which is a copy of the program is generated so as to shorten the processing time.

Description

Description Automatic program generation method and execution management method

The present invention relates to an automatic generation method and an execution management method of a program of an information system in which a plurality of computers are connected and used by a network. Background art

Conventional information systems have been premised on exchanging only data with other computers via a network. In contrast, General Magic and Sun Microphone Systems have announced ways to send both data and programs to other computers. In this method, it is assumed that the program is executed on a computer having a processing environment of a specific language using a specific language. In the conventional method, a single program is exchanged between computers in principle. It is also assumed that the computer resources of the other party can be used without charge.

With the above conventional technology, it is difficult to cope with an information system in which different types of computers are connected in a huge complex network. First of all, it is assumed that the environment in which a specific language operates, so only information systems with limited computer systems are targeted. Second, processing time is enormous if a single program visits many computers connected to the network to perform processing in principle. Third, there is no regulation on how to move the network to borrow and use other computer resources, which limits the number of computers that can be moved. An object of the present invention is to solve these problems and provide an information system in which different types of computers are connected in a large-scale complex network. An object of the present invention is to propose an automatic generation method and an execution management method of a program prepared to be used as a resource of a program. Disclosure of the invention

In a program that visits another computer via a network and performs processing on the computer, the bibliographic information necessary for moving the program, such as the destination, the purpose of the visit, the date and time of the visit, and the date and time of departure, is included in the program. Information table (hereinafter, the contents of this information table will be referred to as passport information), and the visited server (a computer for performing a certain service) will use the information table based on the passport information. Have a means of deciding how to handle the program itself. In addition, the program has electronic money, and each visiting server has a means to lend resources (memory, CPU) on the server to the program at a predetermined price, and to have the program perform the processing. In addition, if the program requests the server to generate its own child program according to the elapsed time since departure, the number of unvisited servers, the purpose of the visit, and the balance of the money held, the program satisfies the specified conditions. Provides a means for generating multiple child programs, and the generated child programs branch off from the original parent program's visiting route and independently process on the unvisited server. In addition, the parent program and the child program are provided with a means to unite on the specified server to be visited, and the program that has become one again continues the visit and processing to the remaining server to be visited. BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 is a conceptual explanatory view of the present invention. FIG. 2 is a diagram showing the structure of an agent program that travels over a network. Fig. 3 is a structural diagram of the passport of the agent program. FIG. 4 is a diagram showing the structure of a passport possessed by the agent program. Fig. 5 shows the flow of the process of synthesizing the agent program in the server. FIG. 6 is a processing flow of the agent program in the server. FIG. 7 is a processing flow of the agent program in the server. FIG. 8 is a schematic diagram of processing of an agent program in a server. FIG. 9 is a schematic diagram of the processing after the program synthesis in the server. FIG. 10 is a flowchart for determining the number of child programs. Fig. 11 shows a method for generating a child program. FIG. 12 is a schematic diagram of a child program generation process. FIG. 13 is a schematic diagram of a child program generation process and is a diagram for explaining a passport generation procedure of the child program. Figure 14 shows the composition of the program. FIG. 15 is a schematic diagram of a program synthesizing process. FIG. 16 is a schematic diagram of a program synthesizing process, and is a diagram for explaining a passport synthesizing procedure of the synthesized program. BEST MODE FOR CARRYING OUT THE INVENTION

One embodiment of the present invention will be described with reference to FIGS.

First, the concept to be achieved by the present invention will be described with reference to FIG. 1, and then the detailed flow of each processing unit will be described.

As shown in FIG. 1 at 101, a program 103 for visiting and processing a plurality of computers via a network (hereinafter, the program itself is referred to as an agent program in the present invention) is a starting point. Calculator from 0 to 2 star And perform the set processing on multiple server computers, and return to the computer that started. It is also conceivable that the order of visit is dynamically added at the start from the preset processing result at the place of visit. The embodiment disclosed in the present embodiment is based on the information and structure that the agent program must have at least to visit any server connected to the network, and to make the visit as quickly as possible. It is a realization method. For example, it is assumed that the agent program visits a server 1 to a server 5 to perform processing as shown in 104 of FIG. Of these, server 1 to server 3 are tasks that can be processed simultaneously and in parallel, and it is assumed that server 4 and server 5 need to visit in this order to perform the tasks. At this time, assuming that this processing is to be completed at the earliest, the agent program A (105) generates child programs A1 (106) and A2 (107), which are their own alternations, and the server program A (105) respectively. To the server 2 to perform the work, and the self (parent program) goes to the server 3 for processing, and each of the agent programs Al and A2, after processing, meet on the server 4, and each processing result And combine them into one program A again, visit server 4, then server 5, and perform the processing.

In the following, the present embodiment describes the program structure and information provided in the agent program to realize this mechanism, and the functions that each server to be visited should have and the method of realizing the functions.

The structure of the agent program 103 is shown at 200 in FIG. The agent program is the first program part (201) that performs processing while interacting with the program on the visited server, and the second program part (200) that performs processing closed in this program at the visited site. 202) and a third part (203) for holding the collected data. The first program part has Includes an ID number that proves the identity of the agent program, an electronic cash (or electronic money) that is the money owned by the agent program, and a passport (300) that contains information such as the route to visit. In. Fig. 3 shows the contents of the passport. The passport contains an ID number for the agent's program to be recognized by the visited server, and a fee for paying when the visitor borrows and processes the server's resources. The electronic cache contains information (301). In addition, the table 302 that describes the visiting route and purpose includes the visiting server name 3005, and whether the processing on that server can be performed in parallel with the processing on the subsequent visiting server. 306) or an attribute 306 indicating whether to process sequentially (shown as S in the table in the figure), and the number of child programs to be encountered on the visited server 307 (about child programs) Will be described later), the purpose of visiting the server 308, the date of arrival at the server and the date of departure 309. Further, it includes a relay address 310 indicating a merge with another program on the visiting server, and a home address 311 corresponding to a computer from which the agent program is transmitted. The details of the setting and use of this table will be explained sequentially, but the server visited will verify this passport, decide how to handle the visiting agent program, and if necessary, add data to this table. And update the information.

At the time of the first departure, this passport is sent over the network with the name of the visiting server, the attributes, the number of child programs (0 initially), and the purpose of the visiting. At the visit destination, the number of child programs, arrival date / time, departure date / time, and relay address are entered and used as information on the passport. In addition, a server to be visited is added based on the information collected at the place of visit. As shown in FIG. 4, the addition is performed by pointing an additional destination table having the same format as that of this table with a pointer from the server name column 401 of the destination. In this example, the agent program This shows the situation where a visit was added in the processing when the ram visited the server with the address // www / ad5. Here, the home address of the table to be added is the name of the visited server to which this table has been added. This table can be nested recursively to any number of levels. In this example, the passport table is dynamically added using a pointer, but the passport table is directly inserted into the table without using a pointer, and the insertion depth is managed by a field flag provided on the table. It is also possible.

Now, how the agent program with the above structure is processed on the visited server will be described with reference to the flowcharts of FIGS. The explanation is given with reference to FIGS. 8 and 9 which are schematic diagrams of the processing.

First, the configuration of the server and the concept of processing will be described with reference to FIG. An agent program 81 delivered to a server system via a network is processed by a master program 80 in the server. Another component of the server system is the relay file 82. This file is set on a storage device in the server as a storage location of an agent program that is processed waiting for the arrival of another agent program among the agent programs delivered to the server. The relay file has a directory 83 for easily searching for an agent program stored in this file. Before the processing of the agent program itself, the master program extracts another agent program waiting for the arriving agent X program if it is in the relay file (84), and combines it with the arriving agent program. Then, a new agent program 85 is generated, and the contents of the program are executed and processed by the master program. Temporarily distributed age If another agent program waiting for the agent program has not arrived, the agent program itself is stored in a relay file and the arrival of another agent program is waited for.

Now, the description of the processing flow itself will begin with FIG. An agent program that visits a server is answered by the master program on the server. The master program 501 copies the first program part of the agent program from the agent program to another memory area, extracts it, and verifies the contents first (502). First, check the ID number and verify that it is a program generated by a legitimate procedure. Next, whether or not the program includes an instruction sequence such as an illegal system call or the like is further analyzed by a compiler. After the certification of the Age X program, if you do not pass the examination, you will be able to return to the home address at the end of the visit table in your passport (Fig. 3), or The agent program itself is erased according to the agreement (503).

If authentication is permitted, the following two types of processing are performed (504).

First, if the program is a parent program, a check is made to see if there is a child program meeting with the visiting server (505). The parent program can be checked by checking the number of children on the passport (307 in Fig. 3), and by checking whether the number of child programs meeting each other or the number of children in the corresponding visitor server column is 1 or more. If there is a child program that falls, it is checked whether the child program has arrived (506). This can be done by checking the directory 83 of the relay file 82 on the server and verifying whether a program having the same ID is stored in the relay file. If the child program has not arrived yet, register the arrival of the parent program itself in the relay file 501 and send it to the master program. The processing of the agent program (parent) by the program ends, and the program waits for the arrival of the child program (509). If there is a child program in the relay file, it is extracted and synthesized with the parent program (507). ₍ The detailed flow of the synthesis processing will be described with reference to FIGS. 14 to 16. Fig. 14 shows the flow, and Fig. 15 shows a schematic diagram of the process.First, an outline of the processing is explained in Fig. 15. In the parent program after merging, the first and second program parts Inherits the parent program 151, except for the passport.The passport transfers the information of the child program 152 to the parent program's passport.The third part is the data of the parent program 1. Merge the information of both 5 1 and child program 1 5 2 to create a new agent program (parent)

Combine to 1 53. The processing flow for compositing is shown in Fig. 14, but the following procedure is repeated as many times as the number of child programs. First, the data of the parent program is added to the data of the child program in the evening (14 1). Next, the passport described in FIG. 3 of the parent program is updated (144). The visitor server line of the child program passport is inserted into the branch point of the child program in the passport line consisting of the visitor server indicating the route of the parent program (144). The branch point can be determined from the name of the visiting server of the passport of the child program. In this case, as described in Fig. 4, if the route is expanded at the visited site, the developed route is inserted through the pointer. Fig. 16 shows a specific example. The child program 16 2 branched from the server 〃 www.ad2 is connected to the parent program's visit route 16 1 〃 www.ad2 on the relay server 〃 www.ad3. 〃 _www., including the visited 1 6 4 that has been deployed in _a d2,

Insert as shown in 163. Returning to Fig. 14, the number of children at the relay point of the passport of the parent program is reduced by 1 (144). Fig. 16 shows the processing result. Finally, the amount of money in the parent program is transferred to the money The synthesis is completed by adding the gold balance (that is, the electronic money figures recorded in the parent program).

Referring back to FIG. 5, it is verified that all the child programs have arrived (508). This can be done by determining whether the number of children on the server of the passport of the parent program generated by synthesis is zero. If the number of children is not 0, there is a child program that has not arrived yet, so the generated parent program itself is registered in the relay file 501, and the processing of the agent program by the master program ends. I will wait for the arrival of the child program (509) o

If the agent program arriving at the server is a child program, the location of the parent program in the relay file 510 is confirmed, and if the parent program is in the relay file 510, the parent program is taken out. What is necessary is just to perform the processing exactly the same as the processing of 507 to 509 described above.

When the composition of the parent program and all the child programs is completed, the processing flow shown in FIG. 6 is performed. The schematic diagram is shown in FIG. The master program 91 copies the first program part 93 of the agent program 92 to another memory area, cuts it out, gives control to it, and interacts with the agent program 92 to make a request to the server. Is performed. At this time, if the subsequent processing of the agent program 92 can be processed in parallel in the future visit, the master program generates a child program 94 which is a pseudo duplicate of the agent program (parent). Then, control is performed so that the parent program and the child program are transferred to the respective destinations via the network.

Returning to the flow of FIG. 6, the description will be continued. The master program copies the first program part of the agent program to another memory area (6 0 1). Stamp the date and time of arrival (ie, record the date and time of arrival) on the passport included in the first program part, and send it to the agent program's home address and / or relay server address. A copy of the routing table 302 in the passport is sent to the server (600). Next, when the agent program is a source program, it is compiled to be an executable program (602), and the master program gives a process to the agent program and executes it. For this execution, a method that is executed on an operating system different from the operating system where the master program is located can be considered. In such a case, the protocol to be exchanged between the two operating systems should be decided in advance, and the agent program and the master program should be made to interact according to the protocol.

The age program sets execution conditions and presents it to the master program (605). The setting of the execution conditions determines the number of child programs to be generated, taking into account the future processing and the elapsed time at the visiting server. The purpose of this is to make it possible for a program released in the network to return to the user with a desired result in a realistic time.

A specific setting example of the execution condition will be described with reference to FIG. By using the information stored in the passports that make up the agent program, the elapsed time from when the agent computer that sent the agent program is output to the network is output, and the agent program is used as a child program. If it is a program, the elapsed time since the child program was created L (1001), the number of servers that can be processed in parallel in the future visits of the agent program N (1002), the amount of money Electronic money information indicating K (1003) can be extracted. This is the arrival of the information table that constitutes each passport Date and time Z Departure date and time, attributes and electronic cash should be checked (Fig. 3). Next, the number of divisions (the number of child programs) is determined using these parameters (100). If an agent program generates a child program, the number of passages through the network will increase by the number of child programs generated in addition to a single program. In addition, the resource usage rate in the entire network increases relatively for the child program. Therefore, using the average network transit fee t and the maintenance cost b of the child program defined by the network b (the amount necessary to allow the existence of the child program, which is equivalent to the so-called resident tax), Compare that to your program's money to determine the number of child programs. In the case of the parent program, for example, let C be a preset constant, and let S be the maximum number not exceeding KZ (C * (b + t)) (1004). The meaning is the ratio of the minimum cost to maintain the child program to the money you have, and C is a constant to control the growth of the child program. In the case of a child program, the main purpose is, for example, to end processing as soon as possible. Therefore, if the elapsed time L since generation has exceeded a predetermined constant T, the child program Let S be the ratio of the number of unprocessed servers to the number of processed servers among the servers to be processed (1005). The meaning is a first-order approximation of the number of child programs that can be completed after L hours. One method is to use MIN ((N-1), S) as the number of child programs, based on the fact that the parent program itself also processes servers, using the number of servers N that can be processed in parallel with S. is there.

Referring back to FIG. 6, the master program, which has confirmed the execution condition of the age program, requests a resource usage fee from the agent program (604). This is the sum of the portion for the work of the agent program and the portion for the generation of the child program. The agent program pays the electronic money according to the requested amount (606). This is an electronic check The data with the personal identification number may be passed in a hand-like format, or the actual payment may be performed later, and only the encrypted signature may be returned to the server. If the transfer of electronic money by the master program has not been completed due to, for example, exceeding the solvency of the agent program, the agent program is notified to that effect, and the agent program is notified of the number of child programs, etc. Is set again, and the above process is repeated until the transfer of the electronic money is completed (608). The change of the execution condition is achieved by the operation of the constants C and T described above. When the transfer is completed, the division processing (child program generation processing) described below is performed according to the request for the generation of the child program (609), and the generated child program is transferred to another server, and the parent program is transmitted to another server. On the current server, the processing of the agent program itself, that is, the parent program itself is continued (610).

Now, the details of the division process of the agent program performed to generate the child program will be described with reference to FIGS. 11 to 13. According to the flow shown in FIG. 11, a description will be given with reference to specific examples shown in FIGS. 12 and 13.

First, the visit server of each child program is determined according to the number of child programs to be generated (111). This is done by initially setting the quotient obtained by dividing the number of servers that can be visited in parallel by ((number of child programs) + 1) as the number of servers visited by the parent and child programs, and allocating the remainder to each server.

Then, the following processing is performed for the number of child programs. First, the ability to generate passports. This involves copying the ID number, distributing the money (e-cash) by the number of programs including the parent, and assigning the visiting server of the corresponding child program to the parent program. Copy the passport information from the table that records the information, and finally set the relay address and home address (1102). This specific processing example will be described with reference to FIG. In this case, it is assumed that the visitor can perform parallel processing at www.adl, and can perform three tasks, 〃www.adl, 〃www.ad2, and 〃www.ad3. It is assumed that there is one child program and two servers, www.ad2 and www.ad3, are assigned to the child program. The passport 1301 of the parent program is used to create the passport 2 of the child program. First, the ID is copied, and the electronic cash is allocated (1303). Next, copy the rows of //www.ad2 and 〃 www.ad3 from the table of the parent program as the destination of the child program, and use the next destination of the parallel target server group as the relay address (in this case /// Set up www.ad4) (1305). The home address is set to the same address as that of the parent program (1306). Returning again to FIG. 11, the necessary parts of the first program part are copied from the parent program according to the visiting purpose of the visiting server. At this time, if there are a plurality of visiting servers, the necessary subprogram group is selected by performing a logical sum for the purpose of visiting (1103). This can be achieved by putting the name of the subprogram included in the first program part in the visit purpose column of the passport. Next, in the same manner, the second program part and necessary parts of the data group already collected are copied from the parent program according to the visit purpose of the visit server. At this time, if there are a plurality of visiting servers, the necessary subprogram group is selected by ORing the visiting purposes (1104).

The concrete image of the result will be described with reference to FIG. Case 1 (1221) in the figure is the result of generating one child program. The first program part has two partial functions (subprograms), and the second program part has two functions. Has one partial function (subprogram) registered and no data is added. Case 2 (1 202) in the figure is the result of generating two child programs, but the second child program 1203 has the second program The part is an example having no function.

Returning again to Fig. 11, the next generated child program is transferred to the address of the first destination via the network. Finally, as a process to the parent program, the passport is modified (1106). This includes reducing the distribution of e-cache to children, masking (disabling) the visits that were to be visited by the child program, and determining the number of relay server children that meet the child program. Count up for a few minutes. This makes it possible to wait for the child program described in Fig. 5 '.

In the specific example shown in Fig. 13 of this process, the reduction of electronic cash (1307), masking of unnecessary servers by visiting child programs (1308), and the number of children at the relay server Counting up (1309) is in progress.

The above is the mechanism of child program generation.

Returning to FIG. 6, the original processing of the agent program on this server is performed thereafter (610). The continuation of the processing flow will be described with reference to FIG. The first program part of the agent program basically achieves the desired purpose by interacting with the master program and utilizing the programs and information and processes owned by the server. First, the agent program issues a request for processing or information provision to the server (701), and the master program executes the requested processing (702). The processing itself varies widely, but for example, submission of data and certificates, reservations for information managed by the server, and the like can be considered. This dialogue is performed by presenting data from the agent program side or conversely by presenting it from the master program side. At the end of the processing of the agent program, a report (703) and a request to add the information collected by the agent in this interactive processing to the data part (203) of the main body of the agent program are sent. Ma The information is added to the stub program (704), and the master program adds the information to the data portion of the agent program before clipping (705). After that, the agent program returns the process (706). The master program extracts the passpoint of the agent program (707), returns the resource usage balance and stamps the departure date and time, and reads the address of the next visited server (770). ). If there is no next server, the home address will be the next destination. Next, the passport is returned to the agent program body (specifically, the updated data is copied) (709). Finally, transfer the agent program to the next destination via the network.

The embodiment of the present invention has been described above.

In the present embodiment, control is given only to the first program part of the agent program, and the data collected by the agent program is carried by the agent itself. However, the following modified examples can be considered.

It is also feasible to give control to the second program part after the processing of the first program part in FIG. 7 to allow the collected data to be processed on the spot. This makes it possible to compress and interpret the amount of collected data. In this case, the second program part can be given a process after cutting out that part and verifying the processing content as shown in the above example, but this part requires interaction with the master program Since it is not a program, it can be run on another operating system. This makes it possible to prevent the server from being damaged by unexpected runaway of the program.

Also, the collected data is not always carried by the agent program, but it is cut out in advance depending on the amount of collected data and transferred to the relay server. W 97/35262 P

1 6

It is also possible. In this case, the first program part can be realized only as a passport as a child program of the agent program by performing the same division processing as in the above-described embodiment.

Furthermore, in the present embodiment, the method of realizing the authentication of the agent program and the generation of the child program on the server visited by the agent program has been described, but the computer that performs each processing is a separate computer. There is also a way to do this. For example, in the authentication of an agent program, if the server to be visited performs the processing described in Fig. 5 on the entrance server connected to the external network, the processing of immigration control in human society will be performed. Servers can be set up on the network. Also, for example, in generating a child program, a specific server may be provided in the network, and the agent program may visit the server and perform the processing described in FIG. For example, a server for processing maternity hospitals in human society can be set up in the network.

According to the present invention, all users can safely share resources of the entire network. In addition, processing via a huge network can be completed in a limited time. Moreover, it is possible to prevent the amount of programs and data flowing on the network from explosively increasing and causing a traffic bottleneck in the network. In addition, by using passport-based processing, the functional configuration of each server can be realized in a unified format. Industrial applicability

As described above, the automatic program generation method and the execution management method according to the present invention are determined while moving a plurality of computers connected via a network. It is suitable for a system that handles programs that process the tasks specified. In particular, the larger the network, the more users can use it without feeling the size or inconvenience.

Claims

The scope of the claims

1. An information system in which a plurality of computers are connected via a network was prepared, and a function was set to perform a specific process on each of a plurality of computers connected to the network, starting from an arbitrary computer. In a system environment that handles a program that sends a program and returns to the computer at the start point together with the result of performing the above-described specific processing, the program has monetary data corresponding to electronic money, and A program execution management method characterized in that use of resources (resources such as a memory and a CPU) of a computer is given by passing said money data to a computer connected to a network.

2. An information system in which a plurality of computers are connected by a network was prepared, and a function was set to perform a specific process on each of a plurality of computers connected to the network starting from an arbitrary computer. In a system environment that handles a program that sends a program and returns to the computer at the start point together with the result of performing the above-described specific processing, the program originates from one computer and is connected to the network. A program that is set to perform a certain process for a plurality of programs has an information table called a passport including the destination, the purpose of the visit, the date and time of the visit, the date and time of departure, and the like. Perform the processing according to the contents of the passport on the computer of the visiting destination via the network, and after the processing is completed, When it is transferred to a process execution management program, characterized in that visit Z departure date and time of the computer on the passport it is stored.

3. A program in which an information system in which multiple computers are connected via a network is prepared, and functions are set to perform specific processing on each of the multiple computers connected to the network, starting from any computer. A program that returns to the starting computer with the result of performing the above specific processing In a system environment that handles programs, a program issued from one computer and set to perform a certain process for each computer connected to the network is included in the program as a destination or destination It has an information table called a passport that includes the date and time of visit, the date and time of departure, etc., and performs the visit purpose processing according to the contents of the table on the computer of the visit destination via the network, and according to the result of the processing. The second visiting computer, which is set as a starting point of the computer which transmitted the program, is dynamically changed by adding a newly visited computer to the information table. Execution management method of the program described in the section.

4. An information system in which a plurality of computers are connected by a network was prepared, and a function was set to perform a specific process for each of a plurality of computers connected to the network starting from an arbitrary computer. In a system environment that handles a program that sends a program and returns to the above-mentioned computer with the result of performing the above-mentioned specific processing, it is a program issued from one computer and connected to the network. A program that has been set to perform a certain process for a certain destination has an information table called a passport that includes the destination, the purpose of the visit, the date and time of departure, the date and time of departure, etc. On the computer of the visit, the processing corresponding to the recorded contents of the above information table is performed, and the processing on the computer of the visited place is ended. The information on the visit of the computer Z in the information table section is added to the information on the departure date and time, and the information is transferred to the next computer to be visited. 3. The program execution management method according to claim 2, wherein the program execution management method is stored.

5. Prepare an information system in which a plurality of computers are connected via a network. Each of the plurality of computers connected to the network, starting from any computer. In a system environment that handles a program that sends a program that is set to perform a specific process to a specific computer and returns to the computer at the start point together with the result of performing the specific process above, A passport that includes the destination, purpose of visit, date and time of visit, date and time of departure, etc., in the program that has been issued and that has been set to perform certain processing for each computer connected to the above network And performs a process in accordance with the recorded contents of the information table on the computer at the destination visited via the network, and when the process in the computer is completed, the date / time of the visit / departure of the computer. The information is recorded in the information table, and the program is transferred to the next visit, and at the same time, 3. The method according to claim 2, wherein the information is sent to a computer that is a starting point of the program.

6. An information system in which a plurality of computers are connected via a network is prepared, and functions are set to perform specific processing for each of the plurality of computers connected to the network, starting from any computer. In a system environment that handles a program that sends a program that has been sent and returns to the starting computer with the result of performing the above-mentioned specific processing, the program is executed on a computer in the network that has not yet passed through. A method of automatically generating a program that creates a child program that allows a group to exclusively visit a group (hereafter, a parent program) and a copy of itself (hereafter, a child program).

7. When you create your own child program and make it visit the network exclusively, if each program finishes the participant's participant, set it so that it waits on a preset relay server. When the child program group and the parent program converge on the relay server, the child program collection data Claims characterized in that the data is merged with the data of the parent program, the child program is then deleted, and only the parent program including the data is transmitted to the next remaining visit route on the network. The method for automatically generating a program according to item 6.

8. When you create your own child program and make it visit the network exclusively, the child program group is the computer (home server) from which the relay server or the parent program is transmitted from each visiting server. 7. The method for automatically generating a program according to claim 6, further comprising: reporting a location of a server currently visited by the user, and maintaining a location record of each of the child programs.

9. The method according to claim 6, wherein each child program recursively generates the child program when the child program is created and the network is exclusively visited. How to automatically generate the program described in the section.

10. When the above program generates multiple copies of itself or a part of it (hereinafter referred to as “child program”) on a computer in the network, the elapsed time of the program and the remaining visits The permission of child program generation and the number of child programs to be generated are determined by using the number of destinations, the order of visits of the remaining destinations (possibility of parallel visits), and the like as condition parameters. Automatic generation method of the program described in 6.

11. The method for automatically generating a program according to claim 10, wherein the parameter for determining whether to generate the child program and the number of child programs to be generated includes an amount of money of the program. .

1 2. In generating the above child program, copy the minimum necessary program part in the parent program for the purpose of visiting the visit given to the child program. 7. The method for automatically generating a program according to claim 6, wherein:

1 3. Prepare an information system in which a plurality of computers are connected via a network, and set a function to perform a specific process on each of a plurality of computers connected to the network starting from an arbitrary computer. In a system environment that handles a program that sends back a program and returns to the computer at the start point together with the result of performing the above-described specific processing, a plurality of programs that exclusively process on a group of computers via a network An automatic program generation method, characterized in that two programs wait for a computer on a network, combine the program part and the data part of both programs to generate one program.

1. Prepare an information system in which a plurality of computers are connected via a network, and set up a function to perform a specific process on each of a plurality of computers connected to the network starting from an arbitrary computer. In a system environment that handles a program that sends a program that returns to the starting point computer with the result of performing the specific processing, the first program part that interacts with another program in the visited computer It has a program structure consisting of a second program part that performs closed processing in its own program at the visit destination, and a third program part that holds data obtained at the visit destination. A program execution management method characterized by giving control only to a first program part.

15. In claim 14, by copying the first program part to another memory area, the communication with the other program part is cut off, and the copied program is not executed by the compiler. The use of the permission instruction and the analysis of the purpose are performed, and only when the inspection is passed, control is given to the copied program part and the program is allowed to interact with the program in the computer to be visited. And a program execution management method for achieving a desired request.

16. In claim 15, the first program part interacting with the program in the visited computer is replaced by another operating system different from the operating system on which the server system program is running. An execution management method of a program characterized by being executed on a stage.

17. In claim 11, the first program part that interacts with the program in the visited computer is a source program, compiled by the visited compiler to create a load module, and A program characterized in that it can be executed at a destination regardless of the type and version of the operating system on the destination computer by means of achieving a desired request by interacting with a program in the computer. Execution management method.

18. In an information system that is connected via a network and in which programs pass between computers via the network, the first program part that interacts with other programs in the visited computer, and It has a program structure consisting of a second program part that performs closed processing in the other program and a third program part that holds data obtained at the visited site. A program execution management method comprising: means for giving control only to a portion; and means for giving control only to a second program portion.

1 9. Prepare an information system in which multiple computers are connected via a network, and set up a function to perform specific processing on each of the multiple computers connected to the network, starting from any computer. In a system environment that handles a program that transmits the transmitted program and returns to the computer at the starting point together with the result of performing the specific processing, the program includes a first computer for updating with the computer that was transmitted. Identify the program part and the program And a third program part for storing the processing result of the program, and the subsequent processing to be transmitted next and the subsequent processing result If it can be performed without reference, create a duplicate program for performing the relevant processing based on the number of relevant processing, rewrite the second program part and send it to different computers, If there is a common computer at the transmission destination of the program and the above-mentioned duplicate program, these programs are combined into one program to automatically generate a program.