Patents by Inventor Nilesh Anant Salvi

Nilesh Anant Salvi 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).

  • Patent number: 10498809
    Abstract: Example implementations relate to clusters of nodes. In an example, a method includes computing a score for a first node in a distributed storage system comprising a plurality of nodes. The score is a function of at least one of: a location of the first node, a health status of the first node, and a resource utilization of the first node. A rank of the first node among the plurality of nodes is then determined based on the score and on a plurality of scores associated with the plurality of nodes. An instruction is sent to the first node to instantiate a manager process for managing the distributed storage system on the first node when the rank of the first node is at least equal to a predefined rank.
    Type: Grant
    Filed: January 29, 2018
    Date of Patent: December 3, 2019
    Assignee: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
    Inventors: Taranisen Mohanta, Abhijith Umesh, Lakshya Garg, Nilesh Anant Salvi
  • Publication number: 20190238634
    Abstract: Example implementations relate to clusters of nodes. In an example, a method includes computing a score for a first node in a distributed storage system comprising a plurality of nodes. The score is a function of at least one of: a location of the first node, a health status of the first node, and a resource utilization of the first node. A rank of the first node among the plurality of nodes is then determined based on the score and on a plurality of scores associated with the plurality of nodes. An instruction is sent to the first node to instantiate a manager process for managing the distributed storage system on the first node when the rank of the first node is at least equal to a predefined rank.
    Type: Application
    Filed: January 29, 2018
    Publication date: August 1, 2019
    Inventors: Taranisen Mohanta, Abhijith Umesh, Lakshya Garg, Nilesh Anant Salvi
  • Publication number: 20100299447
    Abstract: A method, system and computer program product for managing data replication for data groups stored in a first storage device. A polling interval, a maximum bandwidth and a bandwidth tolerance available for data replication is defined. A priority and a status for each data group is defined. The data replication is started in the polling interval, for the data group with highest priority in the pending status to a second storage device connected to the first storage. The rate of data transfer during a polling period is determined by dividing the total data transferred during the polling interval by time period of the polling interval; and bandwidth utilization is determined for data replication by comparing rate of data transfer with maximum bandwidth. If the bandwidth utilization is less than the maximum bandwidth available then another data group is selected for replication. If the data bandwidth utilization is more than the maximum bandwidth available then selected data groups replicating are paused.
    Type: Application
    Filed: July 11, 2009
    Publication date: November 25, 2010
    Inventors: Nilesh Anant Salvi, Alok Srivastava, Eranna Talur