Symantec Operating Corporation

Sivaramakrishna Ramadugu Venkata

Navin Kabra

Anindya Banerjee

Radha Shelat

Dilip Madhusudan Ranade

Laxmikant Vithal Gunda

BijayaLaxmi Nanda

Kai Chiu Wong

Bijaya Laxmi Nanda

A plurality of data objects may be replicated across a plurality of computing nodes coupled to a network. The network may include a first node operable to initiate an update operation to update a plurality of replicas of a first object. If one or more of the replicas are not reachable then the update operation may update a subset (e.g., a quorum) but not all of the replicas. For each node on which one of the replicas was updated in the update operation, the node may add the object to a list of incoherent objects. The list of incoherent objects may subsequently be used to bring the lagging replicas in sync with the replicas that were updated. In another embodiment, a plurality of replicas of an object may be stored on a plurality of nodes, similarly as described above. A first node that stores a replica of the object may store a first timestamp associated with the replica on the first node. The timestamp may be used to ensure that the replica on the first node is coherent with respect to one or more other replicas by periodically communicating with the one or more other replicas when a threshold amount of time has passed without the replica on the first node receiving an update.

Coherency of replicas for a distributed file sharing system

A system including a plurality of nodes operable to exchange information using location-independent addresses. According to one embodiment of a method for obtaining information in a network of nodes, one or more nodes may each create an instance of a location-independent address A. The location-independent address A may represent an address for sending request messages (also referred to simply as requests) in order to obtain information or data from the one or more nodes with which the location-independent address A is associated (i.e., from the one or more nodes that create instances of the location-independent address A). According to one embodiment of a method for storing information in a network of nodes, one or more nodes may each create an instance of a location-independent address A, similarly as described above. However, instead of representing an address for sending requests to obtain information or data, in this case the location-independent address A may represent an address for sending requests to store information or data.

Global monitoring and statistics collection for a plurality of computing nodes

An efficient distributed transaction protocol for a distributed file sharing system is described. One embodiment of the protocol involves a transaction coordinator node sending three messages to participant nodes, where the participant nodes reply to only two of those messages. In one embodiment, the transaction coordinator node may return success to the client application after receiving replies to the second message from the participant nodes. The protocol may provide benefits associated with traditional three-phase commit (3PC) protocols while also decreasing response time latencies experienced by client applications and decreasing network traffic.

Efficient distributed transaction protocol for a distributed file sharing system

Growing community of inventors

Hyderabad Telangana, India

Sivaramakrishna Ramadugu Venkata