CN107003809B - A kind of method and storage equipment of storage equipment storing data - Google Patents
A kind of method and storage equipment of storage equipment storing data Download PDFInfo
- Publication number
- CN107003809B CN107003809B CN201580002559.0A CN201580002559A CN107003809B CN 107003809 B CN107003809 B CN 107003809B CN 201580002559 A CN201580002559 A CN 201580002559A CN 107003809 B CN107003809 B CN 107003809B
- Authority
- CN
- China
- Prior art keywords
- storage
- write request
- data
- storage region
- space
- 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
- 238000000034 method Methods 0.000 title claims description 30
- 238000013507 mapping Methods 0.000 claims description 50
- 239000010813 municipal solid waste Substances 0.000 description 56
- 238000004064 recycling Methods 0.000 description 23
- 230000003321 amplification Effects 0.000 description 18
- 238000003199 nucleic acid amplification method Methods 0.000 description 18
- 230000008569 process Effects 0.000 description 15
- 101000648827 Homo sapiens TPR and ankyrin repeat-containing protein 1 Proteins 0.000 description 12
- 102100028173 TPR and ankyrin repeat-containing protein 1 Human genes 0.000 description 12
- 238000010586 diagram Methods 0.000 description 10
- 230000007246 mechanism Effects 0.000 description 9
- 238000012545 processing Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 239000000203 mixture Substances 0.000 description 6
- 238000013500 data storage Methods 0.000 description 4
- 230000009467 reduction Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000007787 solid Substances 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 239000013028 medium composition Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
-
- 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/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0647—Migration mechanisms
- G06F3/0649—Lifecycle management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/0292—User address space allocation, e.g. contiguous or non contiguous base addressing using tables or multilevel address translation means
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
-
- 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
-
- 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/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- 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/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability 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/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0616—Improving the reliability of storage systems in relation to life time, e.g. increasing Mean Time Between Failures [MTBF]
-
- 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
-
- 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/0644—Management of space entities, e.g. partitions, extents, pools
-
- 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/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
-
- 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1041—Resource optimization
- G06F2212/1044—Space efficiency improvement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/20—Employing a main memory using a specific memory technology
- G06F2212/202—Non-volatile memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/65—Details of virtual memory and virtual address translation
- G06F2212/657—Virtual address space management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/72—Details relating to flash memory management
- G06F2212/7201—Logical to physical mapping or translation of blocks or pages
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/72—Details relating to flash memory management
- G06F2212/7205—Cleaning, compaction, garbage collection, erase control
Abstract
The invention discloses a kind of schemes for storing equipment storing data, storing equipment includes the first storage region and the second storage region, first storage region includes data space and reserved space, second storage region includes data space and reserved space, storage equipment judges the feature of write request, and the reserved space to corresponding storage region is stored according to the data that judging result carries write request.
Description
Technical field
The present invention relates to information technology field, in particular to a kind of method for storing equipment storing data and storage equipment.
Background technique
Solid state hard disk (Solid State Disk, SSD), as shown in Figure 1, including storage control 101 and medium 102
(such as flash memory particle).Storage control 101 include central processing unit 1011 (Center Processing Unit, CPU) and
Memory 1012.It is that unit tissue stores that the storage of SSD, which is with physical block (physical block) and page (page),.Wherein,
Page is that the smallest reading and writing data unit, the size of page can be 4KB, 8KB or 16KB in solid state hard disk.Physics is combined by page
Block, each physical block can have 32,64 or 128 pages.Memory space is generally divided into data space and reserved space by SSD
(Over-Provisioning).Data space is the space for having been written into data, and reserved space is free space, by free page
Composition, can be used for that data are written.When new data will cover the stored data of data space in SSD, it will use and reset
To (Redirection On Write, ROW) mechanism is write, i.e., when SSD to logical block address (Logical Block Address,
LBA) be written new data to modify stored data when, SSD can write new data into the page of reserved space, establish LBA with
Data markers in the page address of the LBA data space mapped originally are rubbish by the mapping relations of the page address of reserved space
Data.After reserved space is lower than certain threshold value, SSD carries out garbage space recycling to the physical block of page where junk data.It returns
Receipts process is as follows: the valid data read out are written to pre- by the valid data where reading junk data in the physical block of page
Spacing, and the data in the physical block of page where junk data are wiped, using the physical block as new reserved space.In rubbish
In rubbish space reclamation process, reads out valid data and the process that valid data are written to reserved space is known as valid data and remove
It moves.
Garbage space recycling can cause to write amplification, and wherein SSD garbage space recycles the valid data size V moved and newly writes
Enter the ratio between the sum of size of data W and new write-in size of data W, i.e. (V+W)/W is known as writing amplification.
Summary of the invention
In a first aspect, storage equipment includes the embodiment of the invention provides a kind of scheme for storing equipment storing data
One storage region and the second storage region, the first storage region include data space and reserved space, and the second storage region includes
Data space and reserved space, storage equipment receive write request, and write request carries logical address and data, and storage equipment judgement is write
The feature of request.
When the feature of write request meets first condition, the first memory block is written in the data that storage equipment carries write request
First storage address of the reserved space in domain, establishes the mapping relations of logical address Yu the first storage address;As the spy of write request
When sign meets second condition, the second storage address of the reserved space of the second storage region is written in the data that write request is carried,
Establish the mapping relations of logical address Yu the second storage address.In the embodiment of the present invention, according to the feature of write request by write request
The reserved space of the data write-in different storage zone of carrying, reduces moving for valid data in garbage space removal process,
Reduce and writes amplification.
Optionally, storage equipment independently can carry out garbage reclamation to the first storage region and the second storage region.Storage
Equipment independently can carry out garbage space recycling to the first storage region and the second storage region and refer to the storage equipment same time point
An other progress garbage space recycling in the first storage region and the second storage region, but another memory block is not influenced
Domain can also carry out garbage space recycling to the first storage region and the second storage region simultaneously.It is write for different characteristic write request
The data for entering different storage zone are left a blank in advance based on the difference configured in different storage zone and independently carry out rubbish to each storage region
Rubbish space reclamation, it is possible to reduce rubbish makes the return trip empty the moving of valid data in removal process, and reduces and writes amplification, it is further also
The triggering times of garbage space recovery process can be improved by configuring different reserved spaces, to reduce object in storage equipment
It manages the erasing times of block and then improves the service life of storage equipment.
Optionally, the size of the reserved space of the first storage region and the second storage region reserved space is of different sizes.
Optionally, the reserved space of the first storage region is stored less than the reserved space of the second storage region or first
The ratio of the reserved space in region and data space is less than the reserved space of the second storage region and the ratio of data space, and second
Storage region is due to there is more reserved spaces, it is possible to reduce the number of the second storage region garbage space recycling.
Optionally, when corresponding storage region is written, for example, when above-mentioned first or second storage region, if right
It answers the reserved space of memory space inadequate, can dynamically be adjusted, such as in the unspent premise of maximum redundancy quota
It can apply for additional reserved space down, then the data in write request are written to the reserved space newly applied.
Optionally, storage equipment judges that the feature of write request includes:
Storage equipment judges that write request is sequence write request or random write request, then first condition is sequence write request,
Second condition is random write request, and sequence write request is respectively stored into different storage regions from random write request, is reduced
Valid data are moved in garbage space removal process, are reduced and are write amplification.Meanwhile sequence write request and random write request simultaneously
In the presence of, while not influencing sequence write request performance, improve the performance of storage equipment random write.Optionally, sentence
Whether the disconnected absolute value of the difference with the address of logical address is greater than in the reference logical address of L whether have data write-in, and L can basis
Requirement setting to sequence write request.A kind of realization, when there is data write-in in reference logical address, then write request is asked for sequential write
It asks, is otherwise random write request;Another kind realizes that, with reference to not having data write-in in logical address, write request is random write request,
When there is data write-in in reference logical address, further, storage equipment judgement last time, which receives, carries writing for reference address
Whether the time interval that the time of request and last time receive the write request for carrying logical address is greater than threshold value T, if it does,
Random write request is remained as, is otherwise sequence write request.Wherein, T is that can be set according to specific implementation.
Optionally, storage equipment judges that the feature of write request includes:
Storage equipment judges the sequence degree of write request, then first condition is the first sequence degree range;Second condition is second
Sequence degree range;And the minimum value of the first sequence degree range is greater than the maximum value of the second sequence degree range.Optionally, sequence degree
For current logical address sequence write request counting Cs with (the counting Cs of the sequence write request of current logical address with currently patrol
The sum of the counting of the random write request Cr of volume address) ratio S (sequence degree), i.e. Cs/ (Cs+Cr)=S.It can be incited somebody to action according to sequence degree
The data that the write request of different order degree carries are respectively stored in the different storage zone with different reserved spaces, reduce rubbish
Valid data are moved in rubbish space reclamation process, are reduced and are write amplification.
Optionally, the storage equipment judges that the feature of write request includes:
Storage equipment judges the degree of randomness of write request;
Then first condition is the first degree of randomness range, and second condition is the second degree of randomness range, and the first degree of randomness model
Minimum value of the maximum value enclosed less than the second degree of randomness range.Optionally, degree of randomness is the random write request of current logical address
Counting Cr and (the counting Cr of the random write request for counting Cs and current logical address of the sequence write request of current logical address
The sum of) ratio R, i.e. Cr/ (Cr+Cs)=R.The data that the write request of different random degree carries can be deposited respectively according to degree of randomness
Storage, reduces valid data in garbage space removal process and moves, reduce and write amplification.
Optionally, storage equipment judges that the feature of write request includes:
Storage equipment judges the size for the data that write request carries;
Then first condition is the first data interval of the first storage region storage, and second condition is the storage of the second storage region
The second data interval, and the minimum value of the first data interval be greater than the second data interval maximum value.Storing equipment includes
Different storage regions, each storage region store between a corresponding data storage area, it is possible to reduce have in garbage collection procedure
Effect data are moved, and amplification is write in reduction.Optionally, data interval refers to the big of the data that the write request of storage region storage carries
Small section.
Optionally, in the case where multiple write requests are concurrent, storage equipment priority processing meets the write request of first condition,
To improve the write performance of storage equipment.
Optionally, storage equipment be SSD, or for stacked tile type magnetic recording (Shingled Magnetic Recording,
SMR) disk, or to recycle the storage array of function with garbage space based on ROW mechanism.
Corresponding with the scheme that first aspect is realized, second aspect, the present invention implements to additionally provide a kind of storage equipment
Memory space is divided into the first storage region and the second storage region, the first storage by storage region splitting scheme, storage equipment
Region includes data space and reserved space, and the second storage region includes data space and reserved space;Wherein the first memory block
The reserved space in domain is used to store the data of the first write request carrying;The reserved space of second storage region is write for storing second
Request the data carried;The feature of first write request meets first condition;Second write request meets second condition.
Optionally, the storage region of respective numbers can be divided according to the sequence degree of write request or the number of degrees of degree of randomness,
And corresponding reserved space is configured according to the value of each grade of the sequence degree or degree of randomness.The division and correspondence of storage region
The configuration of reserved space can carry out in advance, dynamically can also be divided and be configured in use.
The third aspect, corresponding with first aspect and second aspect, the embodiment of the invention also provides storage equipment, respectively
For as equipment is stored in first aspect and second aspect embodiment, to realize first aspect of the embodiment of the present invention and second party
The example scheme that face provides.Storage equipment includes realizing the structure list of first aspect and second aspect of the invention example scheme
Member, alternatively, storage equipment includes storage control to realize the example scheme of first aspect and second aspect.
Correspondingly, the embodiment of the invention also provides non-volatile computer readable storage medium storing program for executing and computer program to produce
Product, when the memory loading non-volatile computer-readable storage medium of the storage control of storage equipment provided in an embodiment of the present invention
The computer instruction for including in matter and computer program product when the CPU of storage control executes the computer instruction, makes to store
Equipment executes the function that equipment is stored in first aspect and second aspect embodiment, with realize first aspect of the embodiment of the present invention and
The scheme that second aspect provides.
Detailed description of the invention
Fig. 1 is SSD structural schematic diagram;
Fig. 2 is flow chart of the embodiment of the present invention;
Fig. 3 is storage region of embodiment of the present invention schematic diagram;
Fig. 4 is implementation column storage region schematic diagram of the present invention;
Fig. 5 is storage region of embodiment of the present invention schematic diagram;
Fig. 6 is storage region of embodiment of the present invention schematic diagram;
Fig. 7 is storage region of embodiment of the present invention schematic diagram;
Fig. 8 is storage region of embodiment of the present invention schematic diagram;
Fig. 9 is storage region of embodiment of the present invention schematic diagram;
Figure 10 is that the embodiment of the present invention stores equipment schematic diagram;
Figure 11 is that the embodiment of the present invention stores equipment schematic diagram.
Specific embodiment
The embodiment of the present invention is by taking SSD as an example, and in embodiments of the present invention, SSD includes that the first storage region Vd1 and second is deposited
Storage area domain Vd2.Vd1 includes data space and reserved space, and Vd2 includes data space and reserved space, the reserved space of Vd1
The reserved space of size and Vd2 it is of different sizes.In the embodiment of the present invention, SSD can be independently between Vd1 and Vd2 progress rubbish time
Recycling.SSD independently can carry out garbage space recycling to Vd1 and Vd2 and refer to the SSD same time respectively to one in Vd1 and Vd2
Garbage space recycling is carried out, but does not influence another storage region, garbage space recycling can also be carried out to Vd1 and Vd2 simultaneously.Needle
To the data of different characteristic write request write-in different storage zone, left a blank in advance to each based on the difference configured in different storage zone
Storage region independently carries out garbage space recycling, it is possible to reduce rubbish makes the return trip empty the moving of valid data in removal process, and reduces
Amplification is write, further can also improve the triggering times of garbage space recovery process by configuring different reserved spaces,
To reduce the service life of the erasing times of physical block in SSD and then improvement SSD.
The above-mentioned characteristic of SSD of the embodiment of the present invention is also applied in other storage equipment of the embodiment of the present invention, herein not
It repeats again.
The embodiment of the present invention is as shown in Figure 2, comprising:
Step 201: receiving write request.
SSD receives write request, carries LBA and data in write request.
Step 202: judging the feature of write request.
A kind of implementation for judging the feature of write request includes:
Specifically, when SSD reception write request, judge that write request is sequence write request or random write request.The present invention is real
It applies in example, the address LBA that SSD will record the time for receiving each write request and write request carries.It is specific real at one
It applies in mode, judges that write request is sequence write request (first condition shown in Fig. 2) or random write request (Article 2 shown in Fig. 2
Part) method it is as follows:
SSD record receives the LBA of write request carrying, and last time receives the time of the write request.According to writing
The LBA m carried is requested, whether has data write-in in inquiry LBA n (referred to as referring to logical address), wherein LBA m and LBA n
Absolute value of the difference be not more than L.Wherein, L can be arranged according to the requirement to sequence write request.If there is no data in LBA n
Write-in, then the write request for carrying LBA m is random write request;If there is data write-in in LBA n, a kind of implementation is then taken
Write request with LBA m is sequence write request;Another implementation, when there is data write-in in LBA n, further judgement is last
Whether the write request time interval that the primary write request time for receiving carrying LBA n carries LBA m with last time reception is greater than
Threshold value T, if it is greater than T, then the write request for carrying LBA m is random write request;If being not more than T, carries writing for LBA m and ask
Seeking Truth sequence write request.Wherein, T is that can be set according to specific implementation, and the embodiment of the present invention is not construed as limiting this.Usually sequence
Write request is the write request from same file or application, and random write request is asked from different files or writing for application
It asks.
SSD of the embodiment of the present invention includes the second storage region shown in the first storage region (Vd1) shown in Fig. 2 and Fig. 2
(Vd2), Vd1 and Vd2 separately includes one or more physical blocks.As shown in figure 3, the embodiment of the present invention includes Y physics with Vd1
Block, each physical block include n+1 page, and Vd1 is used for the data that storage order write request carries, the 1st physical block to Y-2
The data space of a physical block composition Vd1, Y-1 and the Y physical block form reserved space.
As shown in figure 4, SSD receives the first sequence write request, the logical address that the first sequence write request carries is LBA1.Its
In, LBA1 has been mapped into n+1 page of the 1st physical block in Vd1, i.e. the page 0 that LBA1 is mapped to the 1st physical block in Vd1 arrives page
n.The Y-1 physics of reserved space in Vd1 is written in ROW mechanism based on SSD, the data that SSD carries the first sequence write request
Block establishes the mapping of n+1 page of the Y-1 physical block in LBA1 and Vd1, that is, establishes the Y-1 physical block in LBA1 and Vd1
Page 0 arrive page n mapping, by Vd1 in the 1st physical block Data Identification of the page 0 into page n be junk data (release LBA1 with
The mapping of n+1 page of the 1st physical block in Vd1).SSD receives the second sequence write request, the logic that the second sequence write request carries
Address is LBA2.Wherein, LBA2 has been mapped into n+1 page of the 2nd physical block in Vd1, i.e. LBA2 is mapped to the 2nd object in Vd1
The page 0 for managing block arrives page n.The data that second sequence write request carries are written in Vd1 and are left a blank in advance by the ROW mechanism based on SSD, SSD
Between the Y physical block, establish the mapping of n+1 page of the Y physics in LBA2 and Vd1, that is, it is a to establish Y in LBA2 and Vd1
The page 0 of physics arrives the mapping of page n, by Data Identification of the page 0 into page n is that junk data (releases in the 2nd physical block in Vd1
The mapping of n+1 page of the 2nd physical block in LBA2 and Vd1).
Since reserved space becomes 0 in Vd1 shown in Fig. 4, need to start garbage space recycling.From Vd1 selection include
The most physical block of junk data carries out garbage space recycling.In the embodiment of the present invention, the 1st physical block and the 2nd physical block in Fig. 4
In include junk data it is most, therefore start and the garbage space of the 1st physical block and the 2nd physical block recycled.As shown in figure 5,
In garbage space removal process, what it is due to the page storage in Vd1 in the 1st physical block and the 2nd physics is junk data, is not had
Valid data, therefore do not need progress valid data and move, that is, do not write amplification.Therefore, sequence write request storage is arrived
In Vd1, Vd1 reduces valid data and moves in garbage space removal process, and amplification is write in reduction;Simultaneously as garbage space
There is no or have seldom valid data in removal process, therefore, a small amount of reserved space can be distributed for Vd1.
As shown in fig. 6, the embodiment of the present invention includes X physical block with Vd2, each physical block includes n+1 page, Vd2
The data carried for storing random write request, data space of the 1st physical block to -3 physical block composition Vd2 of X, X -
2 to X physical block form reserved space.
As shown in fig. 7, SSD receives the first random write request, the logical address that the first random write request carries is LBA1 '.
Wherein, LBA1 ' has been mapped into the preceding m page of the 1st physical block in Vd2, i.e. LBA1 ' is mapped to the page 0 of the 1st physical block in Vd2
To page m-1.Reserved space X -2 in Vd2 is written in the data that first random write request carries by the ROW mechanism based on SSD, SSD
A physical block establishes the mapping of the preceding m page of -2 physical blocks of X in LBA1 ' and Vd2, that is, establishes X -2 in LBA1 ' and Vd2
The page 0 of a physical block arrives the mapping of page m-1, by Data Identification of the page 0 into page m-1 is junk data in the 1st physical block in Vd2
(mapping for releasing the preceding m page of the 1st physical block in LBA1 ' and Vd2).SSD receives the second random write request, and the second random write is asked
The logical address for asking carrying is LBA3 '.Wherein, LBA3 ' has been mapped into the preceding n+1-m page of the 2nd physical block in Vd2, i.e.,
The page 0 that LBA3 ' is mapped to the 2nd physical block in Vd2 arrives page n-m.ROW mechanism based on SSD, SSD take the second random write request
- 2 physical blocks of reserved space X in the data write-in Vd2 of band, establish the page of physical block n+1-m of X -2 in LBA3 ' and Vd2
Mapping, that is, the mapping of the page m to page n of -2 physical blocks of X in LBA3 ' and Vd2 is established, by page 0 in the 2nd physical block in Vd2
Data Identification into page n-m is junk data (mapping for releasing the preceding n+1-m page of the 2nd physical block in LBA3 ' and Vd2).
As shown in figure 8, determination needs to recycle when reserved space is less than the starting garbage space recycling of certain threshold value in Vd2
Physical block be Vd2 in the 1st physical block and the 2nd physical block.Wherein, page m to page n stores valid data in the 1st physical block, needs
It carries out valid data to move, in the embodiment of the present invention, page m in the 1st physical block to the valid data that page n is stored is moved
Page 0 establishes in LBA4 ' and Vd2 in -1 physical block of X page 0 to the mapping of page m-1 to page n-m in -1 physical block of X in Vd2;Together
When, by page m to page n stores the effective data-moving page m to page n in -1 physical block of X into Vd2 in the 2nd physical block in Vd2, build
Stand the mapping of page m to page n in -1 physical block of X in LBA2 ' and Vd2.SSD is wiped in Vd2 in the 1st physical block and the 2nd physical block
Data, using the 1st physical block and the 2nd physical block as reserved space.
In the embodiment of the present invention, Vd1 is used for the data that storage order write request carries, and Vd2 is for storing random write request
The data of carrying, by the feature according to write request, the data of the data that sequence write request is carried and the carrying of random write request
It is respectively stored into different storage regions, reduces valid data in garbage space removal process and moves, reduce and write amplification.
The embodiment of the present invention, by distributing more reserved spaces for Vd2, i.e. the reserved space of Vd2 is reserved greater than Vd1
Space, it is possible to reduce garbage space recovered frequency, to reduce the erasing times of physical block in Vd2, extend SSD uses the longevity
Life.Another kind realizes that the ratio of the data space of the reserved space and Vd2 of Vd2 is greater than the reserved space of Vd1 and the data of Vd1
The ratio in space, the same achievable embodiment of the present invention reduce the effect of garbage space recovered frequency.
In the embodiment of the present invention, SSD includes Vd1 and Vd2, and Vd1 is used for the data that storage order write request carries, and Vd2 is used
In the data for storing random write request carrying.Under random write request and the simultaneous situation of sequence write request, it will not influence
The performance of sequence write request, while improving SSD random write performance.
Optionally, when corresponding storage region is written, for example, when above-mentioned first or second storage region, if right
It answers the reserved space of memory space inadequate, can dynamically be adjusted, such as in the unspent premise of maximum redundancy quota
It can apply for additional reserved space down, then the data in write request are written to the reserved space newly applied.
Optionally, in the case where multiple write requests are concurrent, when the received write request of SSD have sequence write request again and have with
When machine write request, the first storage region is written in the data that can preferentially carry sequence write request, to improve write performance.
The embodiment of the invention provides another implementations that step 2 judges the feature of write request:
SSD counts the counting of the sequence write request on the LBA that write request carries and the counting of random write request.The present invention is real
Example is applied, the sequence write request that the counting for the sequence write request on LBA that write request carries is also known as write request counts, and write request is taken
The random write request that the counting of random write request on the LBA of band is also known as write request counts.
For example, when SSD judge carrying LBA m write request for sequence write request, then the counting of the sequence write request of LBA m
Cs adds 1, and when judging the write request for carrying LBA m for random write request, then the counting Cr of the random write request of LBA m adds 1.It calculates
(the counting Cs and current LBA m's of the sequence write request of current LBA m is random by the counting Cs/ of the sequence write request of current LBA m
The sum of counting Cr of write request) value S (sequence degree), if S meets first condition shown in Fig. 2 (the first sequence degree range),
Vd1 is written in the data that then write request is carried;When S meets second condition shown in Fig. 2 (the second sequence degree range), be then written
Vd2.For example, the first sequence degree range is greater than 0.8 and no more than 1, the second sequence degree range is no more than 0.8.It is deposited in Vd1
The sequence degree of the corresponding write request of the data of storage is greater than the sequence degree of the corresponding write request of data stored in Vd2, in rubbish sky
Between in removal process, the physical block in the physical block ratio Vd2 in Vd1 generates less valid data and moves, and reduces to write and put
Greatly.
The sequence degree of the corresponding write request of the data stored in Vd1 is greater than the corresponding write request of data stored in Vd2
Sequence degree, SSD are reserved space and data space in reserved space or Vd1 of the reserved space less than Vd2 of Vd1 distribution
Ratio is less than the ratio of reserved space and data space in Vd2.The implementation reduces the number of garbage space recycling in Vd2,
To reduce the erasing times of physical block in Vd2, to extend SSD service life.Further, according to different sequence degree
Write request is write to different regions respectively, will not influence the high write request of sequence degree, while also improving SSD random write
Energy.
It optionally,, can when the received write request of SSD has different sequences to spend in the case where multiple write requests are concurrent
It, can priority processing degree of randomness when the high write request of prioritization degree or the received write request of SSD have different degree of randomness
Low write request, to improve write performance.
Another implementation can also be based on degree of randomness R.When SSD judges that the write request for carrying LBA m is asked for sequential write
Ask, then the counting Cs of the sequence write request of LBA m adds 1, when judge the write request for carrying LBA m for random write request, then LBA m
The counting Cr of random write request add 1.Calculate the counting Cr/ (sequential write of current LBA m of the random write request of current LBA m
Request counting Cs and current LBA m the sum of the counting Cr of random write request) value R (degree of randomness).If R meets Fig. 2 institute
Vd1 is written in the first condition (the first degree of randomness range) shown, the then data carried the write request;When R meets shown in Fig. 2
Two conditions (the second degree of randomness range), then be written Vd2.For example, the first degree of randomness range is no more than 0.2, second degree of randomness model
It encloses for greater than 0.2 but no more than 1.The degree of randomness of the corresponding write request of the data stored in Vd1 is less than the data pair stored in Vd2
The degree of randomness for the write request answered, in garbage space removal process, the physical block in the physical block ratio Vd2 in Vd1 is generated more
Few valid data are moved, and are reduced and are write amplification.
The degree of randomness of the corresponding write request of the data stored in Vd1 is less than the corresponding write request of data stored in Vd2
Degree of randomness, SSD are reserved space and data space in reserved space or Vd1 of the reserved space less than Vd2 of Vd1 distribution
Ratio is less than the ratio of reserved space and data space in Vd2.The implementation reduces the number of garbage space recycling in Vd2,
To reduce the erasing times of physical block in Vd2, to extend SSD service life.Further, according to different degree of randomness
Write request is write to different regions respectively, will not influence the low write request of degree of randomness, while also improving SSD random write
Energy.
Optionally, the storage region of respective numbers can be divided according to the sequence degree of write request or the number of degrees of degree of randomness,
And corresponding reserved space is configured according to the value of each grade of the sequence degree or degree of randomness.The division and correspondence of storage region
The configuration of reserved space can carry out in advance, dynamically can also be divided and be configured in use.
The embodiment of the invention provides another implementations that step 2 judges the feature of write request: judging that write request is taken
The size of the size of the data of band, the data carried according to write request determines storage region.
As shown in figure 9, SSD includes 9 storage regions, it is denoted as Vd1, Vd2 ... Vd9.In the embodiment of the present invention, a kind of realization
Mode, each storage region include R physical block, each physical block includes n+1 page, and another kind is realized, each storage
The physics number of blocks for including in region can also be different, and the embodiment of the present invention is not construed as limiting this.The number that SSD is carried according to write request
According to size, select storage region.Wherein, Vd1 be used for store (0-4KB] data, Vd2 be used for store (4KB-8KB] number
Be used to store according to, Vd3 (8KB-16KB] data, Vd4 be used to store (16KB-32KB] data, Vd5 is for storing (32KB-
64KB] data, Vd6 be used for store (64KB-128KB] data, Vd7 be used for store (128KB-256KB] data, Vd8
For store (256KB-512KB] data, Vd9 be used for store be greater than 512KB data.Wherein, (4KB-8KB] data
The data of referred to as one data interval.Data interval refers to the area of the size for the data that the write request of storage region storage carries
Between.The data interval of Vd1 indicates that the size for the data that the write request of Vd1 storage carries is no more than 4KB.It writes and asks when SSD reception
It asks, according to the data interval that each storage region stores, determines the storage region of the data for storing write request carrying.Such as to scheme
For second storage region shown in 2 is Vd1, since the data interval of Vd1 is no more than 4KB (second condition shown in Fig. 2)
Data, the data that multiple write requests carry therefore, in the same physical block can be stored, when part of data are due to being modified
It is identified as invalid data, when carrying out garbage space recycling to physical block, what other write requests stored in the physical block carried
Data need to carry out valid data and move as valid data, so as to cause amplification is write.It is deposited with Vd9 for as shown in Figure 2 first
For storage area domain, since the data interval of Vd9 is the data greater than 512KB (first condition shown in Fig. 2), same
The data that same or a small amount of several write requests carry are stored in physical block.Therefore, when SSD is received again in the physical block
When the write request of the modification of data, the data of the page storage in entire physical block can be identified as junk data, to physical block
When carrying out garbage space recycling, due to being wholly or largely junk data in entire physical block, no longer generates or only produce
Raw a small amount of valid data are moved, so that will not cause or cause very little writes amplification.Therefore, SSD is divided into different memory blocks
Domain, each storage region store between a corresponding data storage area, it is possible to reduce and valid data are moved in garbage collection procedure,
Amplification is write in reduction.Optionally, the size for the data that write request carries determines corresponding storage region, stores the data field of small data
Between the opposite storage big data of corresponding storage region the corresponding storage region of data interval distribute more reserved spaces or
The ratio of the reserved space and data space that store the corresponding storage region of data interval of small data is greater than storage big data
The reserved space of the corresponding storage region of data interval and the ratio of data space, it is possible to reduce garbage space recovered frequency, object
The number that reason block is wiped free of, extends SSD service life.
Optionally, in the case where multiple write requests are concurrent, when the write request of the received different size of data of carrying of SSD
When, can priority processing carry the biggish write request of data, to improve write performance.
In the embodiment of the present invention, SSD is reserved in reserved space or Vd1 of the reserved space less than Vd2 of Vd1 distribution
The ratio of space and data space is less than the ratio of reserved space and data space in Vd2, and specific implementation can be according to Vd1 and Vd2
In corresponding write request feature, determine different reserved space share weights, for Vd1 distribution reserved space less than Vd2
The ratio of reserved space and data space is less than the ratio of reserved space and data space in Vd2 in reserved space or Vd1.
The embodiment of the present invention is not construed as limiting this.
In the embodiment of the present invention, after the data write-in page that write request is carried, the mapping established between LBA and page is closed
System can also first establish the mapping of the physical block where LBA to the page of write-in data, specific implementation according to the specific implementation of SSD
The mapping mechanism of SSD is referred to, this is not limited by the present invention, and repeats no more.
The present invention is also applied to stacked tile type magnetic recording (Shingled Magnetic Recording, SMR) disk.By
In the special construction of SMR disk, when a certain magnetic track A is written, the data after magnetic track A on L magnetic track, the magnetic can be covered
The data of magnetic track before road A will not be capped.Therefore a magnetic track of M (M >=L) is generally formed a domain (zone) by SMR disk,
Data in zone in physical space are sequentially written in, and valid data in zone are first moved before write-in.SMR disk generally uses
Physical storage space is divided into data zone (the zone of storing data) and reserved zone (idle zone) by ROW mechanism,
And record the mapping of logical address to amount of physical memory;When writing data, data are sequentially written in the reserved space zone, then will patrol
Volume address of cache arrives the physical address being newly written, and is rubbish by the data markers stored in physical address that logical address mapped originally
Rubbish data;Reserved zone number lower than after certain threshold value, find the most zone of junk data, remove by starting garbage space recycling
Valid data in the zone are moved, which becomes reserved zone, can continue to write to data.In zone and SSD in SMR disk
The characteristic of physical block is similar, and therefore, the scheme that SSD reduces that valid data are moved in junk data in the embodiment of the present invention equally may be used
To be applied in SMR disk, SMR disk is divided into different storage regions, multiple zone (including data are included in each storage region
Zone and reserved zone), different size of reserved zone is distributed for different storage regions, judges the feature of write request, such as
Judge that write request is random write request or sequence write request, perhaps judge the sequence degree of write request or judge write request with
Machine degree, or judge the size for the data that write request carries, the data storage that write request is carried to specific storage region
Reserved zone, so that valid data are moved when reducing the recycling of SMR disk garbage space, amplification is write in reduction.Specific implementation can be found in
The implementation of SSD, details are not described herein for the embodiment of the present invention.The different storage region of SMR disk can distribute the side of reserved zone
Formula please refers to the mode of aforementioned SSD different storage zone distribution reserved space.
In addition, being recycled based on ROW mechanism with garbage space in the storage array of function, such as pure SSD storage array and firmly
In disk (HDD) storage array, storage array controllers are divided the logical block address of each hard disk by certain unit (such as 1MB)
For block;Each disk takes a block composition to meet certain condition (for example, independent hard disk redundancy array (Redundant from N number of disk
Array of Independent Disks, RAID) band (segment), for example, composition RAID6 (including 3 data blocks+
2 check blocks);Write performance is improved using sequence WriteMode in segment, the data in segment, which cannot cover, to be write, before write-in
First valid data in segment to be moved.Memory space is divided into data segment and (had been written by storage array controllers
The segment of data) and reserved segment (idle segment), the mapping of record logical address to amount of physical memory.
When writing data, data are sequentially written in reserved segment by storage array controllers, then logical address is mapped to the object being newly written
Address is managed, is junk data by the data markers stored in physical address that the logical address mapped originally;Reserved segment number
After mesh is lower than certain threshold value, the most segment of junk data is found in starting garbage space recycling, will be effective in the segment
Data block is moved, which becomes reserved segment, can continue to write to data.
In above-mentioned storage array, segment is similar with the characteristic of the physical block in SSD, therefore, in the embodiment of the present invention
SSD reduces the scheme that garbage space recycling valid data are moved and is equally applicable to above-mentioned storage array, by storage array point
At different storage regions, include in each storage region multiple segment (data segment and reserved segment), judgement
The feature of write request, such as judge that write request is random write request or sequence write request, or judge the sequence degree of write request, or
Person judges the degree of randomness of write request, or judges the size for the data that write request carries, and the data storage that write request carries is arrived
The reserved segment of specific storage region is reduced so that valid data are moved when reducing the recycling of storage array garbage space
Write amplification.Specific implementation can be found in the implementation of SSD, and details are not described herein for the embodiment of the present invention.Storage array is different to be deposited
The mode that storage area domain can distribute reserved segment please refers to the mode of aforementioned SSD different storage zone distribution reserved space.
The embodiment of the present invention is also applied to other and is formed using flash media and the storage medium with similar characteristic
Product on.
Optionally, in the embodiment of the present invention, by taking SSD as an example, SSD may include more than two storage regions.Further
Ground, the mode of the feature of a variety of judgement write requests can be used in SSD, for example, SSD includes the first storage region and the second memory block
Domain judges write request for sequence write request or random write request, when write request is sequence write request, the number that write request is carried
According to the first storage region is written, when write request is random write request, the second storage region is written in the data that write request is carried;
SSD further includes third storage region and the 4th storage region, the sequence degree or degree of randomness of write request is judged, according to the suitable of write request
Sequence degree or degree of randomness, the data write-in third storage region that write request is carried or the 4th storage region;Optionally, SSD is also wrapped
The 5th storage region and the 6th storage region are included, judges the size for the data that write request carries, the data carried according to write request
Size, the 5th storage region or the 6th storage region is written in the data that write request is carried.The combination sheet of specific implementation
Invention is not construed as limiting.
The embodiment of the invention provides a kind of storage equipment, as shown in Figure 10, store comprising storage control 1001, first
Region 1002 and the second storage region 1003;First storage region 1002 includes data space and reserved space, the second memory block
Domain 1003 includes data space and reserved space.Storage control 1001 is for executing the embodiment of the present invention shown in Fig. 2.Specifically
Ground, storage control 1001 receive write request, and the write request carries logical address and data, judges the spy of the write request
Sign, when the feature of write request meets first condition, the reserved of the first storage region 1002 is written in the data that write request is carried
First storage address in space;Establish the mapping relations of logical address Yu the first storage address;When the feature of write request meets the
When two conditions, the second storage address of the reserved space of the second storage region 1003 is written in the data that write request is carried;It establishes
The mapping relations of logical address and the second storage address.Optionally, storage equipment shown in Fig. 10 can be SSD, then store control
Device 1001 processed is the controller of SSD.Optionally, storage equipment shown in Fig. 10 can also be SMR disk, then storage control 1001
For the controller of SMR disk.Optionally, storage equipment shown in Fig. 10 can also be to store battle array described in the embodiment of the present invention
Column, then storage control 1001 is the array control unit of storage array, and specific descriptions refer to corresponding portion of the embodiment of the present invention
Description, details are not described herein.Optionally, in the case where multiple write requests are concurrent, storage equipment priority processing meets first
The write request of part, to improve the write performance of storage equipment.Optionally, when corresponding storage region is written, for example, above-mentioned
One or when the second storage region, if the reserved space of corresponding memory space is inadequate, can dynamically be adjusted, such as most
It can apply for additional reserved space under the premise of big redundancy quota is unspent, then by the new application of data write-in in write request
Reserved space.
The storage equipment of the embodiment of the present invention can also be situated between for other using flash media and the storage with similar characteristic
The product of matter composition.
The embodiment of the invention provides another kinds to store equipment, includes storage control, the first memory block as shown in figure 11
Domain 1105 and the second storage region 1106;Wherein storage control includes receiving unit 1101, judging unit 1102, writing unit
1103 and map unit 1104.Receiving unit 1101, for receiving write request;Write request carries logical address and data;Judgement
Unit 1102, for judging the feature of write request;Writing unit 1103, for when the feature of write request meets first condition,
The first storage address of the reserved space of the first storage region 1105 is written in the data that write request is carried;Map unit 1104,
For establishing the mapping relations of logical address Yu first storage address;Writing unit 1103 is also used to the feature when write request
When meeting second condition, the second storage ground of the reserved space of the second storage region 1106 is written in the data that write request is carried
Location;Map unit 1104 is also used to establish the mapping relations of logical address Yu the second storage address.Optionally, it is deposited shown in Figure 11
Equipment is stored up, storage control independently can carry out garbage space to the first storage region 1105 and the second storage region 1106 and return
It receives.Optionally, the size of the reserved space of the size of the reserved space of the first storage region 1105 and the second storage region 1106
It is different.Optionally, reserved space of the reserved space of the first storage region 1105 less than the second storage region 1106, the first storage
Size of the size of the reserved space in region 1105 less than the reserved space of the second storage region 1106.Optionally, the first storage
The reserved space and data space of the ratio of the reserved space in region 1105 and data space less than the second storage region 1106
Ratio.Optionally, the judging unit 1102 is specifically used for judging that write request is sequence write request or random write request;Then
One condition is sequence write request, and the second condition is random write request.Optionally, judging unit 1102 is specifically used for judging institute
State the sequence degree of write request, then first condition is the first sequence degree range, and second condition is the second sequence degree range, and first
The minimum value of sequence degree range is greater than the maximum value of the second sequence degree range, and the meaning about sequence degree is shown in Figure 2
Description in embodiment.Optionally, judging unit 1102 is specifically used for judging the degree of randomness of the write request, then first condition is
First degree of randomness range, second condition is the second degree of randomness range, and the maximum value of the first degree of randomness range is less than described the
The minimum value of two degree of randomness ranges, the description in meaning about degree of randomness embodiment shown in Figure 2.Optionally, sentence
Disconnected unit 1102 is specifically used for the size for the data for judging that write request carries, then first condition is the storage of the first storage region 1105
The first data interval, second condition be the second storage region 1106 storage the second data interval;And the first data interval
Minimum value be greater than the maximum value of the second data interval, in meaning about data interval embodiment shown in Figure 2
Description.Optionally, in the case where multiple write requests are concurrent, storage equipment priority processing meets the write request of first condition, with
Improve the write performance of storage equipment.Optionally, when corresponding storage region is written, for example, the above-mentioned first or second stores
When region, if the reserved space of corresponding memory space is inadequate, can dynamically it be adjusted, for example do not have in maximum redundancy quota
Additional reserved space can be applied for by having under the premise of being finished, then the data in write request are written to the reserved space newly applied.
Storage equipment as shown in figure 11 can be the storage array in SSD, SMR disk or the embodiment of the present invention, such as Figure 11
Shown in store equipment, can also for other using flash media and with similar characteristic storage medium composition product, tool
Body description refers to the description of corresponding portion of the embodiment of the present invention, and details are not described herein.
Storage equipment as shown in figure 11, a kind of implementation are that storage equipment is installed and is described unit, and said units can
It is loaded into the memory in the storage control of storage equipment, the instruction in memory is executed by the CPU in storage control, it is real
Function in existing corresponding embodiment of the invention;Another kind realizes that storing the unit for including in equipment can be realized by hardware,
Or it is realized by software and hardware combinations.Said units are also referred to as structural unit.
The embodiment of the present invention additionally provides non-volatile computer readable storage medium storing program for executing and computer program product, works as figure
Memory loading non-volatile computer readable storage medium and the calculating of the storage control of equipment are stored shown in 10 and Figure 11
The computer instruction for including in machine program product, CPU execute the computer instruction loaded in memory, to realize each reality of the present invention
Corresponding function in applying.
According to above-described embodiment, the embodiment of the invention provides the storage region division methods of storage equipment, store equipment
Memory space is divided into the first storage region and the second storage region, the first storage region includes data space and leaves a blank in advance
Between, the second storage region includes data space and reserved space;Wherein the reserved space of the first storage region is for storing first
The data that write request carries;The reserved space of second storage region is used to store the data of the second write request carrying;First writes and asks
The feature asked meets first condition;Second write request meets second condition.Specifically, first condition, second condition, first, which are write, asks
The description of the feature of the feature and the second write request asked embodiment shown in Figure 2, details are not described herein.First storage region
Reserved space and the second storage region reserved space relationship also embodiment shown in Figure 2 description.The present invention is real
The structure for applying storage equipment in example can refer to shown in Figure 10, and details are not described herein.It optionally, can be according to the sequence degree of write request
Or the number of degrees of degree of randomness divides the storage region of respective numbers, and the value of each grade according to the sequence degree or degree of randomness
Configure corresponding reserved space.The division of storage region and the configuration of corresponding reserved space can carry out in advance, can also be with
It is dynamically divided and is configured in use.
In several embodiments provided by the present invention, it should be understood that disclosed device, method can pass through it
Its mode is realized.For example, the division of unit described in Installation practice described above, only a kind of logic function is drawn
Point, there may be another division manner in actual implementation, such as multiple units or components may be combined or can be integrated into separately
One system, or some features can be ignored or not executed.Another point, shown or discussed mutual coupling or straight
Connecing coupling or communication connection can be through some interfaces, and the indirect coupling or communication connection of device or unit can be electrical property,
Mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
Claims (18)
1. a kind of method for storing equipment storing data, which is characterized in that the storage equipment includes the first storage region and the
Two storage regions;First storage region includes data space and reserved space, and second storage region includes data sky
Between and reserved space, which comprises
The storage equipment receives write request;The write request carries logical address and data;
The storage equipment judges the feature of the write request;
When the feature of the write request meets first condition, the data write-in that storage equipment carries the write request described the
First storage address of the reserved space of one storage region;
The storage equipment establishes the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
The storage equipment establishes the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence write request or random write request;
Then the first condition is sequence write request, and the second condition is random write request.
2. the method according to claim 1, wherein the reserved space of first storage region is less than described the
The reserved space of two storage regions.
3. the method according to claim 1, wherein the reserved space and data space of first storage region
Ratio be less than second storage region reserved space and data space ratio.
4. a kind of method for storing equipment storing data, which is characterized in that the storage equipment includes the first storage region and the
Two storage regions;First storage region includes data space and reserved space, and second storage region includes data sky
Between and reserved space, which comprises
The storage equipment receives write request;The write request carries logical address and data;
The storage equipment judges the feature of the write request;
When the feature of the write request meets first condition, the data write-in that storage equipment carries the write request described the
First storage address of the reserved space of one storage region;
The storage equipment establishes the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
The storage equipment establishes the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence degree;
Then the first condition is the first sequence degree range;The second condition is the second sequence degree range;And described first
The minimum value of sequence degree range is greater than the maximum value of the second sequence degree range.
5. a kind of method for storing equipment storing data, which is characterized in that the storage equipment includes the first storage region and the
Two storage regions;First storage region includes data space and reserved space, and second storage region includes data sky
Between and reserved space, which comprises
The storage equipment receives write request;The write request carries logical address and data;
The storage equipment judges the feature of the write request;
When the feature of the write request meets first condition, the data write-in that storage equipment carries the write request described the
First storage address of the reserved space of one storage region;
The storage equipment establishes the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
The storage equipment establishes the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes degree of randomness;
Then the first condition is the first degree of randomness range;The second condition is the second degree of randomness range;And described first
The maximum value of degree of randomness range is less than the minimum value of the second degree of randomness range.
6. a kind of method for storing equipment storing data, which is characterized in that the storage equipment includes the first storage region and the
Two storage regions;First storage region includes data space and reserved space, and second storage region includes data sky
Between and reserved space, which comprises
The storage equipment receives write request;The write request carries logical address and data;
The storage equipment judges the feature of the write request;
When the feature of the write request meets first condition, the data write-in that storage equipment carries the write request described the
First storage address of the reserved space of one storage region;
The storage equipment establishes the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
The storage equipment establishes the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes the size for the data that the write request carries;
Then the first condition is the first data interval of first storage region storage;The second condition is described second
Second data interval of storage region storage;And the minimum value of first data interval is greater than second data interval
Maximum value.
7. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space, institute
Stating storage control includes:
Receiving unit, for receiving write request;The write request carries logical address and data;
Judging unit, for judging the feature of the write request;
Writing unit, the data for when the feature of the write request meets first condition, the write request to be carried are written
First storage address of the reserved space of first storage region;
Map unit, for establishing the mapping relations of the logical address Yu first storage address;
Said write unit is also used to the data for carrying the write request when the feature of the write request meets second condition
The second storage address of the reserved space of second storage region is written;
The map unit is also used to establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence write request or random write request;
Then the first condition is sequence write request, and the second condition is random write request.
8. storage equipment according to claim 7, which is characterized in that the reserved space of first storage region is less than institute
State the reserved space of the second storage region.
9. storage equipment according to claim 7, which is characterized in that the reserved space and data of first storage region
The ratio in space is less than the reserved space of second storage region and the ratio of data space.
10. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space, institute
Stating storage control includes:
Receiving unit, for receiving write request;The write request carries logical address and data;
Judging unit, for judging the feature of the write request;
Writing unit, the data for when the feature of the write request meets first condition, the write request to be carried are written
First storage address of the reserved space of first storage region;
Map unit, for establishing the mapping relations of the logical address Yu first storage address;
Said write unit is also used to the data for carrying the write request when the feature of the write request meets second condition
The second storage address of the reserved space of second storage region is written;
The map unit is also used to establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence degree;
Then the first condition is the first sequence degree range;The second condition is the second sequence degree range;And described first
The minimum value of sequence degree range is greater than the maximum value of the second sequence degree range.
11. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space, institute
Stating storage control includes:
Receiving unit, for receiving write request;The write request carries logical address and data;
Judging unit, for judging the feature of the write request;
Writing unit, the data for when the feature of the write request meets first condition, the write request to be carried are written
First storage address of the reserved space of first storage region;
Map unit, for establishing the mapping relations of the logical address Yu first storage address;
Said write unit is also used to the data for carrying the write request when the feature of the write request meets second condition
The second storage address of the reserved space of second storage region is written;
The map unit is also used to establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes degree of randomness;
Then the first condition is the first degree of randomness range;The second condition is the second degree of randomness range;And described first
The maximum value of degree of randomness range is less than the minimum value of the second degree of randomness range.
12. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space, institute
Stating storage control includes:
Receiving unit, for receiving write request;The write request carries logical address and data;
Judging unit, for judging the feature of the write request;
Writing unit, the data for when the feature of the write request meets first condition, the write request to be carried are written
First storage address of the reserved space of first storage region;
Map unit, for establishing the mapping relations of the logical address Yu first storage address;
Said write unit is also used to the data for carrying the write request when the feature of the write request meets second condition
The second storage address of the reserved space of second storage region is written;
The map unit is also used to establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes the size for the data that the write request carries;
Then the first condition is the first data interval of first storage region storage;The second condition is described second
Second data interval of storage region storage;And the minimum value of first data interval is greater than second data interval
Maximum value.
13. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space,
The storage control, is used for:
Receive write request;The write request carries logical address and data;
Judge the feature of the write request;
When the feature of the write request meets first condition, first memory block is written in the data that the write request is carried
First storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence write request or random write request;
Then the first condition is sequence write request, and the second condition is random write request.
14. storage equipment according to claim 13, which is characterized in that the reserved space of first storage region is less than
The reserved space of second storage region.
15. storage equipment according to claim 13, which is characterized in that the reserved space and number of first storage region
It is less than the reserved space of second storage region and the ratio of data space according to the ratio in space.
16. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space,
The storage control, is used for:
Receive write request;The write request carries logical address and data;
Judge the feature of the write request;
When the feature of the write request meets first condition, first memory block is written in the data that the write request is carried
First storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes sequence degree;
Then the first condition is the first sequence degree range;The second condition is the second sequence degree range;And described first
The minimum value of sequence degree range is greater than the maximum value of the second sequence degree range.
17. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space,
The storage control, is used for:
Receive write request;The write request carries logical address and data;
Judge the feature of the write request;
When the feature of the write request meets first condition, first memory block is written in the data that the write request is carried
First storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes degree of randomness;
Then the first condition is the first degree of randomness range;The second condition is the second degree of randomness range;And described first
The maximum value of degree of randomness range is less than the minimum value of the second degree of randomness range.
18. a kind of storage equipment, which is characterized in that including storage control, the first storage region and the second storage region;It is described
First storage region includes data space and reserved space, and second storage region includes data space and reserved space,
The storage control, is used for:
Receive write request;The write request carries logical address and data;
Judge the feature of the write request;
When the feature of the write request meets first condition, first memory block is written in the data that the write request is carried
First storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu first storage address;
When the feature of the write request meets second condition, second memory block is written in the data that the write request is carried
Second storage address of the reserved space in domain;
Establish the mapping relations of the logical address Yu second storage address;
Wherein, the feature of the write request includes the size for the data that the write request carries;
Then the first condition is the first data interval of first storage region storage;The second condition is described second
Second data interval of storage region storage;And the minimum value of first data interval is greater than second data interval
Maximum value.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811586092.0A CN109656486B (en) | 2015-11-27 | 2015-11-27 | Configuration method of solid state disk, data storage method, solid state disk and storage controller |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2015/095846 WO2017088185A1 (en) | 2015-11-27 | 2015-11-27 | Method for storage device storing data and storage device |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811586092.0A Division CN109656486B (en) | 2015-11-27 | 2015-11-27 | Configuration method of solid state disk, data storage method, solid state disk and storage controller |
Publications (2)
Publication Number | Publication Date |
---|---|
CN107003809A CN107003809A (en) | 2017-08-01 |
CN107003809B true CN107003809B (en) | 2019-01-18 |
Family
ID=58746365
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811586092.0A Active CN109656486B (en) | 2015-11-27 | 2015-11-27 | Configuration method of solid state disk, data storage method, solid state disk and storage controller |
CN201580002559.0A Active CN107003809B (en) | 2015-11-27 | 2015-11-27 | A kind of method and storage equipment of storage equipment storing data |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811586092.0A Active CN109656486B (en) | 2015-11-27 | 2015-11-27 | Configuration method of solid state disk, data storage method, solid state disk and storage controller |
Country Status (13)
Country | Link |
---|---|
US (1) | US20180232314A1 (en) |
EP (2) | EP3220255A4 (en) |
JP (1) | JP6311195B2 (en) |
KR (4) | KR102170539B1 (en) |
CN (2) | CN109656486B (en) |
AU (2) | AU2015383834B2 (en) |
BR (1) | BR112016021172B1 (en) |
CA (1) | CA2942443C (en) |
MX (1) | MX363170B (en) |
RU (1) | RU2642349C1 (en) |
SG (1) | SG11201607335XA (en) |
WO (1) | WO2017088185A1 (en) |
ZA (1) | ZA201704018B (en) |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110554970A (en) * | 2018-05-31 | 2019-12-10 | 北京忆恒创源科技有限公司 | garbage recovery method capable of remarkably reducing write amplification and storage device |
KR20190128392A (en) * | 2018-05-08 | 2019-11-18 | 에스케이하이닉스 주식회사 | Memory system and operation method thereof |
CN112352216B (en) * | 2018-06-30 | 2022-06-14 | 华为技术有限公司 | Data storage method and data storage device |
KR102593757B1 (en) * | 2018-09-10 | 2023-10-26 | 에스케이하이닉스 주식회사 | Memory system and operating method thereof |
TWI709042B (en) * | 2018-11-08 | 2020-11-01 | 慧榮科技股份有限公司 | Method and apparatus for performing mapping information management regarding redundant array of independent disks, and associated storage system |
CN109376095B (en) * | 2018-12-04 | 2023-06-13 | 中国航空工业集团公司西安航空计算技术研究所 | Garbage recycling method based on FLASH region address mapping mechanism |
CN111949560B (en) * | 2019-05-16 | 2024-01-23 | 兆易创新科技集团股份有限公司 | Data writing method and device and storage equipment |
KR20200132495A (en) * | 2019-05-17 | 2020-11-25 | 에스케이하이닉스 주식회사 | Memory system, controller and operation method of the controller |
CN114237489B (en) * | 2020-09-09 | 2024-04-05 | 浙江宇视科技有限公司 | Method and device for writing logic resources into SMR disk, electronic equipment and storage medium |
CN112214175A (en) * | 2020-10-21 | 2021-01-12 | 重庆紫光华山智安科技有限公司 | Data processing method, data processing device, data node and storage medium |
WO2022240318A1 (en) * | 2021-05-13 | 2022-11-17 | Общество с ограниченной ответственностью "РЭЙДИКС" | Method for managing a data storage system and data storage system |
CN113342272B (en) * | 2021-06-07 | 2023-02-10 | 深圳数联天下智能科技有限公司 | Sitting posture data storage method, sitting posture data display method, intelligent cushion and system |
CN113608702A (en) * | 2021-08-18 | 2021-11-05 | 合肥大唐存储科技有限公司 | Method and device for realizing data processing, computer storage medium and terminal |
CN114415981B (en) * | 2022-03-30 | 2022-07-15 | 苏州浪潮智能科技有限公司 | IO processing method and system of multi-control storage system and related components |
CN114741327B (en) * | 2022-04-22 | 2024-04-19 | 中科驭数(北京)科技有限公司 | Garbage recycling method and device |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102023810A (en) * | 2009-09-10 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Method and device for writing data and redundant array of inexpensive disk |
CN102541760A (en) * | 2012-01-04 | 2012-07-04 | 记忆科技(深圳)有限公司 | Computer system based on solid-state hard disk |
Family Cites Families (30)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3585091B2 (en) * | 1998-06-15 | 2004-11-04 | 富士通株式会社 | Storage device |
KR100704998B1 (en) * | 1999-02-26 | 2007-04-09 | 소니 가부시끼 가이샤 | Recording method, managing method and recording apparatus |
KR100771521B1 (en) * | 2006-10-30 | 2007-10-30 | 삼성전자주식회사 | Flash memory device having a multi-leveled cell and programming method thereof |
KR101515525B1 (en) * | 2008-10-02 | 2015-04-28 | 삼성전자주식회사 | Memory device and operating method of memory device |
KR100962186B1 (en) * | 2008-12-22 | 2010-06-10 | 한국과학기술원 | Ultra low power storage system and data management method thereof |
US8452940B2 (en) * | 2008-12-30 | 2013-05-28 | Sandisk Technologies Inc. | Optimized memory management for random and sequential data writing |
JP2010211618A (en) * | 2009-03-11 | 2010-09-24 | Toshiba Corp | Semiconductor storage device |
US8479080B1 (en) * | 2009-07-12 | 2013-07-02 | Apple Inc. | Adaptive over-provisioning in memory systems |
TWI407310B (en) * | 2009-10-09 | 2013-09-01 | Silicon Motion Inc | Data storage device and data access method |
US9753847B2 (en) * | 2009-10-27 | 2017-09-05 | Western Digital Technologies, Inc. | Non-volatile semiconductor memory segregating sequential, random, and system data to reduce garbage collection for page based mapping |
US8677054B1 (en) * | 2009-12-16 | 2014-03-18 | Apple Inc. | Memory management schemes for non-volatile memory devices |
KR101662827B1 (en) * | 2010-07-02 | 2016-10-06 | 삼성전자주식회사 | Memory system selecting write mode of data block and data write method thereof |
KR20140040137A (en) * | 2011-05-17 | 2014-04-02 | 샌디스크 테크놀로지스, 인코포레이티드 | Non-volatile memory and method with small logical groups distributed among active slc and mlc memory partitions |
WO2012161659A1 (en) * | 2011-05-24 | 2012-11-29 | Agency For Science, Technology And Research | A memory storage device, and a related zone-based block management and mapping method |
US8671241B2 (en) * | 2011-09-13 | 2014-03-11 | Dell Products Lp | Systems and methods for using reserved solid state nonvolatile memory storage capacity for system reduced power state |
KR20130030640A (en) * | 2011-09-19 | 2013-03-27 | 삼성전자주식회사 | Method of storing data to storage media, and data storage device including the same |
KR101889298B1 (en) * | 2011-11-08 | 2018-08-20 | 삼성전자주식회사 | Memory device including nonvolatile memory and controling method of nonvolatile memory |
JP6011153B2 (en) * | 2012-08-22 | 2016-10-19 | 富士通株式会社 | Storage system, storage control method, and storage control program |
US9495287B2 (en) * | 2012-09-26 | 2016-11-15 | International Business Machines Corporation | Solid state memory device logical and physical partitioning |
US9141532B2 (en) * | 2012-12-26 | 2015-09-22 | Western Digital Technologies, Inc. | Dynamic overprovisioning for data storage systems |
US9465731B2 (en) * | 2012-12-31 | 2016-10-11 | Sandisk Technologies Llc | Multi-layer non-volatile memory system having multiple partitions in a layer |
US9348746B2 (en) * | 2012-12-31 | 2016-05-24 | Sandisk Technologies | Method and system for managing block reclaim operations in a multi-layer memory |
JP2016506585A (en) * | 2013-01-08 | 2016-03-03 | ヴァイオリン メモリー インコーポレイテッド | Method and system for data storage |
US9098445B2 (en) * | 2013-03-14 | 2015-08-04 | Apple Inc. | Selection of redundant storage configuration based on available memory space |
TWI526830B (en) * | 2013-11-14 | 2016-03-21 | 群聯電子股份有限公司 | Data writing method, memory control circuit unit and memory storage apparatus |
US20150261444A1 (en) * | 2014-03-12 | 2015-09-17 | Kabushiki Kaisha Toshiba | Memory system and information processing device |
US9454551B2 (en) * | 2014-03-13 | 2016-09-27 | NXGN Data, Inc. | System and method for management of garbage collection operation in a solid state drive |
TWI519951B (en) * | 2014-11-03 | 2016-02-01 | 慧榮科技股份有限公司 | Data storage device and flash memory control method |
CN104317742B (en) * | 2014-11-17 | 2017-05-03 | 浪潮电子信息产业股份有限公司 | Automatic thin-provisioning method for optimizing space management |
US9910791B1 (en) * | 2015-06-30 | 2018-03-06 | EMC IP Holding Company LLC | Managing system-wide encryption keys for data storage systems |
-
2015
- 2015-11-27 KR KR1020197038048A patent/KR102170539B1/en active IP Right Grant
- 2015-11-27 JP JP2016560889A patent/JP6311195B2/en active Active
- 2015-11-27 KR KR1020167026409A patent/KR101871471B1/en active IP Right Grant
- 2015-11-27 EP EP15909096.8A patent/EP3220255A4/en not_active Ceased
- 2015-11-27 KR KR1020197008098A patent/KR102060736B1/en active IP Right Grant
- 2015-11-27 AU AU2015383834A patent/AU2015383834B2/en active Active
- 2015-11-27 CA CA2942443A patent/CA2942443C/en active Active
- 2015-11-27 BR BR112016021172-3A patent/BR112016021172B1/en active IP Right Grant
- 2015-11-27 RU RU2016141255A patent/RU2642349C1/en active
- 2015-11-27 WO PCT/CN2015/095846 patent/WO2017088185A1/en active Application Filing
- 2015-11-27 CN CN201811586092.0A patent/CN109656486B/en active Active
- 2015-11-27 CN CN201580002559.0A patent/CN107003809B/en active Active
- 2015-11-27 EP EP20156272.5A patent/EP3779663A1/en not_active Withdrawn
- 2015-11-27 MX MX2016013227A patent/MX363170B/en unknown
- 2015-11-27 SG SG11201607335XA patent/SG11201607335XA/en unknown
- 2015-11-27 KR KR1020187017375A patent/KR101962359B1/en active IP Right Grant
-
2017
- 2017-06-12 ZA ZA2017/04018A patent/ZA201704018B/en unknown
-
2018
- 2018-03-01 US US15/909,670 patent/US20180232314A1/en not_active Abandoned
- 2018-08-21 AU AU2018220027A patent/AU2018220027B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102023810A (en) * | 2009-09-10 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Method and device for writing data and redundant array of inexpensive disk |
CN102541760A (en) * | 2012-01-04 | 2012-07-04 | 记忆科技(深圳)有限公司 | Computer system based on solid-state hard disk |
Also Published As
Publication number | Publication date |
---|---|
KR20180072855A (en) | 2018-06-29 |
CN107003809A (en) | 2017-08-01 |
EP3220255A1 (en) | 2017-09-20 |
CA2942443A1 (en) | 2017-05-27 |
AU2018220027A1 (en) | 2018-09-06 |
AU2015383834B2 (en) | 2018-07-19 |
KR102170539B1 (en) | 2020-10-27 |
KR20190143502A (en) | 2019-12-30 |
KR20190031605A (en) | 2019-03-26 |
MX363170B (en) | 2019-03-13 |
JP2017538981A (en) | 2017-12-28 |
US20180232314A1 (en) | 2018-08-16 |
ZA201704018B (en) | 2019-04-24 |
CN109656486B (en) | 2022-07-12 |
EP3220255A4 (en) | 2018-03-07 |
SG11201607335XA (en) | 2017-07-28 |
KR101962359B1 (en) | 2019-03-26 |
AU2018220027B2 (en) | 2020-06-25 |
KR102060736B1 (en) | 2020-02-11 |
CN109656486A (en) | 2019-04-19 |
KR20170081133A (en) | 2017-07-11 |
EP3779663A1 (en) | 2021-02-17 |
BR112016021172A2 (en) | 2017-10-03 |
AU2015383834A1 (en) | 2017-06-15 |
KR101871471B1 (en) | 2018-08-02 |
MX2016013227A (en) | 2017-06-29 |
CA2942443C (en) | 2019-07-30 |
RU2642349C1 (en) | 2018-01-24 |
JP6311195B2 (en) | 2018-04-18 |
BR112016021172B1 (en) | 2022-12-06 |
WO2017088185A1 (en) | 2017-06-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107003809B (en) | A kind of method and storage equipment of storage equipment storing data | |
CN105589812B (en) | Disk fragments method for sorting, device and host | |
CN102511044B (en) | Method for deleting the data and device thereof | |
CN103052938B (en) | Data mover system and data migration method | |
CN103559138B (en) | Solid state hard disc and space management thereof | |
CN104866428B (en) | Data access method and data access device | |
CN103092766B (en) | A kind of loss equalizing implementation method for NAND FLASH | |
US10503424B2 (en) | Storage system | |
EP2562636A3 (en) | Storage controller and storage control method | |
CN102185929A (en) | Storage area network (SAN)-resource-based video monitoring data storage method and device | |
KR101017067B1 (en) | Locality-Aware Garbage Collection Technique for NAND Flash Memory-Based Storage Systems | |
CN108604165A (en) | Storage device | |
CN103399823A (en) | Method, equipment and system for storing service data | |
CN101604227A (en) | The method and apparatus of data storage | |
CN106980471B (en) | Method and device for improving hard disk writing performance of intelligent equipment | |
CN110990301A (en) | Sequential reading method of multi-plane storage medium and related device | |
CN108334457B (en) | IO processing method and device | |
CN109739688A (en) | Snapshot Resources space management, device, electronic equipment | |
CN107132996B (en) | Intelligent thin provisioning-based storage method, module and system | |
KR101874748B1 (en) | Hybrid storage and method for storing data in hybrid storage | |
CN113868149A (en) | Data storage method, device and equipment and readable storage medium | |
CN117280314A (en) | Memory controller and method for improving memory processing | |
CN114706532A (en) | Disk configuration method, device, server, electronic device and storage medium |
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 | ||
GR01 | Patent grant | ||
GR01 | Patent grant |