Method and apparatus for asynchronous processing of dynamic replication messages

• US 4,620,276 A
• Filed: 06/02/1983
• Issued: 10/28/1986
• Est. Priority Date: 06/02/1983
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Harvey, Roger W. R., Harding, Robert C. Jr., Nauckhoff, Sven H. H., Daniell, Thomas P.
• Primary Examiner(s): NOT, DEFINED
• Application Number:
  US06/500,582
• Time in Patent Office: 1,244 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/300
• US Class Current: 709/201
• CPC Class Codes: H04L 69/00 Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass networks security protocols H04L9/40; wireless communication networks H04W

Abstract

Messages at nodes of a distributed data system are processed asynchronously. Each data atom shared by a pair of nodes is characterized by dipole halves maintained at each node including an access control characteristic, a quality control characteristic, and a pair of rank values. A rank value is a value which monotonically increases (with respect to time) with each significant event. A message from a paired node requesting a change to a dipole half at this node includes the set of rank values at the paired node for the shared data atom. This node compares the rank values which it maintains with those received from the paired node and, based upon the result, selectively rejects or processes the request.

Claims

1. A method for operating a computing apparatus as this node in a multiprocessing system having at least one paired node, this node including means for receiving request messages with respect to the paired node, comprising the steps executed at this node of:

generating a first rank value;

receiving from said paired node a second rank value;

associating said first and second rank values with a data atom replicated at said this node and said paired node;

receiving a request message from said paired node, the request message including a third rank value, a fourth rank value, and a request;

the first and third rank values being indicative of a significant event time at this node and the second and fourth rank values being indicative of a significant event time at paired node; and

comparing said first and second rank values with said third and fourth rank values, respectively, and selectively processing said request based upon their correspondence.

3. The method of claim 1, further comprising the step of generating said first rank value as a value which changes in a predetermined manner at least with each significant event at this node with respect to said data atom.

4. The method of claim 3, wherein said generating step generates said first rank value as a monotonically increasing value with each significant event at this node with respect to any data atom replicated at this node and some other node including said paired node, an increasing value being a value representing later time.

5. The method of claim 3, further comprising the steps of:

associating with said data atom an access control characteristic, the access control characteristic specifying the view of this node of the accessibility of data with respect to said paired node; and

changing said first rank value in said predetermined manner with each significant event, a significant event including a change to said access control characteristic from a less restrictive to a more restrictive value.

6. The method of claim 5 wherein said access control characteristic is selected from the set including exclusive, unique clean, shared clean, prior, and not accessible;

and wherein said significant event includes a change in the access control characteristic in the direction from not accessible to prior to shared clean to unique clean to exclusive.

7. The method of claim 3, further comprising the steps of:

associating with said data atom a quality control characteristic, the quality control characteristic specifying the relative quality difference between a data atom available at or through said paired node and the data held at this node or available through another node related to this node, and which node of this node and paired node is responsible for being able to obtain a clean copy of the data atom on behalf of the other; and

changing said first rank value in said predetermined manner with each significant event, a significant event including a change to said quality control characteristic from a less restrictive to a more restrictive value.

8. The method of claim 7, wherein said quality control characteristic is selected from the set including better, responsible, joint, not responsible, worse, and receiving;

and wherein said significant event includes a change in the quality control characteristic in the direction from better to responsible to joint to not responsible to receiving, or from worse to receiving.

9. The method of claim 1, wherein said request message is a request from paired node for this node to change its view of the quality or accessibility of said data atom at said paired node.

10. The method of claim 1, wherein said first rank value represents the rank value generated at this node at the last significant event occurring at this node with respect to said data atom and said paired node, wherein said second rank value is the ranking value received at this node from paired node in a message prior to said request message and representing the rank value generated at paired node at the last significant event having then occurred at paired node with respect to said data atom and this node, wherein said third rank value is a copy maintained at paired node of the latest first rank value received at paired node at the time said request message was generated, and wherein said fourth rank value is a copy of the latest rank value generated at paired node at the last significant event having occurred at paired node with respect to said data atom and this node at the time of generating of said request message.

11. The method of claim 10, comprising the further step of comparing said second and fourth rank values, and responsive to said fourth rank value representing a rank value generated earlier in time than said second rank value, and thus indicating that said request message has been received out of order, rejecting said request message.

12. The method of claim 10, comprising the further step of comparing said first and second rank values and said second and fourth rank values, and responsive to said second and fourth rank values being equal and said first rank value representing a rank value generated later in time than said fourth rank value, and thus indicating that paired node has not received the most recent significant message from this node, rejecting said request message.

13. The method of claim 10, comprising the further step of comparing said first and second rank values and said second and fourth rank values, and responsive to said second rank value being equal to or generated prior to said fourth rank value, and to said first rank value being equal to said third rank value, and thus indicating that significant messages have been processed in order in both this node and paired node, processing said request message.

14. The method of claim 13, wherein said processing step includes the step of setting said second rank value equal to said fourth rank value.

15. The method of claim 10, comprising the further step of comparing said first and second rank values and said second and fourth rank values, and responsive to said fourth rank value representing a rank value generated latter in time than said second rank value and to said third rank value representing a rank value generated earlier in time than said first rank value, and thus indicating that this node and paired node have sent significant messages which have passed or that one or more messages have been lost, selectively rejecting or processing said request message in accordance with a predetermined criteria.

16. The method of claim 15, wherein said predetermined criteria is a ships criteria specifying at this node which of this node or paired node processes a request message received at this node from paired node when significant messages have passed.

2. A method for operating a computing apparatus as this node in a multiprocessing system having at least one paired node, comprising the steps executed at this node of:

maintaining at this node a first rank set for a given data atom for the node pair of this node and paired node;

receiving from paired node a request message, the request message including a second rank set maintained at the paired node for the given data atom;

pairwise comparing said first and second rank sets to determine the correspondence between said rank sets; and

based upon said correspondence, selectively processing said request message.

17. In a method for operating a computing apparatus having a plurality of nodes including this node and paired node, with each node having means for storing at least one data atom and means responsive to a request for accessing a specified data atom, and communication means interconnecting selected nodes, the computing apparatus being operated in response to a request for accessing a specified data atom and controlling the modification of copies of data atoms at a plurality of nodes;

wherein the computing apparatus is operated according to the steps of (1) generating a data request specifying a required currency status having an access control value of exclusive (E), unique clean (U), shared clean (S), prior (P) or not accessible (N) and having a quality control of better (B), responsible (R), joint (J), not responsible (N), worse (W), or receiving (X) for a specific data atom at the node of the request;

(2) determining if the node of the request views any other node as having for said specific data atom a currency status which is in conflict with said required access control or quality control;

(3) resolving currency conflicts; and

thereafter (4) granting the request for accessing the specified data atom;

characterized in that an improved method for detecting and resolving synchronization incidents resulting from the use of asynchronous communications between said nodes comprises the steps of;

operating each node to increment and store, with respect to a given data atom shared with a paired node, as this node rank TNRANK a time indicative rank value with each change at said each node in currency control for the specified data atom in the direction from N to P to S to U to E and with each change in quality control for the specified data atom in the direction from R to J to N to X or from W to X;

with each request message from paired node to this node, for the specified data atom, transmitting the current TNRANK at paired node as QPNRANK and a PNRANK currently held at paired node for this node as QTNRANK for the specified data atom; and

responsive to a request message received at this node from paired node, comparing the TNRANK and QTNRANK rank values and the PNRANK and QPNRANK rank values; and

responsive to that comparison selectively rejecting the request message, or processing the request message including storing the QPNRANK value as the paired node rank PNRANK for the specified data atom at this node.