Prosecution Insights
Last updated: October 02, 2026
Application No. 18/407,704

OVERLAY CONTAINER STORAGE DRIVER FOR MICROSERVICE WORKLOADS

Non-Final OA §103
Filed
Jan 09, 2024
Priority
Sep 24, 2020 — continuation of 11/893,407
Examiner
AQUINO, WYNUEL S
Art Unit
2199
Tech Center
2100 — Computer Architecture & Software
Assignee
Red Hat Inc.
OA Round
3 (Non-Final)
79%
Grant Probability
Favorable
3-4
OA Rounds
7m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 79% — above average
79%
Career Allowance Rate
360 granted / 456 resolved
+23.9% vs TC avg
Strong +22% interview lift
Without
With
+21.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
23 currently pending
Career history
478
Total Applications
across all art units

Statute-Specific Performance

§101
15.2%
-24.8% vs TC avg
§103
62.6%
+22.6% vs TC avg
§102
3.4%
-36.6% vs TC avg
§112
12.8%
-27.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 456 resolved cases

Office Action

§103
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 . DETAILED ACTION A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 5/26/26 has been entered. Response to Arguments Applicant’s arguments with respect to independent 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. Claim Rejections - 35 USC §103 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. Claim/s 1, 6-11, 16 is/are rejected under 35 U.S.C. 103 as being unpatentable over Yankovskiy (Pub. No. US 2021/0103395) in view of Cain (Pub. No. US 2021/0318824) further view of Ganti (Pub. No. US 2013/0031341). Claim 1, 8, 16 Yankovskiy teaches “a method comprising: receiving, by a processing device of a host system executing a nested container storage interface (CSI) driver within an overcluster, a first command from a workload to create a persistent volume ([0023] The container engine passes the above create volume request to an encrypted container storage integration service (ECSIS) or driver operating/integrated with the container engine.); converting, by the nested CSI driver, the first command used by the workload to create the persistent volume to a second command used by the host system to increase a capacity of a previously generated persistent volume allocated to the workload (i.e. as provided below [0015] The dynamic encrypted storage mechanism would allow one to specify the amount of encrypted storage that is required for the container/application on-demand. [0061] Alternatively, the operator may specify a “-mount” option for mounting an existing storage volume. These options/flags respectively signal a request to container engine 108 to create a storage volume or to mount an existing volume for the requesting container.); and transmitting , by the nested CSI driver within the overcluster, the second command to an undercluster CSI driver of the host system, wherein the second command causes the undercluster CSI driver to increase the capacity of the previously generated persistent volume ([0023] The ECSIS in turn passes the request to an encrypted dynamic volume manager (EDVM) of the present technology. The EDVM interfaces with a storage allocation module (SAM) and requests a volume of the required size of the original create volume request [Fig. 2] 150 as undercluster [0100] CSIS 154 passes the request to DVM 156 per step/block 306 which in turn passes it to SAM 158 per step/block 308. [0088] Next, SAM 158 will initialize a candidate list or CL per box 254. Based on the above explanation of flowchart 250, and specifically decision 258, box 260 and decisions 262, 264, SAM 158 will add 3 unallocated slices from slices 164B in CL [0084] Thus, per box 270 SAM 158 modifies/improves upon its initial greedy choice of slice allocation and removes the excess storage. If there are no further smaller slices available at the top of SASL at decision diamond 258, then that could mean one of two scenarios, (i) either now CL contains enough slices that just/optimally exceed the required size of storage,)”. However, Yankovskiy may not explicitly teach the new limitations. Cain teaches “identifying by the nested CSI driver within the overcluster a previously generated persistent volume allocated to the workload based on the first command to create the persistent volume ([0122] Examples of block 308 may be as described further below with respect to block 414 of FIG. 4 [0119] For example, aspects of the methods may be described below as being performed by a storage virtualization system on a computing system, an example of which may be the containerized storage virtualization system 130 on the computing system 100 described above, and which may be further attributed to a policy engine of such a storage virtualization system, such as the policy engine 242 described above. [0128] At block 414, the storage virtualization system modifies the virtual persistent volume 280 according to the application data store profile 284 identified at block 412. The modified virtual PV 280′ resulting from block 414 is deemed to have an updated application-centric storage policy. In some implementations, block 414 includes modifying an extent composition of the virtual PV 280, and migrating data of the virtual PV 280 among the modified extent composition.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Cain with the teachings of Yankovskiy in order to manage variable storage. The motivation for applying Cain teaching with Yankovskiy teaching is to provide a system that allows for tuning of workloads. Yankovskiy, Cain are analogous art directed towards processing memory-based commands. Together Yankovskiy, Cain teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Cain with the teachings of Yankovskiy by known methods and gained expected results. However, the combination may not explicitly teach details of converting between Yankovskiy teaching of “create a storage volume or to mount an existing volume” as shown above. Ganti teaches “converting… the first command used by the workload to create the persistent volume to a second command used by the host system to increase a capacity of a previously generated persistent volume allocated to the workload, wherein the workload is provided access to an increased storage capacity of the previously generated persistent volume ([0086] Once the paging file request is received, the VIOS automatically partitions a new LU 502 from the distributed storage repository 150 and assigns the new LU 502 to the requesting application/OS of the client LPAR. [0087] In one embodiment, instead of creating a new LU 502, a VIOS 112 managing the requesting application/OS may also determine if memory of an existing LU 502 within the distributed storage repository 150 that is not currently utilized by a VIOS has an available amount of storage at least equal to the minimum required capacity of a received client request for memory allocation that would be suitable for use by the requesting application/OS. When an existing LU 502 meets this criterion, the VIOS assigns the existing LU 502, or a portion of the existing LU 502, to the requesting application/OS. In response to none of the existing LUs 502a-n having sufficient available space that is suitable for use by the requesting application/OS, the managing VIOS may partition a new LU 502 from available memory in the shared distributed storage repository 150.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Ganti with the teachings of Yankovskiy, Cain in order to manage utilizing existing storage. The motivation for applying Ganti teaching with Yankovskiy, Cain teaching is to provide a system that allows for efficient use of resources. Yankovskiy, Cain, Ganti are analogous art directed towards processing memory-based commands. Together Yankovskiy, Cain, Ganti teaches every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Ganti with the teachings of Yankovskiy, Cain by known methods and gained expected results. Claim 6, the combination teaches the claim, wherein Yankovskiy teaches “the method of claim 1, wherein the workload and the nested CSI driver are executed within a container ([Fig. 2] executed within host 102)”. Claim 7, the combination teaches the claim, wherein Yankovskiy teaches “the method of claim 1, wherein the second command comprises an amount to increase the capacity of the previously generated persistent volume ([0023] The ECSIS in turn passes the request to an encrypted dynamic volume manager (EDVM) of the present technology. The EDVM interfaces with a storage allocation module (SAM) and requests a volume of the required size of the original create volume request [Fig. 2] 150 as undercluster [0100] CSIS 154 passes the request to DVM 156 per step/block 306 which in turn passes it to SAM 158 per step/block 308. [0088] Next, SAM 158 will initialize a candidate list or CL per box 254. Based on the above explanation of flowchart 250, and specifically decision 258, box 260 and decisions 262, 264, SAM 158 will add 3 unallocated slices from slices 164B in CL [0084] Thus, per box 270 SAM 158 modifies/improves upon its initial greedy choice of slice allocation and removes the excess storage. If there are no further smaller slices available at the top of SASL at decision diamond 258, then that could mean one of two scenarios, (i) either now CL contains enough slices that just/optimally exceed the required size of storage,)”. Claim 9, the combination teaches the claim, wherein Yankovskiy teaches “the system of claim 8, wherein the nested CSI driver updates the capacity of the persistent volume allocated to the execution environment in response to the capacity of the persistent volume being modified ([0023] The ECSIS in turn passes the request to an encrypted dynamic volume manager (EDVM) of the present technology. The EDVM interfaces with a storage allocation module (SAM) and requests a volume of the required size of the original create volume request [Fig. 2] 150 as undercluster [0100] CSIS 154 passes the request to DVM 156 per step/block 306 which in turn passes it to SAM 158 per step/block 308. [0088] Next, SAM 158 will initialize a candidate list or CL per box 254. Based on the above explanation of flowchart 250, and specifically decision 258, box 260 and decisions 262, 264, SAM 158 will add 3 unallocated slices from slices 164B in CL [0084] Thus, per box 270 SAM 158 modifies/improves upon its initial greedy choice of slice allocation and removes the excess storage. If there are no further smaller slices available at the top of SASL at decision diamond 258, then that could mean one of two scenarios, (i) either now CL contains enough slices that just/optimally exceed the required size of storage,)”. Claim 10, the combination teaches the claim, wherein Yankovskiy teaches “the system of claim 8, wherein the volume management component comprises a logical volume manager ([0065] Let us now refer back to FIG. 3 to continue expanding our understanding of the various aspects of the present design. In addition to SCM 152 in dynamic container storage 150 of FIG. 2-4, there is also a container storage integration service (CSIS) or volume driver 154, a dynamic volume manager (DVM) 156 and a storage allocation module or engine (SAM) 158. Exemplary implementations of CSIS/driver based on instant principles include Docker volume driver, Kubernetes' container storage class or interface (CSI), Red Hat Openshift driver, rkt, etc.)”. Claim 11, the combination teaches the claim, wherein Yankovskiy teaches “the system of claim 8, wherein the volume management component comprises a network storage driver ([0065] Let us now refer back to FIG. 3 to continue expanding our understanding of the various aspects of the present design. In addition to SCM 152 in dynamic container storage 150 of FIG. 2-4, there is also a container storage integration service (CSIS) or volume driver 154, a dynamic volume manager (DVM) 156 and a storage allocation module or engine (SAM) 158. Exemplary implementations of CSIS/driver based on instant principles include Docker volume driver, Kubernetes' container storage class or interface (CSI), Red Hat Openshift driver, rkt, etc.)”. Claim/s 5 is/are rejected under 35 U.S.C. 103 as being unpatentable over Yankovskiy, Cain, Ganti in further view of Wolfin (Pub. No. US 2020/0233961). Claim 5, the combination may not explicitly teach the limitation. Wolfin teaches “the method of claim 1, wherein the workload and the nested CSI driver are executed within a virtual machine (Wolfin teaches as evidence a container engine executes within a VM [0039] The container engine 212 and container monitor 550 can be implemented in the VM 310.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Wolfin with the teachings of Yankovskiy, Cain, Ganti in order to evidence of the environment of Yankovskiy. The motivation for applying Wolfin teaching with Yankovskiy, Cain, Ganti, teaching is to provide a system that allows for design choice. Yankovskiy, Cain, Ganti, Wolfin are analogous art directed towards processing memory-based commands. Together Yankovskiy, Cain, Ganti, Wolfin teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Wolfin with the teachings of Yankovskiy, Cain, Ganti by known methods and gained expected results. Claim/s 2-4, 12-15, 17, 18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Yankovskiy, Cain, Ganti in further view of Stabrawa (Pub. No. US 2020/0371700). Claim 2, the combination may not explicitly teach the claim. Stabrawa teaches “the method of claim 1, further comprising: receiving a third command from the workload to delete the persistent volume; converting the third command used by the workload to delete the persistent volume to a fourth command used by the host system to decrease the capacity of the previously generated persistent volume allocated to the workload; and transmitting the fourth command to the undercluster CSI driver of the host system, wherein the fourth command causes the undercluster CSI driver to decrease the capacity of the previously generated persistent volume([0110] Upon receiving a request to destroy the region 214, the region access logic 212 may de-allocate the portion of the memory included in the memory appliance 110 for the region 214. De-allocating may include listing the de-allocated portions on the free list. Alternatively, or in addition, the region access logic 212 may delete any persisted data related to the region 214 included in the backing store 260. The region access logic 212 may respond to the request to destroy the region 214 with a response message. The response message may include the identifier associated with the region 214 and/or a status, indicating whether the operation was successful.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Stabrawa with the teachings of Yankovskiy, Cain, Ganti in order to evidence of adjusting resource requirements. The motivation for applying Stabrawa teaching with Yankovskiy, Cain, Ganti, teaching is to provide a system that allows for efficient use of resources. Yankovskiy, Cain, Ganti, Stabrawa are analogous art directed towards processing memory-based commands. Together Yankovskiy, Cain, Ganti, Stabrawa teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Stabrawa with the teachings of Yankovskiy, Cain, Ganti by known methods and gained expected results. Claim 3, the combination may not explicitly teach the claim. Stabrawa teaches “the method of claim 1, further comprising: updating, by the nested CSI driver, the capacity of the previously generated persistent volume that is available for use by the workload ([0101] Alternatively, or in addition, the size of the portion of the memory may be specified by the request to resize the existing region 214. Alternatively, or in addition, the request to resize the existing region 214 may specify an offset within the region 214 where the allocated portion may appear. For example, the request to resize the existing region 214 may be re-allocating a portion of the region 214 that was previously de-allocated by a different request to resize the same region 214. The region access logic 212 may assign the allocated portion to the region 214. The region access logic 212 may update the region metadata 215 to include references to the allocated portion of the memory 210.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Stabrawa with the teachings of Yankovskiy, Cain, Ganti in order to evidence of adjusting resource requirements. The motivation for applying Stabrawa teaching with Yankovskiy, Cain, Ganti, teaching is to provide a system that allows for efficient use of resources. Yankovskiy, Cain, Ganti, Stabrawa are analogous art directed towards processing memory-based commands. Together Yankovskiy, Cain, Ganti, Stabrawa teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Stabrawa with the teachings of Yankovskiy, Cain, Ganti by known methods and gained expected results. Claim 4, the combination teaches the claim, wherein Yankovskiy teaches “the method of claim 3, further comprising: providing an indication to the workload that the updated capacity of the previously generated persistent volume is available for use by the workload ([0089] At this point, a logical storage volume 168 has been created by DVM 156 of dynamic container storage 150 that satisfies the size requirement specified in the create volume request. DVM now passes the volume id of the newly created volume to CSIS 154 as shown by box 218 in FIG. 5. Then as shown by box 220, CSIS 154 in turn now passes this volume id to container engine 108 thus satisfying the create volume request of the specified on-demand size. Container engine 108 now in turn can provide this volume to the requesting container/user, although this step in not explicitly shown.)”. Claim 12, the combination teaches the claim, wherein Stabrawa teaches “the system of claim 8, wherein the first command to modify the capacity is received from the nested CSI driver in response to the workload providing a third command to create the second persistent volume ([0171] Determining how to structure the external memory allocation may include determining whether to resize the existing regions referenced by the external memory allocation, whether to create additional regions, and/or whether to replace existing regions with new regions. The allocation logic 412 may resize the existing regions referenced by the external memory allocation, create additional regions, and/or replace existing regions with new regions using the methods described throughout this disclosure.)”. Claim 13, the combination teaches the claim, wherein Stabrawa teaches “the system of claim 12, wherein the nested CSI driver converts the third command into the first command to modify the capacity of the persistent volume, and wherein the second command comprises a command to increase the capacity of the persistent volume ([0162] The allocation logic 412 may create additional regions by sending a request to create a region to the region access logic 212 of the memory appliances selected to include the additional regions. Alternatively, or in addition, the allocation logic 412 may resize existing regions by sending a request to resize an existing region to the region access logic 212 of the memory appliances including the existing regions. Alternatively, or in addition, the allocation logic 412 may destroy existing regions by sending a request to destroy a region to the region access logic 212 of the memory appliances including the existing regions.)”. Claim 14, the combination teaches the claim, wherein Stabrawa teaches “the system of claim 8, wherein the first command to modify the capacity is received from the nested CSI driver in response to the workload providing a third command to delete the persistent volume ([0162] The allocation logic 412 may create additional regions by sending a request to create a region to the region access logic 212 of the memory appliances selected to include the additional regions. Alternatively, or in addition, the allocation logic 412 may resize existing regions by sending a request to resize an existing region to the region access logic 212 of the memory appliances including the existing regions. Alternatively, or in addition, the allocation logic 412 may destroy existing regions by sending a request to destroy a region to the region access logic 212 of the memory appliances including the existing regions.)”. Claim 15, the combination teaches the claim, wherein Stabrawa teaches “the system of claim 14, wherein the nested CSI driver converts the third command into the first command to modify the capacity of the persistent volume, and wherein the second command comprises a command to increase the capacity of the persistent volume ([0162] The allocation logic 412 may create additional regions by sending a request to create a region to the region access logic 212 of the memory appliances selected to include the additional regions. Alternatively, or in addition, the allocation logic 412 may resize existing regions by sending a request to resize an existing region to the region access logic 212 of the memory appliances including the existing regions. Alternatively, or in addition, the allocation logic 412 may destroy existing regions by sending a request to destroy a region to the region access logic 212 of the memory appliances including the existing regions.)”. Claim 17, the combination teaches the claim, wherein Stabrawa teaches “the non-transitory computer-readable storage medium of claim 16, wherein the first command comprises a command to create the second persistent volume for the workload and the second command comprises a command to increase the capacity of the first persistent volume ([0162] The allocation logic 412 may create additional regions by sending a request to create a region to the region access logic 212 of the memory appliances selected to include the additional regions. Alternatively, or in addition, the allocation logic 412 may resize existing regions by sending a request to resize an existing region to the region access logic 212 of the memory appliances including the existing regions. Alternatively, or in addition, the allocation logic 412 may destroy existing regions by sending a request to destroy a region to the region access logic 212 of the memory appliances including the existing regions.)”. Claim 18, the combination teaches the claim, wherein Stabrawa teaches “the non-transitory computer-readable storage medium of claim 16, wherein the first command comprises a command to delete the second persistent volume for the workload and the second command comprises a command to decrease the capacity of the first persistent volume ([0160] In a third example, the allocation logic 412 may determine to structure the external memory allocation using one or more logical relationships, such as striping with parity, between multiple regions on multiple memory appliances. Determining how to structure the resized external memory allocation may include determining whether to resize the existing regions referenced by the external memory allocation, whether to create additional regions, and/or whether to replace existing regions with new regions.)”. Claim 19 is rejected under 35 U.S.C. 103 as being unpatentable over Yankovskiy, Cain, Ganti in further view of Nikaido (Pub. No. US 2018/0018129). Claim 19, the combination may not explicitly teach the claim. Nikaido teaches “the non-transitory computer-readable storage medium of claim 16, wherein to generate the execution environment for the execution of the workload, the processing device to: provide, to the nested CSI driver, one or more specifications associated with modifying the capacity of the first persistent volume, wherein the one or more specifications are used by the nested CSI driver to convert the first command to the second command([0045] Since one VM 603 can read/write data in one volume 210, performance information has a unit that is a combination of a storage device 104 and a volume 210. In order to reflect an increase or decrease in the number of volumes 210 into management of objects for which performance information should be acquired, a protocol converter 108 which converts a protocol for a network 107 (or the computer for business purposes 103) to a protocol for storage devices 104 and vice versa may transfer a request to generate or delete a volume to the manager 101. In a system in which the protocol converter is unnecessary or a system in which the protocol converter 108 is incorporated in each storage device 104, each storage device 104 may transfer a request to generate or delete a volume to the manager 101.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Nikaido with the teachings of Yankovskiy, Cain, Ganti in order to enable cross communication. The motivation for applying Nikaido teaching with Yankovskiy, Cain, Ganti teaching is to provide a system that allows for communication across different systems. Yankovskiy, Cain, Ganti, Nikaido are analogous art directed towards virtual environments. Together Yankovskiy, Cain, Ganti, Nikaido teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Nikaido with the teachings of Yankovskiy, Cain, Ganti by known methods and gained expected results. Claim 20 is rejected under 35 U.S.C. 103 as being unpatentable over Yankovskiy, Cain, Ganti, in further view of Mcclure (Pub. No. US 2019/0370182). Claim 20, the combination may not explicitly teach the claim. Mcclure teaches “the non-transitory computer-readable storage medium of claim 16, wherein to allocate the persistent volume on the host system to the execution environment, the processing device to: annotate the persistent volume with a reference to the execution environment, wherein the nested CSI driver is to expose the first persistent volume to the execution environment in view of the reference([0034] At step 208, controller 134 determines whether mapping module 136 returns a location identifier or VM code 130. If mapping module 136 returns a physical location, then method 200 proceeds to step 210. If mapping module 136 returns VM code 130, then method 200 proceeds to step 214. It should be noted that mapping module may return a logical location identifier rather than a physical location identifier so as to increase security of storage 114 by adding another layer of misdirection as to the organization of data within storage 114. If a logical location identifier is determined to have been returned at step 208, method 200 may proceed back to step 206 to perform another translation on the returned logical location identifier.)”. It would have been obvious to one of ordinary skill in the art at the time the invention was filed to apply the teachings of Mcclure with the teachings of Yankovskiy, Cain, Ganti in order to enable cross communication. The motivation for applying Mcclure teaching with Yankovskiy, Cain, Ganti teaching is to provide a system that allows for communication across different systems. Yankovskiy, Cain, Ganti, Mcclure are analogous art directed towards virtual environments. Together Yankovskiy, Cain, Ganti, Mcclure teach every limitation of the claimed invention. Since the teachings were analogous art known at the filing time of invention, one of ordinary skill could have applied the teachings of Mcclure with the teachings of Yankovskiy, Cain, Ganti by known methods and gained expected results. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to WYNUEL S AQUINO whose telephone number is (571)272-7478. The examiner can normally be reached 9AM-5PM EST M-F. 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, Lewis Bullock can be reached at 571-272-3759. 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. /WYNUEL S AQUINO/Primary Examiner, Art Unit 2199
Read full office action

Prosecution Timeline

Jan 09, 2024
Application Filed
Aug 18, 2025
Non-Final Rejection mailed — §103
Nov 18, 2025
Response Filed
Feb 24, 2026
Final Rejection mailed — §103
May 26, 2026
Request for Continued Examination
May 29, 2026
Response after Non-Final Action
Aug 11, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12748612
VM Disk Conversion (Resistible to Power Off)
3y 9m to grant Granted Sep 29, 2026
Patent 12748682
Real Time Analysis and Control for a Multiprocessor System
3y 3m to grant Granted Sep 29, 2026
Patent 12748615
PREDICTING WORKER INSTANCE COUNT FOR CLOUD-BASED COMPUTING PLATFORMS
3y 1m to grant Granted Sep 29, 2026
Patent 12743297
LAYERED POOL FOR FLEXIBLE RESOURCE ALLOCATION
3y 2m to grant Granted Sep 22, 2026
Patent 12737829
Logical Slot to Distributed Hardware Slot Scheduling for Graphics Work
3y 1m to grant Granted Sep 15, 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
79%
Grant Probability
99%
With Interview (+21.7%)
3y 4m (~7m remaining)
Median Time to Grant
High
PTA Risk
Based on 456 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