CN110321061A - Date storage method and device - Google Patents

Date storage method and device Download PDF

Info

Publication number
CN110321061A
CN110321061A CN201810279190.3A CN201810279190A CN110321061A CN 110321061 A CN110321061 A CN 110321061A CN 201810279190 A CN201810279190 A CN 201810279190A CN 110321061 A CN110321061 A CN 110321061A
Authority
CN
China
Prior art keywords
processor
data
storage device
written
data storage
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.)
Withdrawn
Application number
CN201810279190.3A
Other languages
Chinese (zh)
Inventor
邢冀鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Union Memory Information System Co Ltd
Original Assignee
Shenzhen Union Memory Information System Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Union Memory Information System Co Ltd filed Critical Shenzhen Union Memory Information System Co Ltd
Priority to CN201810279190.3A priority Critical patent/CN110321061A/en
Publication of CN110321061A publication Critical patent/CN110321061A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices

Abstract

This disclosure relates to a kind of date storage method and device, the unbalanced technical problem of processor load for solving data storage device.The described method includes: the data storage device receives the request of write-in data;The first processor at least two processors that the data storage device includes obtains the data write state parameter of the data storage device;The first processor determines the address that the data are written according to the data write state parameter;The corresponding memory space in the address is written in the data by the data storage device.

Description

Date storage method and device
Technical field
This disclosure relates to field of computer technology, and in particular, to a kind of date storage method and device.
Background technique
With the high speed development of data storage technology, such as SSD (Solid State Drives, solid state hard disk) etc. number According to storage device due to having the characteristics that read or write speed is fast, anti-vibration, low-power consumption, noiseless, low in calories and light weight, It is widely used in the fields such as military, vehicle-mounted, industrial, medical and aviation.
Currently, multiple processors can be configured for SSD to improve the read-write efficiency of data storage device (such as SSD), For example three or more processors can be configured.In the environment of multiprocessor, the method for salary distribution is usually respectively each place Reason device fifty-fifty distributes one or more storage units (such as computer flash memory device (NAND)), then multiple processing of SSD The NAND that device distributes each Self management of difference.
However, since there are bad blocks by NAND, and bad block is not equally distributed, therefore the NAND bad block having is more, has NAND bad block it is few, the load that this will to manage the more processor read-write of bad block is lower, manages the less processor of bad block The load of read-write is higher.As it can be seen that the processor load that the mode of existing management NAND may cause data storage device is uneven Weighing apparatus.
Summary of the invention
Purpose of this disclosure is to provide a kind of date storage method and devices, for solving the processor of data storage device The technical issues of load imbalance.
In a first aspect, providing a kind of date storage method, comprising:
The data storage device receives the request of write-in data;
First processor at least two processors that the data storage device includes obtains the data storage dress The data write state parameter set;
The first processor determines the address that the data are written according to the data write state parameter;
The corresponding memory space in the address is written in the data by the data storage device.
Optionally, at least two processor includes the first processor and at least one second processor, described First processor is connected with each processor at least one described second processor,
The data storage device receives the request for data to be written, comprising:
Target second processor at least one described second processor receives the request for the data to be written;
The target second processor is used to be written based on the received the request of the data, generates solicited message;
The target second processor sends the solicited message to the first processor, to request first processing Device obtains the data write state parameter of the data storage device.
Optionally, the ground that the data are written is determined according to the data write state parameter in the first processor After location, the method also includes:
The address is sent to the target second processor by the first processor.
Optionally, the first processor obtains the data write state parameter of the data storage device, comprising:
It is current that the first processor obtains each memory block in each storage unit that the data storage device includes Block programming time, the block erasing time, block read error rate and each storage unit bad block distribution situation in extremely Few one.
Optionally, the method also includes:
The first processor creates disk array RAID according to the data write state parameter of the data storage device Ribbon structure;Or,
The first processor is created according to the data write state parameter and history of the data storage device RAID stripe structure creates RAID stripe structure.
Optionally, the corresponding memory space in the address is written in the data by the data storage device, comprising:
The corresponding memory space in the address is written in the data by the first processor, or, at the target second It manages device and the corresponding memory space in the address is written into the data.
Second aspect provides a kind of data storage device, comprising:
At least one storage unit;
At least two processors, for receiving the request of write-in data;Pass through first at least two processor Processor obtains the data write state parameter of the data storage device;It is write by the first processor according to the data Enter state parameter, determines the address that the data are written;The data are written at least one described storage unit and are corresponded to The memory space of the address.
Optionally, at least two processor includes the first processor and at least one second processor, described First processor is connected with each processor at least one described second processor, at least one described second processor is used In:
It is received by the target second processor at least one described second processor for asking for the data to be written It asks;
It is used to be written the request of the data based on the received by the target second processor, generates solicited message;
The solicited message is sent to the first processor by the target second processor, to request described first Processor obtains the data write state parameter of the data storage device.
Optionally, at least two processor is also used to:
In the first processor according to the data write state parameter, determines and is written after the address of the data, The address is sent to the target second processor by the first processor.
Optionally, at least two processor is used for:
Each memory block in each storage unit that the data storage device includes is obtained by the first processor Current block programming time, the block erasing time, block read error rate and each storage unit bad block distribution situation in At least one.
Optionally, at least two processor is also used to:
By the first processor according to the data write state parameter of the data storage device, disk array is created RAID stripe structure;Or,
It is created by the first processor according to the data write state parameter and history of the data storage device RAID stripe structure, create RAID stripe structure.
Optionally, at least two processor is used for:
The corresponding memory space in the address is written into the data by the first processor, or, passing through the mesh It marks second processor and the corresponding memory space in the address is written into the data.
In the embodiment of the present disclosure, data storage device, can when receiving the request for being used to be written data of host sending The data write state parameter that data storage device is obtained with the first processor for including by data storage device, then according to number The address of write-in data is determined according to write state parameter, then storage corresponding to determining address is written into the data of request write-in Space.It is filled through the above technical solutions, can be stored separately through a processor (i.e. first processor) according to entire data The data write state parameter set determines the position to be write data into, since the data that can be of first processor management are deposited Whole storage units that storage device includes are avoided because distributing load imbalance caused by storage unit to different processor Problem improves the ability of data storage device storing data.
Other feature and advantage of the disclosure will the following detailed description will be given in the detailed implementation section.
Detailed description of the invention
Attached drawing is and to constitute part of specification for providing further understanding of the disclosure, with following tool Body embodiment is used to explain the disclosure together, but does not constitute the limitation to the disclosure.In the accompanying drawings:
Fig. 1 is the structural schematic diagram of data storage device in the embodiment of the present disclosure;
Fig. 2 is the flow chart of date storage method in the embodiment of the present disclosure.
Specific embodiment
It is described in detail below in conjunction with specific embodiment of the attached drawing to the disclosure.It should be understood that this place is retouched The specific embodiment stated is only used for describing and explaining the disclosure, is not limited to the disclosure.
The data storage device of the disclosure is introduced first.
In the embodiment of the present disclosure, data storage device for example can be SSD, that is, use solid-state electronic storage chip array system At hard disk.Currently, the storage medium of SSD generally can there are two types of, one is using flash memory (FLASH) chip as storage be situated between Matter, another is to be used as to deposit using dynamic random access memory (Dynamic Random Access Memory, DRAM) Storage media.Wherein, the SSD using FLASH chip as storage medium, its appearance can be made into a variety of apperances, such as: The patterns such as laptop hard, micro harddisk, storage card.
Such as referring to Figure 1, data storage device 10 may include at least one storage unit 11 and at least two processing Device 12.Fig. 1 is to include that four storage units, 11, three processors 12 (processor 121, processor 122 and processor 123) are Example, what certain data storage device included is also possible to the storage unit 11 of other quantity and the processor 12 of other quantity, this Open embodiment is not construed as limiting this.
Storage unit 11 for example can be the storage medium in SSD, for example be NAND chip or DRAM, can be used for depositing Store up data.
Processor 12 for example can be the processor chips in SSD, and processor chips are the brains of SSD, and effect is such as The load on each NAND chip including rational allocation data in SSD assumes responsibility for entire data relay, connects NAND chip With external SATA (Serial Advanced Technology Attachment, serial hard disk interface technology) interface, etc..
Fig. 2 is a kind of flow chart of date storage method shown according to an exemplary embodiment, as shown in Fig. 2, the number It can be applied in data storage device 10, include the following steps according to storage method.
Step S21: data storage device 10 receives the request of write-in data.
Step S22: the first processor 12 at least two processors 12 that data storage device 10 includes obtains data The data write state parameter of storage device 10.
Step S23: first processor 12 determines the address of write-in data according to data write state parameter.
Step S24: data storage device 10 writes data into the corresponding memory space in address.
Data storage device 10 is for example mounted in the SSD in computer, and the request that data are written can be by computer Host issue, the request in storage unit 11 for writing data into data storage device 10.
Optionally, at least two processors 12 may include first processor 12 and at least one second processor 12, and One processor 12 is connected with each processor 12 at least one second processor 12, and data storage device 10 is received for writing The request for entering data, the target second processor 12 that can be at least one second processor 12 are received for data to be written Request, then target second processor 12 is based on the received for being written the requests of data, generates solicited message, at target second It manages device 12 and sends solicited message to first processor 12, to request first processor 12 to obtain the data write-in of data storage device State parameter.
That is, the data that can be for request of data to be written that receiving host issues are deposited in the embodiment of the present disclosure Target second processor 12 in storage device 10, then request first processor 12 to obtain storage device by target second processor 12 10 data write state parameter.The solicited message that first processor 12 can be sent according to target second processor 12, obtains The data write state parameter of data storage device 10, certainly, first processor 1 can also directly acquire data storage device 10 Data write state parameter.
It optionally, actually include which parameter for data write state parameter, the embodiment of the present disclosure is not construed as limiting, example Such as, the current block programming time of each memory block, block erasing time, block read error in each storage unit 11 that may include At least one of rate and the bad block distribution situation of each storage unit 11.By obtaining above-mentioned parameter, can preferably comment Estimate the health status of each storage unit 11, and then adaptively distribute balanced write-in load, improves data storage device 10 Data writing capability.
Continuing with referring to Fig. 1, since first processor 12 can obtain the data write state parameter of storage device 10, because This first processor 12 can be the processor 123 in Fig. 1, and processor 123 is connected with whole storage units 11, Jin Erneng Obtain the state of whole storage units 11.At least one second processor 12 can be processor 121 and processor in Fig. 1 122, receiving host send write-in data target second processor 12 can be it is therein any one, the embodiment of the present disclosure pair This is not construed as limiting.
First processor 12 can be specifically used to manage the processor of whole storage units 11, at least one second processing Device 12 can be the processor of management FTL (Flash Translation Layer, flash translation layer (FTL)), can be used to implement ground The functions such as location mapping management, garbage reclamation.In the embodiment of the present disclosure, write by target second processor 12 come what receiving host issued The request for entering data, by the data write state for whole storage units 11 that first processor includes according to data storage device 10 Parameter distributes address, can by the load of at least one the balanced second processor 12 of first processor 12, avoid by Storage unit is allocated to the situation of load imbalance caused by each processor is managed respectively.Meanwhile data storage device 10 can also include cache chip, then data are when entering caching, data storage device 10 can be to host return command The instruction of completion, therefore, whole storage units 11 is managed using a first processor 12 not will cause write operation Delay can also directly be inquired when carrying out read operation by least one second processor 12, such as the processor of management FTL Mapping table not will cause the delay of read operation equally without read command is sent to storage unit 11 by first processor 12.
Optionally, in first processor 12 according to data write state parameter, after the address for determining write-in data, first Processor 12 can also send the address to target second processor 12.
First processor 12 will be according to the ground of the determining write-in data of the data write state parameter of data storage device 10 Location feeds back to target second processor 12, and target second processor 12 may be implemented and be managed to address, is carrying out read operation When, can read command directly be sent from target second processor 12 to storage unit 11.Certainly, first processor 12 is in determination Can also feed back to other second processors 12 in addition to target second processor 12 after address, the embodiment of the present disclosure to this not It limits.
Optionally, first processor 12 can create RAID according to the data write state parameter of data storage device 10 (Redundant Arrays of Independent Disks, disk array) ribbon structure;Or, first processor 12 can be with According to the RAID stripe structure that the data write state parameter and history of data storage device create, RAID stripe knot is created Structure.
RAID stripe refers to the data block for continuous data being divided into same size, and every segment data is respectively written into battle array The method in different disk in column.First processor 12 in the embodiment of the present disclosure can be filled according to that can embody data storage The data write state parameter of 10 current health states is set, adaptively determines the composition of RAID stripe, this RAID stripe is non- Normal is flexible, and when 11 health status of storage unit is preferable, can having storage particle as much as possible, (a kind of storage cell, is deposited Storage unit 11 is made of storage particle) constituting bar band, to increase user's space;Larger, health status is worn in storage unit 11 The quantity of the storage particle of constituting bar band is reduced when poor, and then improves system reliability.In addition, since data write state is joined Number may include the parameter of multiple reaction 11 health status of storage unit, therefore can adjust in real time in multiple health status dimensions Whole RAID structure generates the highest RAID structure of reliability under the premise of guaranteeing system available space to greatest extent.
In newly-built RAID stripe, if it is RAID stripe structure is established for the first time, then according to data storage device 10 Current data write state is established;If not RAID stripe structure is established for the first time, it can be stored and be filled according to data The RAID stripe structure of 10 current data write states and history creation is set to create RAID stripe.First processor 12 exists After newly-built RAID stripe, newly-built RAID stripe structure can be recorded in data field, the base of RAID stripe is rebuild as next time Plinth.
For example, by data write state parameter, such as the block current including each memory block in each storage unit 11 Programming time, the block erasing time, block read error rate and each storage unit 11 bad block distribution situation, from multiple dimensions The health status of presently written point is analyzed comprehensively, and the health status that multiple dimensions are analyzed comprehensively passes through as variable History RAID result adjusts the weight of each dimension to generate current RAID stripe structure.Dimension weight adjustment algorithm is studied carefully It unexpectedly is which kind of algorithm, the embodiment of the present disclosure is not construed as limiting, for example be can be and used simple greedy algorithm according to computing capability, The multilayer neural network algorithm, etc. of load can be used.The Block for occurring that RAID is needed to rebuild every time is (minimum in database Store and process unit), algorithm needs to reanalyse the health parameters of this Block, and finding out which or several parameters is to draw The main reason for Block health status is deteriorated is played, Block health shape is then caused according to the adjustment of the health status of current Block The weight of state variation parameter, generates new RAID structure, and the Block for protecting health status to be deteriorated to greatest extent improves system Reliability.
Optionally, the corresponding memory space in address can be write data by first processor 12, or, target second processing Device 12 writes data into the corresponding memory space in address.
In the embodiment of the present disclosure, data are written by first processor 12, that is to say, that first processor 12 can be according to number According to the data write state parametric distribution address of storage device 10, moreover it is possible to write operation is carried out, due at least one second processor 12 may also need to execute some other operations, such as management address mapping, garbage reclamation, etc., therefore, pass through the first processing Device 12 completes the operation of write-in data, has shared the load of at least one second processor 12, has improved data storage device 10 Performance.It is of course also possible to carry out write operation by target second processor 12, the embodiment of the present disclosure is not construed as limiting this.
In the embodiment of the present disclosure, data storage device 10 receive host sending for be written data request when, The data write state parameter of data storage device 10 can be obtained by the first processor 12 that data storage device 10 includes, so The address of write-in data is determined according to data write state parameter afterwards, then the determining address institute of the data write-in of request write-in is right The memory space answered.Through the above technical solutions, can be separately through a processor (i.e. first processor 12) according to entire The data write state parameter of data storage device 10 determines the position to be write data into, since first processor 12 manages The whole storage units 11 that can be data storage device 10 and include, avoid because to different processor distribute storage unit due to The problem of caused load imbalance, improves the ability of 10 storing data of data storage device.
It is apparent to those skilled in the art that for convenience and simplicity of description, only with above-mentioned each function The division progress of module can according to need and for example, in practical application by above-mentioned function distribution by different function moulds Block is completed, i.e., the internal structure of data storage device 10 is divided into different functional modules, to complete whole described above Or partial function.The specific work process of the device of foregoing description, can refer to corresponding processes in the foregoing method embodiment, Details are not described herein.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it Its mode is realized.For example, the apparatus embodiments described above are merely exemplary, for example, the module or unit It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit It closes or communicates to connect, 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, each functional unit in each embodiment of the application can integrate in one processing unit It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product When, it can store in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words It embodies, which is stored in a storage medium, including some instructions are used so that a computer It is each that equipment (can be personal computer, server or the network equipment etc.) or processor (processor) execute the application The all or part of the steps of embodiment the method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk Etc. the various media that can store program code.
Specifically, the corresponding computer program instructions of one of the embodiment of the present application date storage method can be deposited It stores up on CD, hard disk, the storage mediums such as USB flash disk, when the computer journey corresponding with a kind of date storage method in storage medium Sequence instruction is read or is performed by an electronic equipment, includes the following steps:
The data storage device receives the request of write-in data;
First processor at least two processors that the data storage device includes obtains the data storage dress The data write state parameter set;
The first processor determines the address that the data are written according to the data write state parameter;
The corresponding memory space in the address is written in the data by the data storage device.
Optionally, at least two processor includes the first processor and at least one second processor, described First processor is connected with each processor at least one described second processor, stored in the storage medium with step Rapid: the data storage device receives the request for data to be written, and corresponding computer instruction is during being performed, packet It includes:
Target second processor at least one described second processor receives the request for the data to be written;
The target second processor is used to be written based on the received the request of the data, generates solicited message;
The target second processor sends the solicited message to the first processor, to request first processing Device obtains the data write state parameter of the data storage device.
Optionally, store in the storage medium and step: the first processor is according to the data write state Parameter determines the address that the data are written, and corresponding computer instruction is after being performed, further includes:
The address is sent to the target second processor by the first processor.
Optionally, it stored in the storage medium and step: states first processor and obtains the data storage device Data write state parameter, corresponding computer instruction is during being performed, comprising:
It is current that the first processor obtains each memory block in each storage unit that the data storage device includes Block programming time, the block erasing time, block read error rate and each storage unit bad block distribution situation in extremely Few one.
Optionally, other step is also stored in the storage medium, the other step had been performed Cheng Zhong, further includes:
The first processor creates disk array RAID according to the data write state parameter of the data storage device Ribbon structure;Or,
The first processor is created according to the data write state parameter and history of the data storage device RAID stripe structure creates RAID stripe structure.
Optionally, store in the storage medium and step: the data storage device will be described in data write-in The corresponding memory space in address, corresponding computer instruction is during being performed, comprising:
The corresponding memory space in the address is written in the data by the first processor, or, at the target second It manages device and the corresponding memory space in the address is written into the data.
The above, above embodiments are only described in detail to the technical solution to the disclosure, but the above implementation The explanation of example is merely used to help understand disclosed method and its core concept, should not be construed as the limitation to the disclosure.This Those skilled in the art are in the technical scope that the disclosure discloses, and any changes or substitutions that can be easily thought of, should all cover Within the protection scope of the disclosure.

Claims (12)

1. a kind of date storage method is applied to data storage device characterized by comprising
The data storage device receives the request of write-in data;
The first processor at least two processors that the data storage device includes obtains the data storage device Data write state parameter;
The first processor determines the address that the data are written according to the data write state parameter;
The corresponding memory space in the address is written in the data by the data storage device.
2. the method according to claim 1, wherein at least two processor includes the first processor With at least one second processor, the first processor and each processor phase at least one described second processor Even,
The data storage device receives the request for data to be written, comprising:
Target second processor at least one described second processor receives the request for the data to be written;
The target second processor is used to be written based on the received the request of the data, generates solicited message;
The target second processor sends the solicited message to the first processor, to request the first processor to obtain Take the data write state parameter of the data storage device.
3. according to the method described in claim 2, it is characterized in that, in the first processor according to the data write state Parameter, determination are written after the address of the data, the method also includes:
The address is sent to the target second processor by the first processor.
4. the method according to claim 1, wherein the first processor obtains the data storage device Data write state parameter, comprising:
The first processor obtains the block that each memory block is current in each storage unit that the data storage device includes Programming time, the block erasing time, block read error rate and each storage unit bad block distribution situation at least one Person.
5. according to the method described in claim 4, it is characterized in that, the method also includes:
The first processor creates disk array RAID stripe according to the data write state parameter of the data storage device Structure;Or,
The RAID stripe that the first processor is created according to the data write state parameter and history of the data storage device Band structure creates RAID stripe structure.
6. according to the method described in claim 2, it is characterized in that, the data are written describedly the data storage device The corresponding memory space in location, comprising:
The corresponding memory space in the address is written in the data by the first processor, or, the target second processor The corresponding memory space in the address is written into the data.
7. a kind of data storage device characterized by comprising
At least one storage unit;
At least two processors, for receiving the request of write-in data;Pass through the first processing at least two processor Device obtains the data write state parameter of the data storage device;Shape is written according to the data by the first processor State parameter determines the address that the data are written;The data are written at least one described storage unit described in corresponding to The memory space of address.
8. device according to claim 7, which is characterized in that at least two processor includes the first processor With at least one second processor, the first processor and each processor phase at least one described second processor Even, at least one described second processor is used for:
The request for the data to be written is received by the target second processor at least one described second processor;
It is used to be written the request of the data based on the received by the target second processor, generates solicited message;
The solicited message is sent to the first processor by the target second processor, to request first processing Device obtains the data write state parameter of the data storage device.
9. device according to claim 8, which is characterized in that at least two processor is also used to:
In the first processor according to the data write state parameter, determines and be written after the address of the data, pass through The address is sent to the target second processor by the first processor.
10. device according to claim 7, which is characterized in that at least two processor is used for:
It is current that each memory block in each storage unit that the data storage device includes is obtained by the first processor Block programming time, the block erasing time, block read error rate and each storage unit bad block distribution situation in extremely Few one.
11. device according to claim 10, which is characterized in that at least two processor is also used to:
By the first processor according to the data write state parameter of the data storage device, disk array RAID is created Ribbon structure;Or,
It is created by the first processor according to the data write state parameter and history of the data storage device RAID stripe structure creates RAID stripe structure.
12. device according to claim 8, which is characterized in that at least two processor is used for:
The corresponding memory space in the address is written into the data by the first processor, or, passing through the target the The corresponding memory space in the address is written in the data by two processors.
CN201810279190.3A 2018-03-31 2018-03-31 Date storage method and device Withdrawn CN110321061A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810279190.3A CN110321061A (en) 2018-03-31 2018-03-31 Date storage method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810279190.3A CN110321061A (en) 2018-03-31 2018-03-31 Date storage method and device

Publications (1)

Publication Number Publication Date
CN110321061A true CN110321061A (en) 2019-10-11

Family

ID=68111988

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810279190.3A Withdrawn CN110321061A (en) 2018-03-31 2018-03-31 Date storage method and device

Country Status (1)

Country Link
CN (1) CN110321061A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102622189A (en) * 2011-12-31 2012-08-01 成都市华为赛门铁克科技有限公司 Storage virtualization device, data storage method and system
US20130019057A1 (en) * 2011-07-15 2013-01-17 Violin Memory, Inc. Flash disk array and controller
CN106873903A (en) * 2016-12-30 2017-06-20 北京联想核芯科技有限公司 Date storage method and device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130019057A1 (en) * 2011-07-15 2013-01-17 Violin Memory, Inc. Flash disk array and controller
CN102622189A (en) * 2011-12-31 2012-08-01 成都市华为赛门铁克科技有限公司 Storage virtualization device, data storage method and system
CN106873903A (en) * 2016-12-30 2017-06-20 北京联想核芯科技有限公司 Date storage method and device

Similar Documents

Publication Publication Date Title
TWI702495B (en) Apparatus, method, and multimode storage device for performing selective underlying exposure mapping on user data
CN106873903A (en) Date storage method and device
CN106873908B (en) Date storage method and device
US9563511B1 (en) Performing input/output operations on a set of storage devices based on scalable input/output credits
US20130290630A1 (en) Storage system, control method thereof, and program
JP2022111153A (en) Management system for operating storage medium in multi-mode, storage system including the same, and method for managing storage medium using the same
CN104407935B (en) Snapshot rollback method and storage device
US10534546B2 (en) Storage system having an adaptive workload-based command processing clock
US8234459B2 (en) Switch module based non-volatile memory in a server
CN103797770A (en) Method and system for sharing storage resources
KR20140139113A (en) Memory module virtualizaton
CN103703440A (en) Prefetching data tracks and parity data to use for destaging updated tracks
CN105335308B (en) To access information treating method and apparatus, the system of storage device
CN110389710A (en) The method and apparatus for distributing storage resource
CN107908571A (en) A kind of method for writing data, flash memory device and storage device
CN104346293A (en) Data access method, module, processor and terminal device for hybrid memory
CN105988727A (en) RAID-based storage method and storage device
CN108228085A (en) For managing the method and apparatus of storage system
US8996805B2 (en) Shared cache module and method thereof
CN107526533B (en) Storage management method and equipment
US20230342028A1 (en) Zone hints for zoned namespace storage devices
JP5884602B2 (en) Storage control device and storage system
CN106155910A (en) A kind of methods, devices and systems realizing internal storage access
CN110321061A (en) Date storage method and device
CN103914401B (en) Storage device with multiple processors

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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20191011