Symantec Corporation

Veritas Technologies LLC

Symantec Operating Corporation

Vmware, Inc.

Amol Shivram Katkar

Viraj Kamat

Udipta Das

Ankur P Panchbudhe

Jai P Gahlot

Pranav Peshwe

Shailesh Marathe

Praween Kumar

Anand A Kekre

Shirish Vijayvargiya

Sachin Shinde

Bhavin Thaker

Veeral P Shah

Vasantha Kumar Dhanasekar

Abhijit Toley

Grace Jing Chen

Prasad Limaye

Anand J Bhalerao

Shardul Divatia

Amit Gaurav

Vivek Parikh

Sumit Sharma

Neelakandan Panchaksharam

Venu Gopal Gadiraju

Om Prakash Agarwal

Subramanyam Venkata Gurajada

Sachin Pandurang Bochare

Jai Gahlot

Example methods are provided to build a smart file reputation cache at a cloud, and to provide the smart file reputation cache to an antivirus (AV) endpoint such as a virtualized computing instance in a virtualized computing environment. Training techniques can be used to build the smart file reputation cache at the cloud, based on information learned from existing AV endpoints and a management server. The smart file reputation can then be provided to newly installed AV endpoints for local access, instead of the AV endpoints sending file reputation requests to the cloud.

System and method to build a file reputation cache for an antivirus (AV) endpoint

Example methods are provided for adaptive file access authorization using process access patterns. In a learning mode, attributes and other information, which are associated with applications or with processes that are related to the applications and that attempt to access a file system, are collected and used to generate a policy. In a protected mode, file access requests are examined against the policy, and are granted access to the file system or are denied access to the file system based on the contents of the policy. The policy may be updated so as to adapt to changes in the access patterns and to changes in the application or processes.

Adaptive file access authorization using process access patterns

Various systems, methods, and processes to optimize partition arbitration are disclosed. In response to a cluster being partitioned into multiple network partitions, a determination is made, using a first node in a first network partition, whether the first node wins one or more coordination points. The determination of the first node is then transmitted to a second node in the first network partition. Further, another determination is made using the second node whether the second node wins one or more other coordination points other than the one or more coordination points won by the first node.

Partition arbitration optimization

Various systems, methods, and processes to optimize input/output (I/O) fencing operations in systems that implement coordination points are presented. A matrix is generated. The matrix includes information indicating the accessibility of one or more coordination points by a node. The method then transmits the matrix to one or more other nodes.

Input/output fencing optimization

Various methods, systems, and processes to prevent data corruption caused by a pre-existing split brain condition in a cluster are presented. In response to determining that a node is no longer part of a sub-cluster, another node in the sub-cluster is designated as a racer node. The racer node accesses a matrix, and the matrix includes information to determine whether a majority of coordination points in a cluster are accessible by nodes in the sub-cluster. Based on the accessing, a determination is made that the information indicates that the majority of coordination points are accessible by the nodes. The information is then broadcasted.

Preventing data corruption due to pre-existing split brain

Techniques for monitoring a server are disclosed. In one particular exemplary embodiment, the techniques may be realized as a system and method for monitoring a server. The method may comprise monitoring, using a monitoring module communicatively coupled to a network, data traffic at a server. The method may also comprise identifying a lack of data traffic during a predetermined period of time. The method may further comprise generating at least one notification based on the lack of data traffic. The method may also comprises transmitting the at least one notification to a server agent, wherein the server agent places at least one call to the server to verify status of the server.

Techniques for monitoring a server

Techniques for managing computing resources are disclosed. In one particular embodiment, the techniques may be realized as a method for managing computing resources including receiving a desired resource configuration, determining currently available resources, determining, via at least one computer processor, whether the currently available resources satisfy the desired resource configuration, and determining a resource implementation based on the determination of whether the currently available resources satisfy the desired resource configuration.

Techniques for managing computing resources

Information cluster systems and methods are presented. In one embodiment, a cluster method comprises: performing an engine process including issuing requests to bring a resource online, offline, and monitor the resources, wherein the engine process is performed by an engine; performing a resource interaction process including interacting with a resource and directing a resource to comply with the request from the engine process, wherein the resource interaction process is performed by a resource interaction agent; performing a predicate logic process including performing predicate logic operations to determine if a predicate logic condition associated with the resource is satisfied and forwarding an indication of the results of the predicate logic operations to the engine process, wherein the predicate logic process is performed by a predicate logic agent that is separate from the engine performing the engine process.

Cluster systems and methods

A computer-implemented method for managing sub-clusters within dependent clustered computing systems subsequent to partition events may include (1) identifying a first computing cluster and a second computing cluster, (2) determining that the first computing cluster depends on the second computing cluster, (3) detecting a partition event that partitions the first computing cluster into multiple sub-clusters, (4) determining, in response to detecting the partition event, whether the second computing cluster is partitioned into multiple sub-clusters, and (5) making, based at least in part on determining whether the second computing cluster is partitioned into multiple sub-clusters, a fencing decision for the multiple sub-clusters of the first computing cluster. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for managing sub-clusters within dependent clustered computing systems subsequent to partition events

A computer-implemented method for changing fencing modes in clusters may include (1) identifying a cluster of nodes configured with a fencing mode for resolving split-brain scenarios within the cluster, (2) identifying a request to reconfigure the cluster of nodes with a new fencing mode, (3) transmitting the request to each node in the cluster of nodes, (4) in response to the request, for each node in the cluster of nodes, testing the operability of the new fencing mode from the node, (5) receiving a message from the node indicating the success of the test; and, after receiving the message indicating the success of the test from every node within the cluster of nodes, and (6) reconfiguring each node within the cluster of nodes to use the new fencing mode. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for changing fencing modes in clusters

The failure of a specific link of a specific node of a cluster is detected, for example through the operating system of the specific node. A notification of the failure of the specific link is disseminated to the nodes of the cluster, such that the nodes receive the notification prior to learning of the link-down event from the expiration of corresponding heartbeats, and process the event in parallel. The notification of the link failure can be disseminated by broadcasting a message notifying the nodes of the failure of the specific link. The notification of the link failure can also be disseminated by transmitting the notification to a centralized computing device which is polled by the nodes of the cluster at a specific frequency for notifications of link failures.

Cluster wide consistent detection of interconnect failures

Various methods and systems for automatically ranking electronic communications such as emails based on both content and social factors are disclosed. One method assigns a rank to an electronic communication, where assigning the rank involves both assigning a content-based rank to the electronic communication and assigning a social rank to the electronic communication. The rank assigned to the electronic communication can include both the content-based and social rank. Alternatively, the rank can be derived from the content-based and social ranks (e.g., the rank can be an average of the content-based and social ranks).

Automated ranking of electronic communications

Embodiments of the present invention are directed to a method and system for draining or aborting IO requests of a failed system prior to restarting or recovering an application in virtual environments. The method includes detecting, within an electronic system, an application error condition of an application executing on a virtual machine and determining an application restart target. The method further includes sending an input/output (IO) request drain command to a virtual IO server operable to provide storage to the virtual machine and receiving a signal that the IO requests have been drained. The drain command is operable to drain IO requests issued from the application. The application can then be restarted or recovered.

Data corruption prevention during application restart and recovery

A computer-implemented method for managing sub-clusters within a multi-cluster computing system subsequent to a network-partition event may include: 1) identifying a plurality of computer clusters, 2) identifying a network-partition event that partitions each of the plurality of computer clusters into multiple sub-clusters, 3) identifying, within the multiple sub-clusters, a plurality of nodes that share a common attribute or property, and then 4) ensuring that only those nodes that share the common attribute survive subsequent to the network-partition event. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for managing sub-clusters within a multi-cluster computing system subsequent to a network-partition event

A method and apparatus for partitioning a computer cluster through coordination point devices that provide enhanced split brain arbitration during I/O fencing. In one embodiment, a method for using coordination point devices to support Input/Output fencing in a computer cluster comprises processing at least one arbitration request from at least one client computer upon an occurrence of a split brain within a computer cluster, wherein each arbitration request indicates at least one established connection between at least one coordination point device and each client computer of the at least one client computer and each client sub-cluster membership, wherein the at least one coordination point device form a coordination point cluster membership and selecting a client computer of the at least one client computer to continue to be a portion of the computer cluster based on the arbitration request.

Growing community of inventors

Pune, India

Amol Shivram Katkar