Prosecution Insights
Last updated: April 19, 2026
Application No. 18/984,278

NON-STALLING, NON-BLOCKING TRANSLATION LOOKASIDE BUFFER INVALIDATION

Non-Final OA §DP
Filed
Dec 17, 2024
Examiner
KHAN, MASUD K
Art Unit
2132
Tech Center
2100 — Computer Architecture & Software
Assignee
Texas Instruments Incorporated
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
2y 6m
To Grant
93%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allow Rate
373 granted / 428 resolved
+32.1% vs TC avg
Moderate +6% lift
Without
With
+6.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
34 currently pending
Career history
462
Total Applications
across all art units

Statute-Specific Performance

§101
2.0%
-38.0% vs TC avg
§103
63.3%
+23.3% vs TC avg
§102
16.8%
-23.2% vs TC avg
§112
10.5%
-29.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 428 resolved cases

Office Action

§DP
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 . Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claim 1 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 2 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 3 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 4 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 3 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 5 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 6 of U.S. Patent No. 11,663,141 in view of Seiler [US 2017/0084000 A1]. Seiler teaches “generating an address transaction based on the address translation request; and based on the virtual address specified by the address translation request hitting the TLB, providing the address transaction to a memory for processing without walking the page table to determine a physical address for the virtual address specified by the address translation request.” as “translation tables in virtual memory may perform well provided that the translation look aside buffers (TLBs) convert most page addresses without performing the page walk.” [¶0048] Claim 6 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 3 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 8 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 8 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 9 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 9 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 10 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 10 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 11 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 12 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 13 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 14 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 3 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 15 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 6 of U.S. Patent No. 11,663,141 in view of Seiler [US 2017/0084000 A1]. Seiler teaches “generating an address transaction based on the address translation request; and based on the virtual address specified by the address translation request hitting the TLB, providing the address transaction to a memory for processing without walking the page table to determine a physical address for the virtual address specified by the address translation request.” as “translation tables in virtual memory may perform well provided that the translation look aside buffers (TLBs) convert most page addresses without performing the page walk.” [¶0048] Claim 16 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 3 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 18 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 8 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 19 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 9 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Claim 20 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 10 of U.S. Patent No. 12,210,459. Although the claims at issue are not identical, they are not patentably distinct from each other because all limitations of instant application are taught by the parent patent. Allowable Subject Matter The following is a statement of reasons for the indication of allowable subject matter: Independent claim 1 recites the following allowable subject matter: “based on a virtual address specified by the address invalidation request hitting a translation lookaside buffer (TLB) of the MMU, generating an invalidation match transaction;” Closest prior art Chatterjee et al. [US 2020/0371951] appears to teach a MMU for processing core and managing memory, a TLB cache for mapping virtual addresses to real address, address invalidation request receiving and processing. Venkatachar et al. [US 10,635,591] appears to teach comparing invalidation tag matching. However, the prior arts on record do not appear to teach or fairly suggest the recited allowable subject matter. Based on this rationale, claim 1 and its dependent claims 2-10 are considered allowable upon overcoming the double patenting rejection. Independent claim 11 recites the following allowable subject matter: “generate an invalidation match transaction based on a virtual address specified by the address invalidation request hitting the TLB;” Closest prior art Chatterjee et al. [US 2020/0371951] appears to teach a MMU for processing core and managing memory, a TLB cache for mapping virtual addresses to real address, address invalidation request receiving and processing. Venkatachar et al. [US 10,635, 591] appears to teach comparing invalidation tag matching. However, the prior arts on record do not appear to teach or fairly suggest the recited allowable subject matter. Based on this rationale, claim 11 and its dependent claims 12-20 are considered allowable upon overcoming the double patenting rejection. Claims 7 and 17 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 Any inquiry concerning this communication or earlier communications from the examiner should be directed to MASUD K KHAN whose telephone number is (571)270-0606. The examiner can normally be reached Monday-Friday (8am-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, Hosain Alam can be reached on (571) 272-3978. 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. /MASUD K KHAN/Primary Examiner, Art Unit 2132
Read full office action

Prosecution Timeline

Dec 17, 2024
Application Filed
Mar 10, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602328
MEMORY DEVICE, SYSTEM INCLUDING THE SAME, AND OPERATING METHOD OF MEMORY DEVICE
2y 5m to grant Granted Apr 14, 2026
Patent 12591778
SYSTEM AND METHOD FOR TORQUE-BASED STRUCTURED PRUNING FOR DEEP NEURAL NETWORKS
2y 5m to grant Granted Mar 31, 2026
Patent 12585592
TAG SIZE REDUCTION USING MULTIPLE HASH FUNCTIONS
2y 5m to grant Granted Mar 24, 2026
Patent 12579473
REQUIREMENTS DRIVEN MACHINE LEARNING MODELS FOR TECHNICAL CONFIGURATION
2y 5m to grant Granted Mar 17, 2026
Patent 12572463
STORAGE DEVICE AND OPERATING METHOD OF THE STORAGE DEVICE
2y 5m to grant Granted Mar 10, 2026
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

1-2
Expected OA Rounds
87%
Grant Probability
93%
With Interview (+6.3%)
2y 6m
Median Time to Grant
Low
PTA Risk
Based on 428 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