Moving write lock for replicated objects

• US 5,664,176 A
• Filed: 01/31/1995
• Issued: 09/02/1997
• Est. Priority Date: 10/16/1992
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Madduri, Hari Haranath
• Primary Examiner(s): Loomis, John C.
• Application Number:
  US08/381,623
• Time in Patent Office: 945 Days
• Field of Search: 395/200.03, 395/453, 395/468, 395/485, 395/490, 395/600
• US Class Current: 1/1
• CPC Class Codes: G06F 3/1423 controlling a plurality of local displays, e.g. CRT and flat panel display
• CPC Class Codes: G06F 3/1454 involving copying of the display data of a local workstation or window to a remote workstation or window so that an actual copy of the data is displayed simultaneously on two or more displays, e.g. teledisplay
• CPC Class Codes: H04L 12/1813 for computer conferences, e.g. chat rooms instant messaging H04L51/04; protocols for multimedia communication H04L65/1101; arrangements for multi-party communication H04L65/403; telephonic conference arrangements H04M3/56; television conference systems H04N7/15

Abstract

Efficient update and presentation of a plurality of replicated data objects is accomplished with a write lock which moves among the replicas of a data object. After any necessary preparation for updating a data object, a shadow replica requests a write lock from the replica which currently holds the write lock or from the replica designated as the master replica. The write lock is moved to requesting shadow replica which performs an update to itself. The update is then reflected at the local system display to provide visual feedback to the user. The update is propagated to the other replicas which present the change at their associated displays. In the preferred embodiment, the write lock is retained at the replica which last requested the write lock as it is the most likely to receive the next update. While the invention finds particular application in a distributed data processing environment, it can also be used in a single processor having multiple replicas in separate memory partitions.

Claims

1. A computer storage device for storing a set of instructions for executing a method in a computer system, the method for updating a plurality of replicas of a common data object each in a separate memory partition of the computer system, the method when executed comprising the steps of:

requesting a write lock from a first replica which currently holds the write lock;

moving the write lock to a second replica;

performing an update to the second replica;

propagating the update to the plurality of replicas; and

,

refreshing a display of the system to reflect the update in at least one of the replicas.

2. The method as recited in claim 1 which further comprises the step of retaining the write lock at the second replica.

3. The method as recited in claim 1 in which the computer storage device can be coupled to a network in which a plurality of replicas are executable at a plurality of data processing systems coupled to the network and the first replica is in a memory partition in a first data processing system and the second replica is in a memory partition in a second data processing system.

4. The method as recited in claim 1 which further comprises:

requesting the write lock from a master replica;

determining whether the master replica holds the write lock;

requesting the write lock from a shadow replica which is holding the write lock; and

,

returning the write lock to the master replica.

5. The method as recited in claim 1 which further comprises the step of querying a master replica as to which of the plurality of replicas currently holds the write lock.

6. The method as recited in claim 5 which further contains the step of keeping track of the locations of the plurality of the replicas and which of the replicas is a current holder of the write lock.

7. A computer apparatus comprising:

a storage device for storing a program means for updating a plurality of replicas of a common data object distributed in a plurality of memory partitions, the program means comprising;

means for requesting a write lock from a first replica which currently holds the write lock;

means for moving the write lock to a second replica;

means for performing an update to the second replica;

means for propagating the update to the plurality of replicas; and

,

means for refreshing a display of the system to reflect the update in at least one of the replicas.

8. The apparatus as recited in claim 7 in which the program means further comprises means for retaining the write lock at the second replica.

9. The apparatus as recited in claim 7 in which the program means further comprises:

means for requesting the write lock from a master replica;

means for determining whether the master replica holds the write lock;

means for requesting the write lock from a shadow replica which is holding the write lock; and

,

means for returning the write lock to the master replica.

10. The apparatus as recited in claim 7 in which the program means further comprises means for querying a master replica as to which of the plurality of replicas currently holds the write lock.

11. The apparatus as recited in claim 7 which the program means further comprises means for keeping track of the locations of the plurality of the replicas and which of the replicas is a current holder of the write lock.