Prosecution Insights
Last updated: July 17, 2026
Application No. 18/621,597

RESOURCE MANAGEMENT

Non-Final OA §112
Filed
Mar 29, 2024
Priority
Mar 29, 2023 — GB 2304585.9
Examiner
KIM, SISLEY NAHYUN
Art Unit
Tech Center
Assignee
Imagination Technologies Limited
OA Round
1 (Non-Final)
89%
Grant Probability
Favorable
1-2
OA Rounds
4m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 89% — above average
89%
Career Allowance Rate
608 granted / 683 resolved
+29.0% vs TC avg
Strong +16% interview lift
Without
With
+15.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
21 currently pending
Career history
712
Total Applications
across all art units

Statute-Specific Performance

§101
1.6%
-38.4% vs TC avg
§103
81.0%
+41.0% vs TC avg
§102
13.4%
-26.6% vs TC avg
§112
1.8%
-38.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 683 resolved cases

Office Action

§112
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 Objections Claims 1-5, 8, 9, 13-17 are objected to because of the following informalities: Claims 1 and 13 disclose “a shared register allocation cache.” Dependent claims 2, 3, 14, and 15 recite “searching a shared register allocation cache.” Because the cache was already disclosed in parent claim 1 and 13, the dependent claims should recite searching the shared register allocation cache. Claims 5 and 17 disclose “wherein allocating shared registers to the allocating task and updating a cache entry to record the allocation comprises: …” (emphasis added) that refers to the step “allocating shared registers to the allocating task and assigning a cache entry to record the allocation” (emphasis added) in parent claim 4 and 16 respectively. It is recommended to amend the phrase to change “updating” to “assigning” to resolve terminology mismatches. Claim 8 discloses “shared resources identified in a cache entry.” Since parent claim 1 discloses “shared register allocations,” it is recommended to change “shared resources” to “shared registers.” Claim 9 discloses “a valid bit and a cache index (and an allocation base, wherein the valid bit...” There is an opening parenthesis before “and an allocation base” It is recommended to amend the phrase to remove the opening parenthesis. Claim 16 discloses “The shared register allocation cache according to claim 13, the shared register resource manager is arranged … “. It is missing the transition word and should disclose “The shared register allocation cache according to claim 13, wherein the shared register resource manager is arranged … ” (emphasis added). Claim Rejections - 35 USC § 112 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 pre-AIA 35 U.S.C. 112, 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 6, 12, and 18 are rejected under 35 U.S.C. 112(b) or pre-AIA 35 U.S.C. 112, 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 pre-AIA the applicant regards as the invention. Claims 6 and 18 disclose “a counter” instead of referring back to a previously disclosed counter. For example, it recites incrementing a counter, then later decrementing a counter, and finally concludes if the counter... is zero. It is unclear if these are all the same counter or multiple different counters. If it is the same counter, subsequent references must be to “the counter.” For the purpose of examination, it is interpreted as same counter. Claim 12 discloses “… evicting the eligible cache entry …” (line 13, emphasis added). However, the scope of limitation of is indefinite due to lack of antecedent basis. For the purpose of examination, it is interpreted as “an eligible cache entry.” Allowable Subject Matter Claims 1-5, 7-11, 13-17, 19, and 20 are allowed. Claims 6, 12, and 18 would be allowable if rewritten to overcome the rejection(s) under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), 2nd paragraph, set forth in this Office action and to include 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. The Sideris et al. (US 2023/0062386) discloses “Each thread of a group of one or more execution threads that are executing a shader program will have an associated set of registers to be used for storing data for the execution thread; Where there are plural execution units, each execution unit may have its own distinct group of registers (register file), or there may be a single group of registers (register file) shared between plural (e.g. some or all) of the separate execution units” (paragraph [0129]), “The warp manager 34 will then check if the PC 801 hits in the instruction cache 802 and gets back a link to the cache line and offset to the instruction. If it doesn't hit, the spawned thread group will wait until the instructions are loaded into the instruction cache 802” (paragraph [0223], emphasis added), and “When the instructions for the shader program that the thread group is spawned for are present in the instruction cache 802, the thread group execution controller (scheduler) 803 then issues the thread group to a processing element (execution unit) 32 to execute the instructions in the shader program (‘warp_issue’))” (paragraph [0224], emphasis added). The claim requires that a cache hit prevents the task from being issued because the allocation is already known/cached and doesn’t need to be re-calculated or re-issued to an allocator. However, Sideris discloses that a cache hit in the instruction cache is exactly what causes the thread group to be issued. Thus, Sideris cannot anticipate or render obvious a claim limitation when it explicitly teaches the exact opposite behavior. Damani et al. (US 2023/0144553) discloses “Within the physical register file 402, some registers are allocated to particular threads (per-thread allocated registers 408). Some sets of registers are not allocated but are reserved for use by threads within particular thread blocks (intra-block reuse pool 406) … Threads not in any of these allocations or reservations are “free” and available for use by any thread that needs them” (paragraph [0072]), “[0075] For example, when a thread or warp is releasing allocated state 502 registers acquired from any one of the free state 508, inter-block reserved state 504, or intra-block reserved state 506, it may check the status of other threads or warps in its thread block to determine whether or not they need additional registers. If not, the thread or warp may issue an inter-block release instruction for the allocated state 502 registers, placing them into the inter-block reserved state 504. Otherwise the thread or warp may issue an intra-block release instruction to place the allocated state 502 registers into the intra-block reserved state 506” (paragraph [0075]), and “Here a status value of “1” indicates the register is allocated. A status or thread value of “0” indicates the register is not allocated. A value of “0” in the thread block field indicates the register is not reserved for a particular thread block” (paragraph [0080]). The cited passages disclose register allocation states and reuse behavior, not a shared register allocation cache that returns a cache-hit identifier and prevents issuance of the allocating task as required by claim. Atluri et al. (US 2024/0118899) discloses “shared register access and use of shared memory/L1 cache by threads in a block” (paragraphs [0032] and [0138]). However, Atluri do not disclose a shared register allocation cache, cache entries indexed by a secondary program, or returning cache-hit information that prevents issuance of the allocating task. Alexander et al. (US 2020/0210192) discloses “shared registers and reuse of code cached in a repeat cache” (paragraphs [0032]-[0034]). However, Alexander do not disclose a shared register allocation cache that stores allocation records keyed by a secondary program, nor do they disclose returning a cache-hit identifier whose effect is to prevent issuance of the allocating task Any inquiry concerning this communication or earlier communications from the examiner should be directed to SISLEY N. KIM whose telephone number is (571)270-7832. The examiner can normally be reached M-F 11:30AM -7:30PM. 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, April Y. Blair can be reached on (571)270-1014. 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. /SISLEY N KIM/Primary Examiner, Art Unit 2196 6/8/2026
Read full office action

Prosecution Timeline

Mar 29, 2024
Application Filed
Jun 10, 2026
Non-Final Rejection mailed — §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681755
INTELLIGENT/FAST DATA CONFIDENCE FABRIC NETWORK DELIVERY
3y 3m to grant Granted Jul 14, 2026
Patent 12681770
MANAGING DISTRIBUTED PROCESSES
2y 12m to grant Granted Jul 14, 2026
Patent 12675323
BACKGROUND MAINTENANCE TASK REGULATION AND SCHEDULING
2y 10m to grant Granted Jul 07, 2026
Patent 12657070
PROCESSING METHODS, SYSTEMS, DEVICES, AND STORAGE MEDIUMS IN DISTRIBUTED FRAMEWORKS
3y 3m to grant Granted Jun 16, 2026
Patent 12650856
JAVA BYTECODE INJECTION METHODS AND APPARATUSES, ELECTRONIC DEVICES, AND STORAGE MEDIA
2y 7m to grant Granted Jun 09, 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
89%
Grant Probability
99%
With Interview (+15.8%)
2y 7m (~4m remaining)
Median Time to Grant
Low
PTA Risk
Based on 683 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