Patents by Inventor Subramaniam Periyagaram

Subramaniam 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).

  • Patent number: 8812450
    Abstract: Techniques to clone a writeable data object in non-persistent memory are disclosed. The writeable data object is stored in a storage structure in non-persistent memory that corresponds to a portion of a persistent storage. The techniques enable cloning of the writeable data object without having to wait until the writeable data object is saved to the persistent storage and without needing to quiesce incoming operations (e.g., reads and writes) to the writeable data object.
    Type: Grant
    Filed: February 28, 2013
    Date of Patent: August 19, 2014
    Assignee: NetApp, Inc.
    Inventors: Ram Kesavan, Sriram Venketaraman, Mohit Gupta, Subramaniam Periyagaram
  • Publication number: 20140201168
    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
    Type: Application
    Filed: November 22, 2013
    Publication date: July 17, 2014
    Applicant: NetApp, Inc.
    Inventors: Subramaniam Periyagaram, Sandeep Yadav, Blake Lewis, Rickard E. Faith, Ashish Prakash, Ram Kesavan, Ananthan Subramanian
  • Patent number: 8745338
    Abstract: Overwriting part of compressed data without decompressing on-disk compressed data is implemented by receiving a write request for a block of data in a compression group from a client, wherein the compression group comprises a group of data blocks that is compressed, wherein the block of data is uncompressed. The storage server partially overwrites the compression group, wherein the compression group remains compressed while the partial overwriting is performed. The storage server determines whether the partially overwritten compression group including the uncompressed block of data should be compressed. The storage server defers compression of the partially overwritten compression group if the partially overwritten compression group should not be compressed. The storage server compresses the partially overwritten compression group if the partially overwritten compression group should be compressed.
    Type: Grant
    Filed: May 2, 2011
    Date of Patent: June 3, 2014
    Assignee: NetApp, Inc.
    Inventors: Sandeep Yadav, Rickard E. Faith, Subramaniam Periyagaram, Blake Lewis, Ashish Prakash
  • Patent number: 8676862
    Abstract: A method for information management comprises monitoring output from an application to an operating system, wherein the output is monitored substantially continuously; determining if a policy applies to data associated with the output; and executing the policy if the policy applies.
    Type: Grant
    Filed: March 18, 2005
    Date of Patent: March 18, 2014
    Assignee: EMC Corporation
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Patent number: 8600949
    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
    Type: Grant
    Filed: June 21, 2011
    Date of Patent: December 3, 2013
    Assignee: NetApp, Inc.
    Inventors: Subramaniam Periyagaram, Sandeep Yadav, Blake Lewis, Rickard E. Faith, Ashish Prakash, Ram Kesavan, Ananthan Subramanian
  • Patent number: 8539008
    Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.
    Type: Grant
    Filed: April 29, 2011
    Date of Patent: September 17, 2013
    Assignee: NetApp, Inc.
    Inventors: Rickard E. Faith, Subramaniam Periyagaram, Sandeep Yadav, Ashish Prakash, Blake Lewis, Jeff Kimmel, Steve Daniel
  • Publication number: 20120330903
    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
    Type: Application
    Filed: June 21, 2011
    Publication date: December 27, 2012
    Inventors: Subramaniam Periyagaram, Sandeep Yadav, Blake Lewis, Rickard E. Faith, Ashish Prakash, Ram Kesavan, Ananthan Subramanian
  • Publication number: 20120278382
    Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.
    Type: Application
    Filed: April 29, 2011
    Publication date: November 1, 2012
    Inventors: Rickard E. Faith, Subramaniam Periyagaram, Sandeep Yadav, Ashish Prakash, Blake Lewis, Jeff Kimmel, Steve Daniel
  • Patent number: 8260753
    Abstract: In one embodiment, a method for information management comprises monitoring output from an application, wherein the output is monitored substantially continuously; determining if the output is associated with a predetermined type of version; and saving data associated with the output if the output is associated with the predetermined type of version.
    Type: Grant
    Filed: March 18, 2005
    Date of Patent: September 4, 2012
    Assignee: EMC Corporation
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20080177805
    Abstract: A method for information management comprises monitoring output from an application to an operating system, wherein the output is monitored substantially continuously; determining if a policy applies to data associated with the output; and executing the policy if the policy applies.
    Type: Application
    Filed: March 18, 2005
    Publication date: July 24, 2008
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20080162719
    Abstract: A method for information management comprises intercepting an output from an application; distributing packets according to a routing scheme, wherein the packets are associated with the output, and wherein distributing the packets may occur when the application is associated with a first operating system, and may also occur when the application is associated with a second operating system; and storing the packets.
    Type: Application
    Filed: March 18, 2005
    Publication date: July 3, 2008
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20080162595
    Abstract: Information is managed by monitoring an output from an application. A change is intercepted. The change is associated with a file, if file versioning has been selected. The change is to a block, if block versioning has been selected. The change is saved.
    Type: Application
    Filed: March 18, 2005
    Publication date: July 3, 2008
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20080162685
    Abstract: A method for information management comprises applying a software architecture for a first hardware configuration; applying the software architecture for a second hardware configuration; wherein the software architecture includes: monitoring an output from an application; distributing packets; and storing the packets.
    Type: Application
    Filed: March 18, 2005
    Publication date: July 3, 2008
    Inventors: Ajay Pratap Singh Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani
  • Publication number: 20060149793
    Abstract: In one embodiment, a method for information management comprises monitoring output from an application, wherein the output is monitored substantially continuously; determining if the output is associated with a predetermined type of version; and saving data associated with the output if the output is associated with the predetermined type of version.
    Type: Application
    Filed: March 18, 2005
    Publication date: July 6, 2006
    Inventors: Ajay Kushwah, Akhil Kaushik, Jian Xing, Mayank Joshi, Pashupati Kumar, Subramaniam Periyagaram, Rangarajan Suryanarayanan, Yogita Bijani