TW202011186A - Memory storage device and operation method thereof - Google Patents

Abstract

An operation method for a memory storage device is provided. The memory storage device is coupled to a host running a plurality of processes. The memory storage device is includes a memory array and a controller. The operation method includes receiving, by the controller, a first request and a first process ID of a first process among the processes from the host; and based on a first GC (garbage collection) quota parameter corresponding to the first process ID of the first process, sorting, by the controller, the first request and a GC operation, wherein the first GC quota parameter indicating a first GC waiting time of the first process. When the first GC quota parameter corresponding to the first process ID reaches a threshold value, the first request has a sorting priority higher than the GC operation. When the first GC quota parameter corresponding to the first process ID does not reach the threshold value yet, the GC operation has a sorting priority higher than the first request.

Description

Memory storage device and operation method thereof

The present invention relates to a memory storage device and an operation method thereof, and particularly relates to a non-volatile memory storage device and an operation method thereof.

The host (coupled to the memory storage device) may execute one or more processes. These programs may want to access the same or different chips in the memory storage device at the same time. Therefore, when arranging the access sequence of these programs, in principle, the fairness of each program during access should be considered. That is, try not to let a certain program take up too much access time, or a situation where a program has never had a chance to access, which will make the fairness insufficient and reduce system performance.

Therefore, in order to consider the issues of fairness and performance, in the past, a sequencer (scheduler) can be used. If a program occupies too many resources, the sequencer can first block access to the program, and Let other programs access memory.

However, the existing methods do not consider Garbage Collection (abbreviated as GC). Garbage collection is an automatic memory management mechanism in computer science. When the dynamic memory on a computer is no longer needed, it should be released to release the memory. This memory resource management is called garbage collection.

For example, when two programs are accessing memory, if one of the programs triggers the GC, the other program needs to wait for the GC to complete before continuing to access the memory, which will reduce the system performance.

Therefore, how to take into account the fairness of the program when accessing memory is one of the current industry efforts.

According to an embodiment of the present case, an operation method of a memory storage device is proposed. The memory storage device is coupled to a host executing a plurality of programs. The memory storage device includes a memory array and a controller. The method includes: a first request and a first program identification code of a first program among the programs transmitted from the host are received by the controller; and the first program of the controller according to the first program A first garbage collection quota parameter corresponding to the identification code is used to sort the first request and a garbage collection operation. The first garbage collection quota parameter represents a first garbage collection waiting time of the first program. When the first garbage collection quota parameter corresponding to the first program identification code reaches a critical value, the ordering of the first request is superior to the garbage collection operation. When the first garbage collection quota parameter corresponding to the first program identification code does not reach the critical value, the garbage collection operation is ranked better than the first request.

According to another embodiment of the present invention, a memory storage device is provided, which is coupled to a host, and the host executes a plurality of programs. The memory storage device includes: a memory array; and a controller, coupled to the memory The array and the host, the controller receives a first request and a first program identification code of a first program among the programs transmitted from the host, the controller according to the first of the first program A first garbage collection quota parameter corresponding to the program identification code is used to sort the first request and a garbage collection operation. The first garbage collection quota parameter represents a first garbage collection waiting time of the first program. When the first garbage collection quota parameter corresponding to the first program identification code reaches a critical value, the ordering of the first request is superior to the garbage collection operation. When the first garbage collection quota parameter corresponding to the first program identification code does not reach the critical value, the garbage collection operation is ranked better than the first request.

In order to have a better understanding of the above and other aspects of the present invention, the following examples are specifically described in conjunction with the accompanying drawings as follows:

The technical terms of this specification refer to the idioms in the technical field. If this specification describes or defines some terms, the interpretation of these terms shall be based on the description or definition of this specification. Each embodiment of the present disclosure has one or more technical features. Under the premise of possible implementation, those skilled in the art can selectively implement some or all of the technical features in any of the embodiments, or selectively combine some or all of the technical features in these embodiments.

FIG. 1 shows a schematic structural diagram of a memory storage device 200 according to an embodiment of the present case. As shown in FIG. 1, the memory storage device 200 includes a controller 210 and a memory array 220. The memory storage device 200 is coupled to the host 100.

The controller 210 includes a host interface logic (HIL) 230 and a flash translation layer (FTL) 240. In one example, the host interface logic 230 and the flash translation layer 240 are implemented in firmware, but the case is not limited to this.

The flash translation layer 240 includes: a mapping unit 242, a GC manager 244, a fair GC scheduler 246 and a queue 248.

The mapper 242 is used to translate the logical address transmitted from the host 100 into a physical address.

The GC manager 244 is used for GC management. As for the embodiment of the present case, the time point at which the GC manager 244 performs the GC operation is sorted by the fair GC sorter 246.

The fair GC sorter 246 is used to sort the program request and the operation order of the GC, the details of which will be explained below.

The queue 248 is used to store the requests sorted by the fair GC sorter 246 and the operation order of the GC, so that the memory array 220 executes the requests or GC according to the scheduled operation order.

The memory array 220 includes a plurality of memory cells, a plurality of word lines, and a plurality of bit lines arranged in an array. The memory cells are exemplified but not limited to flash memory cells or other non-volatile memory cells, such as phase change memory (Phase Change Random Access Memory, PCRAM), variable resistance Memory (Resistive random-access memory, abbreviated as RRAM or ReRAM), Embedded Multi-Media Card (eMMC), solid-state drive (Solid-state drive or Solid-state disk, SSD for short), etc.

One or more programs P1-PN (N is a positive integer) are running on the operating system of the host 100. In addition, the host 100 further includes an I/O scheduler 110, which sends the request (Req) and the program identification code (PID) to the memory storage according to the received requests of the programs P1-PN In the device 200, the program identification code (PID) can be used to identify which program is issuing the request, that is, different programs are assigned to different program identification codes. The I/O sorter 110 can detect the resource consumption of the programs P1-PN and reallocate resources to the programs P1-PN. The details of the input-output sorter 110 may not be specifically limited here.

Now please refer to FIG. 2, which shows a schematic diagram of the operation of the fair GC sorter 246 according to an embodiment of the present case. As shown in FIG. 2, assume that the execution order scheduled by the I/O sorter 110 from high to low is: GC, PID=1 request (that is, request from program P1), PID=2 request (That is, the request from program P2), the first request with PID=3 (that is, the request from program P3) and the second request with PID=3 (that is, the request from program P3), where , 1 represents priority execution, and 5 represents final execution. However, after checking the GC quota corresponding to each program (the GC quota of programs P1 and P2 has not reached the critical value (eg, the GC quota is not 0), and the GC quota of the program P3 has reached the critical value (eg GC The quota is 0)), the fair GC sorter 246 reorders the execution order as: the first request with PID=3 (that is, the request from program P3), and the second request with PID=3 (that is, from Program P3 request), GC, PID=1 request (ie, request from program P1), PID=2 request (ie, request from program P2). In terms of GC quota, if the GC quota of a program reaches a critical value (such as but not limited to, GC quota = 0), it means that the request issued by the program has a high priority execution order (higher than the GC execution order) ); Conversely, if the GC quota of a program does not reach the critical value (such as but not limited to, the GC quota is not equal to 0), it means that the request issued by the program does not have a high priority execution order (lower than the GC execution order) ). The details of the GC quota will be explained later. The execution order sorted by the fair GC sorter 246 is temporarily stored in the queue 248, and then the memory array 220 is accessed or GCed according to the execution order sorted by the fair GC sorter 246.

Now, in an embodiment of the present case, how to determine the execution order of the GC and the request will be further described. Please refer to FIG. 3, which shows an operation schematic diagram according to an embodiment of the present case. The horizontal axis is the time axis, and the leftmost side represents T=0. Assume that at the time point T _GC-start , the fair GC sorter 246 is scheduled to start performing GC. After that, at the time point T _R-arrival , a program request 1 arrives, and the GC credit corresponding to the program has not yet reached the critical value (assuming that the GC credit is currently 5), so the GC can continue to execute. Since the GC is currently being executed, the program's request 1 must wait. Each time the request 1 of the program waits for a time unit, its GC quota decreases by a fixed value (for example, 1) (that is, the GC quota is updated by the fair GC sorter 246). Therefore, when the program's request 1 waits for 5 time units (the GC wait time is 5 time units), its GC quota is reduced from 5 to 0, so at this time, the fair GC sorter 246 suspends the execution of the GC (As shown by time point T _GC-suspend ), because the fair GC sorter 246 must let the program request 1 execute. After the execution of request 1 of the program is completed, the fair GC sorter 246 resumes the execution of the GC (as shown by the time point T _GC-resume ) until the GC execution ends (as shown by the time point T _GC-complete ).

That is to say, in the embodiment of this case, the GC quota of the program represents the GC waiting time of the program. Each time a unit of time waits, the program's GC quota decreases by 1 (or a fixed value) until the program's GC quota reaches a critical value (that is, in this example, the program's GC quota gradually decreases). Once the GC quota of the program reaches the critical value, the fair GC sorter 246 will give high priority to the program whose GC quota reaches the critical value, and pause the currently executing GC (even if the currently executing GC has not been completed) If the GC quota reaches the threshold, the program can be allowed to access the memory.

Of course, in other possible embodiments of this case, the GC quota of the program may increase by 1 (or by a fixed value) for each time unit waited until the GC quota of the program reaches a critical value (that is, here In the example, the GC quota of the program gradually increases). Once the GC quota of the program reaches a critical value, the fair GC sorter 246 will give high priority to the program whose GC quota reaches the critical value, and pause the currently executing GC (even if the currently executing GC has not been completed) If the GC quota reaches the threshold, the program can be allowed to access the memory.

Please refer to FIG. 4, which shows another schematic diagram of operation according to an embodiment of the present case. The horizontal axis is the time axis, and the leftmost side represents T=0. Suppose that at time T1, the fair GC sorter 246 receives 2 requests (request 1 and request 2) and the GC executes the request. Request 1 and request 2 correspond to program 1 and program 2, respectively, where at T1, the program The GC limit of 1 is GC-Q1=0 (reaching the critical value), and the GC limit of program 2 is GC-Q2=X (X is not equal to 0).

Since the GC quota of the program 1 GC-Q1=0, the fair GC sorter 246 gives priority to the request 1 of the program 1. At time T2, the execution of the request 1 of the program 1 is completed. Therefore, the GC is then executed.

At time T3, the GC has executed X time units, and the GC quota GC-Q2 of the program 2 at this time has been updated from X to 0 (GC-Q2=0). Therefore, at time T3, the fair GC sorter 246 suspends the execution of the GC and executes request 2 with priority. At time T4, the execution of request 2 is completed. At this time, the fair GC sorter 246 resumes the execution of the GC. At time T5, the execution of the GC is completed.

That is to say, in the embodiment of this case, the fair GC sorter 246 periodically checks the GC quota corresponding to each program. If the GC quota of a certain program reaches a critical value, the fair GC sorter 246 prioritizes that the program can Access memory (that is, the program request can be executed). In this way, you can avoid a program waiting for GC too long and affecting performance.

Now, how the fair GC sorter 246 updates and resets the GC quota will be explained. As described above, every time the GC executes a time unit, the GC quotas of all programs are updated once until the threshold is reached.

In an embodiment of this case, a GC quota epoch is set, which is related to the reset of the GC quota. When the GC credit period ends, the GC credit of all programs will be reset (for example, reset to 10). As for how to determine the end of the GC quota period, there are two principles. The first principle is that if the GC quota of all programs reaches a critical value, it can be regarded as the end of the GC quota period. The second principle is to set an additional anticipation period. After resetting all GC credits of all programs, when the earliest GC credit that reaches the threshold appears, set the expected period (for example, but not limited to, 20 seconds), and start timing. If any of the remaining GC quotas reaches a critical value, the expected period is reset (that is, the expected period is returned to the initial value, for example, 20 seconds); otherwise, the expected period is continued to be timed. If the expected period can be timed until the end, then all GC credits are reset. That is, after the GC quota of a certain program reaches the critical value, if no GC quota of any other program reaches the critical value within the timing time of the expected period (that is, 20 seconds), after the end of the expected period, Reset all GC credits. The second principle is to avoid that if the GC quota of a program (or some) has not reached the critical value, it means that the program (or programs) has not been executed by the GC during this period of time and delayed its execution. Memory access. Therefore, all GC credits can be reset.

That is to say, in one embodiment of this case, when GC is triggered, when the GC quota of any program reaches a critical value, the fair GC sorter 246 requests the program (or programs) whose GC quota reaches the critical value. Priority. Conversely, if the GC quota of all programs does not reach the critical value when the GC is triggered, the fair GC sorter 246 will give priority to the GC.

FIG. 5 shows the operation method of the memory storage device according to an embodiment of the present case. As shown in FIG. 5, in step 510, the controller receives the first request of the first program and the first program identification code transmitted from the host. In step 520, the controller sorts the first request and the garbage collection operation according to the first garbage collection quota parameter corresponding to the first program identification code.

In summary, in the embodiment of the present invention, by penetrating into the GC quota, the resources originally allocated to the program can be avoided to be wasted due to the execution of GC. In this way, it can be avoided that the execution of the program has been delayed by the GC's execution of the program's access to the memory. Therefore, the performance of the embodiment can be avoided by this embodiment, and fairness can also be considered.

In summary, although the present invention has been disclosed as above with examples, it is not intended to limit the present invention. Those with ordinary knowledge in the technical field to which the present invention belongs can make various modifications and retouching without departing from the spirit and scope of the present invention. Therefore, the scope of protection of the present invention shall be deemed as defined by the scope of the attached patent application.

200: memory storage device 210: controller 220: memory array 230: host interface logic 240: flash translation layer 242: mapper 244: GC manager 246: fair GC sequencer 248: queue 100: host P1- PN: program 110: I/O sequencer Req: request PID: program identification code T _GC-start , T _R-arrival , T _GC-suspend , T _GC-resume , T _GC-complete : time point T1-T5: time point 510, 520: steps

FIG. 1 shows a schematic structural diagram of a memory storage device according to an embodiment of the present case. Figure 2 shows a schematic diagram of the operation of a fair GC sorter according to an embodiment of the present case. Figure 3 shows a schematic diagram of operation according to an embodiment of the present case. Figure 4 shows another schematic diagram of operation according to an embodiment of the present case. FIG. 5 shows the operation method of the memory storage device according to an embodiment of the present case.

510-520: steps

Claims (10)

An operation method of a memory storage device is coupled to a host that executes a plurality of programs. The memory storage device includes a memory array and a controller. The operation method includes: receiving by the controller A first request and a first program identification code of a first program among the programs transmitted from the host; and a first program identification code corresponding to the first program identification code of the first program A garbage collection quota parameter to sort the first request and a garbage collection operation, the first garbage collection quota parameter represents a first garbage collection waiting time of the first program, wherein, when the first program identification code When the corresponding first garbage collection quota parameter reaches a critical value, the first request is sorted better than the garbage collection operation; and when the first garbage collection quota parameter corresponding to the first program identification code does not reach the threshold At a critical value, the order of the garbage collection operation is better than the first request. The operation method of the memory storage device as described in item 1 of the patent application scope, wherein, if during the execution of the garbage collection operation, the first request of the first program reaches the controller, and the first program identification code The corresponding first garbage collection quota parameter has not yet reached the critical value, the controller allows the garbage collection operation to continue to execute and the first request of the first program is waiting; the first request of the first program While waiting, the controller updates the first garbage collection quota parameter; if the first garbage collection quota parameter reaches the critical value and the garbage collection operation has not been completed, the controller suspends the garbage collection operation and executes the first The first request of a program; and when the execution of the first request of the first program is completed, the controller resumes the garbage collection operation. The operation method of the memory storage device as described in item 1 of the patent application scope, wherein, if at a first time point, the controller receives a second request, a third request of a second program of the programs A third request of the program and the garbage collection operation, a second garbage collection quota parameter corresponding to a second program identification code of the second program has reached the critical value, and a third program of the third program is identified A third garbage collection quota parameter corresponding to the code has not yet reached the critical value, then the controller sorts: the second request, the garbage collection operation, and the third request. The operation method of the memory storage device as described in item 1 of the patent application scope, wherein each time the garbage collection operation is executed for a time unit, the controller updates the plurality of garbage collection quota parameters corresponding to the programs until it reaches The threshold value; and if a garbage collection quota parameter of one of the programs has reached the threshold value, the controller keeps the garbage collection quota parameter of the programs of the programs to remain at the threshold value until Until the garbage collection quota parameter of the program of the programs is reset. The operation method of the memory storage device as described in item 1 of the patent application scope, wherein the controller sets a period of the garbage collection quota parameter; when the period of the garbage collection quota parameter ends, the controller resets the programs Corresponding plural garbage collection quota parameters; if the garbage collection quota parameters corresponding to the programs all reach the critical value, the controller allows the garbage collection quota parameter period to end and the controller resets the programs The corresponding garbage collection quota parameters; after the controller resets the garbage collection quota parameters corresponding to the programs, when one of the garbage collection quota parameters reaches the threshold at the earliest, the controller further sets An expected period and start timing; if any of the remaining garbage collection quota parameters reaches the critical value, the controller resets the expected period, otherwise, the controller lets The expected period continues to be timed; and if the expected period is timed out until the end, the controller resets all the garbage collection quota parameters. A memory storage device is coupled to a host, the host executes a plurality of programs, the memory storage device includes: a memory array; and a controller, coupled to the memory array and the host, the controller Receiving a first request and a first program identification code of a first program among the programs transmitted from the host, the controller according to a first program identification code corresponding to the first program identification code of the first program A garbage collection quota parameter to sort the first request and a garbage collection operation, the first garbage collection quota parameter represents a first garbage collection waiting time of the first program, wherein, when the first program identification code When the corresponding first garbage collection quota parameter reaches a critical value, the first request is sorted better than the garbage collection operation; and when the first garbage collection quota parameter corresponding to the first program identification code does not reach the threshold At a critical value, the order of the garbage collection operation is better than the first request. The memory storage device as described in item 6 of the patent application scope, wherein, during the execution of the garbage collection operation, if the first request of the first program reaches the controller, and the first program identification code corresponds to The first garbage collection quota parameter has not yet reached the threshold, the garbage collection operation continues to execute and the first request of the first program is waiting; while the first request of the first program is waiting, the controller updates the The first garbage collection quota parameter; if the first garbage collection quota parameter reaches the critical value and the garbage collection operation has not yet been completed, the controller suspends the garbage collection operation and executes the first request of the first program; And when the execution of the first request of the first program is completed, the controller resumes the garbage collection operation. The memory storage device as described in item 6 of the patent application scope, wherein, if at a first time point, the controller receives a second request of a second program of the programs and a third program of a third program The third request and the garbage collection operation, a second garbage collection quota parameter corresponding to a second program identification code of the second program has reached the critical value, and a third program identification code corresponding to the third program A third garbage collection quota parameter has not yet reached the critical value, then the controller sorts: the second request, the garbage collection operation and the third request. The memory storage device as described in item 6 of the patent application scope, wherein each time the garbage collection operation is performed for a time unit, the controller updates the plurality of garbage collection quota parameters corresponding to the programs until the threshold is reached So far; and if a garbage collection quota parameter of one of the programs has reached the threshold, the garbage collection quota parameter of the program of the programs continues to remain at the threshold until the program’s The garbage collection quota parameter is reset. The memory storage device as described in item 6 of the patent application scope, wherein the controller sets a garbage collection quota parameter period; when the garbage collection quota parameter period ends, the controller resets the plurals corresponding to the programs Garbage collection quota parameters; if the garbage collection quota parameters corresponding to the programs all reach the critical value, the garbage collection quota parameter period ends and the controller resets the garbage collection quotas corresponding to the programs Parameters; after the controller resets the garbage collection quota parameters corresponding to the programs, when one of the garbage collection quota parameters reaches the threshold at the earliest, the controller sets an expected period and starts timing ; If any of the remaining garbage collection quota parameters reaches the critical value, the controller resets the expected period; otherwise, the controller allows the expected period to continue timing; and If the expected period is counted until the end, the controller resets all the garbage collection quota parameters.

Images