# US 12,216,903 B2 · Storage node data placement utilizing similarity > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,216,903 B2 - Document ID: US12216903B2 - Status: Granted - Kind: B2 - Application number: 17/407,813 - Filed: 2021-08-20 - Published: 2021-12-09 - Granted: 2025-02-04 - Earliest claimed: 2016-10-31 - Assignees: Pure Storage, Inc. - Applicants: Pure Storage, Inc. - Inventors: Robert Lee; Christopher Lumb; Ethan L. Miller; Igor Ostrovsky - Web page: https://patentgrep.com/patent/US12216903B2 ## CPC - G06F 3/061: {Improving I/O performance} - G06F 3/0608: {Saving storage space on storage systems} - G06F 3/0641: {De-duplication techniques} - G06F 3/0647: {Migration mechanisms} - G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]} - G06F 3/0688: {Non-volatile semiconductor memory arrays} - G06F 3/0689: {Disk arrays, e.g. RAID, JBOD} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node. ## Claims ### Claim 1 A storage system comprising: a plurality of nodes comprising a plurality of solid state storage devices; and a storage array controller operatively coupled to the plurality of nodes, the storage array controller comprising a processing device configured to: calculate a plurality of hashes corresponding to data to be stored on the plurality of nodes of the storage system; identify a subset of the plurality of nodes storing data that is similar to the data to be stored while avoiding comparing the plurality of hashes to all hash values of the storage system; transmit the plurality of hashes to the subset of the plurality of nodes; receive, from the subset of nodes, results of a calculation to determine a similarity of the plurality of hashes with respective hashes representing data stored at one or more of the plurality of solid state storage devices on the subset of nodes; identify a node of the subset of nodes based on a result of the calculation for the node; and transmit the data to the identified node. ### Claim 2 (depends on 1) The system of claim 1, wherein the plurality of hashes is generated by a rolling hash algorithm. ### Claim 3 (depends on 1) The system of claim 1, wherein the calculation considers available capacity of the node and throughput of the node. ### Claim 4 (depends on 1) The system of claim 1, wherein the plurality of solid state storage devices have differing capacities. ### Claim 5 (depends on 1) The system of claim 1, wherein the calculation considers a load on the one of the plurality of solid state storage devices. ### Claim 6 (depends on 1) The system of claim 1, wherein the processing device is further configured to: determine a subset of the plurality of solid state storage devices to perform the calculation in view of a predetermined number of low order bits corresponding to the plurality of hashes. ### Claim 7 A method comprising: calculating, by a processing device of a storage array controller, a plurality of hashes corresponding to data to be stored on a plurality of nodes of a storage system, the plurality of nodes comprising a plurality of solid state storage devices; identify a subset of the plurality of nodes storing data that is similar to the data to be stored while avoiding comparing the plurality of hashes to all hash values of the storage system; transmitting the plurality of hashes to the subset of the plurality of nodes; receiving, from the subset of nodes, results of a calculation to determine a similarity of the plurality of hashes with respective hashes representing data stored at one or more of the plurality of solid state storage devices on the subset of nodes; identifying, by the processing device, a node of the subset of nodes based on a result of the calculation for the node; and transmitting the data to the identified node. ### Claim 8 (depends on 7) The method of claim 7, wherein at least two of the solid state storage devices of a node are non-uniform with respect to capacity. ### Claim 9 (depends on 7) The method of claim 7, wherein to calculate the plurality of hashes corresponding to the data, the method further comprises utilizing a rolling hash algorithm on the data. ### Claim 10 (depends on 7) The method of claim 7, wherein the calculation considers available capacity of the node and throughput of the node. ### Claim 11 (depends on 7) The method of claim 7, the method further comprising: sending the data to a second node responsive to receiving the result of the calculation from a first solid state storage device. ### Claim 12 (depends on 7) The method of claim 7, wherein the plurality of solid state storage devices have differing capacities. ### Claim 13 (depends on 7) The method of claim 7, wherein the calculation considers a load on the of the plurality of nodes. ### Claim 14 (depends on 7) The method of claim 7, further comprising determining a subset of the plurality of solid state storage devices to perform the calculation in view of a predetermined number of low order bits corresponding to the plurality of hashes. ### Claim 15 A non-transitory computer readable storage medium storing instructions, which when executed, cause a processing device of a storage array controller to: calculate, by the storage array controller, a plurality of hashes corresponding to data to be stored on a plurality of nodes of a storage system, the plurality of nodes comprising a plurality of solid state storage devices; identify a subset of the plurality of nodes storing data that is similar to the data to be stored while avoiding comparing the plurality of hashes to all hash values of the storage system; transmit the plurality of hashes to the subset of the plurality of nodes; receive, from the subset of nodes, results of a calculation to determine a similarity of the plurality of hashes with respective hashes representing data stored at one or more of the plurality of solid state storage devices on the subset of nodes; identify a node of the subset of nodes based on a result of the calculation for the node; and transmit the data to the identified node. ### Claim 16 (depends on 15) The non-transitory computer readable storage medium of claim 15, wherein the plurality of solid state storage devices comprise storage devices having differing capacities. ### Claim 17 (depends on 15) The non-transitory computer readable storage medium of claim 15, wherein to calculate the plurality of hashes corresponding to the data, the processing device is to compute a rolling hash of the data. ### Claim 18 (depends on 15) The non-transitory computer readable storage medium of claim 15, wherein the calculation considers available capacity of the node. ### Claim 19 (depends on 15) The non-transitory computer readable storage medium of claim 15, wherein the calculation considers throughput of the node. ### Claim 20 (depends on 15) The non-transitory computer readable storage medium of claim 15, wherein the processing device is further to: determine a subset of the plurality of solid state storage devices to perform the calculation in view of a predetermined number of low order bits corresponding to the plurality of hashes.