Patents by Inventor Manish Verma

Manish Verma has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20110137704
    Abstract: A method and system for calculating pipeline integrity business risk score for a pipeline network is provided. The method includes a step of first calculating a structural risk score, an operational risk score and a commercial risk score for each pipeline segment in a pipeline network. The method further includes calculating pipeline integrity business risk score for each pipeline segment. The structural risk score, operational risk score, commercial risk score and pipeline integrity business risk score for each pipeline segment is rolled-up to calculate the respective risk scores of a pipeline network. The rolled-up risk scores are calculated by computing weight factors for each pipeline segment, relative risk scores weight of each pipeline segment and relative risk scores contribution of each pipeline segment. The system of the invention comprises executable files, dynamic linked libraries and risk score computing modules configured to display the risk scores using a dashboard.
    Type: Application
    Filed: February 3, 2010
    Publication date: June 9, 2011
    Applicant: INFOSYS TECHNOLOGIES LIMITED
    Inventors: Dipayan MITRA, Sandeep Kumar DEWANGAN, Larry Joesph RUBENACKER, Manish VERMA, Prakash Dhake, Paras SACHDEVA
  • Patent number: 7627694
    Abstract: A high availability computing system includes a plurality of computer nodes (for example, a server system) connected by a first and a second network, wherein the computer nodes communicate with each other to detect server failure and transfer applications to other computer nodes on detecting server failure. The system incorporates methods of maintaining high availability in a server cluster having a plurality of nodes. A group communications service, a membership service and a system resource manager are instantiated on each node and the group communications service, the membership service and the system resource manager on each node communicate with other nodes to detect node failures and to transfer applications to other nodes on detecting node failure.
    Type: Grant
    Filed: March 16, 2001
    Date of Patent: December 1, 2009
    Assignee: Silicon Graphics, Inc.
    Inventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Sharad Srivastava, Raghu Mallena
  • Patent number: 7506032
    Abstract: In accordance with one embodiment of the present invention, there is provided a mechanism for implementing transfer of arbitrary length messages between one or more machines in a computing environment comprised of a plurality of machines. With this mechanism, it is possible to send and receive messages of arbitrary length across memory-based or other interconnects using a single operation. In one embodiment, the machines are interconnected by a memory-mapped link. The memory-mapped link includes processes for mapping an image of a buffer allocated in the storage of the receiving machine into the addressing space of the sending machine. The sending machine may transfer the message to the memory of the receiving machine using a single write operation to the memory mapped image in the sending machine's own address space.
    Type: Grant
    Filed: March 25, 2004
    Date of Patent: March 17, 2009
    Assignee: Sun Microsystems, Inc.
    Inventors: Prashant Ramarao, Sherman Pun, Manish Verma
  • Publication number: 20020198996
    Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.
    Type: Application
    Filed: November 29, 2001
    Publication date: December 26, 2002
    Inventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Raghu Mallena
  • Publication number: 20020049845
    Abstract: A high availability computing system includes a plurality of computer nodes (for example, a server system) connected by a first and a second network, wherein the computer nodes communicate with each other to detect server failure and transfer applications to other computer nodes on detecting server failure. The system incorporates methods of maintaining high availability in a server cluster having a plurality of nodes. A group communications service, a membership service and a system resource manager are instantiated on each node and the group communications service, the membership service and the system resource manager on each node communicate with other nodes to detect node failures and to transfer applications to other nodes on detecting node failure.
    Type: Application
    Filed: March 16, 2001
    Publication date: April 25, 2002
    Inventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Sharad Srivastava, Raghu Mallena