CN102591793A - Device for assisting upper computer to retrieve free chunks in page mapping unit block - Google Patents
Device for assisting upper computer to retrieve free chunks in page mapping unit block Download PDFInfo
- Publication number
- CN102591793A CN102591793A CN2012100308367A CN201210030836A CN102591793A CN 102591793 A CN102591793 A CN 102591793A CN 2012100308367 A CN2012100308367 A CN 2012100308367A CN 201210030836 A CN201210030836 A CN 201210030836A CN 102591793 A CN102591793 A CN 102591793A
- Authority
- CN
- China
- Prior art keywords
- free block
- host computer
- connects
- searcher
- map unit
- 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.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a device for assisting an upper computer to retrieve free chunks in a page mapping unit block, which comprises a register group and a retriever, wherein the register group is used for storing free flag bits in the mapping unit block of the page mapping unit block, the retriever is a bus device and connected with the register group and retrieves the free chunks according to the free flag bits. According to the device for assisting the upper computer to retrieve the free chunks in the page mapping unit block, the free chunks in the page mapping unit block can be managed in a hardware mode, is improved in speed by about dozens of times compared with a software achievement mode or a retrieving achievement mode in a file system, and therefore efficiency of management for the free chunks is greatly improved.
Description
Technical field
The invention belongs to flash memory (Flash Memory is called for short Flash, full name Flash EEPROM Memory) data storage and administrative skill field.
Background technology
Flash reads (Read), writes (Program) and wipes that the base unit of read and write is a page or leaf in (Erase) operation, and the base unit of wiping is a piece.Write operation to flash can only carry out on the free page that does not write as yet, and can only according to from the low address page or leaf to high address page or leaf sequential write.If want to revise the page or leaf that certain had been write, can only wipe whole physical block earlier, and then write.
Yet the physical features of Flash has determined that its erasable number of times is limited; The erasing times of piece is many between 100,000 times to 1,000,000 times under the current techniques condition; As long as there is the erasing times of a piece to reach the upper limit; It is unreliable that data storage just becomes, and can influence the read-write efficiency and the performance of whole flash memory.For serviceable life of prolonging flash, we mainly adopted both strategies at present, a kind of is to reduce the erasing times to piece as far as possible, promptly when in whole page all be marked as free page the time wipe again.Another kind of strategy is to adopt abrasion equilibrium processing (wear-levling) efficiently.Here relate generally to the strategy of minimizing to the erasing times of piece.
Based on the These characteristics of Flash, need further to understand logical physical map addresses strategy, map addresses comprises piece mapping and page or leaf mapping, and the mixing mapping policy that is the basis with these two kinds of map addresses.Page or leaf map unit piece is to refer in particular to be used to use page or leaf to shine upon the piece of organizing among the flash.Because of number of blocks among the Flash is fixed, the piece mapping can be used SRAM (Static Random Access Memory, SRAM
)Realize logical physical map addresses one to one.And be directed to page or leaf mapping, because of comprising many pages or leaves in each piece, thereby, if the mapping of page or leaf one to one that each piece is all fixed then need take a large amount of internal memories.Reducing under the condition of erase block, can be non-free block by system is used, therefore, only need page shining upon be kept in the internal memory and get final product with busy piece.Be similar to the defragmentation of windows, the page or leaf mapping area of free block can be used as new piece mapping address usefulness, and dynamic random is realized the page or leaf mapping of non-empty block in the middle of the SRAM storage space that can guarantee in preciousness like this.
The storage administration of current Flash mainly concentrates in the application of file system, and form of software is adopted in the management of free block.Common way is on Flash, to set up the file system of flash memory physical characteristics exploitation, lets this document system directly manage the data on the Flash through hardware drive program.Producing the storage administration means according to this all is to adopt the method for log record to manage flash memory device.Its principle of work is that party's item flash memory is when writing new data; System does not directly just wipe original data immediately; Generate new back end in the free block of flash memory but write; And the operation that at every turn writes all will get into daily record, and original back end becomes out-of-date or invalid, and the method is called as non-local update.One of factor that influences its efficient is searching and managing of free block, and when log record improved the flash memory file system robustness, host computer carried out multiple cycles through digitwise operation and relatively obtains free block.The clock period of this need of work labor, cause whole erasable time lengthening.
Summary of the invention
In view of this, the object of the present invention is to provide free block in a kind of auxiliary host computer retrieved page map unit piece based on hard-wired device, make that the efficiency of management to free block improves greatly.
In order to address the above problem, the technical scheme that is adopted is:
The device of free block in a kind of auxiliary host computer retrieved page map unit piece comprises:
Registers group is used to deposit a page map unit piece idle marker position;
Searcher is bus apparatus, connects said registers group, according to idle marker position retrieval free block.
Device according to free block in the auxiliary host computer retrieved page map unit piece of the present invention is realized free block in the page or leaf map unit piece is managed through hardware mode; Use register to deposit page state of map unit piece; Through this state of retriever retrieves, be busy as 1 then, 0 expression is idle; Retrieve first 0 value when then retrieving and finish, be kept at the corresponding page or leaf mapping free block address of 0 value.The nearly tens times lifting of retrieval mode speed that realizes in the file system in other words that realizes than software mode makes the efficiency of management to free block have significantly and promotes.
On the other hand, about cost control, because the quantity of page or leaf map unit piece and few among the Flash only needs to consume few register, chip area is constituted influence hardly, the cost increase is extremely limited, the lifting of comprehensive speed, and use cost declines to a great extent.
The device of free block in the above-mentioned auxiliary host computer retrieved page map unit piece, said searcher comprises:
Data-reading unit connects said registers group, takes out said idle marker position;
Comparer connects said data-reading unit, is used to generate the state of idle marker position;
State machine connects said data-reading unit, comparer examine one page map unit piece when being free block, state machine is preserved this free block address;
The AHB equipment interface is used for searcher and is suspended to ahb bus; And
Control register connects said AHB equipment interface and said state machine, is used to dispose the transmission of register information in searcher and the control state machine.
The device of free block in the above-mentioned auxiliary host computer retrieved page map unit piece, said searcher also comprises a counting unit, connects said comparer, comparer is examined to such an extent that the register number of non-dummy status adds up; And this counting unit also connects said control register.
The device of free block in the above-mentioned auxiliary host computer retrieved page map unit piece, said registers group is divided into groups according to the host computer bit wide, the said searcher of parallel connection.
The device of free block in the above-mentioned auxiliary host computer retrieved page map unit piece, said registers group comprises 5 * host computer bit wide register.
Description of drawings
Fig. 1 is the structural principle block diagram according to the device of free block in a kind of auxiliary host computer retrieved page map unit piece of the present invention.
Embodiment
With reference to Figure of description 1, the right is a registers group among the figure, is used to deposit the idle marker position of page map unit piece, takies one, and therefore, circuit realization aspect is fairly simple.Suppose certain page of map unit piece k at present for idle, then corresponding with it register k puts 0; If certain page of map unit piece m is busy at present, then corresponding register m puts 1.
So, referring to Fig. 1, the device of free block in a kind of auxiliary host computer retrieved page map unit piece comprises:
Registers group is used to deposit a page map unit piece idle marker position;
Searcher is bus apparatus, connects said registers group, according to idle marker position retrieval free block.
About searcher, because object is the position, only need read the state (0 or 1) of position, judge whether this state just can know page free time of map unit piece, therefore, to searcher, because logic is very simple, circuitry consumes is also smaller.
On the other hand, retrieval is hit the time that is consumed and followed the complexity of circuit that relation is also arranged, and is obvious, according to said structure, and the retrieval that its recall precision realizes far above software.
A kind of preferable structure is that said searcher comprises:
Data-reading unit connects said registers group, takes out said idle marker position; The read register circuit is reading of the basic circuit in the computer circuits, especially contraposition, realizes more or less freely;
Comparer connects said data-reading unit, is used to generate the state of idle marker position, as 1 or 0, can consider the circuit of follow-up connection;
State machine connects said data-reading unit, comparer examine one page map unit piece when being free block, state machine is preserved this free block address, supplies host computer to extract;
The AHB equipment interface is used for searcher and is suspended to ahb bus; And
Control register connects said AHB equipment interface and said state machine, is used to dispose the transmission of register information in searcher and the control state machine.
So according to said structure, if what need output is 1, expression is idle, high level in other words, and a simple Sheffer stroke gate just can realize.
Owing to whether need know each page map unit piece all with data sometimes, to carry out other operation, for this reason, said searcher also comprises a counting unit, and busy summation among the figure refers to busy number accumulative total; This counting unit counter in other words connects said comparer, comparer is examined to such an extent that the register number of non-dummy status adds up; And this counting unit also connects said control register, reads for host computer.
Further, said registers group is divided into groups according to the host computer bit wide, and the said searcher of parallel connection is to improve effectiveness of retrieval.
Preferably, said registers group comprises 5 * host computer bit wide register, under the smaller situation of circuitry consumes, satisfies the needs of the high speed page or leaf map unit block retrieval of current Flash.
Referring to the structure of Figure of description 1, for host computer provides the step of non-empty block following:
1. the value (zone bit) of page or leaf map unit piece 0 ~ 159 is obtained, write its 0 ~ 159 corresponding register.
2. all registers are pressed 0 ~ 31; 32 ~ 63,64 ~ 95,96 ~ 127; 128 ~ 159 minutes five groups; Obtaining in every group of register register value is the register number of 1 (according to aforementioned definitions, it is busy being expressed as corresponding page or leaf map unit piece), is the summations that add up of all register values of 1 to the value of depositing in every group of register promptly.
3. sending into searcher with above-mentioned five with value sues for peace and to obtain the sum of non-empty block.
Also can directly travel through whole registers group, directly adding up through counter obtains the sum of non-empty block.
Referring to the structure of Figure of description 1, provide the step of free block map address following:
1. the value (zone bit) of page or leaf map unit piece 0 ~ 159 is obtained, write its 0 ~ 159 corresponding register.
To all registers by 0 ~ 31,32 ~ 63,64 ~ 95,96 ~ 127,128 ~ 159 minutes five groups, with the parallel in proper order searcher of sending into of five groups of registers.
3. retriever retrieves promptly finishes to first 0 value, preserves the address of the corresponding page or leaf map unit piece of this 0 value.
Detailed process is at first to compare 0 ~ 31 this first group of register value, if detecting 0 stops, this address is preserved, and retrieval finishes.Otherwise detect 32 ~ 63 these group register values, detect 0 and promptly stop, preserving this address.Otherwise continue retrieval until retrieving 0 value for the first time, preserve the address of the corresponding page or leaf map unit piece of this 0 value then.
The packet mode of above-mentioned register is to set towards the host computer of 32 frameworks.
Claims (5)
1. the device of free block in the auxiliary host computer retrieved page map unit piece is characterized in that, comprising:
Registers group is used to deposit a page map unit piece idle marker position;
Searcher is bus apparatus, connects said registers group, according to idle marker position retrieval free block.
2. the device of free block in the auxiliary host computer retrieved page map unit piece according to claim 1 is characterized in that said searcher comprises:
Data-reading unit connects said registers group, takes out said idle marker position;
Comparer connects said data-reading unit, is used to generate the state of idle marker position;
State machine connects said data-reading unit, comparer examine one page map unit piece when being free block, state machine is preserved this free block address;
The AHB equipment interface is used for searcher and is suspended to ahb bus; And
Control register connects said AHB equipment interface and said state machine, is used to dispose the transmission of register information in searcher and the control state machine.
3. the device of free block is characterized in that said searcher also comprises a counting unit in the auxiliary host computer retrieved page map unit piece according to claim 2, connects said comparer, comparer is examined to such an extent that the register number of non-dummy status adds up; And this counting unit also connects said control register.
4. according to the device of free block in the arbitrary described auxiliary host computer retrieved page map unit piece of claim 1 to 3, it is characterized in that said registers group is divided into groups according to the host computer bit wide, the said searcher of parallel connection.
5. the device of free block is characterized in that said registers group comprises 5 * host computer bit wide register in the auxiliary host computer retrieved page map unit piece according to claim 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210030836.7A CN102591793B (en) | 2012-02-13 | 2012-02-13 | Device for assisting upper computer to retrieve free chunks in page mapping unit block |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210030836.7A CN102591793B (en) | 2012-02-13 | 2012-02-13 | Device for assisting upper computer to retrieve free chunks in page mapping unit block |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102591793A true CN102591793A (en) | 2012-07-18 |
| CN102591793B CN102591793B (en) | 2014-12-03 |
Family
ID=46480483
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210030836.7A Expired - Fee Related CN102591793B (en) | 2012-02-13 | 2012-02-13 | Device for assisting upper computer to retrieve free chunks in page mapping unit block |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102591793B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489354A (en) * | 2019-08-15 | 2019-11-22 | 山东华芯半导体有限公司 | Support the abrasion equilibrium garbage reclamation accelerator of two kinds of bit wides |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101162608A (en) * | 2006-10-10 | 2008-04-16 | 北京华旗资讯数码科技有限公司 | Memory block of flash memory sign method |
| CN101539895A (en) * | 2009-05-07 | 2009-09-23 | 成都市华为赛门铁克科技有限公司 | Method, device and system for inquiring state based on Flash |
| US20100205356A1 (en) * | 2009-02-09 | 2010-08-12 | Tdk Corporation | Memory controller, memory system with memory controller, and method of controlling flash memory |
| CN202443462U (en) * | 2012-02-13 | 2012-09-19 | 山东华芯半导体有限公司 | Device for assisting upper computer to search free block in page mapping unit block |
-
2012
- 2012-02-13 CN CN201210030836.7A patent/CN102591793B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101162608A (en) * | 2006-10-10 | 2008-04-16 | 北京华旗资讯数码科技有限公司 | Memory block of flash memory sign method |
| US20100205356A1 (en) * | 2009-02-09 | 2010-08-12 | Tdk Corporation | Memory controller, memory system with memory controller, and method of controlling flash memory |
| CN101539895A (en) * | 2009-05-07 | 2009-09-23 | 成都市华为赛门铁克科技有限公司 | Method, device and system for inquiring state based on Flash |
| CN202443462U (en) * | 2012-02-13 | 2012-09-19 | 山东华芯半导体有限公司 | Device for assisting upper computer to search free block in page mapping unit block |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489354A (en) * | 2019-08-15 | 2019-11-22 | 山东华芯半导体有限公司 | Support the abrasion equilibrium garbage reclamation accelerator of two kinds of bit wides |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102591793B (en) | 2014-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103425600B (en) | Address mapping method in a kind of solid-state disk flash translation layer (FTL) | |
| CN108572796B (en) | SSD with heterogeneous NVM types | |
| CN105094686B (en) | Data cache method, caching and computer system | |
| US10628326B2 (en) | Logical to physical mapping | |
| US8566505B2 (en) | Flash management using sequential techniques | |
| CN102111448B (en) | Data prefetching method of DHT memory system and node and system | |
| CN102349055B (en) | To the access time optimization of the file stored on a memory | |
| US10534718B2 (en) | Variable-size table for address translation | |
| US20150098271A1 (en) | System and method of storing data in a data storage device | |
| CN105980992B (en) | A kind of storage system, the method for identification data block stability and device | |
| TWI385517B (en) | Storage device and data management method | |
| CN107003942A (en) | To for strengthening the performance of storage device and the processing of persistent unmapped order | |
| JP6713934B2 (en) | Storage device and its operating method and system | |
| CN105095116A (en) | Cache replacing method, cache controller and processor | |
| CN106354615A (en) | Solid state disk log generating method and device | |
| CN109923514B (en) | Memory operation on data | |
| CN105917303A (en) | Controller, method for identifying data block stability and storage system | |
| US11016904B2 (en) | Storage device for performing map scheduling and electronic device including the same | |
| CN202443462U (en) | Device for assisting upper computer to search free block in page mapping unit block | |
| CN106062724A (en) | Data management on memory modules | |
| CN109408416B (en) | Address mapping table entry page management method and device | |
| CN102650972B (en) | Date storage method, Apparatus and system | |
| CN108664217B (en) | Caching method and system for reducing jitter of writing performance of solid-state disk storage system | |
| Xiang et al. | A reliable B-tree implementation over flash memory | |
| US11836092B2 (en) | Non-volatile storage controller with partial logical-to-physical (L2P) address translation table |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141203 Termination date: 20220213 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |