WO1997035262A1 - Procede de generation automatique de programme et procede de commande d'execution - Google Patents

Procede de generation automatique de programme et procede de commande d'execution Download PDF

Info

Publication number
WO1997035262A1
WO1997035262A1 PCT/JP1996/000677 JP9600677W WO9735262A1 WO 1997035262 A1 WO1997035262 A1 WO 1997035262A1 JP 9600677 W JP9600677 W JP 9600677W WO 9735262 A1 WO9735262 A1 WO 9735262A1
Authority
WO
WIPO (PCT)
Prior art keywords
program
computer
network
child
processing
Prior art date
Application number
PCT/JP1996/000677
Other languages
English (en)
Japanese (ja)
Inventor
Chisato Konno
Katsuro Kikuchi
Original Assignee
Hitachi, Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi, Ltd. filed Critical Hitachi, Ltd.
Priority to PCT/JP1996/000677 priority Critical patent/WO1997035262A1/fr
Publication of WO1997035262A1 publication Critical patent/WO1997035262A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/388—Payment protocols; Details thereof using mutual authentication without cards, e.g. challenge-response
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/12—Payment architectures specially adapted for electronic shopping systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/12—Payment architectures specially adapted for electronic shopping systems
    • G06Q20/127—Shopping or accessing services according to a time-limitation
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07F—COIN-FREED OR LIKE APPARATUS
    • G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
    • G07F17/0014—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for vending, access and use of specific services not covered anywhere else in G07F17/00
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols

Definitions

  • 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.
  • 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
  • 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
  • the visited server a computer for performing a certain service
  • 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.
  • the program satisfies the specified conditions.
  • 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.
  • 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. 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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).
  • 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.
  • 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.
  • the number of child programs, arrival date / time, departure date / time, and relay address are entered and used as information on the passport.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIGS. 8 and 9 are schematic diagrams of the processing.
  • 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.
  • 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.
  • 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.
  • FIG. 5 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).
  • 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).
  • 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.
  • Fig. 14 shows the flow
  • Fig. 15 shows a schematic diagram of the process.
  • 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)
  • 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.
  • the data of the parent program is added to the data of the child program in the evening (14 1).
  • 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,
  • 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.
  • 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.
  • 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.
  • 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).
  • 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.
  • the agent program 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).
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the following processing is performed for the number of child programs.
  • 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.
  • the ID is copied, and the electronic cash is allocated (1303).
  • the home address is set to the same address as that of the parent program (1306).
  • 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).
  • 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.
  • 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 '.
  • 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.
  • 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • the following modified examples can be considered.
  • 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.
  • 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
  • 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.
  • 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.
  • 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.
  • a specific server may be provided in the network, and the agent program may visit the server and perform the processing described in FIG.
  • a server for processing maternity hospitals in human society can be set up in the network.
  • 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.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Finance (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multi Processors (AREA)

Abstract

Dans un système informatique dans lequel une pluralité d'ordinateurs sont connectés par un réseau composite à grande échelle, une table d'informations, dans laquelle sont inscrites des informations appelées 'passeport', contenant des rubriques bibliographiques telles que les destinations, les objectifs, les heures et dates de visites et les heures et date de départ etc., requises pour déplacer un programme d'un ordinateur à l'autre à des fins de traitements donnés, est incorporée dans le programme. La gestion du programme lui-même, tandis que celui-ci passe par un serveur, est déterminée au moyen de ces informations 'passeport'. Ce programme contient de l'argent électronique qui sert à régler les droits d'utilisation d'une ressource sur le serveur. En fonction du traitement, un programme enfant, qui est une copie du programme, est généré pour réduire le temps de traitement.
PCT/JP1996/000677 1996-03-15 1996-03-15 Procede de generation automatique de programme et procede de commande d'execution WO1997035262A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP1996/000677 WO1997035262A1 (fr) 1996-03-15 1996-03-15 Procede de generation automatique de programme et procede de commande d'execution

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP1996/000677 WO1997035262A1 (fr) 1996-03-15 1996-03-15 Procede de generation automatique de programme et procede de commande d'execution

Publications (1)

Publication Number Publication Date
WO1997035262A1 true WO1997035262A1 (fr) 1997-09-25

Family

ID=14153053

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP1996/000677 WO1997035262A1 (fr) 1996-03-15 1996-03-15 Procede de generation automatique de programme et procede de commande d'execution

Country Status (1)

Country Link
WO (1) WO1997035262A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000029847A (ja) * 1998-07-10 2000-01-28 Toshiba Corp エージェントシステム、情報処理方法及び情報処理用ソフトウェアを記録した記録媒体
JP2000029709A (ja) * 1998-06-03 2000-01-28 Internatl Business Mach Corp <Ibm> 分散コンピュ―タ環境内における発見のためのシステム、方法及びコンピュ―タ・プログラム製品
WO2000036508A1 (fr) * 1998-12-16 2000-06-22 Kent Ridge Digital Labs Procede pour detacher et rattacher des composants d'un processus de calcul
JP2001209621A (ja) * 1999-11-17 2001-08-03 Internatl Business Mach Corp <Ibm> 「モバイル・ソフトウェア・エージェント」を経由してモバイル・データ処理装置と通信するシステムおよび方法
US6988073B2 (en) 2001-05-10 2006-01-17 International Business Machines Corporation Method, system, and product for facilitating international travel with respect to immigration
US7426514B2 (en) 2001-07-26 2008-09-16 International Business Machines Corporation Method, system, and computer program product for facilitating international customs planning
US11004067B2 (en) 2019-03-01 2021-05-11 Advanced New Technologies Co., Ltd. Methods and devices for protecting sensitive data of transaction activity based on smart contract in blockchain

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0410113A (ja) * 1990-04-27 1992-01-14 Hitachi Ltd 複合システムにおける経費処理方式
JPH04263354A (ja) * 1991-02-18 1992-09-18 Toshiba Corp 分散処理計算機
JPH05282230A (ja) * 1991-08-29 1993-10-29 Hewlett Packard Co <Hp> コンピュータネットワーク及びコンピュータネットワーク管理方法
JPH07182174A (ja) * 1993-07-08 1995-07-21 General Magic Inc リモートプログラミングの実施方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0410113A (ja) * 1990-04-27 1992-01-14 Hitachi Ltd 複合システムにおける経費処理方式
JPH04263354A (ja) * 1991-02-18 1992-09-18 Toshiba Corp 分散処理計算機
JPH05282230A (ja) * 1991-08-29 1993-10-29 Hewlett Packard Co <Hp> コンピュータネットワーク及びコンピュータネットワーク管理方法
JPH07182174A (ja) * 1993-07-08 1995-07-21 General Magic Inc リモートプログラミングの実施方法

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000029709A (ja) * 1998-06-03 2000-01-28 Internatl Business Mach Corp <Ibm> 分散コンピュ―タ環境内における発見のためのシステム、方法及びコンピュ―タ・プログラム製品
JP2000029847A (ja) * 1998-07-10 2000-01-28 Toshiba Corp エージェントシステム、情報処理方法及び情報処理用ソフトウェアを記録した記録媒体
WO2000036508A1 (fr) * 1998-12-16 2000-06-22 Kent Ridge Digital Labs Procede pour detacher et rattacher des composants d'un processus de calcul
WO2000036507A1 (fr) * 1998-12-16 2000-06-22 Kent Ridge Digital Labs Procede d'adaptation des processus de migration aux machines hotes
WO2000036506A1 (fr) * 1998-12-16 2000-06-22 Kent Ridge Digital Labs Environnement de calcul oriente processus
US7003770B1 (en) 1998-12-16 2006-02-21 Kent Ridge Digital Labs Method of detaching and re-attaching components of a computing process
JP2001209621A (ja) * 1999-11-17 2001-08-03 Internatl Business Mach Corp <Ibm> 「モバイル・ソフトウェア・エージェント」を経由してモバイル・データ処理装置と通信するシステムおよび方法
US6988073B2 (en) 2001-05-10 2006-01-17 International Business Machines Corporation Method, system, and product for facilitating international travel with respect to immigration
US7426514B2 (en) 2001-07-26 2008-09-16 International Business Machines Corporation Method, system, and computer program product for facilitating international customs planning
US11004067B2 (en) 2019-03-01 2021-05-11 Advanced New Technologies Co., Ltd. Methods and devices for protecting sensitive data of transaction activity based on smart contract in blockchain

Similar Documents

Publication Publication Date Title
US20230129822A1 (en) Resource transfer system
JP7236991B2 (ja) ブロックチェーンにより実現される方法及びシステム
Johansen et al. Operating system support for mobile agents
CN111444020B (zh) 一种超融合计算系统架构及融合服务平台
Johansen et al. An introduction to the TACOMA distributed system. Version 1.0
JP2022166214A (ja) ブロックチェーンを介して資産関連活動を制御するシステム及び方法
US20060200444A1 (en) Enterprise computer system
JPH06295286A (ja) コミュニケーションシステムにおけるコンピュータ間で情報を処理するための方法
JPH10228402A (ja) 文書共有管理方法
AU2019203851A1 (en) Methods and devices for processing certificates in blockchain system
WO1997035262A1 (fr) Procede de generation automatique de programme et procede de commande d&#39;execution
CN113196327A (zh) 数据交易系统
US8712786B2 (en) Method and apparatus for controlling a multi-node process
CN116997895A (zh) 减少执行排序验证区块链模型中的事务中止
JP7478240B2 (ja) ブロックチェーンでスマートコントラクトを利用したエスクロー取引方法およびシステム
JP2007299328A (ja) 計算処理方法および計算処理システム
CN112037053B (zh) 一种用于区块链的通用交易解释器及其解释方法
JP7366981B2 (ja) 契約管理システムおよび契約管理方法
JP4288021B2 (ja) 独立したデバイスをシングル・トークン・インタフェースとして連係させる方法及びグラフィカル・ユーザ・インタフェースの方法
JP3913541B2 (ja) 電子データ供給方法、電子データ供給システム、電子データ発行装置、中継装置、プログラムならびにそれを記録したコンピュータ読み取り可能な記録媒体
Goscinski et al. Message passing and RPC-based interprocess communication mechanisms in the RHODOS microkernel
Hulaas et al. Enhancing Java grid computing security with resource control
JP2000029672A (ja) ソフトウェアの配布管理装置
Foley et al. Computational paradigms and protection
JP2023538497A (ja) 編集可能なブロックチェーン

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CN JP KR US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase