Prosecution Insights
Last updated: November 04, 2026
Application No. 19/201,691

PROCESSOR FOR CONFIGURABLE PARALLEL COMPUTATIONS

Non-Final OA §103
Filed
May 07, 2025
Priority
Nov 29, 2023 — continuation of 12/327,116
Examiner
PETRANEK, JACOB ANDREW
Art Unit
2183
Tech Center
2100 — Computer Architecture & Software
Assignee
Star Ally International Limited
OA Round
1 (Non-Final)
80%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
Est. Remaining
89%
With Interview

Examiner Intelligence

Grants 80% — above average
80%
Career Allowance Rate
634 granted / 791 resolved
+25.2% vs TC avg
Moderate +8% lift
Without
With
+8.5%
Interview Lift
resolved cases with interview
Typical timeline
3y 9m
Avg Prosecution
22 currently pending
Career history
833
Total Applications
across all art units

Statute-Specific Performance

§101
4.2%
-35.8% vs TC avg
§103
57.1%
+17.1% vs TC avg
§102
16.4%
-23.6% vs TC avg
§112
14.2%
-25.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 791 resolved cases

Office Action

§103
DETAILED ACTION Claims 1-43 are pending. The office acknowledges the following papers: IDS filed on 7/10/2025, Power of Attorney filed on 4/12/2026. Election/Restriction Restriction to one of the following inventions is required under 35 U.S.C. 121: I. Claims 1-8, drawn to address generators for data operands in memory, classified in G06F9/355. II. Claims 9-17, drawn to first and second level processors with common control, classified in G06F15/8023. III. Claims 18-19, drawn to configurable state machines, classified in G06F9/4498. IV. Claims 20, 22-32, and 35-42, drawn to programmable data processors, classified in G06F15/7867. V. Claims 21 and 33-34, drawn to a substantial combination of inventions III and IV. VI. Claim 43, drawn to a substantial combination of inventions I and IV. The inventions are independent or distinct, each from the other because: Inventions I, II, III, and IV are related as subcombinations disclosed as usable together in a single combination. The subcombinations are distinct if they do not overlap in scope and are not obvious variants, and if it is shown that at least one subcombination is separately usable. In the instant case, subcombination I has separate utility such as providing address generation to memory based on a base address and an increment value. In the instant case, subcombination II has separate utility such as providing common control for first-level processors and second-level processors over first and second interconnection networks. In the instant case, subcombination III has separate utility such as providing configurable state machines with sequencers including building block circuits with state elements or loop elements. In the instant case, subcombination IV has separate utility such as providing a configurable data processor with a plurality of configurable pipeline circuits that include interconnection and ALU elements. See MPEP § 806.05(d). Inventions III and V are related as combination and subcombination. Inventions in this relationship are distinct if it can be shown that (1) the combination as claimed does not require the particulars of the subcombination as claimed for patentability, and (2) that the subcombination has utility by itself or in other combinations (MPEP § 806.05(c)). In the instant case, the combination as claimed does not require the particulars of the subcombination III as claimed because applicant’s inclusion of claim 20 serves as evidence that applicant believes that subcombination IV is patentable, and hence, patentability of the combination may be patentable due to subcombination IV and not necessarily due to subcombination III. Therefore, subcombination III is not essential to patentability of the combination. The subcombination III has separate utility such as providing configurable state machines with sequencers including building block circuits with state elements or loop elements. Inventions IV and V are related as combination and subcombination. Inventions in this relationship are distinct if it can be shown that (1) the combination as claimed does not require the particulars of the subcombination as claimed for patentability, and (2) that the subcombination has utility by itself or in other combinations (MPEP § 806.05(c)). In the instant case, the combination as claimed does not require the particulars of the subcombination IV as claimed because applicant’s inclusion of claim 18 serves as evidence that applicant believes that subcombination III is patentable, and hence, patentability of the combination may be patentable due to subcombination III and not necessarily due to subcombination IV. Therefore, subcombination IV is not essential to patentability of the combination. The subcombination IV has separate utility such as providing a configurable data processor with a plurality of configurable pipeline circuits that include interconnection and ALU elements. Inventions I and VI are related as combination and subcombination. Inventions in this relationship are distinct if it can be shown that (1) the combination as claimed does not require the particulars of the subcombination as claimed for patentability, and (2) that the subcombination has utility by itself or in other combinations (MPEP § 806.05(c)). In the instant case, the combination as claimed does not require the particulars of the subcombination I as claimed because applicant’s inclusion of claim 20 serves as evidence that applicant believes that subcombination IV is patentable, and hence, patentability of the combination may be patentable due to subcombination IV and not necessarily due to subcombination I. Therefore, subcombination I is not essential to patentability of the combination. The subcombination I has separate utility such as providing address generation to memory based on a base address and an increment value. Inventions IV and VI are related as combination and subcombination. Inventions in this relationship are distinct if it can be shown that (1) the combination as claimed does not require the particulars of the subcombination as claimed for patentability, and (2) that the subcombination has utility by itself or in other combinations (MPEP § 806.05(c)). In the instant case, the combination as claimed does not require the particulars of the subcombination IV as claimed because applicant’s inclusion of claim 1 serves as evidence that applicant believes that subcombination I is patentable, and hence, patentability of the combination may be patentable due to subcombination I and not necessarily due to subcombination IV. Therefore, subcombination IV is not essential to patentability of the combination. The subcombination IV has separate utility such as providing a configurable data processor with a plurality of configurable pipeline circuits that include interconnection and ALU elements. The examiner has required restriction between subcombinations usable together. Where applicant elects a subcombination and claims thereto are subsequently found allowable, any claim(s) depending from or otherwise requiring all the limitations of the allowable subcombination will be examined for patentability in accordance with 37 CFR 1.104. See MPEP § 821.04(a). Applicant is advised that if any claim presented in a divisional application is anticipated by, or includes all the limitations of, a claim that is allowable in the present application, such claim may be subject to provisional statutory and/or nonstatutory double patenting rejections over the claims of the instant application. The examiner has required restriction between combination and subcombination inventions. Where applicant elects a subcombination, and claims thereto are subsequently found allowable, any claim(s) depending from or otherwise requiring all the limitations of the allowable subcombination will be examined for patentability in accordance with 37 CFR 1.104. See MPEP § 821.04(a). Applicant is advised that if any claim presented in a divisional application is anticipated by, or includes all the limitations of, a claim that is allowable in the present application, such claim may be subject to provisional statutory and/or nonstatutory double patenting rejections over the claims of the instant application. Restriction for examination purposes as indicated is proper because all the inventions listed in this action are independent or distinct for the reasons given above and there would be a serious search and/or examination burden if restriction were not required because one or more of the following reasons apply: Because these inventions are independent or distinct for the reasons given above and there would be a serious burden on the examiner if the restriction is not required because the inventions require a different field of search (see MPEP 808.02), restriction for examination purposes as indicated is proper. Applicant is advised that the reply to this requirement to be complete must include (i) an election of an invention to be examined even though the requirement may be traversed (37 CFR 1.143) and (ii) identification of the claims encompassing the elected invention. The election of an invention may be made with or without traverse. To reserve a right to petition, the election must be made with traverse. If the reply does not distinctly and specifically point out supposed errors in the restriction requirement, the election shall be treated as an election without traverse. Traversal must be presented at the time of election in order to be considered timely. Failure to timely traverse the requirement will result in the loss of right to petition under 37 CFR 1.144. If claims are added after the election, applicant must indicate which of these claims are readable upon the elected invention. Should applicant traverse on the ground that the inventions are not patentably distinct, applicant should submit evidence or identify such evidence now of record showing the inventions to be obvious variants or clearly admit on the record that this is the case. In either instance, if the examiner finds one of the inventions unpatentable over the prior art, the evidence or admission may be used in a rejection under 35 U.S.C. 103 or pre-AIA 35 U.S.C. 103(a) of the other invention. During a telephone conversation with Edward C. Kwok on 9/16/2026 a provisional election was made without traverse to prosecute the invention of subcombination IV, claims 20, 22-32, and 35-42. Affirmation of this election must be made by applicant in replying to this Office action. Claims 1-19, 21, 33-34, and 43 are withdrawn from further consideration by the examiner, 37 CFR 1.142(b), as being drawn to a non-elected invention. Applicant is reminded that upon the cancelation of claims to a non-elected invention, the inventorship must be corrected in compliance with 37 CFR 1.48(a) if one or more of the currently named inventors is no longer an inventor of at least one claim remaining in the application. A request to correct inventorship under 37 CFR 1.48(a) must be accompanied by an application data sheet in accordance with 37 CFR 1.76 that identifies each inventor by his or her legal name and by the processing fee required under 37 CFR 1.17(i). Allowable Subject Matter Claims 24-26, 32, and 38 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. As allowable subject matter has been indicated, applicant's reply must either comply with all formal requirements or specifically traverse each requirement not complied with. See 37 CFR 1.111(b) and MPEP § 707.07(a). Priority The effective filing date for the subject matter defined in the pending claims in this application is 11/29/2023. Drawings The Examiner contends that the drawings submitted on 5/7/2025 are acceptable for examination proceedings. Specification The disclosure is objected to because of the following informalities: The lengthy specification has not been checked to the extent necessary to determine the presence of all possible minor errors. The Applicant’s cooperation is requested in correcting any errors of which the Applicant may become aware. The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. Appropriate correction is required. 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 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 of this title, 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. Claims 20, 22-23, 27-31, and 40-41 are rejected under 35 U.S.C. 103 as being unpatentable over Hua (U.S. 2021/0200710), in view of Clarke et al. (U.S. 2023/0057903). As per claim 20: Hua disclosed a programmable data processor, comprising a plurality of configurable pipeline circuits (Hua: Figure 1 elements 101-1 to 101-16, paragraph 15)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks.), each configurable pipeline circuit comprising a plurality of configurable interconnection elements (Hua: Figure 1 elements 102-1 to 102-5, paragraphs 15-16)(The PLFs provide a configurable interconnect.) and a plurality of arithmetic and logic circuits (Hua: Figures 1-2 elements 101-1 to 101-16 and 200, paragraphs 15 and 18). Hua failed to teach wherein the configurable pipeline circuit is configured by interconnecting a selected group of the arithmetic or logic circuits by the configurable interconnection elements into a pipeline for carrying out a predetermined arithmetic or logic function under control of a configurable state machine. However, Clarke combined with Hua disclosed wherein the configurable pipeline circuit is configured by interconnecting a selected group of the arithmetic or logic circuits by the configurable interconnection elements into a pipeline for carrying out a predetermined arithmetic or logic function under control of a configurable state machine (Clarke: Figure 1 elements 102 and 106, paragraph 44)(Hua: Figures 1-2 elements 101-1 to 101-16 and 200, paragraphs 15 and 18)(Hua disclosed the array of SPUs that can be configured as pipeline stages for a pipelined task. Hua also disclosed that the SPUs include ALUs. Clarke disclosed an array controller being implemented as a programmable state machine. The combination allows for controlling the SPU array of Hua using the programmable state machine of Clarke.). The advantage of implementing a controller using a programmable state machine is that controls can be later updated for additional functionality. Thus, it would have been obvious to one of ordinary skill in the art at the time of the effective filing date to implement the programmable state machine of Clarke into Hua for the above advantage. As per claim 22: Hua and Clarke disclosed the programmable data processor of Claim 20, wherein each configurable state machine further comprises a control circuit that initiates operation of each sequencer of the configurable state machine (Clarke: Figures 1 and 16C elements 102 and 106-1-2, paragraphs 44 and 194)(Hua: Figures 1-2 elements 101-1 to 101-16 and 200, paragraphs 15 and 18)(Hua disclosed the array of SPUs can be configured as pipeline stages for a pipelined task. Hua also disclosed that the SPUs include ALUs. Clarke disclosed an array controller being implemented as a programmable state machine. Clarke also disclosed multiple array controllers that separately control a partition of the processing array. The combination allows for controlling the SPU array of Hua using the programmable state machine(s) of Clarke.). As per claim 23: Hua and Clarke disclosed the programmable data processor of Claim 20, wherein a first set of results generated from an operation in a first one of the configurable pipeline circuits is provided as input data for an operation in a second one of the configurable pipeline circuits (Hua: Figure 1 elements 101-1 to 101-16, paragraph 15)(The array of SPUs can be configured as pipeline stages for a pipelined task. Computational results from a first SPU is given to a second SPU in the pipeline.). As per claim 27: Hua and Clarke disclosed the programmable data processor of Claim 20, wherein the configurable pipeline circuits are organized into a plurality of groups, each group of the configurable pipeline circuits further comprising a stream processor (Hua: Figure 1 elements 101-1 to 101-16, paragraph 15)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks), and wherein the stream processors are interconnected to each other by a plurality of stream processor-level programmable interconnection elements (Hua: Figure 1 elements 102-1 to 102-5, paragraphs 15-16)(The PLFs provide a configurable interconnect.). As per claim 28: Hua and Clarke disclosed the programmable data processor of Claim 27 wherein, within each group of configurable pipeline circuits, the pipeline of a first one of the configurable pipeline circuits is connected to the pipeline of a second one of configurable pipeline circuits by configuring their respective interconnection elements (Hua: Figure 1 elements 101-1 to 101-16 and 102-1 to 102-5, paragraphs 15-16)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks. The PLFs provide a configurable interconnect, which is used to provide a connection between an output of a first SPU and an input of a second SPU.). As per claim 29: Hua and Clarke disclosed the programmable data processor of Claim 27, wherein between a first group of configurable pipeline circuits and a second group of configurable pipeline circuits, a first one of the configurable pipeline circuits in the first group is connected to the pipeline of a configurable pipeline circuits of the second group by configuring both their respective interconnection elements and the stream processor-level interconnection elements (Hua: Figure 1 elements 101-1 to 101-16 and 102-1 to 102-5, paragraphs 15-16)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks. The PLFs provide a configurable interconnect, which is used to provide a connection between an output of a first SPU and an input of a second SPU.). As per claim 30: Hua and Clarke disclosed the programmable data processor of Claim 29, wherein both the first configurable pipeline circuit and the second configurable pipeline circuit are within one of the groups of the programmable pipeline processors (Hua: Figure 1 elements 101-1 to 101-16 and 102-1 to 102-5, paragraphs 15-16)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks. The PLFs provide a configurable interconnect, which is used to provide a connection between an output of a first SPU and an input of a second SPU.). As per claim 31: Hua and Clarke disclosed the programmable data processor of Claim 29, wherein the first configurable pipeline circuit is part of a first one of the groups of configurable pipeline circuits and wherein the second configurable pipeline circuit is part of a second one of the groups of configurable pipeline circuits (Hua: Figure 1 elements 101-1 to 101-16 and 102-1 to 102-5, paragraphs 15-16)(The array of SPUs can be configured as pipeline stages for a pipelined task. Multiple groups of SPUs can be configured for different tasks. The PLFs provide a configurable interconnect, which is used to provide a connection between an output of a first SPU and an input of a second SPU.). As per claim 40: Hua and Clarke disclosed the programmable data processor of Claim 20, further comprising an interface with an external host processor (Hua: Figure 2 element 104, paragraph 19)(A host CPU connects to the SPUs via a global bus.). As per claim 41: Hua and Clarke disclosed the programmable data processor of Claim 40, further comprising a first plurality of configuration registers accessible to the external host processor, the configuration registers being provided for the external host processor to configure the pipeline in each configurable pipeline circuit in the programmable data processor (Hua: Figure 2 elements 104 and 200, paragraphs 18 and 21-23)(During a configuration phase, the host CPU can write into configuration registers to configure SPU elements.). Claims 35-37 and 39 are rejected under 35 U.S.C. 103 as being unpatentable over Hua (U.S. 2021/0200710), in view of Clarke et al. (U.S. 2023/0057903), in view of Official Notice. As per claim 35: Hua and Clarke disclosed the programmable data processor of Claim 20, wherein each configurable pipeline circuit further comprises a plurality of registers for storing operands and results (Hua: Figure 2 element 206, paragraph 21)(Official notice is given that processor elements in an array can include local registers for the advantage of quickly accessing input data and quickly writing output results. Thus, it would have been obvious to one of ordinary skill in the art to implement a local register file within each SPU.). As per claim 36: Hua and Clarke disclosed the programmable data processor of Claim 35, wherein each configurable pipeline circuit further comprises a memory circuit for storing the operands and the results (Hua: Figure 2 element 206, paragraph 21). As per claim 37: Hua and Clarke disclosed the programmable data processor of Claim 36, wherein the control circuit of each configurable pipeline circuit executes a program stored in the memory circuit, the program comprising instructions of a common instruction set (Hua: Figure 2 elements 203-204, paragraph 19). As per claim 39: Hua and Clarke disclosed the programmable data processor of Claim 37, wherein the common instruction set comprises instructions for data transfers between the registers and the memory (Hua: Figure 2 element 206, paragraph 21)(Official notice is given that ISAs can include load/store instructions for the advantage of moving data between memory and registers for faster access to inputs. Thus, it would have been obvious to one of ordinary skill in the art to implement load/store instructions in the combination.). Claim 42 is rejected under 35 U.S.C. 103 as being unpatentable over Hua (U.S. 2021/0200710), in view of Clarke et al. (U.S. 2023/0057903), further in view of Montagne et al. (U.S. 2005/0027505). As per claim 42: Hua and Clarke disclosed the programmable data processor of Claim 20. Hua and Clarke failed to teach a plurality of look-up tables, each designated for storing a configuration of the programmable interconnection elements, wherein the control circuit retrieves one or more of the configurations from the look-up tables to configure the programmable interconnection elements. However, Montagne combined with Hua and Clarke disclosed a plurality of look-up tables, each designated for storing a configuration of the programmable interconnection elements, wherein the control circuit retrieves one or more of the configurations from the look-up tables to configure the programmable interconnection elements (Montagne: Figure 8 element 800, paragraphs 6-8, 41-45)(Hua: Figure 1 elements 102-1 to 102-5, paragraphs 15-16)(Montagne disclosed a LUT that stores configuration data for a reconfigurable interconnect. Hua disclosed PLFs that provide a configurable interconnect. The combination implements the LUTs of Montagne to store configuration data to reconfigure the interconnect of Hua.). The advantage of using the configuration LUT of Montagne is that the number of bits needed to reconfigure the interconnect is reduced (Montagne: Paragraph 7). Thus, it would have been obvious to one of ordinary skill in the art at the time of the effective filing date to implement the configuration LUT of Montagne into the system of Hua for the above advantage. Conclusion The following is text cited from 37 CFR 1.111(c): In amending in reply to a rejection of claims in an application or patent under reexamination, the applicant or patent owner must clearly point out the patentable novelty which he or she thinks the claims present in view of the state of the art disclosed by the references cited or the objections made. The applicant or patent owner must also show how the amendments avoid such references or objections. The prior art made of record and not relied upon is considered pertinent to applicant’s disclosure. Greathouse et al. (U.S. 2023/0108234), taught labeling workloads. Any inquiry concerning this communication or earlier communications from the examiner should be directed to JACOB A. PETRANEK whose telephone number is (571)272-5988. The examiner can normally be reached on M-F 8:00-4:30. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Jyoti Mehta can be reached on (571) 270-3995. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /JACOB PETRANEK/Primary Examiner, Art Unit 2183
Read full office action

Prosecution Timeline

May 07, 2025
Application Filed
Sep 21, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12783242
SYSTEMS, METHODS, AND APPARATUS FOR INTERMEDIARY REPRESENTATIONS OF WORKFLOWS FOR COMPUTATIONAL DEVICES
3y 4m to grant Granted Nov 03, 2026
Patent 12775467
SEPARATE BRANCH TARGET BUFFERS FOR DIFFERENT LEVELS OF CALLS
4y 1m to grant Granted Oct 27, 2026
Patent 12775385
Memory Request Combination Indication
3y 5m to grant Granted Oct 27, 2026
Patent 12769545
CONFIGURABLE PIPELINE TO PROVIDE NON-SYSTOLIC AND SYSTOLIC OUTPUTS IN CALCULATION
5y 11m to grant Granted Oct 20, 2026
Patent 12769527
METHOD AND APPARATUS FOR COMPILING FOR OVERLAPPING INSTRUCTIONS ON MULTIPLE PROCESSORS
2y 8m to grant Granted Oct 20, 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
80%
Grant Probability
89%
With Interview (+8.5%)
3y 9m (~2y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 791 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