Prosecution Insights
Last updated: April 19, 2026
Application No. 18/314,030

SYSTEMS AND METHODS FOR OPTIMIZING POST PACKAGE REPAIR IN ASSOCIATION WITH SOFTWARE MEMORY HEALING

Final Rejection §103
Filed
May 08, 2023
Examiner
XU, MICHAEL
Art Unit
2113
Tech Center
2100 — Computer Architecture & Software
Assignee
DELL PRODUCTS, L.P.
OA Round
4 (Final)
77%
Grant Probability
Favorable
5-6
OA Rounds
2y 8m
To Grant
99%
With Interview

Examiner Intelligence

Grants 77% — above average
77%
Career Allow Rate
95 granted / 124 resolved
+21.6% vs TC avg
Strong +23% interview lift
Without
With
+23.0%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
18 currently pending
Career history
142
Total Applications
across all art units

Statute-Specific Performance

§101
17.9%
-22.1% vs TC avg
§103
57.0%
+17.0% vs TC avg
§102
13.7%
-26.3% vs TC avg
§112
1.7%
-38.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 124 resolved cases

Office Action

§103
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 . Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 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. Claim(s) 1,3-5,7,9-11,13,15-17 is/are rejected under 35 U.S.C. 103 as being unpatentable over US 20210019082 A1 (Berman) in view of US 20200111539 A1 (Yamaguchi). Regarding claim 1, Berman teaches An information handling system comprising: a processor;(par 50 “executable by any device or machine comprising suitable architecture, such as a general purpose digital computer having a processor, memory, and input/output interfaces).”) a memory system communicatively coupled to the processor(fig 1:126; par 22 “The access controller 125 is configured to interface with a nonvolatile memory device 126. In an exemplary embodiment, the nonvolatile memory device 126 is implemented by a phase-change memory device. The nonvolatile memory device 126 includes a main region 126-1 and a spare region 126-2.”), the memory system comprising a plurality of rows and a plurality of spare rows for post-package repair (PPR) of the memory system;(par 30 “The method of FIG. 3 further includes writing the first codeword to a row of the main region 126-2 having a location derived from the logical address Laddr.”; par 32 “The method of FIG. 3 further includes allocating a new spare address from the spare region 126-2 and writing the first codeword to a location of the spare region 126-2 associated with the new spare address (step 335).”) and one or more instructions stored in non-transitory computer readable media and configured to, when executed, cause the processor to(par 50 “… methods may be tangibly embodied on one or more computer readable medium(s) … and executable by any device … such as a general purpose digital computer having a processor, ….”), in response to a detection of a defect in a block of a particular row of the plurality of rows: (fig 3:330; par 31 “The method of FIG. 3 further includes determining whether the written row is a bad row (step 330). In an exemplary embodiment, the determination is performed by reading data from the written row, comparing the received data against the read data to determine a number of errors, and determining that the row is bad when the number of errors exceeds a certain threshold.”) track a number of defects in the block of the particular row;(par 31 “…the determination is performed by reading data from the written row, comparing the received data against the read data to determine a number of errors, …. “) while the number of defects in the particular row is below a threshold, consider the row to be good,(par 31 “In an exemplary embodiment, the write/read controller 125 reads the data from the written row and performs the comparing. If the number of errors is less than or equal to the threshold, the method can exit since the row is considered to be good.”) and in response to the number of defects in the particular row being at or above the threshold,(fig 3:330,335; par 31 “The method of FIG. 3 further includes determining whether the written row is a bad row (step 330). In an exemplary embodiment, the determination is performed by reading data from the written row, comparing the received data against the read data to determine a number of errors, and determining that the row is bad when the number of errors exceeds a certain threshold. In an exemplary embodiment, the write/read controller 125 reads the data from the written row and performs the comparing. If the number of errors is less than or equal to the threshold, the method can exit since the row is considered to be good. If the number of errors exceeds the threshold, the method continues to step 335.”) perform hardware-based PPR memory healing to replace the particular row with one of the plurality of spare rows.(fig 3:335,340,350; par 32 “The method of FIG. 3 further includes allocating a new spare address from the spare region 126-2 and writing the first codeword to a location of the spare region 126-2 associated with the new spare address (step 335). For example, as shown in FIG. 4B, the first codeword is written into a first row of the first Spare Block 1 of the spare region 126-2.”) However, although Berman teaches in response to a number of defects in the particular row being below a threshold, Berman does not specifically teach in response to a number of defects in the particular row being below a threshold, perform software-based PPR memory healing to prevent use of the block. On the other hand, Yamaguchi teaches An information handling system comprising: a processor;(fig 1:200, fig 14:601; par 43) a memory system communicatively coupled to the processor(fig 1:100, fig 14:603; par 42), the memory system comprising a plurality of rows and a plurality of spare rows for post-package repair (PPR) of the memory system;(fig 1:100; par 43 “The DIMM 100 has a plurality of rows 112 and a plurality of spare rows 113. The row 112 is switched to the spare row 113 by the PPR upon failure.”; PPR is defined in par 5 “Repairing a fault row by switching the faulty row to the spare row is called a post package repair (PPR).”) and one or more instructions stored in non-transitory computer readable media and configured to, when executed, cause the processor to, in response to a detection of a defect in a block of a particular row of the plurality of rows: (fig 11C:S16; par 113 “Further, as illustrated in FIG. 11C, when the memory controller 210 detects that the CE threshold of the DIMM 100 is exceeded during operation of the OS 500, the memory controller 210 generates an SMI and executes the SMI handler 420 of the BIOS 400 (operation S16).”) track a number of defects in the block of the particular row;( fig 11C:S16; par 113“Further, as illustrated in FIG. 11C, when the memory controller 210 detects that the CE threshold of the DIMM 100 is exceeded during operation of the OS 500, the memory controller 210 generates an SMI and executes the SMI handler 420 of the BIOS 400 (operation S16).”) while the a number of defects in the particular row is below a threshold, perform software-based PPR memory healing to prevent use of the block;(fig 11B:S11; par 111 “Then, the BIOS 400 performs a monitoring setting of the row 112 to which the sPPR is applied to the row access monitoring unit 216 of the memory controller 210 (operation S11).”; par 6 “The PPR includes an hPPR and an sPPR. In the hPPR, a fuse switches a faulty row to a spare row. Therefore, the repair by the hPPR may not be undone. In the sPPR, software switches a faulty row to a spare row. Therefore, the repair by the sPPR is lost by reset.”) and in response to the number of software-based PPR memory healing in the particular row being at or above the threshold, perform hardware-based PPR memory healing to replace the particular row with one of the plurality of spare rows.(fig 1:620,630; fig 12B:S42,S43; par 83 “When Cancelcount exceeds a predetermined threshold, the sPPR effect management unit 620 notifies the hPPR data management unit 630 of the sPPR position information 621 and deletes the same information of the sPPR position information 621 and the sPPR position history 622.”; Cancelcount is defined in par 82 “The sPPR effect management unit 620 determines whether the PPR position information notified from the CE information aggregation unit 610 is in the sPPR position history 622, and when such information exists, the sPPR effect management unit 620 adds 1 to Cancelcount.”; hPPR stands for hardware based post package repair and is defined in par 6 “The PPR includes an hPPR and an sPPR. In the hPPR, a fuse switches a faulty row to a spare row. Therefore, the repair by the hPPR may not be undone. In the sPPR, software switches a faulty row to a spare row.”; par 13 “set the software repair position information as hardware repair position information” ) Therefore, it would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to further modify Berman to incorporate the software-based PPR memory healing to prevent use of the block of Yamaguchi. One of ordinary skill in the art would have been motivated to remedy the shortcomings of Berman -- a need for a need for a solution for the issue of how to handle detected errors in a row that are below Berman’s error threshold (Berman par 31 “In an exemplary embodiment, the write/read controller 125 reads the data from the written row and performs the comparing. If the number of errors is less than or equal to the threshold, the method can exit since the row is considered to be good.”; Yamaguchi par 38 “there is a problem that an inappropriate row may be subject to the PPR.”) -- with Yamaguchi providing a known method to solve a similar problem. Yamaguchi provides “an embodiment of a technique of properly repairing a row in which a correctable error occurs in a memory module.”(Yamaguchi par 40) Regarding claim 3, Berman and Yamaguchi teaches The information handling system of Claim 1, Berman further teaches, wherein the threshold is equal to four defects per row.(fig 3:330; par 31 “The method of FIG. 3 further includes determining whether the written row is a bad row (step 330). In an exemplary embodiment, the determination is performed by reading data from the written row, comparing the received data against the read data to determine a number of errors, and determining that the row is bad when the number of errors exceeds a certain threshold.” Although Berman does not specifically set the threshold to four defects, Berman does set a certain threshold number, and it would be obvious to try whatever defect counts are needed.) Regarding claim 4, Berman and Yamaguchi teaches The information handling system of Claim 1, Berman further teaches, wherein the memory system is a dynamic random access memory (DRAM) system.(fig 1:126; par 23 “ In an exemplary embodiment, the controller 125 is configured to interface with the nonvolatile memory 126 or a DRAM (not shown) using a Double data rate (DDR) protocol.”) Regarding claim 5, Berman and Yamaguchi teaches The information handling system of Claim 1, Berman further teaches, wherein the plurality of rows are organized into a plurality of memory banks(fig 4A; par 24 “As shown in FIGS. 4A-4B, the main region 126-1 includes M blocks and the spare region 126-2 includes N blocks.”) Regarding claims 7,9-11, they are the method that the system of claims 1,3-5 implement and are rejected for the same reasons. Regarding claims 13,15-17, they are the non-transitory computer-readable medium containing instructions that the system of claims 1,3-5 implement and are rejected for the same reasons. Claim(s) 2,8,14 is/are rejected under 35 U.S.C. 103 as being unpatentable over US 20210019082 A1 (Berman) and US 20200111539 A1 (Yamaguchi) as applied to claims 1,7,13 above, and further in view of US 20020196687 A1 (Sauvageau). Regarding claim 2, Berman and Yamaguchi teaches The information handling system of Claim 1, Yamaguchi also teaches, wherein the software-based PPR is also performed(fig 11B:S11; par 111 “Then, the BIOS 400 performs a monitoring setting of the row 112 to which the sPPR is applied to the row access monitoring unit 216 of the memory controller 210 (operation S11).”; par 6 “The PPR includes an hPPR and an sPPR. In the hPPR, a fuse switches a faulty row to a spare row. Therefore, the repair by the hPPR may not be undone. In the sPPR, software switches a faulty row to a spare row.”) However, Berman and Yamaguchi do not specifically teach in response to a determination that no unused spare row is available. On the other hand, Sauvageau teaches A system for analyzing and repairing memory with different types of memory spares (par 16 “According to one aspect, a method for analyzing and repairing memory includes the step of determining if failed memory cells detected in at least a portion of memory must be repaired using only one of a number of types of memory spares or may be repaired using any of the number of types of memory spares.”) wherein the software-based PPR is also performed in response to a determination that no unused spare row is available. (par 29 “If a first type of the plurality of types of memory spares is available, then the identified error is repaired with a spare of the first type. Otherwise, it is determined if a second complementary type of the plurality of types of memory spares is available. If a second type of the plurality of types of memory spares is available, then the identified error is repaired with a spare of the second type.”) Therefore, it would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to further modify Berman and Yamaguchi to incorporate the response to a determination that no unused spare row is available of Sauvageau. One of ordinary skill in the art would have been motivated to remedy the shortcomings of Berman and Yamaguchi -- a need for a solution for the issue of how to use spare memory cells efficiently (Sauvageau par 9 “Limitations associated with most conventional testers require that the repair information be generated and used dynamically. This can reduce the overall memory yield by using the redundant memory cells inefficiently. These limitations have also made memory testing a most expensive and time consuming process in the development of faster and denser memory.” Par 6 “Spare I/Os, if present, are capable of simultaneously replacing a number of columns associated with a particular 1/0 bit of memory. …”) -- with Sauvageau providing a known method to solve a similar problem. Sauvageau provides “According to one aspect, a method for analyzing and repairing memory includes the step of determining if failed memory cells detected in at least a portion of memory must be repaired using only one of a number of types of memory spares or may be repaired using any of the number of types of memory spares.”(Sauvageau par 16) Regarding claim 8 it is the method that the system of claim 2 implements and is rejected for the same reasons. Regarding claim 14 it is the non-transitory computer-readable medium containing instructions that the system of claim 2 implements and is rejected for the same reasons. Claim(s) 6,12,18 is/are rejected under 35 U.S.C. 103 as being unpatentable over US 20210019082 A1 (Berman) and US 20200111539 A1 (Yamaguchi) as applied to claims 1,7,13 above, and further in view of US 20230185659 A1 (Bao). Regarding claim 6, Berman and Yamaguchi teaches The information handling system of Claim 1, Yamaguchi teaches, wherein the software-based PPR memory healing is performed(fig 11B:S11; par 111 “Then, the BIOS 400 performs a monitoring setting of the row 112 to which the sPPR is applied to the row access monitoring unit 216 of the memory controller 210 (operation S11).”; par 6 “The PPR includes an hPPR and an sPPR. In the hPPR, a fuse switches a faulty row to a spare row. Therefore, the repair by the hPPR may not be undone. In the sPPR, software switches a faulty row to a spare row.”) by a memory controller of the information handling system(fig 1:620; par 77 “The sPPR effect management unit 620 responds to the sPPR position information 621 based on the request from the PPR switching unit 411. The PPR switching unit 411 applies the sPPR using the sPPR position information 621. The sPPR effect management unit 620 manages information used to confirm the effect of the applied sPPR, and when the effect of the sPPR is confirmed, notifies the sPPR position information 621 to the hPPR data management unit 630.”) However, Berman and Yamaguchi does not specifically teach wherein the software-based PPR memory healing is performed by an operating system of the information handling system. On the other hand, Bao teaches A memory fault handling apparatus that reduces a probability of a system breakdown caused by a memory fault(par 5 “Embodiments of this application provide a memory fault handling method and apparatus, to reduce a probability of system breakdown caused by a memory fault.”) wherein the software-based PPR memory healing is performed by an operating system of the information handling system. (fig 2 par 69 “For example, FIG. 2 shows another memory repair method. As shown in FIG. 2, after identifying a corrected error, a CPU reports the corrected error to an upper-layer operating system (OS), and the OS counts the corrected error and determines a fault severity. After a quantity of corrected errors reaches a threshold, the OS delivers a command to trigger an error isolation mechanism (for example, page offline) in the OS, to isolate virtual space of a faulty region in the OS, and a memory address of the faulty region is no longer used.”) Therefore, it would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to further modify Berman and Yamaguchi to incorporate the memory healing being performed by an operating system of Bao. One of ordinary skill in the art would have been motivated to remedy the shortcomings of Berman and Yamaguchi -- a need for a solution for the issue of how to handle memory when failure rates increase over a threshold value(Bao par 3 “As a capacity of the DRAM memory increases, a basic failure rate increases. Generally, after a memory error occurs, an error correction algorithm such as error checking and correction (ECC) may be used to correct the error. However, frequent error correction affects system performance. In addition, when a memory fault becomes more serious, the error correction algorithm is overloaded, and a probability of an uncorrected error increases greatly. As a result, the uncorrected error may occur, causing system breakdown.”) -- with Bao providing a known method to solve a similar problem. Bao provides “Embodiments of this application provide a memory fault handling method and apparatus, to reduce a probability of system breakdown caused by a memory fault.”(Bao par 5) Regarding claim 12 it is the method that the system of claim 6 implements and is rejected for the same reasons. Regarding claim 18 it is the non-transitory computer-readable medium containing instructions that the system of claim 6 implements and is rejected for the same reasons. Response to Arguments Applicant’s arguments, see remarks pg 7, filed 8/26/2025, with respect to the rejection have been fully considered and are persuasive. The rejection of 06/26/2025 has been withdrawn. Applicant’s arguments, see remarks pg 7-8, filed 8/26/2025, with respect to the rejection(s) of claim(s) 1 under 35 U.S.C. 103 as being unpatentable over US 20210019082 A1 (Berman) in view of US 20140082411 A1 (Warnes) have been fully considered and are persuasive. Therefore, the rejection has been withdrawn. However, upon further consideration, a new ground(s) of rejection is made in under 35 U.S.C. 103 as being unpatentable over US 20210019082 A1 (Berman) in view of US 20200111539 A1 (Yamaguchi). With respect to the independent claims, the applicant has argued that US 20210019082 A1 (Berman) in view of US 20140082411 A1 (Warnes) does not teach limitations “below a threshold, perform software-based PPR memory healing” and “above the threshold, perform hardware- based PPR memory healing”. Berman and the newly cited Yamaguchi teaches in the cited(Yamaguchi par 111 “Then, the BIOS 400 performs a monitoring setting of the row 112 to which the sPPR is applied to the row access monitoring unit 216 of the memory controller 210 (operation S11).”; Yamaguchi par 6 “The PPR includes an hPPR and an sPPR. In the hPPR, a fuse switches a faulty row to a spare row. Therefore, the repair by the hPPR may not be undone. In the sPPR, software switches a faulty row to a spare row.”; and Yamaguchi fig 1:620,630; fig 12B:S42,S43; par 83 “When Cancelcount exceeds a predetermined threshold, the sPPR effect management unit 620 notifies the hPPR data management unit 630 of the sPPR position information 621 and deletes the same information of the sPPR position information 621 and the sPPR position history 622.”). The examiner interprets this as limitations “below a threshold, perform software-based PPR memory healing” and “above the threshold, perform hardware- based PPR memory healing”. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. US 20210263646 A1 - Chin - memory controller determines an exact number of un-remapped redundant rows for a post-package repair. Same company Dell - 2021. US 20220027229 A1 - Chao - post package repair failure memory location reporting system. Also Dell. US 20150234707 A1 - Vogelsang - par 36 takes into account availability of repair resources like spare rows and ECC storage memory cells when deciding which repair mechanism to use. US 20170098480 A1 - Wilson - soft post package repair in memory. Does address matching US 20130254474 A1 - Berke - tracks and reports on units of memory systems that are in use US 20170200511 A1 - Warnes - does post package repair (PPR) data in non-volatile memory US 20150277790 A1 - Mozak - memory device mode registers that disable commands US 20240330133 A1 - Shukla - row error count threshold. Filed mar 2024 US 20140351673 A1 - Ware - bit and data word level row repair. Threshold is based either on bit or multi-bit errors. US 6480982 B1 - Chan - replaces DRAM when threshold number of errors found. Patented 2002. US 20240385754 A1 - Wu - operating system provides repair handler, which performs the PPR. US 20190108896 A1 - Berke - from the abstract: "communicate a command to the memory system requesting information associated with an availability of spare rows for post-package repair of the memory system and receive a response to the command, the command comprising the information associated with the availability" - also Dell, published 2019. Does not contain any error threshold limitations. US 20160162196 A1 - Camp - retires the page after the first threshold is met, retires the region if the region has too many errors, and retires the larger region if the larger region has too many errors. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL XU whose telephone number is (571)272-5688. The examiner can normally be reached Monday-Friday 8:00am - 5:00pm. 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, Bryce Bonzo can be reached at (571) 272-3655. 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. /MICHAEL XU/Examiner, Art Unit 2113
Read full office action

Prosecution Timeline

May 08, 2023
Application Filed
Jan 10, 2025
Non-Final Rejection — §103
Apr 14, 2025
Response Filed
Jun 25, 2025
Final Rejection — §103
Aug 26, 2025
Response after Non-Final Action
Sep 26, 2025
Request for Continued Examination
Oct 03, 2025
Response after Non-Final Action
Nov 22, 2025
Non-Final Rejection — §103
Feb 09, 2026
Applicant Interview (Telephonic)
Feb 09, 2026
Examiner Interview Summary
Feb 24, 2026
Response Filed
Apr 14, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12572503
APPLICATION LEVEL TO SHARE LEVEL REPLICATION POLICY TRANSITION FOR FILE SERVER DISASTER RECOVERY SYSTEMS
2y 5m to grant Granted Mar 10, 2026
Patent 12547498
POWER RECOVERY IN A NON-BOOTING INFORMATION HANDLING SYSTEM
2y 5m to grant Granted Feb 10, 2026
Patent 12468609
FAILOVER OF DOMAINS
2y 5m to grant Granted Nov 11, 2025
Patent 12380015
PREDICTING TESTS BASED ON CHANGE-LIST DESCRIPTIONS
2y 5m to grant Granted Aug 05, 2025
Patent 12360874
SYSTEMS AND METHODS FOR GOVERNING CLIENT-SIDE SERVICES
2y 5m to grant Granted Jul 15, 2025
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

5-6
Expected OA Rounds
77%
Grant Probability
99%
With Interview (+23.0%)
2y 8m
Median Time to Grant
High
PTA Risk
Based on 124 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