Prosecution Insights
Last updated: April 19, 2026
Application No. 19/028,478

MEMORY CONTROLLER FOR SCHEDULING COMMANDS BASED ON RESPONSE FOR RECEIVING WRITE COMMAND, STORAGE DEVICE INCLUDING THE MEMORY CONTROLLER, AND OPERATING METHOD OF THE MEMORY CONTROLLER AND THE STORAGE DEVICE

Non-Final OA §102
Filed
Jan 17, 2025
Examiner
MATIN, TASNIMA
Art Unit
2135
Tech Center
2100 — Computer Architecture & Software
Assignee
SK Hynix Inc.
OA Round
1 (Non-Final)
90%
Grant Probability
Favorable
1-2
OA Rounds
2y 4m
To Grant
98%
With Interview

Examiner Intelligence

Grants 90% — above average
90%
Career Allow Rate
382 granted / 426 resolved
+34.7% vs TC avg
Moderate +9% lift
Without
With
+8.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
13 currently pending
Career history
439
Total Applications
across all art units

Statute-Specific Performance

§101
5.5%
-34.5% vs TC avg
§103
49.4%
+9.4% vs TC avg
§102
16.8%
-23.2% vs TC avg
§112
18.4%
-21.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 426 resolved cases

Office Action

§102
DETAILED ACTION 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. NOTE: It is noted that any citations to specific, pages, columns, lines, or figures in the prior art reference and any interpretations of the reference should not be considered to be limiting in any way. A reference is relevant for all it contains and may be relied upon for all that it would have reasonably suggested to one having ordinary skill in the art. See MPEP 2123. Information Disclosure Statement The references cited in the information disclosure statement (IDS) submitted on 1/17/25, 1/23/25, and 02/26/25 have been considered by the examiner. Claim Rejections - 35 USC § 102 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 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 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. (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claims 1- 7, 11-17 are rejected under 35 U.S.C. 102(a)(1)(a)(2) as being anticipated by Ha et. al., U.S Patent Pub No. 20190146911 (hereinafter Ha). Regarding Claim 1, Ha teaches a memory control device comprising: a controller configured to provide meta data in accordance with normal data being stored in a non-volatile memory device(Fig.1,3,11; Para7-9 "In accordance with an embodiment, a memory system may include a buffer memory storing a plurality of meta-slices constituting meta-data, and a memory controller marking meta-slices being updated, an10ng the plurality of meta-slices stored in the buffer memory, as dirty meta-slices, generating journal data including update information corresponding to the dirty meta-slices, and flushing the journal data together with one of the dirty meta-slices to a nonvolatile memory device" Para33-35) ; and a buffer memory configured to store multiple slices configuring the meta data (Fig.10-12,19; Para7-9 "In accordance with an embodiment, a method of operating a memory system may include loading a plurality of meta-slices constituting meta-data into a buffer memory" Para102-103), wherein the controller is configured to: update in the buffer memory, or writes in the non-volatile memory device, one or more slices among the multiple slices, and enable updating the one or more slices in the buffer memory while writing the one or more slices in the non-volatile memory device (Fig.14,15; Para8-9 "updating a meta-slice map including information on physical addresses storing dirty meta-slices flushed together with the journal entries, updating a journal replay context including index information on the dirty meta-slices flushed together with the journal entries, and flushing an updated meta-slice map and an updated journal replay context to the non-volatile memory device." Para109-112, 129-130, 134-136). Regarding claim 2, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the controller is configured to change state information for the one or more slices based on whether the one or more slices are updated, written, or both updated and written, wherein the state information for one or more slices is stored in the buffer memory(Fig.11-13; Para8-9, 127-130 "The memory controller 1200 may mark the updated meta-slice of the buffer memory device 1300 or the memory buffer 720 as a dirty meta-slice, flush the dirty meta-slice to the non-volatile memory device 1100, and change the dirty meta-slice into a clean meta-slice"). Regarding claim 3, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the state information indicates one of four states including a clean state, a first dirty state, a second dirty state, and a third dirty state(Fig.11-13; Para8-9, 127-130 "clean meta-slices" "dirty meta-slices"). Regarding claim 4, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the controller is configured to: change the state information from the clean state to the first dirty state, or from the second dirty state to the third dirty state, when the one or more slices are updated in the buffer memory, and change the state information from the first dirty state to the second dirty state, or from the second dirty state to the clean state, or from the third dirty to the second dirty state, when the one or more slices are written in the non-volatile memory device( Fig.11-13; Para8-9, 127-130 "The memory controller 1200 may mark the updated meta-slice of the buffer memory device 1300 or the memory buffer 720 as a dirty meta-slice, flush the dirty meta-slice to the non-volatile memory device 1100, and change the dirty meta-slice into a clean meta-slice"). Regarding claim 5, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the state information consist of 2-bit data (Fig.11-13; Para8-9, 127-130). Regarding claim 6, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the controller is configured to: generate first journal data comprising updated information on the one or more slices and store the first journal data in the buffer memory, write the one or more slices of first to third dirty state when the one or more slices of first to third dirty state are present in a state in which the first journal data has a size smaller than a set size, flush the first journal data by changing the first journal data into journal retention data when the first journal data has the set size, and generate second journal data comprising update information on the one or more slices after the flushing of the first journal retention data is started, and store the second journal data in the buffer memory (Fig.11-14,17; Para130-132 "First, referring to FIGS. 11 and 14, when journal data are generated to a predetermined size, the memory controller 1200 may generate a journal entry and store the journal entry in the buffer memory device 1300 or the memory buffer 720." Para158-165). Regarding claim 7, Ha teaches all the limitations of the base claims as outlined above. Further, Ha teaches wherein the second journal data is stored in a different location in the buffer memory than the location at which the journal retention data is stored in the buffer memory (Fig.11-14; Para130-132 "First, referring to FIGS. 11 and 14, when journal data are generated to a predetermined size, the memory controller 1200 may generate a journal entry and store the journal entry in the buffer memory device 1300 or the memory buffer 720."). Regarding claims 11-17, Ha teaches these claims according to the reasoning set forth in claim 1-7. Allowable Subject Matter Claims 8-10 and 18-20 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. The prior art of record, including the reference(s) cited below, neither anticipates, nor renders obvious the recited combination as a whole; including at least the limitations of : “wherein the controller writes one or more slices of first to third dirty state in a state in which the first journal data has a size smaller than a set size by: moving the one or more slices of first to third dirty state to a reserved space of the buffer memory, and writing, when flushing the journal retention data, the one or more slices of first to third dirty state moved to the reserved space together with the journal retention data in the non-volatile memory device.” Conclusion The prior art made of record , listed on form PTO-892, and not relied upon, if any, is considered pertinent to applicant's disclosure. Cho et.al. US20190146910 teaches mapping using segmented meta information table. Any inquiry concerning this communication or earlier communications from the examiner should be directed to TASNIMA MATIN whose telephone number is (571)272-8785. The examiner can normally be reached Monday-Friday 9-5. 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, Jared Rutz can be reached on 571-272-5535. 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. TASNIMA . MATIN Primary Examiner Art Unit 2135 /TASNIMA MATIN/Primary Examiner, Art Unit 2135
Read full office action

Prosecution Timeline

Jan 17, 2025
Application Filed
Mar 03, 2026
Non-Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591513
MEMORY CONTROLLER PERFORMING REFRESH OPERATION AND MEMORY SYSTEM INCLUDING THE SAME
2y 5m to grant Granted Mar 31, 2026
Patent 12585584
SOLID STATE STORAGE DEVICE AND PATROL READ METHOD USING WORD LINE GROUPINGS THEREOF
2y 5m to grant Granted Mar 24, 2026
Patent 12572459
MEMORY WITH IMPROVED INCOMPLETE ACTIVE PERFORMANCE LOSS TASK COMPLETION DETECTION
2y 5m to grant Granted Mar 10, 2026
Patent 12572460
COMPLETING A DEVICE OPERATION INITIATED IN A FIRST MODE IN A SECOND MODE IN A MULTI-PROTOCOL STORAGE DEVICE
2y 5m to grant Granted Mar 10, 2026
Patent 12572464
VEHICLE NON-VOLATILE MEMORY INITIZATION CONTROL STRATEGY
2y 5m to grant Granted Mar 10, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
90%
Grant Probability
98%
With Interview (+8.6%)
2y 4m
Median Time to Grant
Low
PTA Risk
Based on 426 resolved cases by this examiner. Grant probability derived from career allow 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