-
公开(公告)号:US11853576B2
公开(公告)日:2023-12-26
申请号:US17447281
申请日:2021-09-09
Applicant: Hewlett Packard Enterprise Development LP
Inventor: John Butt , Noel Rodrigues , David Bebawy
IPC: G06F3/06
CPC classification number: G06F3/0641 , G06F3/067 , G06F3/0608 , G06F3/0652 , G06F3/0659
Abstract: Examples described herein relate to deletion of data entities in a deduplication system. Examples may maintain entries in a housekeeping queue, each entry including a priority value and a total unshared chunk size of a data entity to be deleted from the deduplication system. Examples may delete the data entities corresponding to the entries including a low priority value from the deduplication system. Examples may determine whether an available storage capacity of the deduplication system is sufficient after deleting the data entities corresponding to the entries including the low priority value. Examples may delete a data entity corresponding to an entry including a high priority value and a largest total unshared chunk size if the available storage capacity is insufficient.
-
公开(公告)号:US20170046093A1
公开(公告)日:2017-02-16
申请号:US15305452
申请日:2014-05-29
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: John Butt
IPC: G06F3/06
CPC classification number: G06F3/0641 , G06F3/0608 , G06F3/0619 , G06F3/0652 , G06F3/0673 , G06F11/1453
Abstract: Determination may be made, for a first backup file comprising deduplication data in a first backup storage device, whether the first backup file comprises a number of tags ready for deletion higher than a threshold amount. Responsive to determining that the number of tags ready for deletion is higher than the threshold amount, each corresponding set of data associated with a tag ready for deletion in the first backup file may be deleted.
Abstract translation: 对于包括第一备份存储设备中的重复数据删除数据的第一备份文件,可以确定第一备份文件是否包括准备好删除的多个标签高于阈值量。 响应于确定准备删除的标签的数量高于阈值量,可以删除与在第一备份文件中准备删除的标签相关联的每个对应的数据集。
-
公开(公告)号:US20230073371A1
公开(公告)日:2023-03-09
申请号:US17447281
申请日:2021-09-09
Applicant: Hewlett Packard Enterprise Development LP
Inventor: John Butt , Noel Rodrigues , David Bebawy
IPC: G06F3/06
Abstract: Examples described herein relate to deletion of data entities in a deduplication system. Examples may maintain entries in a housekeeping queue, each entry including a priority value and a total unshared chunk size of a data entity to be deleted from the deduplication system. Examples may delete the data entities corresponding to the entries including a low priority value from the deduplication system. Examples may determine whether an available storage capacity of the deduplication system is sufficient after deleting the data entities corresponding to the entries including the low priority value. Examples may delete a data entity corresponding to an entry including a high priority value and a largest total unshared chunk size if the available storage capacity is insufficient.
-
公开(公告)号:US11106580B2
公开(公告)日:2021-08-31
申请号:US16773710
申请日:2020-01-27
Applicant: Hewlett Packard Enterprise Development LP
Inventor: John Butt , Dave Donaghy , Mayuri Jain
IPC: G06F12/02 , G06F16/215
Abstract: Examples may include a deduplication system threshold based on an amount of wear of a storage device. Examples may obtain an indication of an amount of wear experienced by at least one storage device storing a plurality of container indexes of a deduplication system, and may adjust a threshold of the deduplication system based on the amount of wear.
-
公开(公告)号:US20170220422A1
公开(公告)日:2017-08-03
申请号:US15328574
申请日:2014-08-28
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: John Butt
CPC classification number: G06F11/1453 , G06F16/122 , G06F16/174 , G06F16/1752 , G06F16/24554 , G06F16/24562 , G06F2201/80 , G06F2201/82
Abstract: Store data chunks associated with data objects to data store files. Determine for each of the data store files reference counts for each of the data chunks indicating number of data objects associated with respective data chunks. Move data chunks to one of the data store files based on whether respective reference counts of respective data chunks exceeds a threshold.
-
公开(公告)号:US20210232500A1
公开(公告)日:2021-07-29
申请号:US16773710
申请日:2020-01-27
Applicant: Hewlett Packard Enterprise Development LP
Inventor: John Butt , Dave Donaghy , Mayuri Jain
IPC: G06F12/02 , G06F16/215 , G06F12/06
Abstract: Examples may include a deduplication system threshold based on an amount of wear of a storage device. Examples may obtain an indication of an amount of wear experienced by at least one storage device storing a plurality of container indexes of a deduplication system, and may adjust a threshold of the deduplication system based on the amount of wear.
-
公开(公告)号:US10769102B2
公开(公告)日:2020-09-08
申请号:US15579838
申请日:2015-06-12
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Dave Donaghy , Josh Whelan , John Butt
IPC: G06F16/11 , G06F16/174 , G06F3/06 , G06F11/14 , G06F9/455
Abstract: According to an example, to allocate disk storage space, a request to store a new data chunk in a container is received. For a list of available containers, an exposure count for the container is fetched in the event that a container comprises a data chunk from a same source as the new data chunk. An optimal container to store the new data chunk is determined, and in the event that an exposure count of the optimal container is less than an exposure count limit, the new data chunk in the optimal container is stored.
-
公开(公告)号:US20180165291A1
公开(公告)日:2018-06-14
申请号:US15579838
申请日:2015-06-12
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Dave Donaghy , Josh Whelan , John Butt
Abstract: According to an example, to allocate disk storage space, a request to store a new data chunk in a container is received. For a list of available containers, an exposure count for the container is fetched in the event that a container comprises a data chunk from a same source as the new data chunk. An optimal container to store the new data chunk is determined, and in the event that an exposure count of the optimal container is less than an exposure count limit, the new data chunk in the optimal container is stored.
-
-
-
-
-
-
-