Prosecution Insights
Last updated: November 12, 2026
Application No. 19/267,860

METHOD AND APPARATUS FOR INSTRUCTION CHECKPOINTING IN A DATA PROCESSING DEVICE POWERED BY AN UNPREDICTABLE POWER SOURCE

Non-Final OA §102§103
Filed
Jul 14, 2025
Priority
Feb 10, 2020 — GB 2001782.8 +2 more
Examiner
JOHNSON, TERRELL S
Art Unit
2176
Tech Center
2100 — Computer Architecture & Software
Assignee
University of Southampton
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
97%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
439 granted / 505 resolved
+31.9% vs TC avg
Moderate +10% lift
Without
With
+10.3%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
15 currently pending
Career history
521
Total Applications
across all art units

Office Action

§102 §103
DETAILED ACTION Status of Claims Claims 1 – 8 are pending. Claim 1 is independent. This office action is Non-Final. 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 § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1, and 5 – 8 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Bahgsorkhi (US Patent Application Publication No. 2017/0045927). As per claim 1, Bahgsorkhi teaches a computer-implemented method comprising: generating computer executable code as one or more code portions [compiler parses source and divides it into a sequence of atomic transactions, each a basic block; coalesces them into coarser transactions, Fig. 3, blocks 302 – 306, 314, 0042 – 0043, 0047, 0054]; detecting a number of processing operations required to reach one or more predetermined stages [transaction ends with a commit function, 0046: the compiler computing device 102 may insert a call to a commit function at the end of each fine-grained transaction. Committing the transaction makes changes to volatile memory 146 variables persistent by writing the changes to a shadow copy of the volatile data 146 that is stored in the non-volatile memory 148.] in execution of each code portion [0043, 0047: in some embodiments, each fine-grained transaction may include four to five machine instructions. The compiler computing device 102 may use any technique to identify the fine-grained transactions. In some embodiments, in block 306 the compiler computing device 102 may identify the basic blocks of the computer program 202. Each fine-grained transaction may include a single basic block; in some embodiments the compiler computing device 102 may generate medium-grained transactions including about 50 machine instructions each as well as coarse-grained transactions including about 200 machine instructions each ]; and associating with each code portion one or more progress indicators, each representing a respective execution stage of the one or more predetermined stages within execution of that code portion [compiler inserts a commit_X call at the end of each transaction, 0046, 0056; the target computing device 104 updates a commit status flag to “in-progress” and once the commit status flag has successfully been changed to “in-progress,” then the target computing device 104 may resume the commit phase of the transaction after a power failure. The target computing device 104 may log the bookkeeping flags (including the commit status flag) to allow for recovery in the event of a power failure while updating the commit status, 0063 ]. As per claim 5, Bahgsorkhi The method of claim 1, in which the generating step comprises compiling computer source code into two or more code portions [0042 – 0043: the compiler compiles C/C++ code source and forms multiple transactions, 0047 - 0049]. As per claim 6 Bahgsorkhi teaches the method of claim 5, comprising: providing, as a final processing stage of at least some of the code portions, checkpoint data storage code configured to store at least one or more data values generated by that code portion [commit_X at the end of each transaction persists the volatile log to an non-volatile shadow copy, 0046, 0062 – 0065, fig. 10]; and providing, as an initial processing stage of at least some of the code portions, checkpoint data retrieval code configured to retrieve at least one or more data values generated by a preceding code portion [retrieval happens in a recovery routine run on reboot 0022, 0073 - 0075]. As per claim 7, Bahgsorkhi teaches the method of claim 1, in which a progress indicator of the one or more progress indicators represents a respective execution stage within execution of that code portion after which a processor executing that code portion should save a current state in response to an interruption of power supply to the processor [restartPC marks commit start/end positions used to decide what is restored, 0078, 0082, figs. 10 and 11. As per claim 8, Bahgsorkhi teaches a non-transitory, computer-readable storage medium which stores computer software which, when executed by a computer, causes the computer to perform the method of claim 1 [0020, 0083: in some embodiments, the methods 300, 600, and/or 700 may be embodied as various instructions stored on a computer-readable media, which may be executed by the processors 120, 140, a peripheral device 130, and/or other components of the compiler computing device 102 and/or the target computing device 104 to cause the corresponding compiler computing device 102 and/or target computing device 104 to perform the corresponding method 300, 600, and/or 700]. 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim 2 rejected under 35 U.S.C. 103 as being unpatentable over Bahgsorkhi (US Patent Application Publication No. 2017/0045927).B , in view of Courousse et al. (US Patent Application Publication No. 2020/0257805 A1, hereinafter “Courousse”). As per claim 2, Bahgsorkhi teaches the method of claim 1. However, Bahgsorkhi does not teach “… in which a progress indicator of the one or more progress indicators represents a respective execution stage within execution of that code portion as a number of processing operations already executed during execution of that code portion…”. Courousse is cited to teach a compiler that, for each basic block, counts the instructions inserted in the block an associates a resulting expected value with the block [0124 – 0126]. That value represents the number of instructions executed by the end of the block. Both Bahgsorkhi and Courousse are directed to marking/annotating instructions. As per claim 2, Courousse is cited to teach … in which a progress indicator of the one or more progress indicators represents a respective execution stage within execution of that code portion as a number of processing operations already executed during execution of that code portion [counter is initialized at block start and incremented as each protected instruction executes; at block end, it’s value is saved (cnt_prec) and must equal the compile time expected value 0110, 0128, 0135, 0209]. It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Courousse with Bahgsorkhi, as Courousse provides improvements by detecting faults and checks so corrupted transactions are caught before committing to non-volatile memory. Allowable Subject Matter Claims 3 and 4 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. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Jayakumar; Hrishikesh et al. (US Patent Application Publication No. 2017/0343987 A1) “Microcontroller Energy Management System” is cited to teach a microcontroller system which employs an intermediate approach in hybrid FRAM-SRAM that involves memory mapping of program sections to retain the reliability benefits provided by FRAM while performing almost as efficiently as an SRAM-based system. The system utilizes an energy-aware memory mapping method which maps different program sections to the hybrid FRAM-SRAM MCU such that energy consumption is minimized without sacrificing reliability. Seth, Anil et al. (US Patent Application Publication No. 2003/0014742) “Technique For Compiling Computer Code To Reduce Energy Consumption While Executing The Code” is cited to teach a technique for reducing power consumption during execution of computer code including power-down instructions, while satisfying user-specified real-time constraints on a microprocessor. In one example embodiment, this is accomplished by identifying one or more potential locations in the computer code where the power-down instructions can be inserted. The identified potential locations are then analyzed to select the locations to insert the power-down instructions based on user-specified real-time constraints so that the inserted power-down instructions reduces power consumption without significantly increasing the execution time of the computer code. Any inquiry concerning this communication or earlier communications from the examiner should be directed to TERRELL S JOHNSON whose telephone number is (571)270-3485. The examiner can normally be reached 10AM-7PM EST M-F. 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, Jaweed Abbaszadeh can be reached at 571-270-1640. 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. /TERRELL S JOHNSON/Primary Examiner, Art Unit 2176
Read full office action

Prosecution Timeline

Jul 14, 2025
Application Filed
Oct 21, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12792364
MANAGEMENT SYSTEM AND MANAGEMENT METHOD
2y 1m to grant Granted Nov 10, 2026
Patent 12783031
SERVER POWER SUPPLYING METHOD AND SYSTEM, DEVICE, AND MEDIUM
2y 1m to grant Granted Nov 03, 2026
Patent 12783034
INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM
2y 1m to grant Granted Nov 03, 2026
Patent 12783029
Printed Circuits with Embedded Resistive Thermal Devices
2y 1m to grant Granted Nov 03, 2026
Patent 12749906
POWER SUPPLY DEVICE AND POWER SUPPLY CONTROL CIRCUIT
2y 0m to grant Granted Sep 29, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
87%
Grant Probability
97%
With Interview (+10.3%)
Low
PTA Risk
Based on 505 resolved cases by this examiner. Grant probability derived from career allowance 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