Prosecution Insights
Last updated: July 17, 2026
Application No. 19/211,751

FREEZE COMMAND AND RESTORE COMMAND ASSOCIATED WITH TAGGED CAPACITY FOR A COMPUTE EXPRESS LINK (CXL) MEMORY DEVICE

Non-Final OA §102§103
Filed
May 19, 2025
Priority
Jun 07, 2024 — provisional 63/657,201
Examiner
NGUYEN, THAN VINH
Art Unit
Tech Center
Assignee
Micron Technology Inc.
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
1y 0m
Est. Remaining
95%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allowance Rate
739 granted / 813 resolved
+30.9% vs TC avg
Minimal +4% lift
Without
With
+4.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
8 currently pending
Career history
820
Total Applications
across all art units

Statute-Specific Performance

§101
3.1%
-36.9% vs TC avg
§103
30.7%
-9.3% vs TC avg
§102
47.1%
+7.1% vs TC avg
§112
10.1%
-29.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 813 resolved cases

Office Action

§102 §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 . Claims 1-20 are pending. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-7 and 9-20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Cong et al (US20190196977, “Cong”). As to claim 1, 12, 20: Cong discloses a system (data processing system; 0002, 0018, 0023-0024; Fig .1), associated method of operation (instructions performing a method; 0021, 0063, claims 13-20), and associated computer readable medium including instructions for performing the method of the system; 0086) comprising: a memory device comprising a plurality of dynamic capacity devices; (memory 14; Fig. 23; 0023; can be allocated/deallocated; 0037-0038; interpret dynamic capacity device as a memory device that can be allocated/deallocated, changing the capacity of usable storage); and a processing device (processor12; 0023-0024; Fig . 1), operatively coupled with the memory device, to perform operations comprising: receiving a host command to freeze first data associated with a first tag, wherein the first tag is associated with a first memory section of the plurality of dynamic capacity devices, and wherein the first memory section is allocated to a first host system to store the first data (data processing system performing allocation operations/commands and using tag to protect for a memory page; 0018, 0019, 0030; memory tag is assigned a specific tag value, the value is associated with a protection status; 0013, 0045); responsive to receiving the host command to freeze, making the first data inaccessible to the first host system (in memory access operations, provide memory protection from access using with tag value; 0018, 0019, 0026, 0030); and responsive to determining that the host command indicates to free the first memory section (for requests in copy on write operations, swap operations, memory deallocation/free operations; 0019), storing the first data in a second memory device, wherein the second memory device is not included in the plurality of dynamic capacity devices (in deallocation and free operation, copy data from one memory to another memory or to a disk, maintain memory tag map; 0065, 0019). [Interpretation: based on claimed steps as a result of the “free” command, operation to store first data from one memory device to another memory device, “free” command is interpreted as an operation to copy first data from one location to another, such as copy on write/swap operation.] As to claim 2, 13: Cong teaches each of the plurality of dynamic capacity devices comprises a plurality of memory sections, wherein each of the plurality of memory sections is associated with a respective one of a plurality of tags, and wherein each of the plurality of tags is unique (each memory address page/block is associated with a unique tag value; 0014, 0016). As to claim 3, 14: Cong teaches the host command specifies the first tag (command with address includes tag value; 0015, 0020, 0021). As to claim 4, 15: Cong teaches the host command specifies whether to free the first memory section (operation to deallocate/free memory; 0019). As to claim 5, 16: Cong teaches the operations further comprise: responsive to determining that the host command indicates to free the first memory section, disassociating the first tag with the first memory section (free/deallocation function, tag value associated with memory is tracked and updated; 0019, 0052-0053). As to claim 6, 17: Cong teaches wherein a capacity of the first memory section allocated to the first host system and associated with the first flag is immutable (size of allocated page is fixed, such as 4K; 0030, 0034, 0051). As to claim 7, 18: Cong teaches making the first data inaccessible comprises setting an item of a tag mapping data structure to a predefined value (tag is set with has specific tag value to associate protection; 0014, 0045). As to claim 9: Cong teaches the operations further comprise: responsive to receiving a first allocation request from the first host system, determining the first memory section and associating the first tag with the first memory section; and storing the first data in the first memory section (allocating memory and associate tag with for protection; 0019, 0030, 0033; storing data; 0003, 0031. As to claim 10: Cong teaches the operations further comprise: creating the first tag responsive to receiving the first allocation request by a first node in an orchestrator cluster, wherein the first node runs on the first host system (allocate memory and create tag associating with memory; 0019, 0033, 0052; allocation request can be from different computing system in computing cluster; 0088). As to claim 11, 19:Cong teaches the operations further comprise: responsive to determining that the host command indicates to free the first memory section, determining the second memory device (copy on write, swap operation; memory deallocation/free; 0019; copy data to another memory/disk). 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) 8 is/are rejected under 35 U.S.C. 103 as being unpatentable over Cong et al (US20190196977, “Cong”), in view of Lee et al (US20230359379, “Lee”). As to claim 8: Cong teaches a memory device but does not specifically teach the memory device comprises a compute express link (CXL) enabled memory device. Cong does teach the memory is shared and protected using tag values; 0078, 0056, 0093). It is well-known in the art to use CXL memory and interconnect to communicate between shared memory to obtain data transfer with low latency. Lee teaches using a Compute Express Link storage and memory (0034) wherein the shared memory communicate with low latency and high bandwidth that support coherency (0040). It would have been obvious to one of ordinary skills in the art, at the time of the invention, to use Lee’s teaching of using CXL memory, for the shared memory of Cong, so that the shared memory access can have low latency and high bandwidth. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. US20160378668 discloses techniques for embedding information about memory accesses to a memory module at the memory module itself. The information, referred to herein as “access metadata,” can indicate the number of times a particular unit of data (e.g., a row of data, a unit of data corresponding to a cache line, and the like) has been read, written, had one or more of its bits flipped, and the like. US20230350832 discloses a storage device includes a nonvolatile memory device that stores user data, and a storage controller that controls the nonvolatile memory device based on control of a host device. The storage controller includes a storage interface circuit that communicates with the host device through a compute express link (CXL) interface, a NAND interface circuit that communicates with the nonvolatile memory device, and a processor that loads map data from an external memory device placed outside the storage device through the storage interface circuit and controls the nonvolatile memory device through the NAND interface circuit based on the map data. Any inquiry concerning this communication or earlier communications from the examiner should be directed to THAN NGUYEN whose telephone number is (571)272-4198. The examiner can normally be reached M-F 7:00am -4:00pm. 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, Tim Vo can be reached at (571)272-3642. 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. /THAN NGUYEN/Primary Examiner, Art Unit 2138
Read full office action

Prosecution Timeline

May 19, 2025
Application Filed
Jul 07, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12675244
COMPUTER SYSTEM AND DATA MANAGEMENT METHOD IN STORAGE SYSTEM
1y 9m to grant Granted Jul 07, 2026
Patent 12675235
SYSTEM AND METHOD OF WRITING TO NONVOLATILE MEMORY USING WRITE BUFFERS
1y 9m to grant Granted Jul 07, 2026
Patent 12639005
STORAGE DEVICE FOR SKIPPING REDUNDANT REPLAY AND JOURNAL REPLAY METHOD THEREOF
1y 9m to grant Granted May 26, 2026
Patent 12638999
APPARATUS, METHOD, AND SYSTEM FOR MANAGING REPLICATION BASED ON REPLICATION DELAY TIME
1y 8m to grant Granted May 26, 2026
Patent 12625646
STORAGE DEVICE, STORAGE CONTROLLER, AND OPERATING METHOD FOR REORDERING READ REQUESTS
1y 9m to grant Granted May 12, 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
91%
Grant Probability
95%
With Interview (+4.2%)
2y 2m (~1y 0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 813 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