Prosecution Insights
Last updated: October 27, 2026
Application No. 19/041,569

MANAGING METADATA ASSOCIATED WITH MEMORY ACCESS OPERATIONS IN A MEMORY DEVICE

Final Rejection §103
Filed
Jan 30, 2025
Priority
Feb 13, 2024 — provisional 63/552,840
Examiner
RUIZ, ARACELIS
Art Unit
2139
Tech Center
2100 — Computer Architecture & Software
Assignee
Micron Technology Inc.
OA Round
2 (Final)
87%
Grant Probability
Favorable
3-4
OA Rounds
9m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
722 granted / 829 resolved
+32.1% vs TC avg
Moderate +13% lift
Without
With
+12.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 5m
Avg Prosecution
19 currently pending
Career history
863
Total Applications
across all art units

Statute-Specific Performance

§101
7.1%
-32.9% vs TC avg
§103
57.0%
+17.0% vs TC avg
§102
16.3%
-23.7% vs TC avg
§112
10.1%
-29.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 829 resolved cases

Office Action

§103
Ation DETAILED ACTION Claims 1-20 are present for examination. 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 . 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. 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-2, 5, 7-9, 12, 14-16 and 19 is/are rejected under 35 U.S.C. 103 as being unpatentable over Roberts et al. (US2016/0378668) in view of Lee et al. (US2023/0359379). With respect claim 1, Roberts et al. teaches a plurality of memory devices (see Fig. 1 and paragraphs 17 and 19; memory modules); and a processing device, operatively coupled with the plurality of memory devices (see Fig. 1 and paragraph 16; processor core 102 coupled to memory devices through controller), to perform operations comprising: receiving a request to perform a memory access operation at a first memory region of a first memory device of the plurality of memory devices (see paragraph 36; memory module 110 receives a memory access request targeting the memory location); identifying, based on an operation type of the memory access operation, one or more corresponding actions associated with the metadata region (see paragraph 35; an access metadata rule for a memory location (e.g., a row of the storage array 116), indicating how the access metadata for the memory location is to be modified in response to a memory access request. Also in claim 1; in response to the first memory access request, adjusting, at the memory module, first access metadata indicating a pattern of accesses to the first location of the memory module); causing the memory access operation to be performed on a first plurality of memory cells at the first memory device (see paragraphs 35-36; memory module 110 receives a memory access request targeting the memory location. In response, at block 408 the memory module 110 executes the memory access request by, for example, writing data to or reading data from the data payload fields of the memory location); and responsive to causing the memory access operation to be performed, causing at least one of the one or more corresponding actions to be performed on a second plurality of memory cells corresponding to the metadata region (see paragraph 33; in response to receiving the memory access request 350, the ADM 115 modifies the access metadata at the memory location indicated by the metadata pointer field 352. Also in paragraphs 35-37; ADM 115 initiates modification of the access metadata at the memory location by executing a low priority read of the access metadata fields at the memory location). Roberts et al. does not teach determining, based on a data structure referencing a namespace accessible to a host system and to the plurality of memory devices, a mapping between an identifier of the first memory region and an identifier of a metadata region associated with the first memory region. However, Lee et al. teaches CXL memory controller 621 may include a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 2, Roberts et al. does not teach wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links. However, Lee et al. teaches wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links (see paragraph 143; host 201 may be directly connected with the plurality of memory devices 202a and 202b. The host 201, the CXL storage 210, and the plurality of CXL memories 220_1 to 220_n may be connected with the CXL switch SW_CXL and may communicate with each other through the CXL switch). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 5, Roberts et al. teaches wherein the one or more actions associated with the metadata region comprise at least one of: (i) a move operation to move metadata of the metadata region from a first physical location to a second physical location, (ii) a copy operation to copy at least a portion of the metadata of the metadata region, (iii) a reset operation to reset at least the portion of the metadata of the metadata region, (iv) a clone operation to duplicate at least the portion of the metadata of the metadata region, or (v) a computation operation to perform a computation operation to at least the portion of the metadata of the metadata region (see paragraph 28 and 32; the FN field 242 can indicate a given metadata value is to be incremented on read and write accesses, and is to be decremented on reset operations). With respect claim 7, Roberts et al. does not teach wherein the system further comprises a fabric management component, wherein the fabric management component comprises firmware embedded within a baseboard management controller, and wherein the fabric management component associated with the one or more of the plurality of memory devices creates, via an application programming interface, an entry of the data structure, wherein the entry comprises the mapping between the identifier of the first memory region and the identifier of the metadata region associated with the first memory region. However, Lee et al. teaches the CXL switch SW_CXL may be connected with an external network or Fabric and may be configured to communicate with an external server through the external network or Fabric (see paragraph 161). Lee et al. also teaches wherein CXL memory controller 621 may include a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 8, Roberts et al. teaches a non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device (see paragraph 48; computer readable medium), cause the processing device to perform operations comprising: receiving a request to perform a memory access operation at a first memory region of a first memory device of a plurality of memory devices (see paragraph 36; memory module 110 receives a memory access request targeting the memory location); identifying, based on an operation type of the memory access operation, one or more corresponding actions associated with the metadata region (see paragraph 35; an access metadata rule for a memory location (e.g., a row of the storage array 116), indicating how the access metadata for the memory location is to be modified in response to a memory access request. Also in claim 1; in response to the first memory access request, adjusting, at the memory module, first access metadata indicating a pattern of accesses to the first location of the memory module); causing the memory access operation to be performed on a first plurality of memory cells at the first memory device (see paragraphs 35-36; memory module 110 receives a memory access request targeting the memory location. In response, at block 408 the memory module 110 executes the memory access request by, for example, writing data to or reading data from the data payload fields of the memory location); and responsive to causing the memory access operation to be performed, causing at least one of the one or more corresponding actions to be performed on a second plurality of memory cells corresponding to the metadata region (see paragraph 33; in response to receiving the memory access request 350, the ADM 115 modifies the access metadata at the memory location indicated by the metadata pointer field 352. Also in paragraphs 35-37; ADM 115 initiates modification of the access metadata at the memory location by executing a low priority read of the access metadata fields at the memory location). Roberts et al. does not teach determining, based on a data structure referencing a namespace accessible to a host system and to the plurality of memory devices, a mapping between an identifier of the first memory region and an identifier of a metadata region associated with the first memory region. However, Lee et al. teaches CXL memory controller 621 may include a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the medium taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 9, Roberts et al. does not teach wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links. However, Lee et al. teaches wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links (see paragraph 143; host 201 may be directly connected with the plurality of memory devices 202a and 202b. The host 201, the CXL storage 210, and the plurality of CXL memories 220_1 to 220_n may be connected with the CXL switch SW_CXL and may communicate with each other through the CXL switch). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the medium taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 12, Roberts et al. teaches wherein the one or more actions associated with the metadata region comprise at least one of: (i) a move operation to move metadata of the metadata region from a first physical location to a second physical location, (ii) a copy operation to copy at least a portion of the metadata of the metadata region, (iii) a reset operation to reset at least the portion of the metadata of the metadata region, (iv) a clone operation to duplicate at least the portion of the metadata of the metadata region, or (v) a computation operation to perform a computation operation to at least the portion of the metadata of the metadata region (see paragraph 28 and 32; the FN field 242 can indicate a given metadata value is to be incremented on read and write accesses, and is to be decremented on reset operations). With respect claim 14, Roberts et al. does not teach wherein a fabric management component associated with the one or more of the pluralities of memory devices creates, via an application programming interface, an entry of the data structure, wherein the entry comprises the mapping between the identifier of the first memory region and the identifier of the metadata region associated with the first memory region. However, Lee et al. teaches the CXL switch SW_CXL may be connected with an external network or Fabric and may be configured to communicate with an external server through the external network or Fabric (see paragraph 161). Lee et al. also teaches wherein CXL memory controller 621 may include a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the medium taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 15, Roberts et al. teaches receiving, by a processing device, a request to perform a memory access operation at a first memory region of a first memory device of a plurality of memory devices (see paragraph 36; memory module 110 receives a memory access request targeting the memory location); identifying, based on an operation type of the memory access operation, one or more corresponding actions associated with the metadata region (see paragraph 35; an access metadata rule for a memory location (e.g., a row of the storage array 116), indicating how the access metadata for the memory location is to be modified in response to a memory access request. Also in claim 1; in response to the first memory access request, adjusting, at the memory module, first access metadata indicating a pattern of accesses to the first location of the memory module); causing the memory access operation to be performed on a first plurality of memory cells at the first memory device (see paragraphs 35-36; memory module 110 receives a memory access request targeting the memory location. In response, at block 408 the memory module 110 executes the memory access request by, for example, writing data to or reading data from the data payload fields of the memory location); and responsive to causing the memory access operation to be performed, causing at least one of the one or more corresponding actions to be performed on a second plurality of memory cells corresponding to the metadata region (see paragraph 33; in response to receiving the memory access request 350, the ADM 115 modifies the access metadata at the memory location indicated by the metadata pointer field 352. Also, in paragraphs 35-37; ADM 115 initiates modification of the access metadata at the memory location by executing a low priority read of the access metadata fields at the memory location). Roberts et al. does not teach determining, based on a data structure referencing a namespace accessible to a host system and to the plurality of memory devices, a mapping between an identifier of the first memory region and an identifier of a metadata region associated with the first memory region. However, Lee et al. teaches CXL memory controller 621 may include a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the method taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 16, Roberts et al. does not teach wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links. However, Lee et al. teaches wherein each of the plurality of memory devices is a dynamic capacity device connected to the host system via a respective plurality of Compute Express Link (CXL) links (see paragraph 143; host 201 may be directly connected with the plurality of memory devices 202a and 202b. The host 201, the CXL storage 210, and the plurality of CXL memories 220_1 to 220_n may be connected with the CXL switch SW_CXL and may communicate with each other through the CXL switch). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the method taught by Roberts et al. to include the above mentioned to efficiently use the memory (see Lee, paragraph 194). With respect claim 19, Roberts et al. teaches wherein the one or more actions associated with the metadata region comprise at least one of: (i) a move operation to move metadata of the metadata region from a first physical location to a second physical location, (ii) a copy operation to copy at least a portion of the metadata of the metadata region, (iii) a reset operation to reset at least the portion of the metadata of the metadata region, (iv) a clone operation to duplicate at least the portion of the metadata of the metadata region, or (v) a computation operation to perform a computation operation to at least the portion of the metadata of the metadata region (see paragraph 28 and 32; the FN field 242 can indicate a given metadata value is to be incremented on read and write accesses, and is to be decremented on reset operations). Claim(s) 3, 10 and 17 is/are rejected under 35 U.S.C. 103 as being unpatentable over Roberts et al. (US2016/0378668) and Lee et al. (US2023/0359379) as applied to claims 1, 8 and 15 above, and further in view of Durham et al (US2021/0405896) and Clark et al. (US2022/0114086). With respect claim 3, Robert et al. and Lee et al. do not teach wherein the data structure comprises a plurality of entries, wherein each entry comprises an identifier of a memory region, a pointer referencing a physical location of a metadata region associated with the memory region, an identifier of a corresponding range of physical addresses of sets of memory cells residing on the plurality of memory devices. However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). Durham et al. also teaches encoded pointer 310 is created for one of the memory allocations 360 (e.g., 32B allocation, 56B allocation, 48B allocation, 24B allocation, or 64B allocation) and includes memory address 304 for an address within the memory range of that memory allocation (see paragraph 76). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). Roberts et al., Lee et al. and Durham et al. does not teach an identifier of one or more host systems of a plurality of host systems, wherein the memory region is accessible by the one or more host systems. However, Clark et al. teaches host-managed device memory (HDM) decoders 126 that may be programmed to facilitate a mapping of host to device physical addresses for use in system memory (e.g., pooled system memory) (see paragraph 21). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al., Lee et al. and Durham et al. to include the above mentioned to improve the system (see Clark, paragraph 16). With respect claim 10, Robert et al. and Lee et al. do not teach wherein the data structure comprises a plurality of entries, wherein each entry comprises an identifier of a memory region, a pointer referencing a physical location of a metadata region associated with the memory region, an identifier of a corresponding range of physical addresses of sets of memory cells residing on the plurality of memory devices, and an identifier of one or more host systems of a plurality of host systems, wherein the memory region is accessible by the one or more host systems. However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). Durham et al. also teaches encoded pointer 310 is created for one of the memory allocations 360 (e.g., 32B allocation, 56B allocation, 48B allocation, 24B allocation, or 64B allocation) and includes memory address 304 for an address within the memory range of that memory allocation (see paragraph 76). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). Roberts et al., Lee et al. and Durham et al. does not teach an identifier of one or more host systems of a plurality of host systems, wherein the memory region is accessible by the one or more host systems. However, Clark et al. teaches host-managed device memory (HDM) decoders 126 that may be programmed to facilitate a mapping of host to device physical addresses for use in system memory (e.g., pooled system memory) (see paragraph 21). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al., Lee et al. and Durham et al. to include the above mentioned to improve the system (see Clark, paragraph 16). With respect claim 17, Robert et al. and Lee et al. do not teach wherein the data structure comprises a plurality of entries, wherein each entry comprises an identifier of a memory region, a pointer referencing a physical location of a metadata region associated with the memory region, an identifier of a corresponding range of physical addresses of sets of memory cells residing on the plurality of memory devices, and However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). Durham et al. also teaches encoded pointer 310 is created for one of the memory allocations 360 (e.g., 32B allocation, 56B allocation, 48B allocation, 24B allocation, or 64B allocation) and includes memory address 304 for an address within the memory range of that memory allocation (see paragraph 76). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). Roberts et al., Lee et al. and Durham et al. does not teach an identifier of one or more host systems of a plurality of host systems, wherein the memory region is accessible by the one or more host systems. However, Clark et al. teaches host-managed device memory (HDM) decoders 126 that may be programmed to facilitate a mapping of host to device physical addresses for use in system memory (e.g., pooled system memory) (see paragraph 21). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al., Lee et al. and Durham et al. to include the above mentioned to improve the system (see Clark, paragraph 16). Claim(s) 4, 11 and 18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Roberts et al. (US2016/0378668) and Lee et al. (US2023/0359379) as applied to claims 1, 8 and 15 above, and further in view of Durham et al (US2021/0405896). With respect claim 4, Roberts et al. and Lee et al. do not teach wherein the operations further comprise: identifying, based on the data structure referencing the namespace, a first pointer referencing a first physical location of the metadata region associated with the first memory region. However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). With respect claim 11, Roberts et al. and Lee et al. do not teach identifying, based on the data structure referencing the namespace, a first pointer referencing a first physical location of the metadata region associated with the first memory region. However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the medium taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). With respect claim 18, Roberts et al. and Lee et al. do not teach identifying, based on the data structure referencing the namespace, a first pointer referencing a first physical location of the metadata region associated with the first memory region. However, Durham et al. teaches wherein for any given memory allocation slot 140 to which a memory allocation is assigned, unique metadata that is associated with the memory allocation is stored in a metadata region 150 defined in the given memory allocation slot 140… encoding of a virtual/linear address (pointer) for a memory allocation identifies a memory allocation slot to which the memory allocation is assigned and may include unique tag data that is associated with the memory allocation and with embedded metadata in the metadata region of the slot (see paragraph 42). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the method taught by Roberts et al. and Lee et al. to include the above mentioned to reduce memory overhead for storing metadata/tags, while providing performance optimizations (see Durham, paragraph 29). Claim(s) 6, 13 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Roberts et al. (US2016/0378668) and Lee et al. (US2023/0359379) as applied to claims 1, 8 and 15 above, and further in view of Okada et al (US2017/0075816). With respect claim 6, Roberts et al. and Lee et al. do not teach wherein the metadata region associated with the first memory region is associated with a read-only access privilege to the host system. However, Okada et al. teaches wherein IO translation table is a page table and includes an entry for each page (see paragraph 91). The entry of a page includes fields for a page number (#), a translation active flag, a target device, a physical address, a page size, a virtual address, and access rights… The access rights include a Read access right and a Write access right. The Read access right indicates whether Read access to the page can be executed. The Write access right indicates whether Write access to the page can be executed (see paragraph 92). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the system taught by Roberts et al. and Lee et al. to include the above mentioned to provide memory access protection (see Okada, paragraph 75). With respect claim 13, Roberts et al. and Lee et al. do not teach wherein the metadata region associated with the first memory region is associated with a read-only access privilege to the host system. However, Okada et al. teaches wherein IO translation table is a page table and includes an entry for each page (see paragraph 91). The entry of a page includes fields for a page number (#), a translation active flag, a target device, a physical address, a page size, a virtual address, and access rights… The access rights include a Read access right and a Write access right. The Read access right indicates whether Read access to the page can be executed. The Write access right indicates whether Write access to the page can be executed (see paragraph 92). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the medium taught by Roberts et al. and Lee et al. to include the above mentioned to provide memory access protection (see Okada, paragraph 75). With respect claim 20, Roberts et al. and Lee et al. do not teach wherein the metadata region associated with the first memory region is associated with a read-only access privilege to the host system. However, Okada et al. teaches wherein IO translation table is a page table and includes an entry for each page (see paragraph 91). The entry of a page includes fields for a page number (#), a translation active flag, a target device, a physical address, a page size, a virtual address, and access rights… The access rights include a Read access right and a Write access right. The Read access right indicates whether Read access to the page can be executed. The Write access right indicates whether Write access to the page can be executed (see paragraph 92). It would have been obvious to a person having ordinary skill in the art to which said subject matter pertains before the effective filing date of the claimed invention to have modified the method taught by Roberts et al. and Lee et al. to include the above mentioned to provide memory access protection (see Okada, paragraph 75). Response to Arguments Applicant's arguments filed 05/18/2026 have been fully considered but they are not persuasive. Applicant’s representative argues, pages 7-10, that Roberts et al. and Lee et al. alone or in combination does not teach determining, based on a data structure referencing a namespace accessible to a host system and to the plurality of memory devices, a mapping between an identifier of the first memory region and an identifier of a metadata region associated with the first memory region as recited in claims 1, 8 and 15. Applicant’s representative argues, pages 7-8, that Lee et al. provides no teaching that the map data comprises a mapping between an identifier of a memory region and an identifier of a metadata region, as recited by the claim. In response: The examiner disagrees. Lee et al. teaches a storage manager, a mapping table manager, an address mapper, and a metadata buffer (see paragraph 183)… wherein mapping table manager may generate the map data by allocating the map data to the buffer memory BFM. The mapping table manager may modify the map data by changing the map data allocated to the buffer memory BFM. The mapping table manager may delete the map data by deallocating the map data allocated to the buffer memory BFM (see paragraph 185-187). Lee also teaches wherein address mapper may generate the mapping relationship between the physical block address and the logical block address of the user under control of the mapping table manager. For example, the address mapper may receive identification information of the recognized CXL storage (i.e., identified memory region) from the storage manager. The address mapper may generate the mapping relationship between the physical block address and the logical block address of the user data of the recognized CXL storage under control of the mapping table manager... The metadata buffer may store the metadata received from the target CXL storage; and CXL memory of the computing system may generate the map data MD based on the metadata (see paragraphs 190-191 and 216-217). Even though Lee does not use the term “identifier”, the claim limitation is inherently taught by the association, through the mapping information stored in CXL memory, between the CXL storage/ memory region identified by the identification information, the metadata region storing metadata associated with the CXL storage. Applicant’s representative argues, pages 8-10, that Lee et al. provides no teaching for "a namespace accessible to a host system and to the plurality of memory devices.", as recited by the claims. In response: The examiner disagrees. Even though Lee does not explicitly use the term namespace, Lee teaches generating map data corresponding to user data stored in the target CXL storage, wherein the map data may indicate the relationship between a physical block address and a logical block address of the user data (see paragraphs 182-187)… CXL memory of the computing system may generate the map data MD based on the standard, wherein the standard may include a data structure of the logical block address of the user data (see paragraphs 216-217). Lee also teaches wherein map data MD may be stored and managed in the CXL memory 120 placed outside the CXL storage 110 (see paragraph 52), and wherein the CXL memory 120 is accessible to host 101 and CXL storage 110 through CXL switch (see paragraph 49). Even though Lee does not use the term “namespace”, the claim limitation is inherently taught by using a data structure associated with a logical address space (i.e., namespace) to determine/generate a mapping. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Goldberg et al. (US 2016/0011801) teaches storage region metadata management. THIS ACTION IS MADE FINAL. 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 ARACELIS RUIZ whose telephone number is (571)270-1038. The examiner can normally be reached Monday-Friday 11:00am-7:30pm. 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, Reginald G. Bragdon can be reached at (571)272-4204. 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. /ARACELIS RUIZ/Primary Examiner, Art Unit 2139
Read full office action

Prosecution Timeline

Jan 30, 2025
Application Filed
Feb 26, 2026
Non-Final Rejection mailed — §103
May 18, 2026
Response Filed
Sep 01, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12762066
System Control Using Sparse Data
1y 8m to grant Granted Oct 13, 2026
Patent 12717720
CACHING PAGES IN COMPUTE REPLICAS BASED ON AGGREGATE USAGE OF PAGES ACROSS THE COMPUTE REPLICAS
2y 3m to grant Granted Aug 25, 2026
Patent 12717481
NON-DETERMINISTIC MEMORY PROTOCOL
1y 9m to grant Granted Aug 25, 2026
Patent 12699589
GLOBAL COHERENCE OPERATIONS
1y 10m to grant Granted Aug 04, 2026
Patent 12681865
PROCESSORS WITH TOGGLEABLE MEMORY TAGGING EXTENSIONS AND RELATED METHODS
2y 9m to grant Granted Jul 14, 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
99%
With Interview (+12.6%)
2y 5m (~9m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 829 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