Prosecution Insights
Last updated: April 19, 2026
Application No. 18/444,421

SYSTEMS AND TECHNIQUES FOR UPDATING LOGICAL-TO-PHYSICAL MAPPINGS

Non-Final OA §103
Filed
Feb 16, 2024
Examiner
LI, ZHUO H
Art Unit
2133
Tech Center
2100 — Computer Architecture & Software
Assignee
Micron Technology, Inc.
OA Round
3 (Non-Final)
89%
Grant Probability
Favorable
3-4
OA Rounds
2y 8m
To Grant
92%
With Interview

Examiner Intelligence

Grants 89% — above average
89%
Career Allow Rate
512 granted / 575 resolved
+34.0% vs TC avg
Minimal +3% lift
Without
With
+3.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
18 currently pending
Career history
593
Total Applications
across all art units

Statute-Specific Performance

§101
5.6%
-34.4% vs TC avg
§103
52.8%
+12.8% vs TC avg
§102
16.5%
-23.5% vs TC avg
§112
9.2%
-30.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 575 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Response to Amendment This Office action is in respond to Applicant’s amendment filed on 12/8/2025. Claims 1-20 are pending in the application. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claims 1, 10, 13-14 and 19-20 are rejected under 35 U.S.C. 103 as being unpatentable over Lo et al. (US 9,977,612 B1, hereinafter Lo) in view of Prasad et al. (US 2022/0283954 A1, hereinafter Prasad) and Bernat et al. (US 10,990,480 B1, hereinafter Bernat). Regarding claim 1, Lo discloses an apparatus as shown in figure 1, comprising: a memory device (figure 1, 150 and 160); and a controller (figure 1, 130) coupled with the memory device and configured to cause the apparatus to: write data to a plurality of contiguous pages of a non-volatile memory device of a memory system (col. 4 lines 25-47, the controller can be configured to receive data and/or storage access commands including write commands which can specify a logical address used to access the data storage system such that it can write data to a plurality of contiguous pages of a non-volatile memory device of a memory system); write an entry to a change log associated with updating logical-to-physical mapping information associated with the data (col. 5 lines 2-30, changes reflected by logs stored later in memory can correspond to more recent changes to the volatile copy of the system data than those reflect by the earlier stored logs comprise mappings or associations between logical and physical addresses in the data storage system, such as associations between logical chunk numbers (LCNs) and physical chunk number (PCNs), associations between logical block addresses (LBAs) and PCNs, and the like such that the entry of the change log comprising a first indication of a virtual block that comprises the plurality of contiguous pages); and update the logical-to-physical mapping information associated with the data based at least in part on the entry of the change log (figure 5 and col. 7 line 56 through col. 8 line 39, generate logs to record changes to the system data stored in the non-volatile memory array). Lo differs from the claimed invention in not specifically teaching that the entry of the change log comprising a first indication of a virtual block that comprises the plurality of contiguous pages and a second indication of a quantity of the plurality of contiguous pages. However, Prasad teaches a method comprising: receiving an indication of a total number of pages desired to be reclaimed from a plurality of virtual memory areas (VMAs) of a shared memory system, wherein a contiguity-aware translation lookaside buffer (TLB) maintains respective sets of TLB entries mapping contiguous regions of virtual memory pages of the plurality of VMAs to corresponding contiguous regions of physical memory pages ([0094]) in order to maintain the contiguity of virtual to physical address mappings. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify Lo in having that that the entry of the change log comprising a first indication of a virtual block that comprises the plurality of contiguous pages and a second indication of a quantity of the plurality of contiguous pages, as per teaching of Prasad, in order to maintain the contiguity of virtual to physical address mappings. The combination of Lo and Prasad differs from the claimed invention in not specifically teaching the entry of the change log comprising a third indication of a logical address associated with the data. However, Bernat teaches a rebuild operation to reconstruct the data to improve the performance of a storage system for updating a mapping data structure to associate a logical address associated with the reconstructed data to the physical address of the data blocks storing the reconstructed data (col. 62 lines 15-32). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the combination of Lo and Prasad in having the entry of the change log comprising a third indication of a logical address associated with the data, as per teaching of Bernat, in order to improve the performance of a storage system. Regarding claim 10, Lo discloses that the entry of the change log comprises a fourth indication of whether the data corresponding to the entry of the change log is valid, and the logical-to-physical mapping information associated with the data is updated based at least in part on the fourth indication indicating that the data is valid (col. 7 lines 46-55, applying changes recorded in those logs that are valid, which can be bounded by a threshold). Regarding claim 13, Lo discloses that a set of logical addresses, i.e., contiguous address, where host data can be stored (col. 4 lines 36-47) such that one of ordinary skill in the art would recognize the plurality of contiguous pages comprising a plurality of contiguous 4 kilobyte chunks of data. In addition, Prasad teaches TLB entries to map the region with normal TLBs when backed by 4K pages ([0003]). Regarding claim 14, the limitations of the claim are rejected as the same reasons as set forth in claim 1. Regarding claim 19, the limitations of the claim are rejected as the same reasons as set forth in claim 10. Regarding claim 20, the limitations of the claim are rejected as the same reasons as set forth in claim 1. Claims 2 and 15 are rejected under 35 U.S.C. 103 as being unpatentable over Lo et al. (US 9,977,612 hereinafter Lo) in view of Prasad et al. (US 2022/0283954 hereinafter Prasad) and Bernat et al. (US 10,990,480 B1, hereinafter Bernat) as applied in claims above, and further in view of Amato (US 2019/0370169). Regarding 2, the combination of Lo, Prasad and Bernat differs from the claimed invention in not specifically teaching that the controller is further configured to cause the apparatus to: store a mapping between a set of indexes used as indications of the virtual block in the entry and identifiers of virtual blocks, wherein the first indication of the virtual block comprises a first index mapped to an identifier of the virtual block. However, Amato teaches an index located in the first L2P mapping table using the hash functions may then be used to locate a physical location of a corresponding physical block address in the second L2P mapping table ([0019]) in order to easily identify a logical sector of data. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the combination of Lo, Prasad and Bernat in having that the controller is further configured to cause the apparatus to: store a mapping between a set of indexes used as indications of the virtual block in the entry and identifiers of virtual blocks, wherein the first indication of the virtual block comprises a first index mapped to an identifier of the virtual block, as per teaching of Amato, in order easily identify a logical sector of data. Regarding claim 15, the limitations of the claim are rejected as the same reasons as set forth in claim 2. Claims 5 and 17 are rejected under 35 U.S.C. 103 as being unpatentable over Lo et al. (US 9,977,612 hereinafter Lo) in view of Prasad et al. (US 2022/0283954 hereinafter Prasad) and Bernat et al. (US 10,990,480 B1, hereinafter Bernat) as applied in claims above, and further in view of Durham et al. (US 2019/0042799 hereinafter Durham). Regarding claim 5, the combination of Lo, Prasad and Bernat differs from the claimed invention in not specifically teaching that the first indication of the virtual block comprises a first quantity of bits that is less than a second quantity of bits of an identifier of the virtual block. However, Durham teaches to set the meta-data tags to a value corresponding to the pointer's virtual address identification tag, and set the small object tag indicator bit in the pointer's virtual address ([0047]) in order to prevent use-after-free of the previous pointer identification tags. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the combination of Lo, Prasad and Bernat in having the first indication of the virtual block comprises a first quantity of bits that is less than a second quantity of bits of an identifier of the virtual block, as per teaching of Durham, in order to prevent use-after-free of the previous pointer identification tags. Regarding claim 17, the limitations of the claim are rejected as the same reasons as set forth in claim 5. Claims 6 and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Lo et al. (US 9,977,612 hereinafter Lo) in view of Prasad et al. (US 2022/0283954 hereinafter Prasad) and Bernat et al. (US 10,990,480 B1, hereinafter Bernat) as applied in claims above, and further in view of Mulani et al. (US 2019/0012099 hereinafter Mulani). Regarding claim 6, the combination of Lo, Prasad and Bernat differs from the claimed invention in not specifically teaching that the entry of the change log comprises a fourth indication of a page offset within the virtual block, the page offset indicating a first page of the plurality of contiguous pages to which the entry of the change log corresponds. However, Mulani teaches where data is stored contiguously, there may be an offset between the lowest address of a logical group and the lowest address of the metablock to which it is mapped ([0078]) such that there is an indication of a page offset within the virtual block, and the page offset indicating a first page of the plurality of contiguous pages to which the entry of the change log corresponds in order to minimize the time needed to access the address directory system in the volatile memory. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the combination of Lo, Prasad and Bernat in having the entry of the change log comprises a fourth indication of a page offset within the virtual block, the page offset indicating a first page of the plurality of contiguous pages to which the entry of the change log corresponds, as per teaching of Mulani, in order to minimize the time needed to access the address directory system in the volatile memory. Regarding claim 18, the limitations of the claim are rejected as the same reasons as set forth in claim 6. Claim 9 is rejected under 35 U.S.C. 103 as being unpatentable over Lo et al. (US 9,977,612 hereinafter Lo) in view of Prasad et al. (US 2022/0283954 hereinafter Prasad), Bernat et al. (US 10,990,480 B1, hereinafter Bernat) and Mulani et al. (US 2019/0012099 hereinafter Mulani) as applied in claim 6 above, and further in view of Durham et al. (US 2019/0042799 hereinafter Durham). Regarding claim 9, the combination of Lo, Prasad, Bernat and Mulani differs from the claimed invention in not specifically teaching that the fourth indication of the page offset comprises a first quantity of bits that is less than a second quantity of bits of the page offset. However, Durham teaches to set the meta-data tags to a value corresponding to the pointer's virtual address identification tag, and set the small object tag indicator bit in the pointer's virtual address ([0047]) in order to prevent use-after-free of the previous pointer identification tags. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the combination of Lo, Prasad, Bernat and Mulani in having that the fourth indication of the page offset comprises a first quantity of bits that is less than a second quantity of bits of the page offset, as per teaching of Durham, in order to prevent use-after-free of the previous pointer identification tags. Allowable Subject Matter Claims 3-4, 7-8, 11-12 and 16 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Response to Arguments Applicant’s arguments with respect to claim(s) 1-20 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ZHUO H LI whose telephone number is (571)272-4183. The examiner can normally be reached Mon. Tue. and Thurs. 8:00-4:00 PM. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Rocio Del Mar Perez-Velez can be reached at (571)-270-5935. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /ZHUO H LI/Primary Examiner, Art Unit 2133
Read full office action

Prosecution Timeline

Feb 16, 2024
Application Filed
May 17, 2025
Non-Final Rejection — §103
Aug 21, 2025
Response Filed
Oct 03, 2025
Final Rejection — §103
Dec 08, 2025
Response after Non-Final Action
Jan 07, 2026
Request for Continued Examination
Jan 24, 2026
Response after Non-Final Action
Feb 07, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12592292
EFUSE UNIT AND APPLICATION CIRCUIT THEREOF
2y 5m to grant Granted Mar 31, 2026
Patent 12578880
MEMORY MANAGEMENT METHOD TO SAVE ENERGY
2y 5m to grant Granted Mar 17, 2026
Patent 12578872
DYNAMIC SENSING SCHEME TO COMPENSATE FOR THRESHOLD VOLTAGE SHIFT DURING SENSING IN A MEMORY DEVICE
2y 5m to grant Granted Mar 17, 2026
Patent 12578863
LOW LATENCY DYNAMIC RANDOM ACCESS MEMORY (DRAM) ARCHITECTURE WITH DEDICATED READ-WRITE DATA PATHS
2y 5m to grant Granted Mar 17, 2026
Patent 12561281
REDUCING STABLE DATA EVICTION WITH SYNTHETIC BASELINE SNAPSHOT AND EVICTION STATE REFRESH
2y 5m to grant Granted Feb 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
89%
Grant Probability
92%
With Interview (+3.3%)
2y 8m
Median Time to Grant
High
PTA Risk
Based on 575 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month