Patents by Inventor Kartik Rathnakar
Kartik Rathnakar 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: 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: 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
-
Patent number: 11055005Abstract: Techniques are provided for background deduplication using trusted fingerprints. Trusted fingerprints of blocks are inserted into a trusted fingerprint store as the blocks are being allocated by a file system sequentially according to block numbers of the blocks. In this way, the trusted fingerprint store is indexed by block numbers of where the blocks are stored. Blocks that are to be deduplicated are identifying by sorting the blocks based upon weak fingerprints, and moving duplicates to a dup file. The dup file is sorted based upon block numbers. Trusted fingerprints are loaded from the trusted fingerprint store for deduplicating the blocks within the dup file.Type: GrantFiled: January 23, 2019Date of Patent: July 6, 2021Assignee: NetApp, Inc.Inventors: Dnyaneshwar Nagorao Pawar, Kartik Rathnakar
-
Patent number: 11010078Abstract: 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: January 28, 2020Date of Patent: May 18, 2021Assignee: NetApp Inc.Inventors: Mukul Sharma, Kartik Rathnakar, Dnyaneshwar Nagorao Pawar, Venkateswarlu Telia, Kiran Nenmeli Srinivasan, Rajesh Khandelwal, Alok 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: 20200117379Abstract: Techniques are provided for background deduplication using trusted fingerprints. Trusted fingerprints of blocks are inserted into a trusted fingerprint store as the blocks are being allocated by a file system sequentially according to block numbers of the blocks. In this way, the trusted fingerprint store is indexed by block numbers of where the blocks are stored. Blocks that are to be deduplicated are identifying by sorting the blocks based upon weak fingerprints, and moving duplicates to a dup file. The dup file is sorted based upon block numbers. Trusted fingerprints are loaded from the trusted fingerprint store for deduplicating the blocks within the dup file.Type: ApplicationFiled: January 23, 2019Publication date: April 16, 2020Inventors: Dnyaneshwar Nagorao PAWAR, Kartik Rathnakar
-
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