Arbitration of state changes

Details Arbitration of state changes Arbitration of state changes

2007-04-17

2007-04-17

Lin, Wen-Tai (Department: 2154)

Electrical computers and digital processing systems: multicomput

Computer conferencing

Cooperative computer processing

C709S213000, C710S120000, C710S242000

Reexamination Certificate

active

10316450

ABSTRACT:
When multiple nodes in a computer network perform work on a shared entity, such as a database record, an arbitration process is used to ensure changes made by more than one node to the same data is propagated to each of the nodes holding the shared entity and that the changes are applied in the same order on each of the nodes. An arbitration cycle for a particular entity is begun on a node (“instigator”) when the node broadcasts a proposal message for a change to the entity to the other nodes or when the node (“observer”) receives such a proposal message. Multiple nodes can be instigators during a single arbitration cycle. Each node that receives a proposal message sends a response message to the corresponding instigator. The arbitration cycle is closed to additional proposal messages after one instigator has received responses from all the nodes that share the entity. After each instigator node receives all the proposals in the arbitration cycle, it determines whether it is the winner of the arbitration cycle and broadcasts a closure message if it is. Each node determines an order in which to apply the changes proposed in the arbitration cycle when it knows it has received all the proposals in the arbitration cycle as determined by the sending or receiving of the closure message. Because each arbitration cycle is associated with a particular entity, multiple arbitration cycles associated with different items can be running concurrently in the network but multiple arbitration cycles for the same item must be executed serially. The arbitration process is executed even if there is only one proposal made in an arbitration cycle since the arbitration process enables the orderly propagation of changes across all the nodes that share the entity.

REFERENCES:
patent: 4914569 (1990-04-01), Levine et al.
patent: 5167022 (1992-11-01), Bahr et al.
patent: 5418967 (1995-05-01), Simcoe et al.
patent: 5649102 (1997-07-01), Yamauchi et al.
patent: 5787262 (1998-07-01), Shakib et al.
patent: 5794034 (1998-08-01), Harinarayan et al.
patent: 5822587 (1998-10-01), McDonald et al.
patent: 5832508 (1998-11-01), Sherman et al.
patent: 5835766 (1998-11-01), Iba et al.
patent: 5878410 (1999-03-01), Zbikowski et al.
patent: 5905998 (1999-05-01), Ebrahim et al.
patent: 6029177 (2000-02-01), Sadiq et al.
patent: 6233623 (2001-05-01), Jeffords et al.
patent: 6240479 (2001-05-01), Snyder et al.
patent: 6249830 (2001-06-01), Mayer et al.
patent: 6249846 (2001-06-01), Van Doren et al.
patent: 6324590 (2001-11-01), Jeffords et al.
patent: 6360250 (2002-03-01), Anupam et al.
patent: 6457021 (2002-09-01), Berkowitz et al.
patent: 6513084 (2003-01-01), Berkowitz et al.
patent: RE38457 (2004-03-01), Rothrock et al.
“TimesTen 3.7—In-Memory Database for 32-bit and 64-bit Operating Systems”, TimesTen Performance Software, http://www.timesten.com/products, 11 p., (Jun. 1999).
“TimesTen In-Memory Data Management—Technical White Paper”, Technical White Paper, TimesTen Peformance Software, http://www.timesten.com/products, 15 p., (2000).
Fleischmann, “Design and Implementation of a Distributed Shared Memory for the HP-UX Kernel,” Diploma Thesis, Universität Karlsruhe, 151 pp. (Oct. 1995).
Durand, “Palimpsest: Change-oriented Concurrency Control for the Support of Collaborative Applications,” Ph.D. Thesis, Boston University, 187 pp. (1999).

Affiliated with

Also associated with

Rating

Arbitration of state changes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Arbitration of state changes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arbitration of state changes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3773840