Prosecution Insights
Last updated: May 29, 2026
Application No. 18/350,841

VIRTUAL MACHINE MEMORY MANAGEMENT

Final Rejection §103
Filed
Jul 12, 2023
Examiner
KE, PENG
Art Unit
2194
Tech Center
2100 — Computer Architecture & Software
Assignee
DELL PRODUCTS, L.P.
OA Round
2 (Final)
51%
Grant Probability
Moderate
3-4
OA Rounds
1y 12m
Est. Remaining
76%
With Interview

Examiner Intelligence

Grants 51% of resolved cases
51%
Career Allowance Rate
111 granted / 216 resolved
-3.6% vs TC avg
Strong +25% interview lift
Without
With
+24.6%
Interview Lift
resolved cases with interview
Typical timeline
4y 10m
Avg Prosecution
12 currently pending
Career history
244
Total Applications
across all art units

Statute-Specific Performance

§101
3.6%
-36.4% vs TC avg
§103
86.3%
+46.3% vs TC avg
§102
5.3%
-34.7% vs TC avg
§112
1.5%
-38.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 216 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 In the amendment filed on 03/06/2026, claims 1-20 are pending and claims 1, 8 and 15 are amended. This is a Final Action. Response to Arguments Applicant’s arguments with respect to claims 1-20 have been considered but are moot because the new ground of rejection. 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. Claims 1-4, 8-11, and 15-18 are rejected under 35 U.S.C. 103 as being unpatentable over Graham US Publication 2009/0138752 in view of Kamiya US Publication 20220237016 and Ghosh US Patent 9,286,104. 18/350,841 Graham US Publication 2009/0138752 in view of Kamiya US Publication 20220237016 and Ghosh US Patent 9,286,104 Claim 1 A computer-implemented method of virtual machine memory management, the method comprising: assigning, for each virtual machine of a plurality of virtual machines operating at a compute node, one or more respective first memory modules of a plurality of first memory modules to the virtual machine, the plurality of first memory modules operating at a storage node, the storage node physically different and separate from the compute node; See Graham p0029-p0049; Kamiya teaches when the associated virtual machine and volume are on different nodes; p0052; p0062-p0064 (the locality between the virtual machine and the volume transitions from a state in which there is not locality to a state in which there is not locality) It would have been obvious at the time of the invention for a person ordinary skill in the art (POSITA) to include Kamiya’s teaching with method of Graham in order to provide system with the ability to migrate with different system structure. accessing, by the plurality of virtual machines and over a first communication channel between the compute node and the storage node, the respective first memory modules; See Graham p0029-p0049; detecting, for a particular virtual machine of the plurality of virtual machines, a loss of connectivity of the particular virtual machine with respective first memory modules assigned to the particular virtual machine; in response to detecting the loss of connectivity of the particular virtual machine with respective first memory modules assigned to the particular virtual machine; See Graham teaches migrate virtual machines from node to another upon detect connectivity issue; p0032 and p0049 Ghosh teaches assign memory modules to VM. (see Ghosh c7:20-50) It would have been obvious at the time of the invention for a person ordinary skill in the art (POSITA) to include Ghosh’s teaching with method of Graham in order to provide system with the ability to manage memory. assigning, for the particular virtual machine, one or more second memory modules of a plurality of second memory modules to the particular virtual machine, the plurality of second memory modules operating at the compute node; establishing a second communication channel between a baseband management controller (BMC) of the storage node and a remote access controller (RAC) of the computing node; and transferring, over the second communication channel, data stored at the respective first memory modules assigned to the particular virtual machine to the second memory modules assigned to the particular virtual machine while maintaining the particular virtual machine at the computer node and the particular virtual machine continues to operate at the compute node. Ghosh teaches second memory module in the same cloud computing nodes. (see Ghosh c14:10-30) It would have been obvious at the time of the invention for a person ordinary skill in the art (POSITA) to include Ghosh’s teaching with method of Graham in order to ability to operate on a cloud system. Ghosh teaches establish channels between nodes through Network interface controller. (see Fig. 2, p0020-p0042) Kamiya teaches when the associated virtual machine and volume are on different nodes; p0052; p0062-p0064 (the locality between the virtual machine and the volume transitions from a state in which there is not locality to a state in which there is not locality) Claim 2 The computer-implemented method of claim 1, further comprising: after transferring the data stored at the respective first memory modules assigned to the particular virtual machine to the assigned second memory modules, restarting the particular virtual machine. Graham p0035; Claim 3 The computer-implemented method of claim 2, further comprising: maintaining operation of the particular virtual machine after restarting. See Graham p0029-p0049; Claim 4 The computer-implemented method of claim 1, wherein assigning, for the particular virtual machine, one or more second memory modules of a plurality of second memory modules to the particular virtual machine further comprises: See Graham p0029-p0049; see Ghosh c7:20-50 identifying non-volatile memory modules of the one or more second memory modules; identifying volatile memory modules of the one or more second memory modules; determining that one or more of the non-volatile memory modules of the one or more second memory modules is available; in response to determining that one or more of the non-volatile memory modules of the one or more second memory modules is available, assigning, for the particular virtual machine, one or more of the non-volatile memory modules of the plurality of second memory modules to the particular virtual machine; and transferring, over the second communication channel, data stored at the respective first memory modules assigned to the particular virtual machine to the non-volatile memory modules assigned to the particular virtual machine. Graham teaches high-availability cluster; See Graham p0009; p0027-p0049; Ghosh teaches migration based on memory volatility. (see Ghosh c3:5-20); As per claims 8-11 and 15-18, they are rejected under the same rationale as claims 1-4. See rejection above. Claims 5-7, 12-14, and 19-20 are rejected under 35 U.S.C. 103 as being unpatentable over Graham US Publication 2009/0138752 in view of Kamiya US Publication 20220237016, Ghosh US Patent 9,286,104 and Doshi US 2022/0114055. 18/350,841 Graham US Publication 2009/0138752 in view of Kamiya US Publication 20220237016 , Ghosh US Patent 9,286,104 and Doshi US 2022/0114055 Claim 5 The computer-implemented method of claim 4, further comprising: determining that the non-volatile memory modules of the one or more second memory modules are unavailable; in response to determining that the non-volatile memory modules of the one or more second memory modules are unavailable, assigning, for the particular virtual machine, one or more of the volatile memory modules of the plurality of second memory modules to the particular virtual machine; and transferring, over the second communication channel, data stored at the respective first memory modules assigned to the particular virtual machine to the non-volatile memory modules assigned to the particular virtual machine. See Graham p0029-p0049; Doshi teaches if primary backup is unavailable, the secondary backup is promoted to primary and generator a virtual back up component. (see Doshi p0150-p0156) It would have been obvious at the time of the invention for a person ordinary skill in the art (POSITA) to include Doshi’s teaching with method of Graham in order to provide system with additional backup. Claim 6 The computer-implemented method of claim 5, further comprising: determining that the non-volatile memory modules and the non-volatile memory modules of the one or more second memory modules are unavailable; and in response to determining that the non-volatile memory modules and the non-volatile memory modules of the one or more second memory modules are unavailable, assigning, for the particular virtual machine, one or more additional memory modules of a plurality of additional memory modules to the particular virtual machine, the plurality of additional memory modules operating at an additional storage node. See Graham p0029-p0049; See Doshi p0150-p0156) It would have been obvious at the time of the invention for a person ordinary skill in the art (POSITA) to include Doshi’s teaching with method of Graham in order to provide system with a pool of capabilities. Claim 7 The computer-implemented method of claim 1, wherein the first memory modules are non-volatile dual inline memory modules (NVDIMM) over fabric. Doshi teaches NVDIMMs. See p0104; As per claims 12-14, they are rejected under the same rationale as claims 5-7. See rejection above. As per claims 19-20, they are rejected under the same rationale as claims 5 and 6. See rejection above. Related Prior Art Here is a list of reference relates to Resource Management: Hadas US Publication 2021/0019161: Minimizing downtime of highly available virtual machines. Paterra et al. US Publication 2024/0202157: Field-reconfigurable cloud-provided servers with application-specific pluggable modules. Lazri US Publication 2016/0004863: Method for detecting attack on virtual machines. 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. Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to PENG KE whose telephone number is (571)272-4062. The examiner can normally be reached M-F 6:30-5:00. 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, Kevin Young can be reached at (571) 270-3180. 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. PENG KE Primary Examiner Art Unit 2194 /PENG KE/Primary Examiner, Art Unit 2194
Read full office action

Prosecution Timeline

Jul 12, 2023
Application Filed
Jan 13, 2026
Non-Final Rejection mailed — §103
Feb 17, 2026
Interview Requested
Feb 25, 2026
Examiner Interview Summary
Mar 06, 2026
Response Filed
May 11, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12639136
USER INTERACTION EVENT STREAMING
3y 5m to grant Granted May 26, 2026
Patent 12619355
MACHINE LEARNING DATABASE MEMORY USE PREDICTION AND ADAPTATION
3y 11m to grant Granted May 05, 2026
Patent 12613748
VEHICULAR COMPUTATIONAL TASK ALLOCATION
3y 4m to grant Granted Apr 28, 2026
Patent 12596493
TECHNIQUES FOR DETERMINING A MINIMUM HARDWARE CONFIGURATION USING PERFORMANCE HEADROOM METRICS
3y 4m to grant Granted Apr 07, 2026
Patent 12585492
MEMORY MANAGEMENT METHOD AND ELECTRONIC DEVICE
3y 3m to grant Granted Mar 24, 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
51%
Grant Probability
76%
With Interview (+24.6%)
4y 10m (~1y 12m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 216 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