Prosecution Insights
Last updated: July 05, 2026
Application No. 18/086,030

METHOD AND APPARATUS TO AGGREGATE OBJECTS TO BE STORED IN A MEMORY TO OPTIMIZE THE MEMORY BANDWIDTH

Final Rejection §103
Filed
Dec 21, 2022
Examiner
KHAN, MASUD K
Art Unit
2132
Tech Center
2100 — Computer Architecture & Software
Assignee
Intel Corporation
OA Round
2 (Final)
87%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
387 granted / 443 resolved
+32.4% vs TC avg
Moderate +6% lift
Without
With
+6.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
27 currently pending
Career history
470
Total Applications
across all art units

Statute-Specific Performance

§101
0.5%
-39.5% vs TC avg
§103
89.2%
+49.2% vs TC avg
§102
2.3%
-37.7% vs TC avg
§112
3.5%
-36.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 443 resolved cases

Office Action

§103
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 The office action is responding to the amendments filed on 05/01/2026. Claims 1, 8 and 15 have been amended. 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 (i.e., changing from AIA to pre-AIA ) 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, 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(s) 1, 8 and 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over O'Shea et al. [US 8,645,623 B1] in view of Mital et al. [US 2013/0091330 A1]. Claim 1 is rejected over O'Shea and Mital. O'Shea teaches “An apparatus comprising: packet processing circuitry to process a network packet, the packet processing circuitry including:” as “The packet switch network passes both user data and messages, the user data passing through the data pipe and the messages being generated and received by the message engine.” [Col 1, lines 63-66] “memory access circuitry, the memory access circuitry to:” as “ a DSA transfer is used for a CPU within a storage processor (SP) to indirectly access a local/remote memory in any SP on the packet switching network.” [Col 2, lines 53-56] “collect evicted data in multiple data fields in a line, the multiple data fields to match data fields in a memory line in an external memory, the evicted data written to the multiple data fields at different times; and” as “Bit 63 of the primary or secondary address in FIG. 4H is the `context enable` which ensures that the setup directed to a particular context was fully assembled by the program (i.e., software) running on the CPU before it was evicted.” [Col 14, lines 62-65] “perform a single read-modify-write operation to update the memory line in the external memory with the evicted data stored in the line;” as “an atomic read-modify-write operation modifies the read data and writes the modified data back into the same memory location from which it was originally read.” [Col 17, lines 58-60] O'Shea does not explicitly teach wherein: the evicted data comprises object data to be used by the packet processing circuitry in one or more network packet processing operations. However, Mital teaches “wherein: the evicted data comprises object data to be used by the packet processing circuitry in one or more network packet processing operations.” as “at step 520, older data is evicted from system cache 400 in order to write the received packet data, process 500 proceeds to step 526.” [¶0048] (It is implied, the older data is previously loaded packet data) and “Network processors are generally used for analyzing and processing packet data for routing and switching packets in a variety of applications” [¶0004] O'Shea and Mital are analogous arts because they teach data storage system and cache management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of O'Shea and Mital before him/her, to modify the teachings of O'Shea to include the teachings of Mital with the motivation of allow network processor 100 to process a wide variety of data and control messages more efficiently than with a fixed pipeline or non-pipelined architecture. [Mital, ¶0020] Claim 8 recites a method with the same limitations as claim 1 and rejected over O'Shea and Mital under the same rationale of rejection of claim 1. Claim 15 recites a system with the same limitations as claim 1 and antic rejected over O'Shea and Mital under the same rationale of rejection of claim 1. Claim(s) 2, 9 and 16 is/are rejected under 35 U.S.C. 103 as being unpatentable over O'Shea et al. [US 8,645,623 B1] in view of Mital et al. [US 2013/0091330 A1] and in further view of Mevergnies et al. [US 2007/0277001 A1]. Claim 2 is rejected over O'Shea, Mital and Mevergnies. The combination of O'Shea and Mital does not explicitly teach wherein the line and the memory line have N bytes, N is an integer multiple of 4 and each of the data fields in the line to store evicted data has N/4 bytes. However, Mevergnies teaches “wherein the line and the memory line have N bytes, N is an integer multiple of 4 and each of the data fields in the line to store evicted data has N/4 bytes.” as “In box 234, the execution of another instruction of the second process causes a fourth block of data from the system memory to be loaded into a second line of the cache memory, causing the second block of data to be evicted, for example, due to the set-associative property of the cache memory.” [¶0018] O'Shea, Mital and Mevergnies are analogous arts because they teach data storage system and cache management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of O'Shea, Mital and Mevergnies before him/her, to modify the teachings of combination of O'Shea and Mital to include the teachings of Mevergnies with the motivation of a single cache security logic element may be enabled for multiple processes running on different processors, so long as the processes share a common cache memory. [Mevergnies, ¶0027] Claim 9 recites a method with the same limitation as claim 2 and rejected over O'Shea, Mital and Mevergnies under the same rationale of rejection of claim 2. Claim 16 recites a system with the same limitation as claim 2 and rejected over O'Shea, Mital and Mevergnies under the same rationale of rejection of claim 2. Claim(s) 6, 13 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over O'Shea et al. [US 8,645,623 B1] in view of Mital et al. [US 2013/0091330 A1] and in further view of Chen. [US 2023/0120806 A1]. Claim 6 is rejected over O'Shea, Mital and Chen. The combination of O'Shea and Mital does not explicitly teach wherein the external memory is a dynamic random access memory. However, Chen teaches “wherein the external memory is a dynamic random access memory.” as “the external memory 180 is a dynamic random access memory (DRAM).” [¶0021] O'Shea, Mital and Chen are analogous arts because they teach data storage system and cache management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of O'Shea, Mital and Chen before him/her, to modify the teachings of combination of O'Shea and Mital to include the teachings of Chen with the motivation of data transmissions between the internal memory and the external memory are reduced and convolution operation efficiency is significantly enhanced. [Chen, ¶0008] Claim 13 recites a method with the same limitation as claim 6 and rejected over O'Shea, Mital and Chen under the same rationale of rejection of claim 6. Claim 20 recites a system with the same limitation as claim 6 and rejected over O'Shea, Mital and Chen under the same rationale of rejection of claim 6. Claim(s) 7 and 14 is/are rejected under 35 U.S.C. 103 as being unpatentable over O'Shea et al. [US 8,645,623 B1] in view of Mital et al. [US 2013/0091330 A1] in further view of Mevergnies et al. [US 2007/0277001 A1] and yet in further view of Chen. [US 2023/0120806 A1]. Claim 7 is rejected over O'Shea, Mital, Mevergnies and Chen. The combination of O'Shea, Mital and Mevergnies does not explicitly teach wherein N is 64. However, Chen teaches “wherein N is 64.” as “The operation above is performed in the number dimension N on each of the 64 pointwise convolution weights” [¶0032] O'Shea, Mital, Mevergnies and Chen are analogous arts because they teach data storage system and cache management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of O'Shea, Mital, Mevergnies and Chen before him/her, to modify the teachings of combination of O'Shea, Mital and Mevergnies to include the teachings of Chen with the motivation of data transmissions between the internal memory and the external memory are reduced and convolution operation efficiency is significantly enhanced. [Chen, ¶0008] Claim 14 recites a method with the same limitation as claim 7 and rejected over O'Shea, Mital, Mevergnies and Chen under the same rationale of rejection of claim 7. Allowable Subject Matter Claims 3, 10 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. The following is a statement of reasons for the indication of allowable subject matter: Claims 3, 10 and 17 recite the following limitation: “wherein the evicted data is a counter.” The prior arts of record do not appear to teach or fairly suggest that the evicted data is specifically is a counter value. Based on this rationale, claims 3, 10 and 17 are considered to contain allowable subject matter. Claims 4-5, 11-12 and 18-19 are objected because they are dependent on already objected claims. Response to Arguments Applicant’s arguments with respect to claim(s) have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. 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 nonprovisional extension fee (37 CFR 1.17(a)) 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 mailing date of this final action. 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 at (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 21, 2022
Application Filed
Jan 30, 2023
Response after Non-Final Action
Feb 02, 2026
Non-Final Rejection mailed — §103
May 01, 2026
Response Filed
Jun 02, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12664093
SCHEDULING MERGED STORE OPERATIONS IN COMPLIANCE WITH STORE ORDERING RULES
3y 11m to grant Granted Jun 23, 2026
Patent 12656964
METHOD AND SYSTEM FOR EFFICIENT LAYOUT OF STORED VIDEO SEGMENTS
2y 0m to grant Granted Jun 16, 2026
Patent 12650927
STORAGE SYSTEM AND STORAGE CONTROL METHOD
1y 9m to grant Granted Jun 09, 2026
Patent 12639604
SOLVING OPTIMIZATION PROBLEMS ON SHALLOW CIRCUITS USING A QUANTUM COMPUTER
3y 7m to grant Granted May 26, 2026
Patent 12632747
TRAINING A KNOWLEDGE GRAPH ALIGNMENT MODEL BASED ON PREDICTED ALIGNMENT PROBABILITIES AND ALIGNMENT DIFFICULTY DEGREES OF ENTITY PAIRS
3y 6m 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

3-4
Expected OA Rounds
87%
Grant Probability
94%
With Interview (+6.5%)
2y 4m (~0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 443 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