Patents by Inventor Subramanian Periyagaram

Subramanian Periyagaram 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: 20190018605
    Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.
    Type: Application
    Filed: September 17, 2018
    Publication date: January 17, 2019
    Applicant: NETAPP, INC.
    Inventors: Sandeep Yadav, Subramanian Periyagaram
  • Patent number: 9558203
    Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.
    Type: Grant
    Filed: July 1, 2015
    Date of Patent: January 31, 2017
    Assignee: EMC Corporation
    Inventors: Thomas L. Dings, Jacob M. Jacob, Subramanian Periyagaram, Pashupati Kumar, Robert W. Toop
  • Publication number: 20160026654
    Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.
    Type: Application
    Filed: July 1, 2015
    Publication date: January 28, 2016
    Inventors: Thomas L. Dings, Jacob M. Jacob, Subramanian Periyagaram, Pashupati Kumar, Robert W. Toop
  • Patent number: 9135122
    Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.
    Type: Grant
    Filed: March 25, 2011
    Date of Patent: September 15, 2015
    Assignee: EMC Corporation
    Inventors: Thomas L. Dings, Jacob M. Jacob, Subramanian Periyagaram, Pashupati Kumar, Robert W. Toop
  • Publication number: 20150205816
    Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.
    Type: Application
    Filed: November 24, 2014
    Publication date: July 23, 2015
    Inventors: Subramanian Periyagaram, Rahul Khona, Dnyaneshwar Pawar, Sandeep Yadav
  • Patent number: 9026512
    Abstract: Searching data is disclosed. A searchable index is used to determine which, if any, data objects comprising a set of backup data are responsive to a search query. For the search query, a search result is generated. The search result includes, in the event a first data object that is responsive to the search query comprises a version of one or more other data objects that are responsive to the search query, data indicating that the first data object comprises a version of said one or more other data objects.
    Type: Grant
    Filed: August 18, 2005
    Date of Patent: May 5, 2015
    Assignee: EMC Corporation
    Inventors: Akhil Kaushik, Subramanian Periyagaram, Jian Xing, Rangarajan Suryanarayanan
  • Publication number: 20150039818
    Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.
    Type: Application
    Filed: October 16, 2014
    Publication date: February 5, 2015
    Inventors: Sandeep Yadav, Subramanian Periyagaram
  • Patent number: 8892527
    Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.
    Type: Grant
    Filed: September 14, 2012
    Date of Patent: November 18, 2014
    Assignee: NetApp, Inc.
    Inventors: Sandeep Yadav, Subramanian Periyagaram
  • Publication number: 20140195496
    Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.
    Type: Application
    Filed: January 22, 2014
    Publication date: July 10, 2014
    Applicant: NetApp, Inc.
    Inventors: Sandeep Yadav, Subramanian Periyagaram
  • Patent number: 8671082
    Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.
    Type: Grant
    Filed: February 26, 2009
    Date of Patent: March 11, 2014
    Assignee: NetApp, Inc.
    Inventors: Sandeep Yadav, Subramanian Periyagaram
  • Patent number: 8539191
    Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.
    Type: Grant
    Filed: January 6, 2009
    Date of Patent: September 17, 2013
    Assignee: NetApp, Inc.
    Inventors: Dnyaneshwar Pawar, Rahul Khona, Subramanian Periyagaram, Sandeep Yadav
  • Publication number: 20120303587
    Abstract: Information management is disclosed. A file output from an application to an operating system is intercepted before the file output arrives at the operating system. The file output is directed towards protected data. The intercepted file output is analyzed to determine whether a predetermined type of version of the protected data has been created. In the event it is determined that the predetermined type of version of the protected data has been created at least in part because the analyzed intercepted file output includes a modification to the protected data, the protected data automatically backed up, including by storing at least a portion of the file output as a backup version of the protected data. In the event it is determined that the predetermined type of version of the protected data has not been created, the protected data is not backed up.
    Type: Application
    Filed: August 7, 2012
    Publication date: November 29, 2012
    Applicant: EMC CORPORATION
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramanian Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20110173159
    Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.
    Type: Application
    Filed: March 25, 2011
    Publication date: July 14, 2011
    Applicant: EMC CORPORATION
    Inventors: Thomas L. Dings, Jacob M. Jacob, Subramanian Periyagaram, Pashupati Kumar, Robert W. Toop
  • Patent number: 7937369
    Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.
    Type: Grant
    Filed: May 25, 2006
    Date of Patent: May 3, 2011
    Assignee: EMC Corporation
    Inventors: Thomas L. Dings, Jacob M. Jacob, Subramanian Periyagaram, Pashupati Kumar, Robert W. Toop
  • Publication number: 20100174879
    Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.
    Type: Application
    Filed: January 6, 2009
    Publication date: July 8, 2010
    Applicant: NetApp, Inc.
    Inventors: Dnyaneshwar Pawar, Rahul Khona, Subramanian Periyagaram, Sandeep Yadav
  • Publication number: 20100088296
    Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.
    Type: Application
    Filed: October 3, 2008
    Publication date: April 8, 2010
    Applicant: NetApp, Inc.
    Inventors: Subramanian Periyagaram, Rahul Khona, Dnyaneshwar Pawar, Sandeep Yadav
  • Publication number: 20070043705
    Abstract: Facilitating a search of backup data is disclosed. Data associated with at least a portion of the backup data is received. A searchable index of the backup data is generated based at least in part on the received data. The searchable index includes an index data indicating a location within the backup data of an object comprising the backup data.
    Type: Application
    Filed: August 18, 2005
    Publication date: February 22, 2007
    Inventors: Akhil Kaushik, Subramanian Periyagaram, Jian Xing, Rangarajan Suryanarayanan
  • Publication number: 20070043715
    Abstract: Searching data is disclosed. A searchable index is used to determine which, if any, data objects comprising a set of backup data are responsive to a search query. For the search query, a search result is generated. The search result includes, in the event a first data object that is responsive to the search query comprises a version of one or more other data objects that are responsive to the search query, data indicating that the first data object comprises a version of said one or more other data objects.
    Type: Application
    Filed: August 18, 2005
    Publication date: February 22, 2007
    Inventors: Akhil Kaushik, Subramanian Periyagaram, Jian Xing, Rangarajan Suryanarayanan