Prosecution Insights
Last updated: August 17, 2026
Application No. 17/858,175

SYSTEM AND METHOD OF PREFETCHING ARRAY SEGMENTS

Final Rejection §112
Filed
Jul 06, 2022
Examiner
ALLI, KASIM A
Art Unit
2183
Tech Center
2100 — Computer Architecture & Software
Assignee
Huawei Technologies Co., Ltd.
OA Round
6 (Final)
65%
Grant Probability
Favorable
7-8
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 65% — above average
65%
Career Allowance Rate
123 granted / 188 resolved
+10.4% vs TC avg
Strong +36% interview lift
Without
With
+35.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
18 currently pending
Career history
209
Total Applications
across all art units

Statute-Specific Performance

§101
3.2%
-36.8% vs TC avg
§103
53.8%
+13.8% vs TC avg
§102
17.3%
-22.7% vs TC avg
§112
21.7%
-18.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 188 resolved cases

Office Action

§112
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 response to the amendment filed on 09/15/2025. Claims 1-4, 7-8, 11-12, and 17-27 are pending. Claims 1, 4, and 7-8 are amended. Claims 5-6, 9-10, and 13-16 are canceled. Claims 17-27 are new. Response to Arguments Applicant’s arguments, see Remarks pages 6-7, filed 09/15/2025, with respect to the rejection(s) of claim(s) 1 under 35 U.S.C. 103 have been fully considered and are persuasive. Specifically, the argument that the amendment “identifying portions of data in the array segment where hash-like accesses occurred more than a predetermined count within a predetermined window of loop iterations” is not taught by Cavus and Meier was found to be persuasive. Therefore, the rejection has been withdrawn. However, this amendments raises new matter issues and a new rejection under 35 U.S.C. 112(a) is given below. Claim Objections Claim 4 is objected to because of the following informalities: Claim 4 line 1- insert --the portions of-- before “data” to clarify that this refers to the prefetching of the portions of data introduced in claim 1. Appropriate correction is required. Claim Rejections - 35 USC § 112 The following is a quotation of the first paragraph of 35 U.S.C. 112(a): (a) IN GENERAL.—The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor or joint inventor of carrying out the invention. The following is a quotation of the first paragraph of pre-AIA 35 U.S.C. 112: The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor of carrying out his invention. Claims 1-4, 7-8, 11-12, and 17-27 are rejected under 35 U.S.C. 112(a) or 35 U.S.C. 112 (pre-AIA ), first paragraph, as failing to comply with the written description requirement. The claim(s) contains subject matter which was not described in the specification in such a way as to reasonably convey to one skilled in the relevant art that the inventor or a joint inventor, or for applications subject to pre-AIA 35 U.S.C. 112, the inventor(s), at the time the application was filed, had possession of the claimed invention. Claim 1 recites “identifying portions of data in the array segment where hash-like accesses occurred more than a predetermined count within a predetermined window of loop iterations” in lines 5-7. However, the specification at [0058] discloses “At block 402, the compiler detects hash accesses which are in a loop. Generally, hash access in a loop may be necessary to ensure that there is a high enough frequency of accesses to pay for the cost of the optimization. Otherwise, if the hash accesses are too infrequent, the optimization may slow down execution more than the improved prefetching improves execution.” That is, [0058] describes detecting hash accesses that are in a loop to ensure that there is a high enough frequency of accesses, which is not the same as “identifying portions of data in the array segment where hash-like accesses occurred more than a predetermined count within a predetermined window of loop iterations” (as recited in claim 1) since hash accesses in a loop can be identified without having to identify that the accesses occurred more than a predetermined count within a predetermined window of loop iterations (for example, by just checking if the access is performed in a single iteration of the loop). [0057] discloses that “The compiler may be configured to identify segments of code where hash-like accesses are performed often enough to warrant the use of a PMU” but this also does not describe identifying portions of data where hash-like accesses occurred more than a predetermined count within a predetermined window of loop iterations. No other portion of the specification describes identifying data where hash-like accesses occur more than a predetermined count within a predetermined window of loop iterations. Claim 8 recites a similar limitation in lines 10-12 and is rejected for similar reasons. The dependent claims are rejected based on their dependence from claims 1 and 8. The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 18-25 rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 18 recites “the code” in line 1. There is insufficient antecedent basis for this limitation in the claim. Claim 20 recites “the allocated prefetcher management unit resources” in line 3. There is insufficient antecedent basis for this limitation as the claim does not introduce allocated prefetcher management unit resources. Claim 22 recites “the address in memory where a given hash table begins” in line 2. There is insufficient antecedent basis for this limitation as the claim does not introduce an address in memory where a given hash table begins. Claim 24 recites “each loop iteration” in line 3. It is unclear whether this refers to each loop iteration of the number of loop iterations introduced in line 2 or each loop iteration of the window of loop iterations introduced in claim 1. Claim 25 recites “per handle” in lines 2-3. There is insufficient antecedent basis for this limitation as the claim does not introduce handles. Claims dependent on a rejected base claim are further rejected based on their dependence. Prior Art Considerations The prior art of record was not found to teach, in combination with other limitations in the claims, identifying portions of data in the array segment where hash-like accesses occurred more than a predetermined count within a predetermined window of loop iterations, as described in claims 1 and 8. While sec. 2.1 of Cavus teaches a compiler that identifies a loop and passes extracted indirect-access information to a hardware component (which indicates that Cavus identifies portions of an array that are accessed using hash-like accesses in a loop/at the predetermined frequency of the loop), Cavus does not teach the compiler identifying portions of data where hash-like accesses occur more than a predetermined count within a predetermined window of loop iterations. Meier was not found to cure this deficiency in Cavus. While no prior art rejection is currently given for claims 1-4, 7-8, 11-12, and 17-27, these claims are currently rejected under 112(a) and are thus not allowable at the current point. Examiner notes that amendments to resolve the new matter issues would likely impact the prior art considerations. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KASIM ALLI whose telephone number is (571)270-1476. The examiner can normally be reached Monday - Friday 9am 5pm. 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, Andrew Caldwell can be reached on (571) 272-3702. 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. /KASIM ALLI/Examiner, Art Unit 2182 /JYOTI MEHTA/Supervisory Patent Examiner, Art Unit 2183
Read full office action

Prosecution Timeline

Show 9 earlier events
Dec 04, 2024
Response Filed
Jan 10, 2025
Final Rejection mailed — §112
Mar 11, 2025
Response after Non-Final Action
Apr 10, 2025
Request for Continued Examination
Apr 14, 2025
Response after Non-Final Action
Jun 16, 2025
Non-Final Rejection mailed — §112
Sep 15, 2025
Response Filed
May 26, 2026
Final Rejection mailed — §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12705052
INTERRUPTIBLE AND RESTARTABLE MATRIX MULTIPLICATION INSTRUCTIONS, PROCESSORS, METHODS, AND SYSTEMS
1y 7m to grant Granted Aug 11, 2026
Patent 12645453
DATA TRANSFER FOR VECTORS IN NEURAL NETWORKS
3y 8m to grant Granted Jun 02, 2026
Patent 12639072
REDUCING INSTRUMENTATION CODE BLOAT AND PERFORMANCE OVERHEADS USING A RUNTIME CALL INSTRUCTION
3y 11m to grant Granted May 26, 2026
Patent 12632256
PREFETCH REQUEST GENERATION
1y 12m to grant Granted May 19, 2026
Patent 12632255
RESERVATION STATION WITH MULTIPLE ENTRY TYPES
1y 11m to grant Granted May 19, 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

7-8
Expected OA Rounds
65%
Grant Probability
99%
With Interview (+35.8%)
3y 3m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 188 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