Asynchronous semi-inline deduplication

    公开(公告)号:US11068182B2

    公开(公告)日:2021-07-20

    申请号:US16683466

    申请日:2019-11-14

    Applicant: NetApp inc.

    Abstract: 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.

    INLINE DEDUPLICATION
    2.
    发明申请

    公开(公告)号:US20200159432A1

    公开(公告)日:2020-05-21

    申请号:US16774127

    申请日:2020-01-28

    Applicant: NetApp Inc.

    Abstract: 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.).

    ASYNCHRONOUS SEMI-INLINE DEDUPLICATION
    4.
    发明申请

    公开(公告)号:US20180181339A1

    公开(公告)日:2018-06-28

    申请号:US15903328

    申请日:2018-02-23

    Applicant: NetApp Inc.

    Abstract: 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.

    ASYNCHRONOUS SEMI-INLINE DEDUPLICATION

    公开(公告)号:US20210342082A1

    公开(公告)日:2021-11-04

    申请号:US17373820

    申请日:2021-07-13

    Applicant: NetApp Inc.

    Abstract: 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.

    Inline deduplication
    7.
    发明授权

    公开(公告)号:US11010078B2

    公开(公告)日:2021-05-18

    申请号:US16774127

    申请日:2020-01-28

    Applicant: NetApp Inc.

    Abstract: 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.).

    Asynchronous semi-inline deduplication

    公开(公告)号:US11620064B2

    公开(公告)日:2023-04-04

    申请号:US17373820

    申请日:2021-07-13

    Applicant: NetApp Inc.

    Abstract: 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.

    Background deduplication using trusted fingerprints

    公开(公告)号:US11055005B2

    公开(公告)日:2021-07-06

    申请号:US16254741

    申请日:2019-01-23

    Applicant: NetApp Inc.

    Abstract: 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.

    ASYNCHRONOUS SEMI-INLINE DEDUPLICATION
    10.
    发明申请

    公开(公告)号:US20180173449A1

    公开(公告)日:2018-06-21

    申请号:US15386544

    申请日:2016-12-21

    Applicant: NetApp Inc.

    CPC classification number: G06F3/0641 G06F3/0608 G06F3/0683

    Abstract: 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.

Patent Agency Ranking