Patents by Inventor Nilesh P. BHOSALE

Nilesh P. BHOSALE 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: 20190034119
    Abstract: A method for scheduling data services in a heterogeneous storage environment is disclosed. In one embodiment, such a method includes instrumenting, in a heterogeneous storage environment, each of a plurality of storage systems to generate events when operations are performed thereon. The events are detected and indexed in a single namespace. These events may then be analyzed to generate a statistical model of I/O activity occurring in the heterogeneous storage environment over a period of time. From the statistical model, the method determines periods of reduced I/O workload across the heterogeneous storage environment. The method then schedules data services to occur during these periods of reduced I/O workload. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: July 28, 2017
    Publication date: January 31, 2019
    Applicant: International Business Machines Corporation
    Inventors: Deepavali M. Bhagwat, Nilesh P. Bhosale, Joseph W. Dain, James Hewitt, Wayne A. Sawdon
  • Publication number: 20180373745
    Abstract: In one embodiment, a method includes receiving, at a centralized index operating in a cloud environment via a messaging bus, first events spawned by a first processor managing an object store accessible via the cloud environment. The method also includes receiving, at the centralized index, second events spawned by a second processor managing an archival store accessible via the cloud environment. Also, the method includes normalizing metadata in the first and second events. Moreover, the method includes indexing and storing the metadata in the centralized index. The object store and the archival store operate in different object subsystems of the cloud environment. Other systems, methods, and computer program products are described for managing import, export, and copy of data within a public tiered object storage environment in accordance with more embodiments.
    Type: Application
    Filed: June 26, 2017
    Publication date: December 27, 2018
    Inventors: Deepavali M. Bhagwat, Nilesh P. Bhosale, Joseph W. Dain, James Hewitt, Wayne A. Sawdon
  • Patent number: 9992298
    Abstract: A method for pre-fetching objects from an object store and storing them in an object cache is disclosed. In one embodiment, such a method includes monitoring access to objects in an object store. The objects have metadata tags, such as user-defined or pre-defined metadata tags, associated therewith. The method further maintains a database for metadata tags associated with the objects, and keeps track of a number of object accesses per metadata tag. In the event a threshold number of object accesses for a particular metadata tag is reached, the method promotes objects having the metadata tag and/or a related metadata tag to an object cache. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: August 14, 2014
    Date of Patent: June 5, 2018
    Assignee: International Business Machines Corporation
    Inventors: Duane M. Baldwin, Nilesh P. Bhosale, John T. Olson, Sandeep R. Patil
  • Patent number: 9268497
    Abstract: Exemplary embodiments for increased in-line deduplication efficiency in a computing environment are provided. Embodiments include incrementing the size of data samples from fixed size data chunks for each nth iteration for reaching a full size of an object requested for in-line deduplication, calculating in nth iterations hash values on data samples from fixed size data chunks extracted from the object, and matching in a nth hash index table the calculated nth iteration hash values for the data samples from the fixed size data chunks with a corresponding hash value of existing objects in storage, wherein the nth hash index table is built for each nth iteration of the data samples belonging to the fixed data chunks.
    Type: Grant
    Filed: February 26, 2014
    Date of Patent: February 23, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Duane M. Baldwin, Nilesh P. Bhosale, John T. Olson, Sandeep R. Patil
  • Publication number: 20160048551
    Abstract: A method for pre-fetching objects from an object store and storing them in an object cache is disclosed. In one embodiment, such a method includes monitoring access to objects in an object store. The objects have metadata tags, such as user-defined or pre-defined metadata tags, associated therewith. The method further maintains a database for metadata tags associated with the objects, and keeps track of a number of object accesses per metadata tag. In the event a threshold number of object accesses for a particular metadata tag is reached, the method promotes objects having the metadata tag and/or a related metadata tag to an object cache. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: August 14, 2014
    Publication date: February 18, 2016
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Duane M. Baldwin, Nilesh P. Bhosale, John T. Olson, Sandeep R. Patil
  • Publication number: 20140181465
    Abstract: Exemplary embodiments for increased in-line deduplication efficiency in a computing environment are provided. Embodiments include incrementing the size of data samples from fixed size data chunks for each nth iteration for reaching a full size of an object requested for in-line deduplication, calculating in nth iterations hash values on data samples from fixed size data chunks extracted from the object, and matching in a nth hash index table the calculated nth iteration hash values for the data samples from the fixed size data chunks with a corresponding hash value of existing objects in storage, wherein the nth hash index table is built for each nth iteration of the data samples belonging to the fixed data chunks.
    Type: Application
    Filed: February 26, 2014
    Publication date: June 26, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Duane M. BALDWIN, Nilesh P. BHOSALE, John T. OLSON, Sandeep R. PATIL
  • Publication number: 20130268496
    Abstract: Exemplary method, system, and computer program product embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only hash values are calculated in nth iterations for accumulative data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the accumulative data chunks are matched in a nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object. Additional system and computer program product embodiments are disclosed and provide related advantages.
    Type: Application
    Filed: April 5, 2012
    Publication date: October 10, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Duane Mark BALDWIN, Nilesh P. BHOSALE, John Thomas OLSON, Sandeep Ramesh PATIL
  • Publication number: 20130268497
    Abstract: Exemplary embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only, hash values are calculated in nth iterations on data samples from fixed size data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the data samples from the fixed size data chunks are matched in an nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object.
    Type: Application
    Filed: April 5, 2012
    Publication date: October 10, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Duane Mark BALDWIN, Nilesh P. BHOSALE, John Thomas OLSON, Sandeep Ramesh PATIL