초록 ▼

A method for coordinating recursive requests and responses in the peer-to-peer processing of a distributed application across a synchronous request/response interface. The method utilizes, on each side of the interface, a decision table and a local LIFO stack of generated and received requests, resp

A method for coordinating recursive requests and responses in the peer-to-peer processing of a distributed application across a synchronous request/response interface. The method utilizes, on each side of the interface, a decision table and a local LIFO stack of generated and received requests, responses, and input from the application. The local stack is run in a push-pop manner and assists the local decision table in conducting the peer-to-peer processing until the LIFO stack becomes exhausted. A fault on either side of the interface results in undoing the processing by unwinding each stack back to a predetermined point. If one side operates as a persistent server, its application program environment is saved from one request to another by a dynamic save and simulated return to the application. Lastly, a request/demand is substituted for a demand/request by the server so as to change the server and requester roles of either side of the interface.

대표청구항 ▼

A method for managing peer-to-peer processing of a distributed application over a synchronous request/response (CALL/RETURN) interface, peer-to-peer processing connoting execution of at least one application or part thereof on at least a first and a second communicating processor (CP), said first an

A method for managing peer-to-peer processing of a distributed application over a synchronous request/response (CALL/RETURN) interface, peer-to-peer processing connoting execution of at least one application or part thereof on at least a first and a second communicating processor (CP), said first and second CP including counterpart first and second stacks of indicia of CP and interface activity, comprising the steps of: (a) generating and communicating either a request or a response from the first CP to the second CP over the synchronous interface, said generating and communicating step being responsive to either a request or response from the second CP, input received from the application, or indicia provided by the first stack or operated according to a LIFO discipline; (b) concurrently pushing or popping onto or from the first stack indicia of each generated or received request or response from or to the first CP; and (c) repeating steps (a)-(b) until the first stack becomes exhausted.