CN100414516C - Two-way data storaging method - Google Patents
Two-way data storaging method Download PDFInfo
- Publication number
- CN100414516C CN100414516C CNB2004100980716A CN200410098071A CN100414516C CN 100414516 C CN100414516 C CN 100414516C CN B2004100980716 A CNB2004100980716 A CN B2004100980716A CN 200410098071 A CN200410098071 A CN 200410098071A CN 100414516 C CN100414516 C CN 100414516C
- Authority
- CN
- China
- Prior art keywords
- storage
- memory block
- data
- total amount
- write
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a data storage method for writing storage data in a storage device. The storage device comprises a memory block which comprises a first end and a second end; the data storage method comprises the following steps: receiving storage data and selecting a storage direction; when a first storage direction is selected as the storage direction, the first end is an initiation point of the first storage direction; when a second storage direction is selected as the storage direction, the second end is the initiation point of the second storage direction. In addition, the storage data is written in the memory block according to the storage direction.
Description
Technical field
The present invention relates to a kind of method of storage data, the particularly a kind of method that can carry out the bi-directional data storage by the two ends of a memory block.
Background technology
Generally speaking, industry storage method commonly used can roughly be divided into three kinds: orderly storing method, non-orderly storing method and hash (hash) storing method.In order the characteristics of storing method are that each data that write all is stored in the internal memory in the mode of orderly arrangement, that is when whenever writing data, and the action that system just must carry out a minor sort makes all data in the internal memory all according to series arrangement.Non-orderly storage rule is that the data that desire stored according to the sequencing that stores are one by one in the write memory, therefore, compared to orderly storing method, non-orderly storage rule can be omitted and whenever write the action that data will sort, yet, because the arrangement mode of each stored data does not have any rule in the internal memory, therefore system must provide a mapping table (mapping table) to write down the start address and the size of each data in addition, search item by item so that subsequent reads not be used in when fetching data in the internal memory, but access is carried out in the position of directly reading these data from mapping table.For the hash storing method, it is to utilize a hash function (hashfunction) that each data is performed calculations, wherein the value of calculation generation can correspond to a predetermined memory address, therefore write or during access, system only needs to calculate the pairing value of these data according to above-mentioned hash function just can find corresponding memory address no matter be.
Yet, when above-mentioned three kinds of storage methods are applied to have the system of less internal memory, just each have its restriction, with cell phone system, because the common internal memory of cell phone system is less, so when using above-mentioned hash storing method,, then may cause the situation of internal memory waste if the selection of hash function is improper.Compared to the hash storing method,, owing to whenever write the work that data all need sort, also be one to bear greatly for the not strong cell phone system of calculation function though in order storing method can effectively utilize all internal memories.Thus, for the selection of comparatively trading off seemingly of the non-orderly storing method of cell phone system, though non-orderly storing method is that many storage datas are stored in the internal memory according to the sequencing that writes, but the time one is of a specified duration, no matter use the storage space that is released (released) in above-mentioned any storage method internal memory to exist in this internal memory and can't be repeated to use in discontinuous mode, therefore must just reform at set intervals to this internal memory, that is, allow the remaining space in above-mentioned discontinuous storage space and the internal memory combine, so that the storage data of redistributing to other uses.
See also Fig. 1, Fig. 1 is the synoptic diagram for the memory block 10 of using existing non-orderly storing mode.As shown in FIG., memory block 10 is to comprise a plurality of storage data D that deposited at this moment
1, D
3, D
5, D
8, D
9, D
10Storage space 12,16,22,28,32,34, a plurality of d/d storage spaces (oblique line part) 14,18,24,26, and a storage space that had not used 36.This is because when receiving the first stroke storage data D
1The time, memory block 10 can write storage data D along the direction of arrow 20 memory allocated spaces 12
1, and then second storage data D that writes given in memory allocated space 14
2, in like manner, many storage data D
3-D
10Can be constantly write memory block 10 in order, last, memory block 10 just memory allocated space 34 is given the 10th storage data D that writes
10Afterwards, (the storage data D for example because some storage data
2, D
4, D
6, D
7) may no longer be used by system, so system just can discharge the storage data D that those do not re-use
2, D
4, D
6, D
7The storage space at place (oblique line part) 14,18,24,26, because remaining space 36 all can be distributed to other storage data with the storage area 14,18,24,26 this moments, so system can reform to memory block 10, make storage space 14,18,24,26 concentrate on the left side of memory block 10, that is after merging with storage space 36, could use for other storage data in more efficient storage allocation space.Because the action of above-mentioned reformation must be carried out repeatedly and execution each time all can expend a large amount of operation times, the operand of elevator system significantly not only, also can allow the user produce the sensation of delay of response, therefore, the operand that how effectively to utilize storage space to reduce the internal memory reformation simultaneously is major subjects of the present invention.
Summary of the invention
Therefore, one of fundamental purpose of the present invention is to provide a kind of two-way data storaging method, to solve the problem of above-mentioned internal memory reformation overlong time.
According to the present invention, it is to disclose a kind of two-way data storaging method that is applied to a storage device.This storage device includes a plurality of memory blocks.This two-way data storaging method includes: receive a storage data; Store direction and one second from one first of a target memory block and store selection one storage direction in the direction; And this storage data is write this target memory block according to this storage direction.
Data storage method of the present invention is optionally to write storage data from the two ends of a memory block, makes the size of data that need reform can be reduced to half at most, reforms the required time significantly to reduce internal memory.
Description of drawings
Fig. 1 is for using the synoptic diagram of the memory block that has non-orderly storing mode now.
Fig. 2 is the process flow diagram of an embodiment of two-way data storaging method of the present invention.
Fig. 3 is applied to the synoptic diagram of a storage device for two-way data storaging method of the present invention.
Fig. 4 is the synoptic diagram of the employed mapping table of two-way data storaging method of the present invention.
Fig. 5 is the process flow diagram of the step of select target memory block among Fig. 2.
Fig. 6 is applied to the synoptic diagram of another storage device for two-way data storaging method of the present invention.
Fig. 7 is the synoptic diagram of two-way data storaging method reformation of the present invention storage device shown in Figure 6.
The reference numeral explanation
| 140、300 | Storage device |
| 10、160a、160n、320、340、360 | Memory block |
Embodiment
See also Fig. 2, Fig. 2 is the process flow diagram of an embodiment of two-way data storaging method of the present invention.Two-way data storaging method of the present invention can be applicable to the comparatively limited system of memory source, for example: device for mobile communication.As shown in FIG., in the present embodiment, the operation of two-way data storaging method includes the following step:
Step 110: beginning;
Step 112: receive a storage data;
Step 114: in a plurality of memory blocks, select a target memory block to write this storage data;
Step 116: whether the first storage data total amount that direction write of judging this target memory block as if "No", then continues step 122 greater than the second storage data total amount that direction write, otherwise, execution in step 124;
Step 122: write this storage data according to this first storage direction;
Step 124: write this storage data according to this second storage direction;
Step 126: will write the address and be recorded in the mapping table, and the data total amount of Inbound write in record; And
Step 128: finish.
In the present embodiment, judgement first stores the data total amount and second method that stores the data total amount that is write on the direction that are write on the direction and utilizes one first pointer to be recorded in the first data total amount that stores on the direction, and utilizing one second pointer to be recorded in the second data total amount that stores on the direction, its detailed judgment mode will describe in detail hereinafter.
See also Fig. 3, the two-way data storaging method of the present invention of Fig. 3 is applied to the synoptic diagram of a storage device 140.In the present embodiment, storage device 140 includes the memory block that a plurality of storage volumes are 150 (bit) (block) 160a-160n, and therefore, if the start address of memory block 160a is k, then its end address just is k+149.As shown in the figure, storage space 162 is that to be used for putting down in writing size be 30 storage data D
A1, storage space 164 is that to be used for putting down in writing size be 45 storage data D
D2, and storage data D
A1With storage data D
A2Be respectively according to storing direction RD
1And storage direction RD
2Write memory block 160a.In addition, for memory block 160a, a pointer ptr1 is used to refer to store direction RD
1The data total amount that is write, and a pointer ptr2 is used to refer to store direction RD
2The data total amount that is write, therefore, as storage data D
A1, D
A2Behind the write memory block 160a, pointer ptr1 address pointed can be k+30 just, and pointer ptr2 address pointed is to be k+149-45.
Please consult Fig. 2 and Fig. 3 simultaneously, as the storage data D that to receive a size in addition be 20 positions of system
D3The time, a target memory block can be selected earlier by system, in the present embodiment, supposes that memory block 160a is selected target memory block, will describe in detail hereinafter as for the mechanism of select target memory block.Then, system can utilize pointer ptr1, ptr2 to judge and store direction RD
1The data total amount whether greater than storing direction RD
2The data total amount.In the present embodiment owing to store direction RD
1The data total amount be less than storing direction RD
2The data total amount because the method for computational data total amount is that pointer address is deducted the pairing start address of corresponding storage direction, therefore store direction RD as can be known
1The data total amount be less than storing direction RD
2The data total amount, so system can be with storage data D
A3According to storing direction RD
1Write memory block 160a, last, at storage data D
A3Be attached to storage data D
A1After, the corresponding direction RD that stores
1Pointer ptr1 just point to address k+50, and storage data D
A3Start address can be recorded in the mapping table.See also Fig. 4, Fig. 4 is the synoptic diagram of the employed mapping table 180 of two-way data storaging method of the present invention.As shown in Figure 4, as storage data D
A1, D
A2, D
A3After being recorded in memory block 160a in regular turn, mapping table 180 just can write down each storage data D
D1, D
D2, D
D3Start address and size, wherein if a storage data D
D2No longer be used after a while, that is system need discharge the storage data D that does not re-use
A2Storage space 164, then relevant storage data D
A2Just can be from mapping table 180 deletions.
See also Fig. 5, Fig. 5 is the thin portion process flow diagram of step 114 shown in Figure 2.As shown in FIG., the operation of select target memory block includes the following step:
Step 202: beginning;
Step 204: calculate the remaining space size of all memory blocks at present;
Whether step 206: have the remaining space of at least one memory block can hold the storage data that desire writes down, if "Yes", then execution in step 208, otherwise, execution in step 210;
Step 208: in a plurality of memory blocks that hold this storage data, select a memory block with least residue space to be used as a target memory block;
Step 210: the degree of fragmentation (fragmentation) of calculating a plurality of memory blocks;
Step 212: select a memory block with maximum degree of fragmentation to be used as a memory block to be reformed, and calculate this memory block of waiting to reform in first, second storage pairing degree of fragmentation of many storage datas that direction write; And
Step 214: select the bigger storage direction of degree of fragmentation to reform (defragment), and get back to step 204.
In the present embodiment, the calculating of degree of fragmentation is to judge according to the reference position and the size of each storage data in the mapping table (mapping table 180 for example shown in Figure 4) whether a memory block has many discontinuous idle storage spaces, that is, if the quantity of discontinuous idle storage space is big more, then the degree of fragmentation of this memory block is just big more.The detail operations of select target memory block is described as follows with an example.
See also Fig. 6, Fig. 6 is applied to the synoptic diagram of another storage device 300 for two-way data storaging method of the present invention.As shown in FIG., in the present embodiment, storage device 300 includes the memory block 320,340,360 that three storage volumes are 150 positions, therefore, the address of supposing memory block 320 is from m to m+149, and then the address of memory block 340 is just from m+150 to m+299, and the address of memory block 360 is from m+300 to m+449, in addition, suppose that memory block 320 is storing direction RD
1, RD
2On pointer ptr1, ptr2 point to address m+60 and m+79 respectively, memory block 340 is storing direction RD
1, RD
2On pointer ptr3, ptr4 point to address m+225 and m+229 respectively, and memory block 360 is storing direction RD
1, RD
2On pointer ptr5, ptr6 point to address m+330 and m+419 respectively.In addition, oblique line shown in the figure partly is to represent before once to be configured and be released the storage space of (released) at present, though the data in this storage space can not be utilized again, but because fragmentary being dispersed in the memory block of these storage spaces uses for new storage data so may also can't have enough capacity with configuration.As shown in Figure 6, memory block 320 is record storage data B at present
3, B
4, B
5, memory block 340 is record storage data B at present
6, B
7, B
8, B
10, and memory block 360 is record storage data B at present
11, B
12In addition, pairing storage volume is the remaining space for memory block 320 between pointer ptr1, the ptr2, pairing storage volume is the remaining space for memory block 340 between pointer ptr3, the ptr4, and pairing storage volume is a remaining space for memory block 360 between pointer ptr5, the ptr6.
Please consult Fig. 5 and Fig. 6 simultaneously, receive the storage data C of 60 position sizes when system
1The time, system can calculate earlier remaining space size in the memory block 320,340,360 respectively, the practice of present embodiment is respectively memory block 320,340,360 pairing two pointers to be subtracted each other, the remaining space size of hence one can see that memory block 320 is 20 positions, the remaining space size of memory block 340 is 5 positions, and the size of memory block 360 remaining spaces is to be 90 positions.In other words, have only memory block 360 to be enough to write 60 storage data C
1, therefore, memory block 360 is storage data C
1The target memory block.Note that the remaining space that detects more than one memory block when system all is enough to storage data C
1The time, then can select the memory block of remaining space minimum to deposit storage data C
1, so that the memory headroom utilization has more efficient.
Receive one 40 storage data C again when system
2The time, this moment, the remaining space size of memory block 320,340,360 was 20,5,30 positions in regular turn, all was not enough to hold storage data C
2Therefore, memory block 320 can further calculate in system, 340,360 degree of fragmentation (fragmentation), be to use the existing method of calculating degree of fragmentation in the present embodiment, just inquire about the address and the size of data of each storage data according to the mapping table of storage device 300, count memory block 320 then respectively, 340, how many idle storage spaces (oblique line part) 360 respectively have, and then select the memory block of idle space maximum (that is degree of fragmentation maximum) to be used as memory block to be reformed, therefore, in the present embodiment, memory block 320 is memory block to be reformed, and is last, calculates the memory block 320 of waiting to reform and stores direction RD at two
1, RD
2On degree of fragmentation and select the higher storage direction of degree of fragmentation to reform.Because the degree of fragmentation that stores on the direction RD1 is higher, so can reform via storing the storage data that direction RD1 write in the memory block 320, as shown in FIG., storage data B
4Will be turned left and be moved, be made storage data B
4Start address be m, if storage data B
4Size be 36 positions, the pointer ptr1 that then stores direction RD1 also can change into and be directed to m+36.See also Fig. 7, Fig. 7 is the synoptic diagram of two-way data storaging method reformation of the present invention storage device 300 shown in Figure 6.Memory block 320 just can make after reformation and be positioned at storage data B
4Before d/d storage space be positioned at storage data B
4After remaining space merge, therefore, memory block 320 just can successfully store the storage data C that desires to write after reformation
2Note that reformation mode used in the present invention do not exceed with present embodiment, store direction and reform, or storing directions to two simultaneously reforms and be all category of the present invention no matter only treat specific one of reformation memory block.
Compared to prior art, two-way data storaging method of the present invention is to control the two ends that many storage datas are evenly distributed in a memory block according to the selection of writing Inbound, the data volume of supposing these many storage datas is m, and then each end can be considered the data volume that is writing down convergence m/2 position in this memory block.When reforming, the storage method of prior art must be reformed to whole memory block, and therefore the operand of reforming is about m
xYet two-way data storaging method of the present invention is about the reform operand of required cost of whole memory block
Significantly less than the required operand m of prior art
xEven, because two-way data storaging method of the present invention is the two ends that the data volume of m position are evenly distributed in memory block,, can optionally only reform to the data quantity of half so have in limited time when the running time, its operand just is approximately
Therefore, two-way data storaging method of the present invention not only can reduce the required operand of internal memory reformation, more can be divided into two the time that the reformation memory block is required, when the time is limited, carry out the reformation work of half earlier, second half waits until that then a control circuit (a for example microprocessor) remakes in the time of comparatively idle, and just more flexiblely the amount of sharing out the work is to control circuit thus, and the while is the overall efficiency of elevator system further.
The above only is preferred embodiment of the present invention, and all equalizations of being done according to the present patent application claim change and modify, and all should belong to covering scope of the present invention.
Claims (17)
1. a data storage method is applicable to a storage device is write storage data, and this storage device includes a plurality of memory blocks, and each memory block comprises one first end and one second end, and this data storage method includes:
Receive a storage data;
Select a memory block to write data from these a plurality of memory blocks;
Relatively one first total amount and one second total amount select one to store direction, wherein, this first total amount is the data volume from this first storage this memory block that direction writes, this second total amount is the data volume from this second storage this memory block that direction writes, when selecting one first to store direction as this storage direction, then this first end is the starting point for this first storage direction; When selecting one second to store direction as this storage direction, then this second end is the starting point for this second storage direction; And
According to this storage direction this storage data is write this memory block.
2. data storage method as claimed in claim 1, wherein, select the step of this storage direction to include:
If this first total amount less than this second total amount, selects this first storage direction to be used as this storage direction; And
If this first total amount greater than this second total amount, selects this second storage direction to be used as this storage direction.
3. data storage method as claimed in claim 1, wherein, select the step of this memory block to include:
Calculate the residue storage area of each memory block in a plurality of memory blocks respectively; And
Select a memory block from these a plurality of memory blocks, the residue storage area of this memory block is greater than the size of the required storage space of this storage data.
4. data storage method as claimed in claim 3, it includes in addition:
Calculate the degree of fragmentation memory block to be reformed of these a plurality of memory blocks, to carry out a resurfacing operation.
5. data storage method as claimed in claim 4, wherein, the step of carrying out this resurfacing operation includes in addition:
Reform in this memory block of waiting to reform from this first many storage data that store that direction write or this second stores many storage datas that direction write certainly.
6. data storage method as claimed in claim 5, wherein, the step of carrying out this resurfacing operation includes in addition:
Calculate the degree of fragmentation that stores many storage datas that direction write in this memory block of waiting to reform from this first, second respectively, and reform optionally according to storage direction that this first stores the direction and second storage many storage datas that direction write with big degree of fragmentation.
7. data storage method as claimed in claim 4 wherein, if the neither foot in residue storage area of these a plurality of memory blocks holds this storage data, then carries out this resurfacing operation.
8. data storage method as claimed in claim 4, wherein, this resurfacing operation can be carried out when a program begins or finishes.
9. data storage method as claimed in claim 4, wherein, select the step of this memory block of waiting to reform to include in addition:
In these a plurality of memory blocks, select a memory block with maximum degree of fragmentation to be used as this memory block to be reformed.
10. data storage method as claimed in claim 4, wherein, select the step of this memory block of waiting to reform to include in addition:
The memory block of selecting degree of fragmentation to be higher than a critical value in these a plurality of memory blocks is used as this memory block to be reformed.
11. an electronic installation includes:
A memory block, this memory block comprise one first end and one second end;
One program executing apparatus is used for carrying out a program, and this program produces a storage data when carrying out; And
One memory block operating means, it is one first total amount and one second total amount relatively, wherein, this first total amount is for writing the data volume of this memory block from this first end, this second total amount is for to write the data volume of this memory block from this second end, and optionally from this first total amount this first end or this second end corresponding with this second total amount smaller this storage data write this memory block.
12. electronic installation as claimed in claim 11, wherein, when this memory block operating means selects one first to store direction as the storage direction, then this first end is the starting point for this first storage direction, when selecting one second to store direction as the storage direction, then this second end is the starting point for this second storage direction.
13. electronic installation as claimed in claim 12, wherein, the degree of fragmentation memory block to be reformed that this memory block operating means calculates this memory block carries out a resurfacing operation, and this memory block of waiting to reform is for from this first many storage data that store that direction write or this second stores many storage datas that direction write certainly.
14. electronic installation as claimed in claim 13, wherein, this memory block to be reformed is to have this first many storage data that store that direction write certainly of big degree of fragmentation or this second stores many storage datas that direction write certainly.
15. electronic installation as claimed in claim 13 wherein, if the neither foot in residue storage area of this memory block holds this storage data, then carries out this resurfacing operation.
16. electronic installation as claimed in claim 13, wherein, this resurfacing operation can be carried out when this program begins or finishes.
17. electronic installation as claimed in claim 13 wherein, carries out this resurfacing operation when this degree of fragmentation is higher than a critical value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100980716A CN100414516C (en) | 2004-12-02 | 2004-12-02 | Two-way data storaging method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100980716A CN100414516C (en) | 2004-12-02 | 2004-12-02 | Two-way data storaging method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1783031A CN1783031A (en) | 2006-06-07 |
| CN100414516C true CN100414516C (en) | 2008-08-27 |
Family
ID=36773245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100980716A Expired - Fee Related CN100414516C (en) | 2004-12-02 | 2004-12-02 | Two-way data storaging method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100414516C (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101714120A (en) * | 2008-10-06 | 2010-05-26 | 深圳富泰宏精密工业有限公司 | Data storage system and method |
| CN109948003B (en) * | 2019-03-20 | 2021-01-15 | 武汉大学 | Block chain system of isomorphic dual-mode main and auxiliary chains and block production method thereof |
| US11550711B2 (en) * | 2019-09-09 | 2023-01-10 | Micron Technology, Inc. | Dynamically adjusted garbage collection workload |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09134312A (en) * | 1995-11-08 | 1997-05-20 | Olympus Optical Co Ltd | Flash memory device |
| US5712740A (en) * | 1995-02-28 | 1998-01-27 | Sony Corporation | Method for reducing wasted storage space when storing multiple data blocks on a storage medium |
-
2004
- 2004-12-02 CN CNB2004100980716A patent/CN100414516C/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5712740A (en) * | 1995-02-28 | 1998-01-27 | Sony Corporation | Method for reducing wasted storage space when storing multiple data blocks on a storage medium |
| JPH09134312A (en) * | 1995-11-08 | 1997-05-20 | Olympus Optical Co Ltd | Flash memory device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1783031A (en) | 2006-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11914530B2 (en) | Memory having internal processors and data communication methods in memory | |
| CN110058794A (en) | For Dynamic Execution garbage reclamation data memory device and operating method | |
| CN107168647B (en) | FLASH data read-write method and system | |
| US8874828B2 (en) | Systems and methods for providing early hinting to nonvolatile memory charge pumps | |
| TW200723281A (en) | Mass storage device having both XIP function and storage function | |
| US8645723B2 (en) | Asynchronous management of access requests to control power consumption | |
| US20140244948A1 (en) | Memory having internal processors and methods of controlling memory access | |
| US20160055097A1 (en) | Heterogeneous unified memory | |
| US20130219111A1 (en) | System and method for read-while-write with nand memory device | |
| US20120084484A1 (en) | Selectively combining commands for a system having non-volatile memory | |
| CN110781096A (en) | Apparatus and method for performing garbage collection by predicting demand time | |
| US9043552B2 (en) | Systems and methods for operating a flash memory file system | |
| CN101241446A (en) | Command scheduling method and apparatus of virtual file system embodied in nonvolatile data storage device | |
| US20080276050A1 (en) | Erase handling method for non-volatile memory and electronic apparatus thereof | |
| WO2010141223A2 (en) | Conditional operation in an internal processor of a memory device | |
| US12079131B2 (en) | Memory system and operating method thereof | |
| CN111897743B (en) | Data storage device and loading method of logical-to-physical address mapping table | |
| CN104866428A (en) | Data access method and data access device | |
| US7409527B2 (en) | Bidirectional data storing method | |
| EP1835392A3 (en) | Storage system issuing optimum I/O command to allocation-on-use enabled volume and controlling method therefor | |
| CN108733324B (en) | Data reading and writing method, device and equipment of solid state disk and storage medium | |
| US11520520B2 (en) | Memory system and method of controlling nonvolatile memory | |
| CN103218305A (en) | Distribution method of memory space | |
| CN100414516C (en) | Two-way data storaging method | |
| US20100241786A1 (en) | Apparatus and method for optimized NAND flash memory management for devices with limited resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |