# US 12,762,048 B2 · Predictive center allocation data structure > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,762,048 B2 - Document ID: US12762048B2 - Status: Granted - Kind: B2 - Application number: 18/591,851 - Filed: 2024-02-29 - Published: 2024-09-05 - Granted: 2026-10-13 - Earliest claimed: 2023-03-03 - Assignees: Micron Technology, Inc. - Applicants: Micron Technology, Inc. - Inventors: Leon Zlotnik - Web page: https://patentgrep.com/patent/US12762048B2 ## CPC - G06F 12/0246: {in block erasable memory, e.g. flash memory} - G06F 12/0653: {with centralised address assignment} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract An apparatus includes a memory resource configured to store data entries in data structures including a first data structure and a second data structure and a processing device coupled to the memory resources. The processing device is configured to determine a predicted address location in the first data structure for a data entry, determine an equivalent address location in the second data structure, and write the data entry to the equivalent address location in the second data structure. ## Claims ### Claim 1 An apparatus, comprising: a memory resource configured to store data entries in data structures including a first data structure and a second data structure, wherein the data entries stored in the first data structure are different from the data entries stored in the second data structure; and a processing device coupled to the memory resource, wherein the processing device is configured to: determine a predicted address location in the first data structure for a data entry based on a value of the data entry relative to values of previously written data entries; determine an equivalent address location in the second data structure that is a distance from a last physical address in the second data structure equivalent to a distance the predicted address location is from a last physical address in the first data structure; and write the data entry to the equivalent address location in the second data structure. ### Claim 2 (depends on 1) The apparatus of claim 1, wherein the data entry further comprises a first data entry for the second data structure. ### Claim 3 (depends on 1) The apparatus of claim 1, wherein the predicted address location is an address location other than an address location in the first data structure that is substantially equidistant from a first physical address of the first data structure and a last physical address location of the first data structure. ### Claim 4 (depends on 1) The apparatus of claim 1, wherein the first data structure is a full data structure. ### Claim 5 (depends on 1) The apparatus of claim 1, wherein: the first data structure is configured as an ordered ascending data structure or is configured as an ordered descending data structure; and the second data structure is configured as an ordered ascending data structure or is configured as an ordered descending data structure. ### Claim 6 (depends on 1) The apparatus of claim 1, wherein the equivalent physical address location is a physical location in the second data structure that is equivalent to the predicted physical address in the first data structure. ### Claim 7 (depends on 1) The apparatus of claim 1, wherein the first data structure is a data structure included in a plurality of data structures that is directly preceding the second data structure. ### Claim 8 (depends on 1) The apparatus of claim 1, wherein: the first data structure comprises N address locations, and a first physical address is a zeroth address location of the first data structure and a last address location is an Nth address location of the first data structure, or the first physical address is the Nth address location of the first data structure and the last address location is the zeroth address location of the first data structure; and the second data structure comprises N address locations, and a first physical address is a zeroth address location of the second data structure and a last address location is an Nth address location of the second data structure, or the first physical address is the Nth address location of the second data structure and the last address location is the zeroth address location of the second data structure, and wherein a quantity of the N physical address locations in the first data structure is equal to a quantity of the N physical address locations in the second data structure. ### Claim 9 (depends on 1) The apparatus of claim 1, wherein the data entries comprise logical-to-physical mapping entries associated with a memory sub-system in which the memory resources are deployed. ### Claim 10 (depends on 1) The apparatus of claim 1, wherein the predicted address location in the first data structure is altered based on a quantity, a direction, or both, of shift operations involving a first data entry written to the first data structure. ### Claim 11 A method, comprising: determining, for a data entry, a predicted physical address location in a first data structure based on a value of the data entry relative to values of previously written data entries, wherein the data entry is stored in a location different than the first data structure; determining an equivalent physical address location in a second data structure that is a distance from a last physical address in the second data structure equivalent to a distance the predicted physical address location is from a last physical address in the first data structure; and writing a first data entry to the equivalent physical address location in the second data structure. ### Claim 12 (depends on 11) The method of claim 11, wherein the equivalent physical address location further comprises an address location in the second data structure other than an address location that is substantially equidistant from a lowermost physical location of the second data structure and an uppermost physical location of the second data structure. ### Claim 13 (depends on 11) The method of claim 11, further comprising determining the predicted address location based on a predicted location in the first data structure and a predicted address location in at least one additional data structure. ### Claim 14 (depends on 13) The method of claim 13, wherein the first data structure is an immediately preceding data structure that was most recently filled, and wherein a weight associated with the predicted location in the first data structure is greater than a weight associated with the predicted address location in the at least one additional data structure. ### Claim 15 (depends on 14) The method of claim 14, wherein the predicted address location is a location between the predicted location in the first data structure and the predicted location in at least one additional data structure. ### Claim 16 A non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to: determine, for a first data entry, a predicted address location in a first data structure that is at an off-center physical address in the first data structure based on a value of the first data entry relative to values of previously written data entries, wherein the first data structure is a full data structure storing data entries other than the first data entry; determine an equivalent address location in a second data structure that is a distance from a last physical address in the second data structure equivalent to a distance the predicted address location is from a last physical address in the first data structure; and write a first data entry to the equivalent address location in the second data structure. ### Claim 17 (depends on 16) The non-transitory computer-readable storage medium of claim 16, wherein the predicted address location in the first data structure is at the off-center physical address that is not the first physical address, the last physical address, nor the center physical address in the first data structure. ### Claim 18 (depends on 17) The non-transitory computer-readable storage medium of claim 17, wherein the equivalent address location in the second data structure is at the off-center physical address that is not the first physical address, the last physical address, nor the center physical address in the second data structure. ### Claim 19 (depends on 17) The non-transitory computer-readable storage medium of claim 17, further comprising instructions that, when executed by the processing device, cause the processing device to write the first data entry, a second data entry, or one or more subsequent data entries, or any combination thereof, to the second data structure as part of an operation to write logical-physical mapping information associated with a memory sub-system in which a memory resource including the second data structure is deployed. ### Claim 20 (depends on 17) The non-transitory computer-readable storage medium of claim 17, further comprising instructions that, when executed by the processing device, cause the processing device to: receive a command to locate a particular data entry that has been written to the second data structure, wherein the particular data entry is one of the first data entry, a second data entry, or a subsequently written data entry written to the second data structure; and perform a search involving each data entry that has been written to the second data structure to locate the particular data entry.