CN109445697A - A kind of chunking method and device - Google Patents
A kind of chunking method and device Download PDFInfo
- Publication number
- CN109445697A CN109445697A CN201811231294.3A CN201811231294A CN109445697A CN 109445697 A CN109445697 A CN 109445697A CN 201811231294 A CN201811231294 A CN 201811231294A CN 109445697 A CN109445697 A CN 109445697A
- Authority
- CN
- China
- Prior art keywords
- good block
- block
- logic unit
- good
- idle
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a kind of chunking method and devices, this method comprises: obtaining the essential information of the good block of solid state hard disk according to the factory bad block table of solid state hard disk；According to the essential information of good block, the free time good block composition combination block of preset quantity is successively chosen from the good block of each logic unit management；Idle good block is the good block for not forming combination block；When the quantity of idle good block in the good block for not having idle good block or destination logical unit management in the good block of destination logical unit management is less than preset quantity, idle good block is chosen from the good block of other logic unit management according to preset rules；Destination logical unit management is any one in the management of each logic unit, guarantees that in combination block do not include bad block, avoids the problem of combination block is abandoned.
Description
Technical field
This application involves technical field of data storage more particularly to a kind of chunking method and devices.
Background technique
Memory block management is the important content of solid state hard disk (Solid State Drives, SSD) firmware algorithm, wherein group
Block implementation method, the management of combination block are closely related with the readwrite performance of SSD.
Currently used group of block method is the memory block managed from all logic units (Logic Unit Number, LUN)
Middle taking-up physics numbers identical physical block composition combination block (such as superblock).If corresponding to physics number on some of them LUN
Physical block is bad block, then will lead to includes a certain number of bad blocks in combination block.When the quantity of bad block in combination block reaches certain
When degree, which is abandoned, and in turn results in the waste of the memory space of good block in the combination block.
Summary of the invention
In view of this, the embodiment of the present application provides a kind of chunking method and device, it is able to solve in the prior art because of group
Close the problem of block bad number of blocks abandons caused waste of storage space more.
A kind of group of block method provided by the embodiments of the present application, comprising:
According to the factory bad block table of solid state hard disk, the essential information of the good block of the solid state hard disk is obtained；
According to the essential information of the good block, the sky of preset quantity is successively chosen from the good block of each logic unit management
Not busy good block forms combination block；The free time good block is the good block for not forming combination block；
When the good block for not having idle good block or the destination logical unit management in the good block of destination logical unit management
When the quantity of middle free time good block is less than the preset quantity, chosen from the good block of other logic unit management according to preset rules
Idle good block；The destination logical unit management is any one in each logic unit management.
Optionally, described to choose idle good block, specific packet from the good block of other logic unit management according to preset rules
It includes:
Judge in the good block of each first logic unit management one by one whether available free piece；First logic unit and institute
It states destination logical unit and belongs to identical communication channel；
If so, choosing idle good block from the good block of available free piece of the first logic unit management.
Optionally, described to choose idle good block from the good block of other logic unit management according to preset rules, specifically also
Include:
When idle good block no in the good block of each first logic unit management, alternatively, each described first patrols
When the sum of quantity of idle good block is less than the preset quantity in volume unit and the good block of the destination logical unit management, judgement
In the good block of each second logic unit management whether available free piece；Second logic unit and the target logic list
Member belongs to different communication channels；
If so, choosing idle good block from the good block of available free piece of the second logic unit management.
Optionally, described to choose idle good block from the good block of other logic unit management according to preset rules, specifically also
Include:
When idle good block no in the good block of each second logic unit management, alternatively, each described first patrols
It is small to collect the sum of quantity of idle good block in the good block of unit, each second logic unit and the destination logical unit management
When the preset quantity, terminates and set up combination block.
Optionally, the essential information for obtaining the good block of solid state hard disk, later further include:
According to generated piece of record sheet of essential information of the good block；The good block record sheet includes each free time good block
Physical address and its affiliated logic unit information and communication channel information；
It then, is according to selection with the good block record sheet when choosing idle good block.
A kind of group of block assembly provided by the embodiments of the present application, comprising: acquiring unit and chunk unit；
The acquiring unit obtains the basic of the good block of the solid state hard disk for the factory bad block table according to solid state hard disk
Information；
The chunk unit, for the essential information according to the good block, from the good block of each logic unit management according to
The secondary free time good block for choosing preset quantity forms combination block；The free time good block is the good block for not forming combination block；It is also used to work as
There is no idle good block in idle good block or the good block of the destination logical unit management in the good block of destination logical unit management
Quantity when being less than the preset quantity, chooses free time good block from the good block of other logic unit management according to preset rules；
The destination logical unit management is any one in each logic unit management.
Optionally, the chunk unit, specifically includes: the first judgment sub-unit and selecting block subelement；
First judgment sub-unit, it is whether available free in the good block for judging each first logic unit management one by one
Block；First logic unit and the destination logical unit belong to identical communication channel；
It is described to select block subelement, for when the judging result of first judgment sub-unit be when, from available free piece
Idle good block is chosen in the good block of first logic unit management.
Optionally, the chunk unit, specifically further include: the second judgment sub-unit；
Second judgment sub-unit, for judging each first logic unit pipe when first judgment sub-unit
Without idle good block in the good block of reason, alternatively, each first logic unit and the destination logical unit management is good
When the sum of quantity of idle good block is less than the preset quantity in block, in the good block that judges each second logic unit management
Whether available free piece；Second logic unit and the destination logical unit belong to different communication channels；
It is described to select block subelement, it is also used to when the judging result of second judgment sub-unit, which is, is, from available free piece
The second logic unit management good block in choose idle good block.
Optionally, the chunk unit, specifically further include: terminate subelement；
The termination subelement, for judging each second logic unit management when second judgment sub-unit
Without idle good block in good block, alternatively, each first logic unit, each second logic unit and the target
When the sum of the quantity of idle good block is less than the preset quantity in the good block of logic unit management, terminates and set up combination block.
Optionally, described device further include: generation unit；
The generation unit, for generated piece of record sheet of essential information according to the good block；The good block record sheet
Physical address and its affiliated logic unit information and communication channel information including each free time good block；
Then, the chunk unit is specifically used for when choosing idle good block, is that foundation is chosen with the good block record sheet.
Compared with prior art, the application has at least the following advantages:
In the embodiment of the present application, the essential information of wherein good block is determined according to the factory bad block table of solid state hard disk first,
And on this basis, the free time good block composition combination block of preset quantity is successively chosen from the good block of each logic unit management,
Guarantee that in combination block do not include bad block, avoids the problem of combination block is abandoned.When the good block of a certain logic unit management does not have
When not being less than preset quantity by the free time good block that other combination blocks occupy, sky is chosen from other logic units according to preset rules
Not busy good block forms combination block, it is ensured that combination block includes the physical block of anticipated number, ensure that the performance of solid state hard disk.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The some embodiments recorded in application, for those of ordinary skill in the art, without creative efforts,
It can also be obtained according to these attached drawings other attached drawings.
Fig. 1 is the flow diagram of a kind of group of block method provided by the embodiments of the present application；
Fig. 2 is a kind of chunking schematic diagram of provided by the embodiments of the present application group of block method；
Fig. 3 is the flow diagram of another group block method provided by the embodiments of the present application；
Fig. 4 is another chunking schematic diagram of provided by the embodiments of the present application group of block method；
Fig. 5 is another chunking schematic diagram of provided by the embodiments of the present application group of block method；
Fig. 6 is the structural schematic diagram of a kind of group of block assembly provided by the embodiments of the present application.
Specific embodiment
In order to make those skilled in the art more fully understand application scheme, below in conjunction in the embodiment of the present application
Attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is only this
Apply for a part of the embodiment, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art exist
Every other embodiment obtained under the premise of creative work is not made, shall fall in the protection scope of this application.
Referring to Fig. 1, which is the flow diagram of a kind of group of block method provided by the embodiments of the present application.
Provided by the embodiments of the present application group of block method, includes the following steps S101-S103.
S101: according to the factory bad block table of solid state hard disk, the essential information of the good block of solid state hard disk is obtained.
In practical applications, each SSD factory Shi Junhui, which provides record by producer, has the physical block damaged in SSD (i.e. bad
Block) information factory bad block table.The essential information of available physical blocks in SSD (i.e. good block) can be determined according to factory bad block table,
The essential information has included but is not limited to the physical block number, the LUN information and affiliated communication channel (Channel) of block
Deng.
In some possible implementations of the embodiment of the present application, can also include: after step S101
According to generated piece of record sheet of essential information of good block, so that subsequent block composition combination block of therefrom having chosen is (as surpassed
Grade block).Wherein, good block record sheet includes that the physical address of each free time good block and its affiliated logic unit information are believed with communication
Road information.In the embodiment of the present application, idle good block refers specifically to the good block for not forming combination block.
S102: according to the essential information of good block, preset quantity is successively chosen from the good block of each logic unit management
Idle good block forms combination block.
In the embodiment of the present application, due to not including bad block in the combination block of composition, then there is no combination blocks to abandon
The case where, avoid the waste of storage resource.In practical applications, it can set and be chosen from each LUN according to specific needs
Good block quantity (i.e. preset quantity), here without limiting, Fig. 2 is equal to 1 with preset quantity to be illustrated a kind of chunking
Schematic diagram, in each dotted line frame in good block form a combination block.
In some possible designs, if having generated block record sheet, when choosing idle good block, it can be remembered with good block
Recording table is according to selection.
S103: when the good block for not having idle good block or destination logical unit management in the good block of destination logical unit management
When the quantity of middle free time good block is less than preset quantity, the free time is chosen from the good block of other logic unit management according to preset rules
Good block.Wherein, destination logical unit management is any one in the management of each logic unit.
In the embodiment of the present application, in order to avoid can not generate the quantity of good block in combination block or combination block be unsatisfactory for it is pre-
Phase borrows block from other logic units when that can not select idle good block from some logic unit (i.e. destination logical unit),
It ensure that the performance of solid state hard disk.
It is idle good the following detailed description of specifically how to be chosen from the good block of other logic unit management according to preset rules
Block.
In some possible implementations of the embodiment of the present application, as shown in figure 3, step S103 can specifically include:
S1031: judge in the good block of each first logic unit management one by one whether available free piece；If so, executing step
Rapid S1032.
Wherein, the first logic unit and destination logical unit belong to identical communication channel.
S1032: idle good block is chosen from the good block of available free piece of the first logic unit management.
In the present embodiment, first from logic unit (i.e. the first logic belonged in identical Channel with destination logical unit
Unit) in borrow block form combination block, it is ensured that the storage performance of combination block.Fig. 4 is equal to 1 with preset quantity to be illustrated one
Chunking schematic diagram when kind borrowing from block to the logic unit belonged in identical Channel, in each dotted line frame in good block composition one
A combination block.
Optionally, with continued reference to Fig. 3, when idle good block no in the good block of each first logic unit management, alternatively,
When the sum of the quantity of idle good block is less than preset quantity in each first logic unit and the good block of destination logical unit management, step
Suddenly S103 specifically can also include:
S1033: judge in the good block of each second logic unit management whether available free piece.If so, thening follow the steps
S1034。
Wherein, the second logic unit and destination logical unit belong to different communication channels.
S1034: idle good block is chosen from the good block of available free piece of the second logic unit management.
In the present embodiment, in logic unit (i.e. the first logic list belonged in identical Channel with destination logical unit
Member) in when there is no sufficient amount of idle good block, then borrow block to form combination block from other logic units.Fig. 5 is with preset quantity
Equal to 1 for be illustrated it is a kind of to the logic unit belonged in different Channel borrow block when chunking schematic diagram, each dotted line frame
In in good block form a combination block.
Optionally, with continued reference to Fig. 3, when idle good block no in the good block of each second logic unit management, alternatively,
The sum of the quantity of idle good block in each first logic unit, each second logic unit and the good block of destination logical unit management
When less than preset quantity, step S103 specifically can also include:
S1035: it terminates and sets up combination block.
In some possible implementations, when terminate set up combination block when, the free time good block weight that will can choose before
It has newly been put into block record sheet, has been chosen from good block record sheet when to occur bad block in subsequent use process in combination block idle
Bad block in good block replacement combination block.
In the embodiment of the present application, the essential information of wherein good block is determined according to the factory bad block table of solid state hard disk first,
And on this basis, the free time good block composition combination block of preset quantity is successively chosen from the good block of each logic unit management,
Guarantee that in combination block do not include bad block, avoids the problem of combination block is abandoned.When the good block of a certain logic unit management does not have
When not being less than preset quantity by the free time good block that other combination blocks occupy, sky is chosen from other logic units according to preset rules
Not busy good block forms combination block, it is ensured that combination block includes the physical block of anticipated number, ensure that the performance of solid state hard disk.
The group block method provided based on the above embodiment, the embodiment of the present application also provides a kind of group of block assemblies.
Referring to Fig. 6, which is the structural schematic diagram of a kind of group of block assembly provided by the embodiments of the present application.
Provided by the embodiments of the present application group of block assembly, comprising: acquiring unit 100 and chunk unit 200；
Acquiring unit 100 obtains the essential information of the good block of solid state hard disk for the factory bad block table according to solid state hard disk；
Chunk unit 200 is successively chosen from the good block of each logic unit management for the essential information according to good block
The free time good block of preset quantity forms combination block；Idle good block is the good block for not forming combination block；It is also used to when target logic list
There is no the quantity of idle good block in idle good block or the good block of destination logical unit management to be less than in the good block of member management default
When quantity, idle good block is chosen from the good block of other logic unit management according to preset rules；Destination logical unit management is
Any one in the management of each logic unit.
In some possible implementations of the embodiment of the present application, chunk unit 200 be can specifically include: the first judgement
Subelement and select block subelement；
First judgment sub-unit, in the good block for judging each first logic unit management one by one whether available free piece；
First logic unit and destination logical unit belong to identical communication channel；
Select block subelement, for when the judging result of the first judgment sub-unit be when, from available free piece of the first logic
Idle good block is chosen in the good block of Single Component Management.
In some possible implementations of the embodiment of the present application, chunk unit 200 specifically can also include: second to sentence
Disconnected subelement；
Second judgment sub-unit, for judging in the good block of each first logic unit management when the first judgment sub-unit
Without idle good block, alternatively, in each first logic unit and the good block of destination logical unit management idle good block quantity it
When with being less than preset quantity, judge in the good block of each second logic unit management whether available free piece；Second logic unit and
Destination logical unit belongs to different communication channels；
Block subelement is selected, is also used to when the judging result of the second judgment sub-unit, which is, is, second from available free piece patrols
It collects and chooses idle good block in the good block of Single Component Management.
In some possible implementations of the embodiment of the present application, chunk unit 200 specifically can also include: terminator
Unit；
Subelement is terminated, for not having when in the good block that the second judgment sub-unit judges each second logic unit management
Idle good block, alternatively, idle in each first logic unit, each second logic unit and the good block of destination logical unit management
When the sum of quantity of good block is less than preset quantity, terminates and set up combination block.
In some possible implementations of the embodiment of the present application, which can also include: generation unit；
Generation unit, for generated piece of record sheet of essential information according to good block；Good block record sheet includes each good block
Physical address and its affiliated logic unit information and communication channel information；
Then, chunk unit 200 are specifically used for when choosing idle good block, are that foundation is chosen with good block record sheet.
In the embodiment of the present application, the essential information of wherein good block is determined according to the factory bad block table of solid state hard disk first,
And on this basis, the free time good block composition combination block of preset quantity is successively chosen from the good block of each logic unit management,
Guarantee that in combination block do not include bad block, avoids the problem of combination block is abandoned.When the good block of a certain logic unit management does not have
When not being less than preset quantity by the free time good block that other combination blocks occupy, sky is chosen from other logic units according to preset rules
Not busy good block forms combination block, it is ensured that combination block includes the physical block of anticipated number, ensure that the performance of solid state hard disk.
It should be appreciated that in this application, " at least one (item) " refers to one or more, and " multiple " refer to two or two
More than a."and/or" indicates may exist three kinds of relationships, for example, " A and/or B " for describing the incidence relation of affiliated partner
It can indicate: only exist A, only exist B and exist simultaneously tri- kinds of situations of A and B, wherein A, B can be odd number or plural number.Word
Symbol "/" typicallys represent the relationship that forward-backward correlation object is a kind of "or"." at least one of following (a) " or its similar expression, refers to
Any combination in these, any combination including individual event (a) or complex item (a).At least one of for example, in a, b or c
(a) can indicate: a, b, c, " a and b ", " a and c ", " b and c ", or " a and b and c ", and wherein a, b, c can be individually, can also
To be multiple.
It should be noted that each embodiment in this specification is described in a progressive manner, each embodiment emphasis is said
Bright is the difference from other embodiments, and the same or similar parts in each embodiment may refer to each other.For reality
For applying device disclosed in example, since it is corresponded to the methods disclosed in the examples, so description is fairly simple, related place ginseng
See method part illustration.
It should also be noted that, herein, relational terms such as first and second and the like are used merely to one
Entity or operation are distinguished with another entity or operation, without necessarily requiring or implying between these entities or operation
There are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant are intended to contain
Lid non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
The above is only the preferred embodiment of the application, not makes any form of restriction to the application.Though
Right the application has been disclosed in a preferred embodiment above, however is not limited to the application.It is any to be familiar with those skilled in the art
Member, in the case where not departing from technical scheme ambit, all using the methods and technical content of the disclosure above to the application
Technical solution makes many possible changes and modifications or equivalent example modified to equivalent change.Therefore, it is all without departing from
The content of technical scheme, any simple modification made to the above embodiment of the technical spirit of foundation the application are equal
Variation and modification, still fall within technical scheme protection in the range of.
Claims (10)
1. a kind of group of block method, which is characterized in that the described method includes:
According to the factory bad block table of solid state hard disk, the essential information of the good block of the solid state hard disk is obtained；
According to the essential information of the good block, the free time that preset quantity is successively chosen from the good block of each logic unit management is good
Block forms combination block；The free time good block is the good block for not forming combination block；
When there is no the good block of idle good block or the destination logical unit management hollow in the good block of destination logical unit management
When the quantity of not busy good block is less than the preset quantity, the free time is chosen from the good block of other logic unit management according to preset rules
Good block；The destination logical unit management is any one in each logic unit management.
2. the method according to claim 1, wherein it is described according to preset rules from other logic unit management
Idle good block is chosen in good block, is specifically included:
Judge in the good block of each first logic unit management one by one whether available free piece；First logic unit and the mesh
Mark logic unit belongs to identical communication channel；
If so, choosing idle good block from the good block of available free piece of the first logic unit management.
3. according to the method described in claim 2, it is characterized in that, it is described according to preset rules from other logic unit management
Idle good block is chosen in good block, specifically further include:
When idle good block no in the good block of each first logic unit management, alternatively, each first logic list
When the sum of the quantity of idle good block is less than the preset quantity in the good block of the first and described destination logical unit management, judgement is each
In the good block of the second logic unit management whether available free piece；Second logic unit and the destination logical unit category
In different communication channels；
If so, choosing idle good block from the good block of available free piece of the second logic unit management.
4. according to the method described in claim 3, it is characterized in that, it is described according to preset rules from other logic unit management
Idle good block is chosen in good block, specifically further include:
When idle good block no in the good block of each second logic unit management, alternatively, each first logic list
The sum of the quantity of idle good block is less than institute in first, each second logic unit and the good block of the destination logical unit management
When stating preset quantity, terminates and set up combination block.
5. method according to any of claims 1-4, which is characterized in that the acquisition good block of solid state hard disk
Essential information, later further include:
According to generated piece of record sheet of essential information of the good block；The good block record sheet includes the physics of each free time good block
Address and its affiliated logic unit information and communication channel information；
It then, is according to selection with the good block record sheet when choosing idle good block.
6. a kind of group of block assembly, which is characterized in that described device includes: acquiring unit and chunk unit；
The acquiring unit obtains the essential information of the good block of the solid state hard disk for the factory bad block table according to solid state hard disk；
The chunk unit is successively selected from the good block of each logic unit management for the essential information according to the good block
Take the free time of preset quantity good block composition combination block；The free time good block is the good block for not forming combination block；It is also used to work as target
There is no the number of idle good block in idle good block or the good block of the destination logical unit management in the good block of logic unit management
When amount is less than the preset quantity, idle good block is chosen from the good block of other logic unit management according to preset rules；It is described
Destination logical unit management is any one in each logic unit management.
7. device according to claim 6, which is characterized in that the chunk unit specifically includes: the first judgment sub-unit
With select block subelement；
First judgment sub-unit, in the good block for judging each first logic unit management one by one whether available free piece；
First logic unit and the destination logical unit belong to identical communication channel；
It is described to select block subelement, for when the judging result of first judgment sub-unit, which is, is, from the first of available free piece
Idle good block is chosen in the good block of logic unit management.
8. device according to claim 7, which is characterized in that the chunk unit, specifically further include: the second judgement is single
Member；
Second judgment sub-unit, for judging each first logic unit management when first judgment sub-unit
Without idle good block in good block, alternatively, in each first logic unit and the good block of the destination logical unit management
When the sum of quantity of idle good block is less than the preset quantity, judge in the good block of each second logic unit management whether
Available free piece；Second logic unit and the destination logical unit belong to different communication channels；
It is described to select block subelement, it is also used to when the judging result of second judgment sub-unit, which is, is, from the of available free piece
Idle good block is chosen in the good block of two logic unit management.
9. device according to claim 8, which is characterized in that the chunk unit, specifically further include: terminate subelement；
The termination subelement, for judging the good block of each second logic unit management when second judgment sub-unit
In without idle good block, alternatively, each first logic unit, each second logic unit and the target logic
When the sum of the quantity of idle good block is less than the preset quantity in the good block of Single Component Management, terminates and set up combination block.
10. according to device described in claim 6-9 any one, which is characterized in that described device further include: generation unit；
The generation unit, for generated piece of record sheet of essential information according to the good block；The good block record sheet includes
The physical address of each free time good block and its affiliated logic unit information and communication channel information；
Then, the chunk unit is specifically used for when choosing idle good block, is that foundation is chosen with the good block record sheet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811231294.3A CN109445697A (en) | 2018-10-22 | 2018-10-22 | A kind of chunking method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811231294.3A CN109445697A (en) | 2018-10-22 | 2018-10-22 | A kind of chunking method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109445697A true CN109445697A (en) | 2019-03-08 |
Family
ID=65548319
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811231294.3A Pending CN109445697A (en) | 2018-10-22 | 2018-10-22 | A kind of chunking method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109445697A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110109627A (en) * | 2019-05-21 | 2019-08-09 | 深圳市时创意电子有限公司 | A kind of effective method for promoting Nand flash memory device and producing sufficient capacity rate |
| CN112558863A (en) * | 2020-11-25 | 2021-03-26 | 成都佰维存储科技有限公司 | SSD bad block replacement method and device, readable storage medium and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101727295A (en) * | 2008-10-31 | 2010-06-09 | 西安奇维测控科技有限公司 | Method for writing in and reading out data based on virtual block flash memory address mapping |
| CN102317925A (en) * | 2009-02-12 | 2012-01-11 | 株式会社东芝 | Memory system and method of controlling memory system |
| US20130159601A1 (en) * | 2011-12-20 | 2013-06-20 | Paul A. Lassa | Controller and Method for Virtual LUN Assignment for Improved Memory Bank Mapping |
| CN105786407A (en) * | 2016-02-26 | 2016-07-20 | 湖南国科微电子股份有限公司 | Multi-CE NAND Flash dynamic block model based on multi-channel master control and bad block processing method |
| CN207148818U (en) * | 2017-07-31 | 2018-03-27 | 北京忆芯科技有限公司 | Solid storage device control unit with LUN mapping device |
| CN108469946A (en) * | 2018-03-31 | 2018-08-31 | 北京联想核芯科技有限公司 | A kind of chunking method and apparatus for improving SSD write efficiencies |
-
2018
- 2018-10-22 CN CN201811231294.3A patent/CN109445697A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101727295A (en) * | 2008-10-31 | 2010-06-09 | 西安奇维测控科技有限公司 | Method for writing in and reading out data based on virtual block flash memory address mapping |
| CN102317925A (en) * | 2009-02-12 | 2012-01-11 | 株式会社东芝 | Memory system and method of controlling memory system |
| US20130159601A1 (en) * | 2011-12-20 | 2013-06-20 | Paul A. Lassa | Controller and Method for Virtual LUN Assignment for Improved Memory Bank Mapping |
| CN105786407A (en) * | 2016-02-26 | 2016-07-20 | 湖南国科微电子股份有限公司 | Multi-CE NAND Flash dynamic block model based on multi-channel master control and bad block processing method |
| CN207148818U (en) * | 2017-07-31 | 2018-03-27 | 北京忆芯科技有限公司 | Solid storage device control unit with LUN mapping device |
| CN108469946A (en) * | 2018-03-31 | 2018-08-31 | 北京联想核芯科技有限公司 | A kind of chunking method and apparatus for improving SSD write efficiencies |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110109627A (en) * | 2019-05-21 | 2019-08-09 | 深圳市时创意电子有限公司 | A kind of effective method for promoting Nand flash memory device and producing sufficient capacity rate |
| CN112558863A (en) * | 2020-11-25 | 2021-03-26 | 成都佰维存储科技有限公司 | SSD bad block replacement method and device, readable storage medium and electronic equipment |
| CN112558863B (en) * | 2020-11-25 | 2023-02-14 | 成都佰维存储科技有限公司 | SSD bad block replacement method and device, readable storage medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101788995B (en) | Hotspot data identification method and device | |
| CN104462389B (en) | Distributed file system implementation method based on classification storage | |
| US20060212495A1 (en) | Method and system for storing data into a database | |
| CN106406759B (en) | Data storage method and device | |
| CN103064639A (en) | Method and device for storing data | |
| CN105701028A (en) | Method and device for managing disks in distributed storage system | |
| CN103631538A (en) | Cold and hot data identification threshold value calculation method, device and system | |
| CN104462240A (en) | Method and system for realizing hierarchical storage and management in cloud storage | |
| CN112988066B (en) | Data processing method and device | |
| CN107562913A (en) | The date storage method and device of a kind of distributed file system | |
| CN101620569A (en) | A Method for Expanding Storage Space of Logical Volume | |
| CN106527995A (en) | Data expansion and migration method for I/O equilibrium | |
| US7792966B2 (en) | Zone control weights | |
| CN109445697A (en) | A kind of chunking method and device | |
| CN107070897A (en) | Network log storage method based on many attribute Hash duplicate removals in intruding detection system | |
| CN109446177A (en) | A kind of implementation method and device of distributive catalogue of document system file number quota | |
| CN109240607A (en) | A kind of file reading and device | |
| CN106331075A (en) | Method for storing files, metadata server and manager | |
| CN110019017B (en) | High-energy physical file storage method based on access characteristics | |
| CN109597800A (en) | A kind of log distribution method and device | |
| CN106844491B (en) | Temporary data writing and reading method and device | |
| CN107633097B (en) | Dynamic capacity expansion method and system for database table | |
| CN107092525A (en) | data cache method and device | |
| CN109445715A (en) | A kind of bad block processing method and device of combination block | |
| CN104133970A (en) | Data space management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190308 |
|
| RJ01 | Rejection of invention patent application after publication |