International Business Machines Corporation

John R Carrell

Ethan S Wozniak

Ravi V Khadiwala

Bohdan Lew Bodnar

Alex Marchenko

A method for execution by a dispersed storage and task (DST) processing unit includes receiving an access request via a network. A set of possible storage units for performance of the access request are determined. A latency summarization value is determined for each of the set of possible storage units based on historical latency data for the set of possible storage units. A weight for each of the set of possible storage units is determined based on the latency summarization values to generate a plurality of weights. A probabilistic selection function is performed in accordance with the plurality of weights to select a proper subset of the set of possible storage units. A plurality of requests are generated based on the access request for transmission, via the network, to the proper subset of the set of possible storage units.

Probabilistically selecting storage units based on latency or throughput in a dispersed storage network

A method begins by receiving a request for a move data function regarding a data object, where the data object is stored at a source DSN location in a first bucket of memory of the DSN. The move data function includes a target DSN location within a second bucket of the memory of the DSN. The method continues by determining dispersed storage error encoding parameters of the first and second buckets. When dispersed storage error encoding parameters of the first and second buckets substantially match, the method continues by creating new metadata, regarding the data object being stored at the target DSN location, that includes a logical address to logical address mapping such that the target DSN location points to the source DSN location and the data object is not physically present at a physical address space that corresponds to the target DSN location.

Growing community of inventors

Geneva, IL, United States of America

John R Carrell