CN102073592B - Quick read-write method and device for flash memory - Google Patents
Quick read-write method and device for flash memory Download PDFInfo
- Publication number
- CN102073592B CN102073592B CN 200910222617 CN200910222617A CN102073592B CN 102073592 B CN102073592 B CN 102073592B CN 200910222617 CN200910222617 CN 200910222617 CN 200910222617 A CN200910222617 A CN 200910222617A CN 102073592 B CN102073592 B CN 102073592B
- Authority
- CN
- China
- Prior art keywords
- subclauses
- clauses
- sector
- data
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a quick read-write method and a quick read-write device for a flash memory. The method comprises the following steps of: dividing entries into each sector in the flash memory, and dividing to-be-written data for storage according to the length of the entries, wherein each entry is used for bearing data; when the data are written, querying the unused entries in the current sector, and writing the data into the unused entries; when only one unused sector is queried, if the entries of invalid data are stored in other sectors is detected, reclaiming the space occupied by the entries; otherwise, directly writing the data into the unused data. The data are organized and stored according to a form of entries of fixed formats. When the data are modified, the original entries are not modified, but the original entries are set to be invalid, and new entries are written, so the erasing frequency is reduced, the average writing speed is quickened, and balanced access of different storage units of the FLASH is ensured.
Description
Technical field
The present invention relates to the embedded system technology field, relate in particular to a kind of method and apparatus that needs the simple mode of employing to realize the equilibrium read-write of NOR FLASH that is applicable to.
Background technology
In embedded system, usually use FLASH (flash memory) as storer, the write operation of on the one hand each FLASH all need be wiped the position of correspondence; Wiping with the required time of write operation of FLASH will be far longer than the time of reading on the other hand.Therefore, according to common custom read-write FLASH can wipe with write operation on waste great amount of time, and cause shorten the serviceable life of FLASH because of the erasable number of times of different spaces is unbalanced.
Visit to FLASH has had mature methods, but has all used complicated algorithm, implements the working time that need take more program's memory space and CPU.For the usability situation of high CPU not, said method is also inapplicable, need find a kind of simple relatively method fast to satisfy actual demand.
Summary of the invention
The technical matters that the present invention will solve provides a kind of FLASH rapid read-write method and device, under the situation that does not need a large amount of computings, realizes simple, equilibrium and the fast reading and writing of FLASH, satisfies the application of the not high embedded system of cpu performance.
The object of the invention also provides a kind of flash memory rapid read-write method, comprising:
Clauses and subclauses are divided in each sector to flash memory inside, and each clauses and subclauses is used to carry data, divides data to be written according to the length of said clauses and subclauses and stores;
When writing data, inquire about the untapped clauses and subclauses in the current sector, said untapped clauses and subclauses are write data; When inquiring when only existing a sector not use, there are the clauses and subclauses of preserving invalid data if detect other sectors, then reclaim the shared space of said clauses and subclauses; Otherwise directly said untapped sector is write data.
The object of the invention also provides a kind of device of fast reading and writing, comprising: configuration module, writing module, recycling module and inquiry detection module;
Said configuration module is used for some clauses and subclauses that are used to carry data are divided in each sector of flash memory inside, and notifies the said write module with the length of said clauses and subclauses;
Said inquiry detection module is used to inquire about the untapped clauses and subclauses in the current sector, and notice said write module; Also be used for when detecting when only existing a untapped sector and other sectors not to have the clauses and subclauses of preserving invalid data; With the said sector notice said write module of not using, only exist a sector not use and other sectors are notified said recycling module when having the clauses and subclauses of preserving invalid data when detecting;
The said write module is used for writing the untapped clauses and subclauses of being notified according to the data said to be written that the length of said clauses and subclauses will be divided after data to be written also will be divided;
Said recycling module is used to reclaim said other sectors and has the shared space of clauses and subclauses of preserving invalid data.
Useful technique effect of the present invention:
Adopted form tissue storage with data clauses and subclauses according to fixed format.When revising data, be not to revise original clauses and subclauses, but original clauses and subclauses are changed to invalid and write the way of new clauses and subclauses, reduced erasable number of times, accelerated average writing speed, the equilibrium visit of the different storage unit of the FLASH of assurance.
Description of drawings
Fig. 1 is the synoptic diagram of embodiment of the invention discal patch destination data form.
Fig. 2 is the process flow diagram of FLASH read-write operation in the embodiment of the invention.
The structural drawing of Fig. 3 for installing in the embodiment of the invention.
Embodiment
Core of the present invention is: the form tissue of data clauses and subclauses according to fixed format is kept among the FLASH, and read-write is wiped and space arrangement is based on all that clauses and subclauses carry out.
The inside of FLASH generally is divided into the individual sector of n (n>=2), and the size of each sector is 2
mByte, sector are the minimum erasable units of FLASH.In each sector also logical partitioning size is arranged is 2
jThe clauses and subclauses of byte, each sector can preserve 2
kIndividual such clauses and subclauses, j+k=m thus.
The data of preserving in the said clauses and subclauses comprise: use sign, effective sign, clauses and subclauses name sign and data message.
In view of the above, can data read and write rationally be divided, with said use sign, effectively sign and clauses and subclauses name sign to constitute length be 2
jThe data block of byte.
FLASH reading/writing method of the present invention is kept at the form tissue of data clauses and subclauses according to fixed format among the FLASH, and the form of clauses and subclauses is as shown in Figure 1.
Wherein, use sign, explain whether these clauses and subclauses are used, preserve the storage unit that this uses identifies and be in original state, explain that then these clauses and subclauses do not use, can write data; Rewritten by original state if preserve the storage unit of this use sign, promptly placed user mode.
Effectively sign explains whether the data of these clauses and subclauses are effective, for untapped clauses and subclauses, preserves this storage unit that effectively identifies and is in original state, explains that then the data of these clauses and subclauses are effective; If these clauses and subclauses are preserved the storage unit of criterion knowledge and are rewritten by original state, promptly place disarmed state, explain that the data of these clauses and subclauses are invalid;
Notice that effectively sign can not be changed to effectively from invalid, original state is effectively, and being changed to can only be in recovery after invalid, when wiping, revert to original state.
Clauses and subclauses name sign is the sign that is used to distinguish clauses and subclauses, and the clauses and subclauses name sign of each clauses and subclauses has nothing in common with each other, and clauses and subclauses name sign is write and fashionablely write with data message.
The remaining space of clauses and subclauses is used to preserve data message, and this method is not done any qualification to data message.
Data writing operation:
There have data to write to be fashionable; According to the entry length that provides in advance; Find the start address of clauses and subclauses to be written, at first will use sign to be changed to user mode by the original state after wiping, it is constant that effectively sign keeps original state; Explain that the data in these clauses and subclauses are effective, write clauses and subclauses name sign and data message then; If occur mistake in the ablation process, it is invalid then these clauses and subclauses to be changed to.
During write data, next clauses and subclauses write the tail end that is close to clauses and subclauses, till clauses and subclauses are not used in this sector.If the clauses and subclauses that write will guarantee then that for first clauses and subclauses of this sector the data in this sector have been wiped free of; If clauses and subclauses have not been used in this sector, then need find next untapped sector to continue to write.
The resource reclaimer operation:
If does not use only remaining last sector; Then at first find and comprise the maximum sector of invalid entries; Effective clauses and subclauses in this sector are changed to invalid and the copying data in these effective clauses and subclauses is not used the sector to last one, so just obtain in it all that clauses and subclauses are invalid sector, then with this sector erasing; For use, and will use sign to be changed to original state with effectively identifying.If have write operation to take place afterwards, continue again data writing operation is as above carried out in above-mentioned untapped last sector;
Note that when above-mentioned last sector as after last sectors process to be used, there is not the next untapped sector of order in it, at this moment above-mentionedly is wiped free of sector for use and can becomes last untapped sector;
If does not use only remaining last sector, do not find other sectors that comprises invalid entries again, then in the end data writing operation is carried out in a sector; If last sector does not have invalid data to use yet, think that then the storage space of FLASH is full.
Revise data manipulation:
In the time will revising the data of the clauses and subclauses that write FLASH; At first according to the former clauses and subclauses of clauses and subclauses name sign inquiry of waiting to revise clauses and subclauses; If there are former clauses and subclauses, it is invalid then effective sign of former clauses and subclauses to be changed to, and the data of revising is identified with above-mentioned clauses and subclauses name together write new clauses and subclauses.
If when revising the data manipulation generation, according to waiting that the clauses and subclauses name sign of revising clauses and subclauses does not inquire former clauses and subclauses name, then directly carries out the process of write operation; The process of write data as previously mentioned.
Read data operation:
During reading of data, be designated all clauses and subclauses of keyword search, find to comprise the clauses and subclauses name sign that conforms to, sense data with the clauses and subclauses name;
During reading of data, if do not find the clauses and subclauses name sign that will read, then return mistake.
In conjunction with Fig. 2, explain that concrete FLASH read-write step of the present invention is following:
Step 101: erase operation all need be carried out in all sectors to be used before using, with guarantee its all data preserve unit all be can foresee, changeable original state;
Wherein, the use of all clauses and subclauses to be used sign is original state with effectively identifying;
Step 102: each operation at first judges it is read operation or write operation, if read operation, then execution in step 103, if write operation, then execution in step 106;
Step 103: carry out read operation, the clauses and subclauses name sign that at first reads according to band is searched the clauses and subclauses that will read;
Step 104:, then read the data message in these clauses and subclauses if find this clauses and subclauses;
Step 105: if do not find this clauses and subclauses, wrong indication is returned in then read operation failure;
Step 106: carry out write operation, judge whether the current active sector has untapped clauses and subclauses, if having, then execution in step 113, and data are write clauses and subclauses; If no, execution in step 107 then;
Step 107: do not use clauses and subclauses, explain that the current active sector is full, then search other sectors to be used;
Step 108: if there is not sector to be used, explain that then the storage space of FLASH is full, return the write operation failure;
Step 109: if sector to be used is arranged, then whether this sector of interpretation is last sector to be used, if not, then execution in step 112; If then execution in step 110;
Step 110:, prepare for reclaiming the invalid entries occupation space if the sector that whether comprises invalid entries in the flash memory is then searched in last sector to be used; Do not comprise the invalid entries sector if find, then execution in step 112; If find, then execution in step 111;
Step 111: reclaim the invalid entries occupation space; The effective clauses and subclauses that are about on the maximum sector of invalid entries copy last sector to be used to; Clauses and subclauses name sign with effective clauses and subclauses is preserved; It is invalid that effective clauses and subclauses in simultaneously that aforementioned invalid entries is maximum sectors are changed to, and the sector erasing that aforementioned invalid entries is maximum, for use;
Step 112: switch to said sector to be used, prepare to write clauses and subclauses;
Step 113: it is present to write bar, whether has the clauses and subclauses (being former clauses and subclauses) of identical clauses and subclauses name sign earlier according to the clauses and subclauses name sign inquiry of data to be written, is rewriting or writes new clauses and subclauses with differentiation; If there are former clauses and subclauses; Promptly will rewrite clauses and subclauses, execution in step 114 is not if exist former clauses and subclauses; Promptly to write clauses and subclauses, directly execution in step 115;
Step 114: it is invalid earlier effective sign of former clauses and subclauses to be changed to, and switches to the not use clauses and subclauses of said sector to be used, continues execution in step 115;
Step 115: accomplished all preliminary work that writes, the clauses and subclauses writing position confirmed, finds the start address of not using clauses and subclauses of said sector to be used, and the use sign of these clauses and subclauses is changed to user mode, writes clauses and subclauses name sign and data;
Note, if write data failure, then need effectively to identify be changed to by original state invalid.
All clauses and subclauses of each sector all begin order from first clauses and subclauses and write.Rise at the beginning; Active sector is write next sector that the sector of selecting when full to be used is an order; When active sector out-of-date as last sectors process to be used; Sector to be used possibly no longer be the next sector of order, judges whether this sector is sector to be used but can whether use through first clauses and subclauses.This method is not done qualification to the lookup method that uses.
Describe through the formation of a specific embodiment below apparatus of the present invention.
Fig. 3 is the structural drawing of the device of fast reading and writing in the embodiment of the invention, and this device comprises: configuration module 1, writing module 3, recycling module 4, inquiry detection module 2, read module 5 and mode switch module 6;
Said mode switch module 6 switches to associative mode according to user instruction, switches to when writing pattern, starts said inquiry detection module 2, when switching to read mode, starts the clauses and subclauses name sign that said read module 5 and notice are treated service data;
Said configuration module 1 is used for some clauses and subclauses that are used to carry data are divided in each sector of flash memory inside, and notifies said write module 3 with the length of said clauses and subclauses; Also be used to said clauses and subclauses and dispose the criterion knowledge, if the data of said clauses and subclauses are effective, said effective sign is placed in effective status, if the data of said clauses and subclauses are invalid, said effective sign is placed in disarmed state; And be said clauses and subclauses configuration items name sign, be used to distinguish each clauses and subclauses;
Said inquiry detection module 2 is used to inquire about the untapped clauses and subclauses in the current sector, and notice said write module 3; Also be used for only existing a sector not use and other sectors when not having the clauses and subclauses of preserving invalid data when detecting; With the said sector notice said write module 3 of not using, detect and notify said recycling module 4 when only having the clauses and subclauses that does not use a sector and invalid data is preserved in other sectors existence;
Said write module 3; Be used for the former clauses and subclauses of clauses and subclauses name sign search according to current data to be written; If search former clauses and subclauses; It is invalid then effective sign of said former clauses and subclauses to be changed to, and divides data to be written according to the length of said clauses and subclauses, and writes the untapped clauses and subclauses of being notified with said clauses and subclauses name sign; If do not search former clauses and subclauses, then directly divide data to be written and write the untapped clauses and subclauses of being notified with said clauses and subclauses name sign according to the length of said clauses and subclauses;
Said recycling module 4 is used to reclaim the shared space of the clauses and subclauses of preserving invalid data of said other sectors;
Said read module 5 is used for being designated all clauses and subclauses of keyword search with said clauses and subclauses name, finds the clauses and subclauses name sign that conforms to, and reads the data of corresponding clauses and subclauses.
Wherein, said recycling module 4 also comprises: search for submodule 41, arrangement submodule 42 and wipe submodule 43:
Said search submodule 41 is used for when only existing a sector not use, and search comprises the maximum sector of disarmed state clauses and subclauses, and notifies said arrangement submodule 42;
Said arrangement submodule 42, the copying data that is used for effective status clauses and subclauses in the sector that said disarmed state clauses and subclauses are maximum does not use the sector and said effective status clauses and subclauses is changed to disarmed state to said, notifies the said submodule 43 of wiping after copying successfully;
The said submodule 43 of wiping is used to wipe the maximum sector of said disarmed state clauses and subclauses.
Above-mentioned explanation illustrates and has described a preferred embodiment of the present invention; But as previously mentioned; Be to be understood that the present invention is not limited to the form that this paper discloses, should do not regard eliminating as, and can be used for various other combinations, modification and environment other embodiment; And can in invention contemplated scope described herein, change through the technology or the knowledge of above-mentioned instruction or association area.And change that those skilled in the art carried out and variation do not break away from the spirit and scope of the present invention, then all should be in the protection domain of accompanying claims of the present invention.
Claims (8)
1. a flash memory rapid read-write method is characterized in that, comprising:
Clauses and subclauses are divided in each sector to flash memory inside, and each clauses and subclauses is used to carry data, divides data to be written according to the length of said clauses and subclauses and stores;
When writing data, inquire about the untapped clauses and subclauses in the current sector, said untapped clauses and subclauses are write data; When inquiring when only existing a sector not use, there are the clauses and subclauses of preserving invalid data if detect other sectors, then reclaim the shared space of said clauses and subclauses; Otherwise directly said untapped sector is write data;
The space that the said clauses and subclauses of said recovery are shared; Further comprise: when only existing a sector not use; At first find and comprise the maximum sector of disarmed state clauses and subclauses; The copying data of effective status clauses and subclauses in this sector is not used the sector and said effective status clauses and subclauses are changed to disarmed state to said, wipe the maximum sector of said disarmed state clauses and subclauses.
2. the method for claim 1 is characterized in that,
Preserve effective sign in the said clauses and subclauses, when said effective sign was in original state, the data of said clauses and subclauses were effective; When said effective sign was changed to disarmed state by original state, the data of said clauses and subclauses were invalid;
Also preserve clauses and subclauses name sign in the said clauses and subclauses, be used to distinguish each clauses and subclauses.
3. method as claimed in claim 2 is characterized in that, also comprises:
According to the former clauses and subclauses of the clauses and subclauses name of current data to be written sign search, if search former clauses and subclauses, it is invalid that effective sign that then will said former clauses and subclauses is changed to, and current data to be written identified with its clauses and subclauses name write said untapped clauses and subclauses; If do not search former clauses and subclauses, then directly current data to be written are write said untapped clauses and subclauses with its clauses and subclauses name sign.
4. the method for claim 1 is characterized in that,
The clauses and subclauses of each sector write data by putting in order;
Whether first clauses and subclauses through inquiring about in the said sector are used, judge that whether said sector is for not using the sector.
5. the device of a fast reading and writing is characterized in that, comprising: configuration module, writing module, recycling module and inquiry detection module;
Said configuration module is used for some clauses and subclauses that are used to carry data are divided in each sector of flash memory inside, and notifies the said write module with the length of said clauses and subclauses;
Said inquiry detection module is used to inquire about the untapped clauses and subclauses in the current sector, and notice said write module; Also be used for when detecting when only existing a untapped sector and other sectors not to have the clauses and subclauses of preserving invalid data; With the said sector notice said write module of not using, only exist a sector not use and other sectors are notified said recycling module when having the clauses and subclauses of preserving invalid data when detecting;
The said write module is used for writing the untapped clauses and subclauses of being notified according to the data said to be written that the length of said clauses and subclauses will be divided after data to be written also will be divided;
Said recycling module is used to reclaim said other sectors and has the shared space of clauses and subclauses of preserving invalid data;
The said write module; Be used for the former clauses and subclauses of clauses and subclauses name sign search according to current data to be written; If search former clauses and subclauses, it is invalid then effective sign of said former clauses and subclauses to be changed to, and said data to be written are write the untapped clauses and subclauses of being notified with its clauses and subclauses name sign; If do not search former clauses and subclauses, then directly said data to be written are write the untapped clauses and subclauses of being notified with its clauses and subclauses name sign.
6. device as claimed in claim 5 is characterized in that,
Said configuration module also is used to said clauses and subclauses and disposes criterion and know, and when effectively being designated original state, the data of said clauses and subclauses are effective when said; When said effective sign was changed to disarmed state by original state, the data of said clauses and subclauses were invalid; And be said clauses and subclauses configuration items name sign, be used to distinguish each clauses and subclauses.
7. device as claimed in claim 6 is characterized in that, said recycling module further comprises: search for submodule, put submodule in order and wipe submodule:
Said search submodule is used for when only existing a sector not use, and search comprises the maximum sector of disarmed state clauses and subclauses, and notifies said arrangement submodule;
Said arrangement submodule, the copying data that is used for effective status clauses and subclauses in the sector that said disarmed state clauses and subclauses are maximum does not use the sector and effective sign of said effective status clauses and subclauses is changed to invalid to said, notifies the said submodule of wiping after copying successfully;
The said submodule of wiping is used to wipe the maximum sector of said disarmed state clauses and subclauses.
8. device as claimed in claim 5 is characterized in that,
Whether said inquiry detection module uses through first clauses and subclauses of inquiring about in the said sector, judges that whether said sector is for not using the sector.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910222617 CN102073592B (en) | 2009-11-19 | 2009-11-19 | Quick read-write method and device for flash memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910222617 CN102073592B (en) | 2009-11-19 | 2009-11-19 | Quick read-write method and device for flash memory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102073592A CN102073592A (en) | 2011-05-25 |
| CN102073592B true CN102073592B (en) | 2012-12-05 |
Family
ID=44032138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910222617 Active CN102073592B (en) | 2009-11-19 | 2009-11-19 | Quick read-write method and device for flash memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102073592B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136215A (en) * | 2011-11-24 | 2013-06-05 | 腾讯科技（深圳）有限公司 | Data read-write method and device of storage system |
| CN105786733B (en) * | 2014-12-26 | 2020-08-07 | 南京中兴新软件有限责任公司 | Method and device for writing TCAM (ternary content addressable memory) entries |
| CN105159601B (en) * | 2015-08-07 | 2018-12-07 | 杭州海兴电力科技股份有限公司 | A method of improving Flash erasing and writing life |
| CN106598875A (en) * | 2015-10-19 | 2017-04-26 | 深圳市华百安智能技术有限公司 | Method for rapidly processing NOR FLASH records in embedded system |
| AU2016393275B2 (en) | 2016-02-19 | 2019-10-10 | Huawei Technologies Co., Ltd. | Method and apparatus for accessing flash memory device |
| CN107092563B (en) * | 2017-04-20 | 2021-02-26 | 新华三信息技术有限公司 | Garbage recovery method and device |
| CN110147200A (en) * | 2018-02-13 | 2019-08-20 | 矽创电子股份有限公司 | The controller and control method of flash memory |
| CN109947369A (en) * | 2019-03-22 | 2019-06-28 | 河南卓正电子科技有限公司 | Date storage method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1351350A (en) * | 2000-10-27 | 2002-05-29 | 岳京星 | Method for partitioning memory block and identifying R/W information in flash memory |
| CN101551780A (en) * | 2008-12-29 | 2009-10-07 | 深圳创维－Rgb电子有限公司 | Television and data storage method and device thereof |
-
2009
- 2009-11-19 CN CN 200910222617 patent/CN102073592B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1351350A (en) * | 2000-10-27 | 2002-05-29 | 岳京星 | Method for partitioning memory block and identifying R/W information in flash memory |
| CN101551780A (en) * | 2008-12-29 | 2009-10-07 | 深圳创维－Rgb电子有限公司 | Television and data storage method and device thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102073592A (en) | 2011-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102073592B (en) | Quick read-write method and device for flash memory | |
| KR100843543B1 (en) | System comprising flash memory device and data recovery method thereof | |
| JP4832521B2 (en) | Data management method in flash memory media | |
| US7191306B2 (en) | Flash memory, and flash memory access method and apparatus | |
| KR100772863B1 (en) | Method and apparatus for shortening operating time of page replacement in demand paging applied system | |
| KR100755702B1 (en) | Storage apparatus using non volatile memory as cache and method for operating the same | |
| CN102576333B (en) | Data cache in nonvolatile memory | |
| KR101613678B1 (en) | Recovery for non-volatile memory after power loss | |
| EP2115595B1 (en) | Memory device performance enhancement through pre-erase mechanism | |
| CN102737715B (en) | For the method for power fail safeguard of data of NOR flash memory | |
| CN102622309B (en) | Data security erase method and device | |
| US9092323B2 (en) | Systems and methods for recovering addressing data | |
| CN101241471A (en) | Flash memory system and garbage collection method thereof | |
| KR20070068796A (en) | Storage apparatus using non volatile memory and method for managing the same | |
| JP2004362426A (en) | Information processing system, its control method, and computer program | |
| TW201301030A (en) | Fast translation indicator to reduce secondary address table checks in a memory device | |
| JP2006235960A (en) | Method for increasing speed of garbage collection | |
| KR20100132244A (en) | Memory system and method of managing memory system | |
| EP1966701A2 (en) | Memory with block-erasable locations | |
| EP1966699A2 (en) | Memory with block-erasable locations and a linked chain of pointers to locate blocks with pointer information | |
| CN107817945B (en) | Data reading method and system of hybrid memory structure | |
| CN101025715A (en) | Power-fail protection method based on two continuous logical blocks for non-volatile memory | |
| CN102662856A (en) | Solid state disk and access method | |
| CN108475230A (en) | A kind of storage system and system rubbish recovering method | |
| CN111966611B (en) | SPI flash memory control chip with logic-to-physical address architecture |
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 | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160907 Address after: 300308 Tianjin Airport Economic Zone, Binhai New Area seven East Road No. 2 Zhongxing Industrial Base Patentee after: ZTE INTELLIGENT IOT TECHNOLOGY Co.,Ltd. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Patentee before: ZTE Corp. |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: Room 401, building 12, east area, airport business park, No. 80, Huanhe North Road, free trade zone (Airport Economic Zone), Binhai New Area, Tianjin 300000 Patentee after: Gaoxing Zhilian Technology Co.,Ltd. Address before: 300308, Zhongxing Industrial base, 2 East seven, Airport Economic Zone, Tianjin Binhai New Area Patentee before: ZTE INTELLIGENT IOT TECHNOLOGY Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Room 401, building 12, East Airport Business Park, 80 Huanhe North Road, Tianjin Binhai New Area pilot free trade zone (Airport Economic Zone) Patentee after: Zte Intelligent Iot Technology Co.,Ltd. Address before: Room 401, building 12, East Airport Business Park, 80 Huanhe North Road, Tianjin Binhai New Area pilot free trade zone (Airport Economic Zone) Patentee before: Gaoxing Zhilian Technology Co.,Ltd. |