Patents by Inventor Venkateswarlu Tella
Venkateswarlu Tella 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: 11960448Abstract: Techniques are provided for implementing a unified object format. The unified object format is used to format data in a performance tier (e.g., infrequently accessed data, snapshot data, etc.) into objects that are stored into an object store for low cost, scalable, long term storage compared to storage of the performance tier. With the unified object format, compression of the data may be retained when the data is stored as the objects into the object store. Additional compression may also be provided for the data in the objects. The unified object format includes slot header metadata used to track the location of the data within the object notwithstanding the data being compressed and/or stored at non-fixed boundaries. The slot header metadata may be cached at the performance tier for improved read performance and may be repaired by a repair subsystem (a slot header repair subsystem).Type: GrantFiled: April 28, 2022Date of Patent: April 16, 2024Assignee: NetApp, Inc.Inventors: Palak Sharma, Dibyasri Nandi, Sindhushree K N, Cheryl Marie Thompson, Qinghua Zheng, Venkateswarlu Tella, Debanjan Paul, Dinakaran Narayanan
-
Patent number: 11861169Abstract: Techniques are provided for a layout format for compressed data. A first set of data blocks are grouped into a first group based upon a first frequency of access to the first set of data blocks. A second set of data blocks are grouped into a second group based upon a second frequency of access to the second set of data blocks. The first set of data blocks are compressed into a first compression group using a first compression algorithm. The second set of data blocks are compressed into a second compression group using a second compression algorithm.Type: GrantFiled: September 22, 2020Date of Patent: January 2, 2024Assignee: NetApp, Inc.Inventors: Girish Hebbale Venkatasubbaiah, Rahul Thapliyal, Dnyaneshwar Nagorao Pawar, Kartik Rathnakar, Venkateswarlu Tella, Ananthan Subramanian
-
Patent number: 11740820Abstract: Methods and systems for a storage environment are provided. One method includes identifying, by a processor, a plurality of block numbers of a fragmented address space for re-allocation, each block number associated with data stored by a file system in a storage device of a storage system; determining, by the processor, compressed data associated with a block number from among the plurality of block numbers; verifying, by the processor, that an indirect block of a hierarchical structure maintained by the file system references the block number associated with the compressed data; and copying, by the processor, the compressed data to a new block, without decompressing the data.Type: GrantFiled: May 11, 2022Date of Patent: August 29, 2023Assignee: NETAPP, INC.Inventors: Mathankumar Devarajan, Girish Hebbale Venkatasubbaiah, Venkateswarlu Tella, Dnyaneshwar Nagorao Pawar, Harsh Tiwari
-
Publication number: 20230135151Abstract: Techniques are provided for implementing a unified object format. The unified object format is used to format data in a performance tier (e.g., infrequently accessed data, snapshot data, etc.) into objects that are stored into an object store for low cost, scalable, long term storage compared to storage of the performance tier. With the unified object format, compression of the data may be retained when the data is stored as the objects into the object store. Additional compression may also be provided for the data in the objects. The unified object format includes slot header metadata used to track the location of the data within the object notwithstanding the data being compressed and/or stored at non-fixed boundaries. The slot header metadata may be cached at the performance tier for improved read performance and may be repaired by a repair subsystem (a slot header repair subsystem).Type: ApplicationFiled: April 28, 2022Publication date: May 4, 2023Inventors: Palak Sharma, Dibyasri Nandi, K N Sindhushree, Cheryl Marie Thompson, Qinghua Zheng, Venkateswarlu Tella, Debanjan Paul, Dinakaran Narayanan
-
Publication number: 20230133433Abstract: Techniques are provided for implementing a unified object format. The unified object format is used to format data in a performance tier (e.g., infrequently accessed data, snapshot data, etc.) into objects that are stored into an object store for low cost, scalable, long term storage compared to storage of the performance tier. With the unified object format, compression of the data may be retained when the data is stored as the objects into the object store. Additional compression may also be provided for the data in the objects. The unified object format includes slot header metadata used to track the location of the data within the object notwithstanding the data being compressed and/or stored at non-fixed boundaries. The slot header metadata may be cached at the performance tier for improved read performance and may be repaired by a repair subsystem (a slot header repair subsystem).Type: ApplicationFiled: April 28, 2022Publication date: May 4, 2023Inventors: Palak Sharma, Dibyasri Nandi, Sindhushree K N, Cheryl Marie Thompson, Qinghua Zheng, Venkateswarlu Tella, Debanjan Paul, Dinakaran Narayanan
-
Publication number: 20230135954Abstract: Techniques are provided for implementing a unified object format. The unified object format is used to format data in a performance tier (e.g., infrequently accessed data, snapshot data, etc.) into objects that are stored into an object store for low cost, scalable, long term storage compared to storage of the performance tier. With the unified object format, compression of the data may be retained when the data is stored as the objects into the object store. Additional compression may also be provided for the data in the objects. The unified object format includes slot header metadata used to track the location of the data within the object notwithstanding the data being compressed and/or stored at non-fixed boundaries. The slot header metadata may be cached at the performance tier for improved read performance and may be repaired by a repair subsystem (a slot header repair subsystem).Type: ApplicationFiled: April 28, 2022Publication date: May 4, 2023Inventors: Palak Sharma, Dibyasri Nandi, Sindhushree K N, Cheryl Marie Thompson, Qinghua Zheng, Venkateswarlu Tella, Debanjan Paul, Dinakaran Narayanan
-
Patent number: 11620064Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: GrantFiled: July 13, 2021Date of Patent: April 4, 2023Assignee: NetApp, Inc.Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Publication number: 20210405882Abstract: Techniques are provided for a layout format for compressed data. A first set of data blocks are grouped into a first group based upon a first frequency of access to the first set of data blocks. A second set of data blocks are grouped into a second group based upon a second frequency of access to the second set of data blocks. The first set of data blocks are compressed into a first compression group using a first compression algorithm. The second set of data blocks are compressed into a second compression group using a second compression algorithm.Type: ApplicationFiled: September 22, 2020Publication date: December 30, 2021Inventors: Girish Hebbale Venkatasubbaiah, Rahul Thapliyal, Dnyaneshwar Nagorao Pawar, Kartik Rathnakar, Venkateswarlu Tella, Ananthan Subramanian
-
Publication number: 20210342082Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: ApplicationFiled: July 13, 2021Publication date: November 4, 2021Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Patent number: 11068182Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: GrantFiled: November 14, 2019Date of Patent: July 20, 2021Assignee: NetApp, Inc.Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Publication number: 20200159432Abstract: One or more techniques and/or computing devices are provided for inline deduplication. For example, a checksum hash table and/or a block number hash table may be maintained within memory (e.g., a storage controller may maintain the hash tables in-core). The checksum hash table may be utilized for inline deduplication to identify potential donor blocks that may comprise the same data as an incoming storage operation. Data within an in-core buffer cache is eligible as potential donor blocks so that inline deduplication may be performed using data from the in-core buffer cache, which may mitigate disk access to underlying storage for which the in-core buffer cache is used for caching. The block number hash table may be used for updating or removing entries from the hash tables, such as for blocks that are no longer eligible as potential donor blocks (e.g., deleted blocks, blocks evicted from the in-core buffer cache, etc.).Type: ApplicationFiled: January 28, 2020Publication date: May 21, 2020Inventors: Mukul Sharma, Kartik Rathnakar, Dnyaneshwar Nagorao Pawar, Venkateswarlu Tella, Kiran Nenmeli Srinivasan, Rajesh Khandelwal, Alok Sharma
-
Publication number: 20200081643Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: ApplicationFiled: November 14, 2019Publication date: March 12, 2020Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Patent number: 10585611Abstract: One or more techniques and/or computing devices are provided for inline deduplication. For example, a checksum hash table and/or a block number hash table may be maintained within memory (e.g., a storage controller may maintain the hash tables in-core). The checksum hash table may be utilized for inline deduplication to identify potential donor blocks that may comprise the same data as an incoming storage operation. Data within an in-core buffer cache is eligible as potential donor blocks so that inline deduplication may be performed using data from the in-core buffer cache, which may mitigate disk access to underlying storage for which the in-core buffer cache is used for caching. The block number hash table may be used for updating or removing entries from the hash tables, such as for blocks that are no longer eligible as potential donor blocks (e.g., deleted blocks, blocks evicted from the in-core buffer cache, etc.).Type: GrantFiled: April 26, 2016Date of Patent: March 10, 2020Assignee: NetApp Inc.Inventors: Mukul Sharma, Kartik Rathnakar, Dnyaneshwar Nagorao Pawar, Venkateswarlu Tella, Kiran Nenmeli Srinivasan, Rajesh Khandelwal, Alok Sharma
-
Patent number: 10496314Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: GrantFiled: February 23, 2018Date of Patent: December 3, 2019Assignee: NetApp Inc.Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Publication number: 20180181339Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: ApplicationFiled: February 23, 2018Publication date: June 28, 2018Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Publication number: 20180173449Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: ApplicationFiled: December 21, 2016Publication date: June 21, 2018Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Patent number: 10001942Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.Type: GrantFiled: December 21, 2016Date of Patent: June 19, 2018Assignee: NetApp Inc.Inventors: Alok Sharma, Girish Hebbale Venkata Subbaiah, Kartik Rathnakar, Venkateswarlu Tella, Mukul Sharma
-
Publication number: 20170308320Abstract: One or more techniques and/or computing devices are provided for inline deduplication. For example, a checksum hash table and/or a block number hash table may be maintained within memory (e.g., a storage controller may maintain the hash tables in-core). The checksum hash table may be utilized for inline deduplication to identify potential donor blocks that may comprise the same data as an incoming storage operation. Data within an in-core buffer cache is eligible as potential donor blocks so that inline deduplication may be performed using data from the in-core buffer cache, which may mitigate disk access to underlying storage for which the in-core buffer cache is used for caching. The block number hash table may be used for updating or removing entries from the hash tables, such as for blocks that are no longer eligible as potential donor blocks (e.g., deleted blocks, blocks evicted from the in-core buffer cache, etc.).Type: ApplicationFiled: April 26, 2016Publication date: October 26, 2017Inventors: Mukul Sharma, Kartik Rathnakar, Dnyaneshwar Nagorao Pawar, Venkateswarlu Tella, Kiran Nenmeli Srinivasan, Rajesh Khandelwal, Alok Sharma