Prosecution Insights
Last updated: October 26, 2026
Application No. 19/227,353

PRE-READ ALGORITHM FOR A SEQUENTIAL READ OPERATION OF A MEMORY SYSTEM

Final Rejection §103
Filed
Jun 03, 2025
Priority
Jun 12, 2024 — provisional 63/659,234
Examiner
KHAN, MASUD K
Art Unit
2132
Tech Center
2100 — Computer Architecture & Software
Assignee
Micron Technology Inc.
OA Round
2 (Final)
88%
Grant Probability
Favorable
3-4
OA Rounds
11m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
399 granted / 456 resolved
+32.5% vs TC avg
Moderate +7% lift
Without
With
+6.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
22 currently pending
Career history
492
Total Applications
across all art units

Statute-Specific Performance

§101
2.3%
-37.7% vs TC avg
§103
63.6%
+23.6% vs TC avg
§102
16.9%
-23.1% vs TC avg
§112
11.0%
-29.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 456 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Response to Arguments Applicant's arguments filed on 09/08/2026 have been fully considered but they are not persuasive except for claim 9. Applicant argues that Zheng fails to teach or suggest the claimed sequence of storing a first command in a command queue and subsequently “receiving, after setting the value of the flag, a third command,” because Zheng allegedly groups and reorders multiple received commands simultaneously and therefore does not disclose the claimed temporal relationship. Applicant further argues that Zheng is silent regarding setting the claimed flag. The argument is not persuasive because the rejection does not rely upon Zheng alone for each limitation of claim 1. Rather, the rejection is based upon the combined teachings of Zheng, Olbrich, and Chow. As explained in the Office Action, Zheng teaches a sequential-read architecture in which read commands are received and reordered and a sequential read stream is established according to continuity of the access addresses. Zheng further teaches pre-reading data associated with the sequential read operation. Applicant's argument that Zheng's grouping/reordering of commands occurs “simultaneously” does not establish that Zheng's system is incapable of receiving a subsequent read command after an earlier operation has occurred. The cited disclosure describes the manner in which received commands are organized into sequential read streams; it does not require that all commands subsequently processed by the system must have been received at the same instant, nor does it preclude subsequent commands from being received during continued operation of the SSD. Moreover, the rejection does not rely upon Zheng for the claimed flag limitation. As expressly acknowledged in the Office Action, Zheng and Olbrich do not explicitly teach setting the claimed flag. Chow was relied upon to supply this feature. Chow teaches a Data Valid Flag (DVF), wherein the flag is set when valid data is present in the AFB and cleared when valid data is no longer present. Thus, Chow provides an express teaching of using a flag to indicate the validity/presence of data stored in a buffer. Applicant argues that Chow merely describes “receiving data from the host” and that Chow's STOP command is not the claimed “third command to read” data. This argument attacks Chow individually rather than the proposed combination. Chow is not relied upon as independently teaching the complete sequence of commands recited in claim 1. Rather, Zheng provides the sequential-read command processing, while Chow supplies the known technique of maintaining a flag indicating the validity/presence of buffered data. Accordingly, one of ordinary skill in the art, applying Chow's data-valid indication to the buffered sequential-read data of the Zheng/Olbrich system, would have understood the flag to indicate whether the relevant buffered data is available for use when processing a subsequent read command. The fact that Chow describes its flag in connection with host-data buffering does not negate its teaching of the underlying technique—maintaining state information identifying whether buffered data is valid and available. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim(s) 1-3, 8, 11-13, 16 and 18-20 is/are rejected under 35 U.S.C. 103 as being unpatentable over ZHENG et al. [CN106339326A] in view of Olbrich et al. [US 8,738,841 B2] and in further view of Chow et al. [US 8,108,590 B2]. Claim 1 is rejected over ZHENG, Olbrich and Chow. ZHENG teaches “A memory system, comprising: one or more memory devices; and processing circuitry coupled with the one or more memory devices and configured to cause the memory system to:” as “ In this way, the SSD can access the actual storage array of the flash memory” [Spec] “store a first command in a command queue, the first command indicating to read a first set of data from at least one of the one or more memory devices of the memory system;” as “The re-established sequential read command stream is consistent with each thread-initiated sequential read request of the host, and Sequential Read Streams 1, 2, and 3 correspond to the command streams of threads 1, 2, and 3 of the host terminal, respectively.” [Spec] “transmit, based at least in part on executing the first command, a second command to read a second set of data from at least one of the one or more memory devices;” as “then the data of the N block sizes continues to be read to the FLASH read channel to set the pre-read buffer according to the logical block address sequence of the previous read command;” [Spec] “receive, after setting the value of the flag, a third command to read the at least subset of the second set of data; and” as “in order to play the advantage of sequential read performance of the SSD, a read command reordering module is added to the SSD, a received command is reordered inside the SSD, and a corresponding read command stream group Sequential Read Stream is established according to the continuity of the access address of the read command. The re-established sequential read command stream is consistent with each thread-initiated sequential read request of the host, and Sequential Read Streams 1, 2, and 3 correspond to the command streams of threads 1, 2, and 3 of the host terminal, respectively.” [Spec] ZHENG does not explicitly teach store the second set of data in a buffer of the memory system based at least in part on receiving the second set of data, wherein the buffer comprises a plurality of portions and at least a subset of the second set of data is stored in a first portion of the plurality of portions; set a value of a flag associated with the first portion based at least in part on storing the at least subset of the second set of data in the first portion, the value of the flag indicating that the at least subset of the second set of data has been transferred to the first portion; transmit the subset of the second set of data based at least in part on the third command and the value of the flag. However, Olbrich teaches “store the second set of data in a buffer of the memory system” as “Each Flash Port includes a Flash HEMi and a Stage Buffer (e.g., Flash Port 0 304 contains Flash HEMi 0 307 and Flash Stage Buffer 0 308).” [Col 6, lines 52-55] “based at least in part on receiving the second set of data, wherein the buffer comprises a plurality of portions and” as “ In the currently preferred embodiment, each Flash Stage Buffer is a dual port SRAM that can handle one read and one write concurrently,” [Col 6, lines 63-65] “at least a subset of the second set of data is stored in a first portion of the plurality of portions;” as “wherein the second set of buffers are further configured to store data read from any subset of the buffers in the set of flash stage buffers in logical block address order.” [Claim 14] ZHENG and Olbrich are analogous arts because they teach I/O system and storage management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of ZHENG and Olbrich before him/her, to modify the teachings of ZHENG to include the teachings of Olbrich with the motivation of it is advantageous to stripe LBAs across Flash Groups, since this maximizes the likelihood that a single transaction will address data held on more than one Flash Group, thereby allowing multiple flash reads or writes relevant to the transaction to occur simultaneously. [Olbrich, Col 19, lines 45-50] The combination of ZHENG and Olbrich does not explicitly teach set a value of a flag associated with the first portion based at least in part on storing the at least subset of the second set of data in the first portion, the value of the flag indicating that the at least subset of the second set of data has been transferred to the first portion; transmit the subset of the second set of data based at least in part on the third command and the value of the flag. However, Chow teaches “set a value of a flag associated with the first portion based at least in part on storing the at least subset of the second set of data in the first portion, the value of the flag indicating that the at least subset of the second set of data has been transferred to the first portion;” as “The data valid flag (DVF) is set when there is valid data in the AFB, but cleared when no valid data is in the AFB.” [Col 6, lines 52-54] “transmit the subset of the second set of data based at least in part on the third command and the value of the flag.” as “FIG. 9 is a flowchart of selecting an available Aggregating Flash Block (AFB) for receiving host data remaining in the page buffer when the host sends a STOP command. ” [Col 10, lines 59-61] ZHENG, Olbrich and Chow are analogous arts because they teach I/O system and storage management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of ZHENG, Olbrich and Chow before him/her, to modify the teachings of combination of ZHENG and Olbrich to include the teachings of Chow with the motivation of the electronic data flash card has a small volume but a large storage capability, thereby resulting in convenience during data transfer; and second, because everyone has a unique fingerprint, the electronic data flash card only permits authorized persons to access the data files stored therein, thereby resulting in enhanced security. [Chow, Col 15, line 65 – Col 16, line 5] Claim 2 is rejected over ZHENG, Olbrich and Chow. ZHENG teaches “determine whether the third command corresponds to a first type of command, the first type of command comprising a sequential read command, wherein transmitting the subset of the second set of data is based at least in part on determining that the third command corresponds to the first type of command.” as “ The re-established sequential read command stream is consistent with each thread-initiated sequential read request of the host, and Sequential Read Streams 1, 2, and 3 correspond to the command streams of threads 1, 2, and 3 of the host terminal, respectively.” [Spec] Claim 3 is rejected over ZHENG, Olbrich and Chow. ZHENG teaches “determine whether the third command comprises a read command for the at least subset of the second set of data, wherein transmitting the at least subset of the second set of data is based at least in part on determining that the third command comprises the read command.” as “ The method for improving sequential read performance of a solid state disk is characterized in that a read command accessed by a logical block address accessed by a read command is grouped into a same read command stream group.” [Spec] Claim 8 is rejected over ZHENG, Olbrich and Chow. ZHENG does not explicitly teach communicate a host read data transfer module request to an interface between the memory system and a host system, wherein identifying the value of the flag is based at least in part on the host read data transfer module request. However, Olbrich teaches “communicate a host read data transfer module request to an interface between the memory system and a host system, wherein identifying the value of the flag is based at least in part on the host read data transfer module request.” as “Open Flag 3508 is set when the SuperBlock is opened for writing.” [Col 48, lines 40-41] Claim 11 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 1. Claim 12 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 2. Claim 13 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 3. Claim 17 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 8. Claim 18 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 1. Claim 19 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 2. Claim 20 is rejected over ZHENG, Olbrich and Chow under the same rationale of rejection of claim 3. Claim(s) 7, 10 and 16 is/are rejected under 35 U.S.C. 103 as being unpatentable over ZHENG et al. [CN106339326A] in view of Olbrich et al. [US 8,738,841 B2] in further view of Chow et al. [US 8,108,590 B2] and yet in further view of Parks et al. [US 2017/0301386 A1]. Claim 7 is rejected over ZHENG, Olbrich, Chow and Parks. The combination of ZHENG, Olbrich and Chow does not explicitly teach refrain from performing a read task corresponding to the third command based at least in part on determining that the third command corresponds to the at least subset of the second set of data and the value of the flag. However, Parks teaches “refrain from performing a read task corresponding to the third command based at least in part on determining that the third command corresponds to the at least subset of the second set of data and the value of the flag.” as “If the flag is set, the DRAM controller refrains from reading the DRAM and returns a value of zero.” [Abstract] ZHENG, Olbrich, Chow and Parks are analogous arts because they teach I/O system and storage management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of ZHENG, Olbrich, Chow and Parks before him/her, to modify the teachings of combination of ZHENG, Olbrich and Chow to include the teachings of Parks with the motivation of less power may be consumed because the DRAM block need not be refreshed to maintain a zero value; [Parks, ¶0026] Claim 10 is rejected over ZHENG, Olbrich, Chow and Parks. The combination of ZHENG, Olbrich and Chow does not explicitly teach wherein each portion of the plurality of portions are configured to store 64 kilobytes of data. However, Parks teaches “wherein each portion of the plurality of portions are configured to store 64 kilobytes of data.” as “ common page sizes are 4 KB, 64 KB, 1 MB, 16 MB, 256 MB, 1 GB and 2 GB.” [¶0013] ZHENG, Olbrich, Chow and Parks are analogous arts because they teach I/O system and storage management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of ZHENG, Olbrich, Chow and Parks before him/her, to modify the teachings of combination of ZHENG, Olbrich and Chow to include the teachings of Parks with the motivation of less power may be consumed because the DRAM block need not be refreshed to maintain a zero value; [Parks, ¶0026] Claim 16 is rejected over ZHENG, Olbrich, Chow and Parks under the same rationale of rejection of claim 7. Claim(s) 9 is/are rejected under 35 U.S.C. 103 as being unpatentable over ZHENG et al. [CN106339326A] in view of Olbrich et al. [US 8,738,841 B2] in further view of Chow et al. [US 8,108,590 B2] and yet in further view of BEN-RUBI. [US 2022/0283736 A1]. Claim 9 is rejected over ZHENG, Olbrich, Chow and BEN-RUBI. The combination of ZHENG, Olbrich and Chow does not explicitly teach wherein a queue depth associated with the command queue is equal to one. However, BEN-RUBI teaches “wherein a queue depth associated with the command queue is equal to one.” as “ common page sizes are 4 KB, 64 KB, 1 MB, 16 MB, 256 MB, 1 GB and 2 GB.” [¶0013] ZHENG, Olbrich, Chow and BEN-RUBI are analogous arts because they teach I/O system and storage management. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of ZHENG, Olbrich, Chow and BEN-RUBI before him/her, to modify the teachings of combination of ZHENG, Olbrich and Chow to include the teachings of BEN-RUBI with the motivation of need in the art for an improved parallel read operation [BEN-RUBI, ¶0004] Allowable Subject Matter Claims 4, 9 and 14 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim 4 and 14 recite “determine whether the fourth command corresponds to a second type of command different from a first type of command that comprises a sequential read command; and increment a counter based at least in part on determining that the fourth command corresponds to the second type of command, wherein transmitting the at least subset of the second set of data is based at least in part on determining that the value of the counter does not satisfy a threshold.” This concept is not taught by the prior arts of record. Claims 5-6 and 15 are objected because they are dependent on claims 4 and 14 respectively and includes the same subject matters of claim 4 and 14. Conclusion 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 MASUD K KHAN whose telephone number is (571)270-0606. The examiner can normally be reached Monday-Friday (8am-5pm). Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Hosain Alam can be reached at (571) 272-3978. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /MASUD K KHAN/ Primary Examiner, Art Unit 2132
Read full office action

Prosecution Timeline

Jun 03, 2025
Application Filed
Jun 11, 2026
Non-Final Rejection mailed — §103
Sep 08, 2026
Response Filed
Oct 14, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12761823
Power Aware Memory Allocation and Freeing
3y 0m to grant Granted Oct 13, 2026
Patent 12755152
METHOD AND SYSTEM FOR A TEMPERATURE-RESILIENT NEURAL NETWORK TRAINING MODEL
3y 0m to grant Granted Oct 06, 2026
Patent 12754770
CLOUD APPLICATION THRESHOLD BASED THROTTLING
1y 10m to grant Granted Oct 06, 2026
Patent 12743377
PARALLEL PROCESSING ARCHITECTURE WITH BLOCK MOVE SUPPORT
2y 1m to grant Granted Sep 22, 2026
Patent 12737301
SOFTWARE INTERFACE TO XPU ADDRESS TRANSLATION CACHE
4y 0m 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
88%
Grant Probability
94%
With Interview (+6.8%)
2y 4m (~11m remaining)
Median Time to Grant
Moderate
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