Patents by Inventor Vinodh Venkatesan

Vinodh Venkatesan 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: 11061579
    Abstract: A method for data storage tape access optimization is provided. The method identifies a plurality of data segments stored on a data storage tape. Each segment having a location and a size on the data storage tape. The method determines a subset of data segments stored on the data storage tape selected for retrieval. The method determines an access order for the subset of data segments. The access order represents a minimized tape cycle time for retrieving the subset of data segments. The method retrieves the subset of data segments from the data storage tape based on the access order.
    Type: Grant
    Filed: September 11, 2019
    Date of Patent: July 13, 2021
    Assignee: International Business Machines Corporation
    Inventors: Slavisa Sarafijanovic, Mark Alfred Lantz, Vinodh Venkatesan, Paul Merrill Greco
  • Patent number: 11038984
    Abstract: The present invention is notably directed to a computer-implemented method of accessing data by an application. The method comprises detecting an application that is accessing an initial file stored in a storage system; fetching an application model of the detected application, the application model comprising an association between access patterns of the detected application when accessing first files with first metadata information of the said first files; identifying one or more second files stored in the storage system, the identified one or more second files having second metadata information that are similar to the first metadata information; and prefetching the identified one or more second files.
    Type: Grant
    Filed: August 26, 2019
    Date of Patent: June 15, 2021
    Assignee: International Business Machines Corporation
    Inventors: Giovanni Cherubini, Jens Jelitto, Vinodh Venkatesan
  • Publication number: 20210072900
    Abstract: A method for data storage tape access optimization is provided. The method identifies a plurality of data segments stored on a data storage tape. Each segment having a location and a size on the data storage tape. The method determines a subset of data segments stored on the data storage tape selected for retrieval. The method determines an access order for the subset of data segments. The access order represents a minimized tape cycle time for retrieving the subset of data segments. The method retrieves the subset of data segments from the data storage tape based on the access order.
    Type: Application
    Filed: September 11, 2019
    Publication date: March 11, 2021
    Inventors: Slavisa Sarafijanovic, Mark Alfred Lantz, Vinodh Venkatesan, Paul Merrill Greco
  • Patent number: 10671303
    Abstract: Predictively selecting subset of disks of a storage system to be spun-up, including providing metadata of data entities stored in the disks of the storage system, estimating the data entity access probabilities for a prediction time window based on the metadata, each data entity access probability being indicative for the probability of access to a certain data entity within the prediction time window, calculating disk access probabilities for a prediction time window based on the estimated probability of access of data entities, each disk access probability being indicative for the probability of access to a certain disk within the prediction time window, estimating the number of disks to be spun-up in a certain prediction time window, dynamically adapting the data entity threshold value and/or the disk access threshold value, selecting a subset of disks to be spun-up in the following prediction time window.
    Type: Grant
    Filed: September 13, 2017
    Date of Patent: June 2, 2020
    Assignee: International Business Machines Corporation
    Inventors: Giovanni Cherubini, Mark A. Lantz, Vinodh Venkatesan
  • Patent number: 10649860
    Abstract: A computer-implemented method for managing a tiered storage system having an archive tier and an active storage tier comprises determining a workload for moving data between the active tier and the archive tier; and determining an assignment of data to be stored across the active tier and the archive tier, based on the determined workload.
    Type: Grant
    Filed: September 7, 2017
    Date of Patent: May 12, 2020
    Assignee: International Business Machines Corporation
    Inventors: Slavisa Sarafijanovic, Yusik Kim, Vinodh Venkatesan, Ilias Iliadis, Robert B. Basham
  • Patent number: 10621102
    Abstract: A computer-implemented method is provided for managing digital datasets stored on a multi-tiered storage system that includes several tiers of storage, the datasets likely to be accessed by one or more applications interacting with the storage system. The method includes monitoring an access history of datasets accessed by the one or more applications; and while monitoring the access history: computing probabilities of access, by the one or more applications, of the datasets stored on the storage system according to metadata associated to given datasets as identified in the monitored access history; and based on the computed probabilities of access, selecting one or more of the datasets to be moved across the tiers. Related storage systems and computer program products are also provided.
    Type: Grant
    Filed: March 23, 2017
    Date of Patent: April 14, 2020
    Assignee: International Business Machines Corporation
    Inventors: Giovanni Cherubini, Yusik Kim, Mark A. Lantz, Vinodh Venkatesan
  • Patent number: 10592147
    Abstract: The invention is notably directed to computer-implemented methods and systems for managing datasets in a storage system. In such systems, it is assumed that a (typically small) subset of datasets are labeled with respect to their relevance, so as to be associated with respective relevance values. Essentially, the present methods determine, for each unlabeled dataset of the datasets, a respective probability distribution over a set of relevance values. From this probability distribution, a corresponding relevance value can be obtained. This probability distribution is computed based on distances (or similarities), in terms of metadata values, between said each unlabeled dataset and the labeled datasets. Based on their associated relevance values, datasets can then be efficiently managed in a storage system.
    Type: Grant
    Filed: July 26, 2017
    Date of Patent: March 17, 2020
    Assignee: International Business Machines Corporation
    Inventors: Giovanni Cherubini, Mark A. Lantz, Taras Lehinevych, Vinodh Venkatesan
  • Patent number: 10585614
    Abstract: An embodiment is directed to a method for determining an assignment of data to be stored on at least one storage tier i of a plurality of storage tiers of a tiered storage system. The method including, for the at least one storage tier i, steps of accessing storage device characteristics of the at least one storage tier i of the plurality; based on the accessed storage device characteristics, splitting the at least one storage tier i into Ni storage subtiers of the at least one storage tier i, the Ni storage subtiers having respective storage device characteristics; and based on characteristics of data to be stored on the tiered storage system and the respective storage device characteristics of the Ni storage subtiers, determining an assignment of data to be stored on each of the Ni storage subtiers. Embodiments are directed to related methods, systems and computer program products.
    Type: Grant
    Filed: October 19, 2016
    Date of Patent: March 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ilias Iliadis, Yusik Kim, Slavisa Sarafijanovic, Vinodh Venkatesan
  • Patent number: 10579281
    Abstract: A method for storing a data segment in a storage tier of a storage unit comprising at least two storage tiers includes receiving the data segment to be stored including metadata; receiving metadata of data segments stored in the storage unit; and determining the storage tier to store the received data segment to and a protection level dependent on the metadata received and dependent on the metadata of the received data segment.
    Type: Grant
    Filed: August 18, 2015
    Date of Patent: March 3, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Giovanni Cherubini, Ilias Iliadis, Jens Jelitto, Vinodh Venkatesan
  • Publication number: 20190392303
    Abstract: A computer-implemented method for managing datasets of a storage system is provided, wherein the datasets have respective sets of metadata, the method including: successively feeding first sets of metadata to a spiking neural network (SNN), the first sets of metadata fed corresponding to datasets of the storage system that are labeled with respect to classes they belong to, so as to be associated with class labels, for the SNN to learn representations of said classes in terms of connection weights that weight the metadata fed; successively feeding second sets of metadata to the SNN, the second sets of metadata corresponding to unlabeled datasets of the storage system, for the SNN to infer class labels for the unlabeled datasets, based on the second sets of metadata fed and the representations learned; and managing datasets in the storage system, based on class labels of the datasets, these including the inferred class labels.
    Type: Application
    Filed: June 22, 2018
    Publication date: December 26, 2019
    Inventors: Giovanni Cherubini, Timoleon Moraitis, Abu Sebastian, Vinodh Venkatesan
  • Publication number: 20190379762
    Abstract: The present invention is notably directed to a computer-implemented method of accessing data by an application. The method comprises detecting an application that is accessing an initial file stored in a storage system; fetching an application model of the detected application, the application model comprising an association between access patterns of the detected application when accessing first files with first metadata information of the said first files; identifying one or more second files stored in the storage system, the identified one or more second files having second metadata information that are similar to the first metadata information; and prefetching the identified one or more second files.
    Type: Application
    Filed: August 26, 2019
    Publication date: December 12, 2019
    Inventors: Giovanni Cherubini, Jens Jelitto, Vinodh Venkatesan
  • Patent number: 10397368
    Abstract: The present invention is notably directed to a computer-implemented method of accessing data by an application. The method comprises detecting an application that is accessing an initial file stored in a storage system; fetching an application model of the detected application, the application model comprising an association between access patterns of the detected application when accessing first files with first metadata information of the said first files; identifying one or more second files stored in the storage system, the identified one or more second files having second metadata information that are similar to the first metadata information; and prefetching the identified one or more second files.
    Type: Grant
    Filed: June 25, 2015
    Date of Patent: August 27, 2019
    Assignee: International Business Machines Corporation
    Inventors: Giovanni Cherubini, Jens Jelitto, Vinodh Venkatesan
  • Publication number: 20190243546
    Abstract: The invention is notably directed to computer-implemented methods and systems for managing datasets in a storage system. In such systems, it is assumed that a (typically small) subset of datasets are labeled with respect to their relevance, so as to be associated with respective relevance values. Essentially, the present methods determine, for each unlabeled dataset of the datasets, a respective probability distribution over a set of relevance values. From this probability distribution, a corresponding relevance value can be obtained. This probability distribution is computed based on distances (or similarities), in terms of metadata values, between said each unlabeled dataset and the labeled datasets. Based on their associated relevance values, datasets can then be efficiently managed in a storage system.
    Type: Application
    Filed: April 22, 2019
    Publication date: August 8, 2019
    Inventors: Giovanni Cherubini, Mark A. Lantz, Taras Lehinevych, Vinodh Venkatesan
  • Patent number: 10353608
    Abstract: A device and method for determining number of storage devices for each of plurality of storage tiers and assignment of data to be stored in the plurality of storage tiers. The device computes an optimized number of storage devices for each tier including a classifier, which receives units as input data to be stored in the system. Based on the characteristics of the storage devices, the device outputs a data-unit-to-storage tier assignment. An optimizer receives data-unit-to-storage tier assignment from the classifier and a cost budget for the system. Thereafter, an output for the number of storage devices for each storage tier is calculated. A method for determining number of storage devices for each of a plurality of storage tiers and assignment of data to be stored in the plurality of storage tiers are also provided.
    Type: Grant
    Filed: August 6, 2015
    Date of Patent: July 16, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ilias Iliadis, Jens Jelitto, Yusik Kim, Slavisa Sarafijanovic, Vinodh Venkatesan
  • Publication number: 20190079689
    Abstract: Predictively selecting a subset of disks of a storage system to be spun-up, including providing metadata of data entities stored in the disks of the storage system, estimating the data entity access probabilities for a prediction time window based on said metadata, each data entity access probability being indicative for the probability of access to a certain data entity within said prediction time window, calculating disk access probabilities for a prediction time window based on the estimated probability of access of data entities, each disk access probability being indicative for the probability of access to a certain disk within said prediction time window, estimating the number of disks to be spun-up in a certain prediction time window, dynamically adapting the data entity threshold value and/or the disk access threshold value, selecting a subset of disks to be spun-up in the following prediction time window.
    Type: Application
    Filed: September 13, 2017
    Publication date: March 14, 2019
    Inventors: Giovanni Cherubini, Mark A. Lantz, Vinodh Venkatesan
  • Publication number: 20190073275
    Abstract: A computer-implemented method for managing a tiered storage system having an archive tier and an active storage tier comprises determining a workload for moving data between the active tier and the archive tier; and determining an assignment of data to be stored across the active tier and the archive tier, based on the determined workload.
    Type: Application
    Filed: September 7, 2017
    Publication date: March 7, 2019
    Inventors: Slavisa Sarafijanovic, Yusik Kim, Vinodh Venkatesan, Ilias Iliadis, Robert B. Basham
  • Publication number: 20190034083
    Abstract: The invention is notably directed to computer-implemented methods and systems for managing datasets in a storage system. In such systems, it is assumed that a (typically small) subset of datasets are labeled with respect to their relevance, so as to be associated with respective relevance values. Essentially, the present methods determine, for each unlabeled dataset of the datasets, a respective probability distribution over a set of relevance values. From this probability distribution, a corresponding relevance value can be obtained. This probability distribution is computed based on distances (or similarities), in terms of metadata values, between said each unlabeled dataset and the labeled datasets. Based on their associated relevance values, datasets can then be efficiently managed in a storage system.
    Type: Application
    Filed: July 26, 2017
    Publication date: January 31, 2019
    Inventors: Giovanni Cherubini, Mark A. Lantz, Taras Lehinevych, Vinodh Venkatesan
  • Publication number: 20180314443
    Abstract: A storage system and a method for storing a data segment, a storage capacity manager and a method for managing a capacity of a storage unit, and a storage tier relocation manager and a method for relocating a data segment. The storage system includes at least two storage tiers, an access pattern evaluator, a classification unit, a selector, and logic. The storage capacitor manager includes a monitoring unit and capacity managing unit. The storage tier relocation manager includes a target storage tier, the data segment relocated to the target storage tier, and a protection measure.
    Type: Application
    Filed: June 20, 2018
    Publication date: November 1, 2018
    Inventors: Giovanni Cherubini, Ilias Iliadis, Jens Jelitto, Vinodh Venkatesan
  • Publication number: 20180276134
    Abstract: A computer-implemented method is provided for managing digital datasets stored on a multi-tiered storage system that includes several tiers of storage, the datasets likely to be accessed by one or more applications interacting with the storage system. The method includes monitoring an access history of datasets accessed by the one or more applications; and while monitoring the access history: computing probabilities of access, by the one or more applications, of the datasets stored on the storage system according to metadata associated to given datasets as identified in the monitored access history; and based on the computed probabilities of access, selecting one or more of the datasets to be moved across the tiers. Related storage systems and computer program products are also provided.
    Type: Application
    Filed: March 23, 2017
    Publication date: September 27, 2018
    Inventors: Giovanni Cherubini, Yusik Kim, Mark A. Lantz, Vinodh Venkatesan
  • Publication number: 20180107425
    Abstract: An embodiment is directed to a method for determining an assignment of data to be stored on at least one storage tier i of a plurality of storage tiers of a tiered storage system. The method including, for the at least one storage tier i, steps of accessing storage device characteristics of the at least one storage tier i of the plurality; based on the accessed storage device characteristics, splitting the at least one storage tier i into Ni storage subtiers of the at least one storage tier i, the Ni storage subtiers having respective storage device characteristics; and based on characteristics of data to be stored on the tiered storage system and the respective storage device characteristics of the Ni storage subtiers, determining an assignment of data to be stored on each of the Ni storage subtiers. Embodiments are directed to related methods, systems and computer program products.
    Type: Application
    Filed: October 19, 2016
    Publication date: April 19, 2018
    Inventors: Ilias Iliadis, Yusik Kim, Slavisa Sarafijanovic, Vinodh Venkatesan