Deduplication aware scalable content placement

A method comprising:

• receiving data to be stored on one or more nodes of a storage array;
• calculating, by a processing device, a plurality of hashes corresponding to the data;
• determining a first subset of the plurality of hashes corresponding to the data;
• determining a second subset of the plurality of hashes of the first subset;
• generating, by the processing device, in view of the second subset, a node candidate placement list, wherein the candidate placement list comprises less than all of the plurality of nodes;
• sending, by the processing device, the first subset of the plurality of hashes to one or more nodes represented on the node candidate placement list;
• receiving, from the one or more nodes represented on the node candidate placement list, characteristics corresponding to the one or more nodes represented on the candidate placement list;
• and
• in view of the characteristics, identifying one of the one or more nodes represented on the candidate placement list and sending the data to the identified node.

A non-transitory computer readable storage medium storing instructions, which when executed, cause a processing device to:

• receive data to be stored on one or more nodes of a storage array;
• calculate a plurality of hashes corresponding to the data;
• determine a first subset of the plurality of hashes corresponding to the data;
• generate, in view of the first subset, a node candidate placement list, wherein the candidate placement list comprises less than all of the plurality of nodes;
• and
• send the first subset of the plurality of hashes to one or more nodes represented on the node candidate placement list.