公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：US20180225179A1

公开(公告)日：2018-08-09

申请号：US15749574

申请日：2015-08-07

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Dave Donaghy ,  Shiraz Billimoria ,  Adam Richard Heath

IPC: G06F11/14 ,  G06F17/30 ,  H04L9/06

CPC classification number: G06F11/1464 ,  G06F11/14 ,  G06F11/1448 ,  G06F11/1469 ,  G06F16/113 ,  H04L9/0643

Abstract: Examples disclosed herein relate to data encryption instructions to divide a data element into a plurality of data chunks, encrypt the plurality of data chunks, store the encrypted plurality of data chunks in a local storage, and provide the data element to a remote backup storage.

公开(公告)号：US11941448B2

公开(公告)日：2024-03-26

申请号：US17011327

申请日：2020-09-03

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Dave Donaghy ,  Shiraz Billimoria

IPC: G06F9/50 ,  G06F3/06

CPC classification number: G06F9/5027 ,  G06F3/0604 ,  G06F3/0631 ,  G06F3/0647 ,  G06F3/0676 ,  G06F3/0677 ,  G06F3/0679 ,  G06F3/0682

Abstract: A computing device includes a processor and a machine-readable storage storing instructions. The instructions are executable by the processor to: determine a completed amount of data transferred for each of a plurality of data transfer jobs, each of the plurality of data transfer jobs to transfer data to a storage system; determine an estimated probability of failure for each of the plurality of data transfer jobs; and allocate computing resources of the storage system to the plurality of data transfer jobs based on the completed amount of data transferred and the estimated probability of failure of each of the plurality of data transfer jobs.

公开(公告)号：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

IPC: G06F17/30 ,  G06F3/06 ,  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.