CN104407820B - Data processing method based on solid hard disk storage system, device and system - Google Patents

Data processing method based on solid hard disk storage system, device and system Download PDF

Info

Publication number
CN104407820B
CN104407820B CN201410766796.1A CN201410766796A CN104407820B CN 104407820 B CN104407820 B CN 104407820B CN 201410766796 A CN201410766796 A CN 201410766796A CN 104407820 B CN104407820 B CN 104407820B
Authority
CN
China
Prior art keywords
queue
stored
state table
completes
complete
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
Application number
CN201410766796.1A
Other languages
Chinese (zh)
Other versions
CN104407820A (en
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201410766796.1A priority Critical patent/CN104407820B/en
Publication of CN104407820A publication Critical patent/CN104407820A/en
Application granted granted Critical
Publication of CN104407820B publication Critical patent/CN104407820B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The embodiment of the invention discloses a kind of data processing method based on solid hard disk storage system, including: solid state hard disc obtains pending data, and pending data have been stored in queue；Update first and complete quene state table, make first to complete content instruction that quene state table stored: completing queue storage has pending data, first completes the content that quene state table stored includes: what each solid state hard disc was corresponding completes whether to store in queue pending data.By this data processing method, processor completes queue by complete that quene state table can accurately access that storage has pending data, decreases processor to completing the system loss that causes in the polling procedure of queue.

Description

Data processing method based on solid hard disk storage system, device and system
Technical field
The present invention relates to computer memory technical field, particularly relate to number based on solid hard disk storage system According to processing method, device and system.
Background technology
Existing solid state hard disc (Solid State Drive is called for short SSD) mainly includes two parts: deposit Storage granule, is used for storing data；Solid-state hard disk controller, is stored in the number in storage granule for management According to, and communicate with other equipment such as processors.As it is shown in figure 1, solid hard disk storage system includes place Manage device, solid state hard disc, submission queue (Submission Queue is called for short SQ) and complete queue (Comp- Letion Queue, is called for short CQ).Wherein, SQ is for storing the read-write operation that solid state hard disc is pending Request, CQ is for storing number that solid state hard disc completes, that processor is pending according to read-write operation request According to.
The process that solid state hard disc is initiated read-write operation request by processor is as follows: 1, processor sends read-write Operation requests is to SQ；2, there is pending read-write operation in processor notice solid-state hard disk controller SQ Request；3, solid-state hard disk controller obtains pending read-write operation request from SQ；4, solid-state is hard After dish performs this read-write operation request, it is thus achieved that corresponding pending data, and by these pending data In write CQ；5, there are pending data in solid-state hard disk controller notifier processes device CQ；6, place Reason device obtains pending data from CQ, and completes data process.In step 4, solid state hard disc controls Device, after by pending data write CQ, can send interrupt signal to processor in steps of 5, Processor is made to interrupt current task to perform step 6, it is also possible to processor not to be sent interrupt signal, Then processor need timing CQ is inquired, to obtain data pending in CQ, and if Step 5 uses interrupt signal, owing in solid state hard disc processing system, the frequency of read-write operation request is higher, Therefore the occurrence frequency of interrupt signal is the highest, causes the interruption expense of processor to promote the most therewith.
Each solid state hard disc in existing solid hard disk storage system typically has the corresponding process of a CQ Device, in the case of solid hard disk storage system includes multiple solid state hard disc, then a processor can be right Answer multiple CQ, if the solid-state hard disk controller of each solid state hard disc does not use interrupt signal notifier processes Device accesses CQ, then processor needs the multiple CQ of automatic regular polling, to obtain each solid state hard disc processor The pending data sent, the polling procedure of this CQ will cause opening more greatly of solid hard disk storage system Pin.
Summary of the invention
Propose the present invention for above-mentioned prior art, utilize the present invention can solve in prior art The problem that solid hard disk storage system expense that processor poll CQ causes is excessive.
The first aspect of the embodiment of the present invention provides at a kind of data based on solid hard disk storage system Reason method, described solid hard disk storage system includes storage device, processor and at least two solid state hard disc, Described at least two solid state hard disc includes that the first solid state hard disc, described first solid state hard disc include solid state hard disc Controller and storage granule, described first solid state hard disc is by submitting queue to and completing queue and described process The mutual read-write operation request of device and pending data, store described submission queue in described storage device Completing queue with described, described data processing method includes:
Described solid-state hard disk controller is according to the read-write operation request in described submission queue, by accessing institute State storage granule and obtain the pending data that described read-write operation request is corresponding, please by described read-write operation The pending data asking corresponding complete queue described in being stored in；
Update first and complete quene state table so that described first completes the content that quene state table is stored Instruction: described in complete queue storage and have pending data, described first completes quene state table is stored Content include: corresponding the completing in queue of each solid state hard disc in described at least two solid state hard disc Whether storage has pending data, and described first completes quene state table is stored in described storage device.
In conjunction with first aspect, in the first implementation of first aspect, described renewal first completes team Row state table specifically includes and operates S1 to S4 as follows:
S1: complete the first content that quene state table is stored by described first, is stored in second and completes queue State table；
S2: complete, by described second, the content that quene state table is stored, be stored in the 3rd and complete quene state Table, and update the described 3rd and complete the content that quene state table is stored so that the described 3rd completes queue The instruction of content that state table is stored: described in complete queue storage and have described pending data；S3: sentence Disconnected described first completes the second content and described second that quene state table stored completes quene state table The content stored is the most identical；
S4: if identical, then complete the content that quene state table stored by the described 3rd and be stored in described One completes quene state table；If it is not the same, the most again perform described operation S1 to S3, until described One completes the second content and described second that quene state table stored completes what quene state table was stored Content is identical.
In conjunction with the first implementation of first aspect, in the second implementation of first aspect, institute State first content and include that described first completes all the elements that quene state table is stored, or described first complete What one-tenth quene state table was stored completes, to described, the content that queue is relevant.
In conjunction with the first implementation and the second implementation of first aspect, in the 3rd of first aspect Planting in implementation, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, Described atomic operation instruction Atomic_cas includes parameter: described first completes the address of quene state table, Described second completes the content that quene state table is stored, and the described 3rd completes quene state table and stored Content.
In conjunction with first aspect, in the 4th kind of implementation of first aspect, described renewal first completes team Row state table specifically includes:
Complete, by described first, the content that quene state table is stored, be stored in the 4th and complete quene state table, Complete quene state table to lock described first；
Update the described 4th and complete quene state table so that the described 4th completes what quene state table was stored Content indicates: described in complete queue storage and have described pending data；
Complete the content that quene state table stored to be stored in described first complete quene state by the described 4th Table, completes described first quene state table and unlocks.
The second aspect of the embodiment of the present invention provides a kind of solid state hard disc, and described solid state hard disc is used for solid-state Hard disk storage system, described solid hard disk storage system includes storage device, processor and at least two institute Stating solid state hard disc, described solid state hard disc includes solid-state hard disk controller and storage granule, described solid state hard disc By submitting queue to and completing queue and the mutual read-write operation request of described processor and pending data, Storing described submission queue in described storage device and described complete queue, described solid state hard disc includes: It is stored in unit, for obtaining the pending data that read-write operation request is corresponding, described pending data According to described read-write operation request in described submission queue access what described storage granule obtained, by institute State pending data corresponding to read-write operation request be stored in described in complete queue；Updating block, for more New first completes quene state table so that described first completes the content instruction that quene state table stored: Described completing queue storage and have pending data, described first completes the content that quene state table is stored Including: whether what each solid state hard disc in described at least two solid state hard disc was corresponding completes to deposit in queue Containing pending data, described first completes quene state table is stored in described storage device.
In conjunction with second aspect, in the first implementation of second aspect, described updating block is specifically used In following operation S1 to S4:
S1: complete the first content that quene state table is stored by described first, is stored in second and completes queue State table；
S2: complete, by described second, the content that quene state table is stored, be stored in the 3rd and complete quene state Table, and update the described 3rd and complete the content that quene state table is stored so that the described 3rd completes queue The instruction of content that state table is stored: described in complete queue storage and have described pending data；S3: sentence Disconnected described first completes the second content and described second that quene state table stored completes quene state table The content stored is the most identical；
S4: if identical, then complete the content that quene state table stored by the described 3rd and be stored in described One completes quene state table；If it is not the same, the most again perform described operation S1 to S3, until described First completes the second content that quene state table stored completes quene state table with described second and is stored Content identical.
In conjunction with the first implementation of second aspect, in the second implementation of second aspect, institute State first content and include that described first completes all the elements that quene state table is stored, or described first complete What one-tenth quene state table was stored completes, to described, the content that queue is relevant.
In conjunction with the first implementation and the second implementation of second aspect, in the 3rd of second aspect Planting in implementation, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, Described atomic operation instruction Atomic_cas includes parameter: described first completes the address of quene state table, Described second completes the content that quene state table is stored, and the described 3rd completes quene state table and stored Content.
In conjunction with second aspect, in the 4th kind of implementation of second aspect, described updating block is specifically used In:
Complete, by described first, the content that quene state table is stored, be stored in the 4th and complete quene state table, Complete quene state table to lock described first；
Update the described 4th and complete quene state table so that the described 4th completes what quene state table was stored Content indicates: described in complete queue storage and have described pending data；
Complete the content that quene state table stored to be stored in described first complete quene state by the described 4th Table, completes described first quene state table and unlocks.
The third aspect of the embodiment of the present invention provides at a kind of data based on solid hard disk storage system Reason method, described solid hard disk storage system includes storage device, processor and at least two solid state hard disc, Each solid state hard disc in described at least two solid state hard disc is by submitting queue to and completing queue and institute State the mutual read-write operation of processor and pending data, described storage device stores described submission team Row complete queue with described, and described data processing method includes: described processor completes queue according to first The content that state table is stored, determines that the pending queue that completes, the described pending queue that completes are: Storage has the queue that completes of pending data, and described first completes the content bag that quene state table is stored Include: whether what each solid state hard disc in described at least two solid state hard disc was corresponding completes to store in queue Having pending data, described first completes quene state table is stored in described storage device；Obtain described Pending completes the described pending data of storage in queue, processes described pending data.
In conjunction with the third aspect, in the first implementation of the third aspect, described complete team according to first The content that row state table is stored, determines that the pending queue that completes specifically includes:
Update the 5th and complete the content that quene state table is stored so that the described 5th completes quene state table The content instruction stored: corresponding the completing of each solid state hard disc in described at least two solid state hard disc Queue does not the most store pending data；
Content that quene state table stored is completed by the described 5th first complete with described by exchange instruction Become the content exchange that quene state table is stored；
According to the described 5th completing the content that quene state table is stored after exchange, determine pending complete Become queue.
In conjunction with the first implementation of the third aspect, in the second implementation of the third aspect, institute Stating exchange instruction is that atomic operation instructs lock xchg, and described atomic operation instructs lock xchg and includes ginseng Number: the described 5th completes the address of quene state table, and described first completes the address of quene state table.
In conjunction with the third aspect, described in the third implementation of the third aspect, complete queue according to first The content that state table is stored, determines that the pending queue that completes specifically includes:
Complete, by described first, the content that quene state table is stored, be stored in the 6th and complete quene state table, Complete quene state table to lock described first；
Complete, according to the described 6th, the content that quene state table is stored, determine and pending complete queue；
Update described first and complete the content that quene state table is stored so that described first completes queue shape The content instruction that state table is stored: each solid state hard disc in described at least two solid state hard disc is corresponding Complete queue and the most do not store pending data, complete quene state table by described first and unlock.
The fourth aspect of the embodiment of the present invention provides a kind of data processing equipment, described data processing equipment For solid hard disk storage system, described solid hard disk storage system includes at storage device, described data Reason device and at least two solid state hard disc, each solid state hard disc in described at least two solid state hard disc leads to Cross submission queue and complete queue and the mutual read-write operation of described data processing equipment and pending data, Described storage device stores described submission queue and described completes queue, described data processing equipment bag Include: confirmation unit, for completing, according to first, the content that quene state table is stored, determine pending Completing queue, the described pending queue that completes is: storage has the queue that completes of pending data, institute State first to complete the content that quene state table stored and include: each in described at least two solid state hard disc What individual solid state hard disc was corresponding completes whether to store in queue pending data, and described first completes queue State table is stored in described storage device；Processing unit, for obtaining described pending completing in queue The described pending data of storage, process described pending data.
In conjunction with fourth aspect, in the first implementation of fourth aspect, described confirmation unit is specifically used In:
Update the 5th and complete the content that quene state table is stored so that the described 5th completes quene state table The content instruction stored: corresponding the completing of each solid state hard disc in described at least two solid state hard disc Queue does not the most store pending data；
Content that quene state table stored is completed by the described 5th first complete with described by exchange instruction Become the content exchange that quene state table is stored；
According to the described 5th completing the content that quene state table is stored after exchange, determine pending complete Become queue.
In conjunction with the first implementation of fourth aspect, in the second implementation of fourth aspect, institute Stating exchange instruction is that atomic operation instructs lock xchg, described atomic operation instruction lock xchg and includes parameter: Described 5th address completing quene state table, described first completes the address of quene state table.
In conjunction with fourth aspect, in the third implementation of fourth aspect, described confirmation unit is specifically used In:
Complete, by described first, the content that quene state table is stored, be stored in the 6th and complete quene state table, Complete quene state table to lock described first；
Complete, according to the described 6th, the content that quene state table is stored, determine and pending complete queue；
Update described first and complete the content that quene state table is stored so that described first completes queue shape The content instruction that state table is stored: each solid state hard disc in described at least two solid state hard disc is corresponding Complete queue and the most do not store pending data, complete quene state table by described first and unlock.
5th aspect of the embodiment of the present invention provides a kind of solid hard disk storage system, described solid state hard disc Storage system includes: the arbitrary described solid state hard disc of second aspect of at least two such as embodiment of the present invention, Data processing equipment as described in as arbitrary in the fourth aspect of the embodiment of the present invention, storage device；
What described solid state hard disc was corresponding complete queue is stored in described storage device；
Set up logical between described solid state hard disc, described data processing equipment, described storage device by bus Letter.
The embodiment of the present invention provides a kind of data processing method based on solid hard disk storage system, and solid-state is hard Dish, after pending data have been stored in queue, has updated quene state table, and this completes queue shape State table have recorded during each completes queue in solid hard disk storage system and whether store pending number According to.By this data processing method, processor to its complete queue conduct interviews time, need not be by all Complete the equal poll of queue one time to obtain pending data, but can essence by completing quene state table Really know that storage has a queue that completes of pending data, and then accurately access these and complete queue to obtain Pending data, decrease processor to completing the system loss that causes in the polling procedure of queue, add The speed processor acquisition process to completing data pending in queue.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to reality Execute the required accompanying drawing used in example to make to introduce simply, it is clear that, the accompanying drawing in description below It is some embodiments of the present invention, for those of ordinary skill in the art, is not paying creative labor On the premise of Dong, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the composition structural representation of the solid hard disk storage system applied in prior art；
The composition structural representation of the solid hard disk storage system that Fig. 2 is applied by the embodiment of the present invention；
The schematic flow sheet of the data processing method that Fig. 3 is applied by the inventive method embodiment 1；
The composition structural representation of another solid hard disk storage system that Fig. 4 is applied by the embodiment of the present invention Figure；
The composition structural representation of the another solid hard disk storage system that Fig. 5 is applied by the embodiment of the present invention Figure；
The schematic flow sheet of the data processing method that Fig. 6 is applied by the inventive method embodiment 2；
The composition structural representation of the solid state hard disc that Fig. 7 is applied by present device embodiment 1；
The composition structural representation of the data processing equipment that Fig. 8 is applied by present device embodiment 2；
The composition structural representation of the data processing equipment that Fig. 9 is applied by present device embodiment 3.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out Clearly and completely describe, it is clear that described embodiment be a part of embodiment of the present invention rather than Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making wound The every other embodiment obtained under the property made work premise, broadly falls into the scope of protection of the invention.
Term " processor " in this specification refers generally to perform the processing unit of data processing task, can For referred to as processor core or process core, it is also possible to be the integrated of a kind of disposal ability with signal Circuit chip, such as general processor, digital signal processor (Digital Signal Processor, DSP), Special IC (Application Specific Integrated Circuit, ASIC), ready-made able to programme Gate array (Field Programmable Gate Array, FPGA) etc..
Term " solid-state hard disk controller " in this specification refers generally to be integrated in solid state hard disc, to solid The equipment that storage granule in state hard disk is managed.
The solid hard disk storage system of the embodiment of the present invention
Fig. 2 describes the composition structural representation of the solid hard disk storage system that the embodiment of the present invention is provided Figure, this solid hard disk storage system includes at least two solid state hard disc, i.e. solid state hard disc 204, and solid-state is hard Dish 210, solid state hard disc 204 includes solid-state hard disk controller 206 and storage granule 208, solid state hard disc 210 include solid-state hard disk controller 212 and storage granule 214.Processor 202, storage device 216, Solid state hard disc 204 and solid state hard disc 210 are communicated by bus 228, wherein store in storage device Having had quene state table 226, whether each that have recorded in this table in storage device completes to deposit in queue Containing pending data, in storage device, also storage has each submit queue to and complete queue, the most often The corresponding each processor of individual solid state hard disc has one to complete queue and submission a queue, such as solid state hard disc 204 by submitting queue 218 to and completing queue 222 read-write operation request mutual with processor 202 and treat The data processed, solid state hard disc 210 is by submitting queue 220 to and completing queue 224 and processor 202 Mutual read-write operation request and pending data.
It should be noted that the solid hard disk storage system of reality potentially includes multiple processor, the most often The corresponding each processor of individual solid state hard disc all have one to submit queue to and one complete queue, reality completes The storage position of quene state table 226, can with each submission queue and each storage position completing queue Think same storage device, it is also possible to for different storage device, such as: completing quene state table 226 can To be stored in the depositor of processor 202, or it is stored in the storage device being integrated in processor 202, Or be stored in the storage device being integrated in solid state hard disc 204 or solid state hard disc 210, it specifically stores Mode does not constitute restriction.
Embodiment of the method 1
Seeing Fig. 3, this method embodiment 1 is based on the solid hard disk storage system shown in Fig. 2, is carried A kind of data processing method of confession, it should be noted that the executive agent of this method embodiment is Fig. 2 institute One of them solid state hard disc in the solid hard disk storage system shown, this method embodiment takes for convenience of describing For solid state hard disc 204, it practice, any one solid state hard disc in solid hard disk storage system is the most permissible Implementing this method embodiment, data processing method includes:
Step 402, solid state hard disc 204 obtains pending data, pending data has been stored in Queue 222.
Concrete, after processor 202 submits read-write operation request write to queue 218, notice solid-state is hard Dish 204 has pending read-write operation request in submitting queue 218 to.Solid-state hard disk controller 206 basis After this notice obtains the read-write operation request in submission queue 218, obtain by accessing storage granule 208 The pending data that this read-write operation request is corresponding, and the data that this is pending have been stored in queue 222。
Step 404, solid state hard disc 204 has updated quene state table 226 so that complete quene state table The content instruction that 226 are stored: completing queue 222 storage has pending data, completes quene state table 226 contents stored include: corresponding the completing of each solid state hard disc in solid hard disk storage system Whether queue stores pending data, i.e. completes in the solid hard disk storage system shown in Fig. 2 Queue 222 and complete whether to store in queue 224 pending data.
Concrete, table 1 completes a kind of implementation of quene state table 226 for this, have recorded in table 1 Become queue number, to each of solid hard disk storage system completing queue, such as this solid state hard disc storage system System includes n solid state hard disc, i.e. includes that n completes queue, then table 1 at least includes n row, each Complete queue number also to should have one storage status indicator, indicate its correspondence complete queue in whether store Having pending data, as a example by table 1, storage status indicator represents this storage mark correspondence for " 1 " The queuing memory that completes contain pending data, storage status indicator represents this storage mark for " 0 " Know corresponding complete queue in do not store pending data.If in step 402, solid state hard disc 204 Queue 222 queue number that completes in Table 1 that completes pending data being stored in is 1, and table 1 record Perform the state before step 404 for solid state hard disc 204, then, in step 404, solid state hard disc 204 needs more Newly complete quene state table 226 so that it is the content of record is converted to table 2 by table 1.
It should be noted that, each in this specification completes quene state table, the content of its storage is permissible For the as shown in table 1 corresponding relation completing queue number and storage status indicator, it is also possible to for the number of n position According to, now the n in solid hard disk storage system completes the corresponding relation of queue and this n position and has established, Then this n-bit data can represent that this n completes whether to store in queue pending data, such as n When being 8, completing only storage " 00001010 " in quene state table, solid state hard disc can be really with processor Second in fixed this 8 bit data established in advance and the 4th corresponding complete in queue, and storage needs The data processed.
Table 1
Complete queue number Storage status indicator
1 1
2 1
…
n 0
Table 2
Owing to solid hard disk storage system potentially including multiple solid state hard disc, therefore reality may go out Existing multiple solid state hard disc continuous accesses complete the situation of quene state table 226.Such as, solid state hard disc 204 Pending data have been stored in queue number be 8 complete queue after, need will complete quene state table Storage status indicator part in 226 is updated to " 00110001 " by " 00110000 ", due to internal memory Read-write operation be minimum operation unit with 1 byte (8), therefore solid state hard disc 204 cannot be direct Be updated completing the storage status indicator that queue number is 8, for this solid state hard disc 204 need by " 00110000 " fetches quene state table 226 from completing, and will after being updated to " 00110001 " again " 00110001 " has write back quene state table 226, completes to update；If will at solid state hard disc 204 " 00110001 ", after completing to fetch quene state table 226, has been write back team by " 00110000 " Period, the storage state that solid state hard disc 210 will complete in quene state table 226 before row state table 226 Identification division is updated to " 10110000 ", then " 00110001 " can be write back by solid state hard disc 204 subsequently Complete quene state table 226, override " 10110000 ", cause solid state hard disc 210 to completing queue The renewal of state table 226 was lost efficacy, then complete quene state table 226 and cannot correctly record solid state hard disc storage In system, each completes the situation of the pending data of queue storage.
Therefore, optionally, example in undertaking, as in Fig. 4, step 404 solid state hard disc 204 to completing team The renewal process of row state table 226 can be:
S1: solid state hard disc 204, by currently completing the content that quene state table 226 is stored, has been stored in Quene state table 228, now, completes in quene state table 226 content of storage and completes quene state In table 228, the content of storage is " 00110000 ".
S2: solid state hard disc 204, by completing the content that quene state table 228 is stored, has been stored in queue State table 230, now, completes the content of storage in quene state table 228,230 and is " 00110000 "； Solid state hard disc 204 has updated quene state table 230, and such as solid state hard disc 204 is by pending data Incorporated queue number be 1 complete queue, then solid state hard disc 204 will complete quene state table 230 Be updated to " 10110000 ", concrete, herein can to the update method completing quene state table 230 Think and " 00110000 " and " 10000000 " are carried out or computing, obtain " 10110000 ".
S3: solid state hard disc 204 judges, after S2 is finished, current time completes quene state table 228 contents stored are with to complete the content that quene state table 226 stored the most identical.
S4: if completing content that quene state table 228 stored in S3 and completing quene state table 226 The content stored is identical, illustrates during S1 and S2 performs, without other solid state hard discs to completing team Row state table 226 is updated, then " 10110000 " have been write back queue shape by solid state hard disc 204 State table 226, completes to update；If both differ, illustrate, during S1 and S2 performs, have it He is updated completing quene state table 226 by solid state hard disc, the most now completes quene state table 226 contents stored are " 00110011 ", then solid state hard disc 204 now can not be by " 10110000 " Write back quene state table 226, but re-executed step S1 to S3, i.e. fetched " 00110011 " It is stored in quene state table 228, quene state table 230 will have been completed and be updated to " 10110011 ", then Secondary rejudge that currently to complete quene state table 226 interior with currently complete quene state table 228 and stored Hold the most identical.Solid state hard disc 204 repeats step S1 to S3, until when it performs step S3, It is identical with completing the content that quene state table 228 stored to complete content that quene state table 226 stored, Solid state hard disc 204 has been successfully updated quene state table 226.
Optionally, supporting Atomic_cas instruction in PCI Express bus specification, this instruction has three Input parameter, i.e. (the first address completing quene state table, second completes quene state to Atomic_cas The content that table is stored, the 3rd completes the content that quene state table is stored), example in undertaking, solid-state is hard Dish 204 in step s3, to bus send Atomic_cas (complete the address of quene state table 226, Complete the content that quene state table 228 is stored, complete the content that quene state table 230 is stored) refer to Order, then bus has judged the content that quene state table 228 is stored, and completes quene state table 226 Address in the content that stored the most identical；If identical, then bus will complete quene state table 230 The content stored, according to completing the address of quene state table 226, has write quene state table 226, Complete to update；If it is not the same, then bus is stored currently completing in the address of quene state table 226 Content return to solid state hard disc 204, solid state hard disc 204 re-executes step S1 to S3.Meanwhile, Due to Atomic_cas instruction originally as atomic operation, then bus is when execution Atomic_cas instruction Wait other solid state hard discs of configuration in this bus and cannot complete quene state table 226 by bus access, protect Demonstrate,proved complete quene state table 226 can correctly record in each completes queue whether stored pending Data.
Optionally, such as Fig. 5, for having ensured that quene state table 226 can correctly record solid state hard disc and deposit In storage system, each completes the situation of the pending data of queue storage.Solid state hard disc 204 can also carry out Hereinafter operate the renewal completing quene state table 226: quene state table 226 will be completed and stored Content, be stored in quene state table 234, quene state table 226 will have been completed and lock；Renewal completes Quene state table 234 so that complete the content instruction that quene state table 234 is stored: complete queue 222 Storage has pending data；It has been stored in queue shape by completing the content that quene state table 234 stored State table 226, will complete quene state table 226 and unlock.Wherein to the locking completing quene state table 226 Conciliate latching operation similar with common memory latching operation, such as: in completing residing for quene state table 226 Depositing space and add lock flag, solid state hard disc 204 will complete the content reading that quene state table 226 is stored When going out, being " locking " state by lock mark position, in reality, Chang Suo flag uses " 1 " mark " locking " state, solid state hard disc 204 has been stored in completing the content that quene state table 234 stored After quene state table 226, it is " unblock " state by lock mark position.Solid state hard disc 204 read and Latching operation is used, it is ensured that period completes quene state table 226 nothing when having write quene state table 226 Method is revised by other solid state hard discs.
It should be noted that solid hard disk storage system potentially includes multiple processor and multiple solid in reality State hard disk, such as, include 2 processors, and 32 solid state hard discs, then solid state hard disc 1 is by completing team Row 1 and processor 1 interaction data, by completing queue 2 and processor 2 interaction data；Solid state hard disc 2, by completing queue 3 and processor 1 interaction data, count with processor 2 alternately by completing queue 4 According to, the like.A total of 64 complete queue, then complete the storage shape in quene state table 226 State identification division also has 64 bit data (8 bytes), but solid state hard disc 1 in use actual only with Complete in quene state table 226, and complete queue 1 and the part completing queue 2 corresponding has relation.
Therefore, optionally, solid state hard disc 204 when performing each alternative in this method embodiment, Can operate completing the full content that quene state table 226 stored, it is also possible to only for completing The partial content relevant to completing queue 222 in quene state table 226 operates, such as, complete team Row state table have recorded 64 states completing queue altogether, therefore including at least the space of 8 bytes, its In complete that the storage status indicator of queue 222 has been positioned in 8 bytes of quene state table 226 the In 1 byte, then solid state hard disc 204 is when performing this method embodiment, it is only necessary to grasp this byte , such as, this byte locked, read, update, solve latching operation, or this byte is carried out Aforementioned S1 to S4 operates, and need not operate whole 8 bytes completing quene state table 226.
It should be noted that each step in this method embodiment does not constitute execution sequence relation successively, Such as step 404 can perform with step 402 before, i.e. solid state hard disc 204 is first to completing quene state Table 226 is updated, and writes pending data to completing queue 222 the most again.
A kind of a kind of data processing method based on solid hard disk storage system of above-mentioned offer, solid state hard disc is deposited Solid state hard disc in storage system, after pending data have been stored in queue, has updated quene state Table, whether this completes to have recorded in quene state table during each completes queue in solid hard disk storage system and deposits Contain pending data.By this data processing method, processor conducts interviews it is completed queue Time, need not will be fully completed the equal poll of queue one time to obtain pending data, but by completing team Row state table can accurately know that storage has the queue that completes of pending data, and then accurately accesses these Completing queue to obtain pending data, this data processing method decreases processor to completing queue The system loss caused in polling procedure, accelerates processor to completing obtaining of data pending in queue Take process.
Embodiment of the method 2
Seeing Fig. 6, this method embodiment 2 is based on the solid hard disk storage system shown in Fig. 2, is carried A kind of data processing method of confession, it should be noted that the executive agent of this method embodiment is Fig. 2 institute Processor 202 in the solid hard disk storage system shown, it practice, solid hard disk storage system includes many In the case of individual processor, any one processor therein all can implement this method embodiment, data Processing method includes:
Step 602, processor 202, according to completing the content that quene state table 226 is stored, determines and waits to locate That manages completes queue, and the pending queue that completes is: storage has the queue that completes of pending data, complete The content becoming quene state table 226 to be stored includes: each solid-state in solid hard disk storage system is hard What dish was corresponding completes whether to store in queue pending data, stores at the solid state hard disc shown in Fig. 2 System i.e. completes queue 222 and completes whether queue 224 stores pending data.
Concrete, each solid state hard disc in solid hard disk storage system does not use interrupt notification processor In the case of 202, processor 202 needs to access each at set intervals to be completed queue and wherein deposits to obtain The pending data of storage, before this, processor 202 has first accessed quene state table 226, and root Complete the state of queue according to each wherein stored, determine that what storage had pending data completes queue. It should be noted that, completing in quene state table 226 and embodiment of the method 1 in this method embodiment 2 Unanimously, it implements details and does not repeats them here.
Step 604, the pending pending number completing to store in queue determined in obtaining step 602 According to, process pending data.
Processor 202 have accessed quene state table 226 in step 602 and determined pending complete After becoming queue, need renewal to complete quene state table 226, such as, complete in quene state table 226 Storage status indicator part is " 00110000 ", then processor 202 has learnt that queue number is 3 and completes Queue number be 4 the storage that completes in queue have pending data, then processor 202 in the next step will The two can be accessed complete queue and process storage pending data therein, therefore complete quene state Table 226 completes in queue storage have pending by not re-recording the two after being accessed by processor 202 Data.If the original state completing quene state table 226 is i.e. fully completed queue for " 00000000 " The most do not store pending data, then complete after quene state table 226 accesses by processor 202 every time, Needs are updated to " 00000000 " to start the record completing quene state of next round.But, by Solid hard disk storage system in this method embodiment includes at least two solid state hard disc, if at place Reason device 202 has read quene state table 226 and renewal completes, between quene state table 226, have solid-state hard Dish is updated completing quene state table 226, then next processor 202 has updated quene state During table 226, it will cover and this time update, caused quene state table 226 cannot correctly record each complete Become the state of queue.
Therefore, optionally, such as Fig. 4, processor 202 is in step 602 according to completing quene state table 226 contents stored, determine that the pending queue that completes is specifically as follows: updated quene state The content that table 232 is stored so that complete the content instruction that quene state table 232 is stored: solid-state is hard The queue that completes that each solid state hard disc in disc storaging system is corresponding does not the most store pending data；Logical Cross exchange instruction and deposited completing the content that quene state table 232 stored with completing quene state table 226 The content exchange of storage；According to exchange after complete the content that quene state table 232 is stored, determine and wait to locate That manages completes queue.First processor 202 has updated quene state table 232, as this solid state hard disc is deposited Storage system respectively completes " 0 " in quene state table and has represented that queue does not stores pending data, To complete as a example by quene state table 226 has 8, then complete after quene state table 232 as " 00000000 ", Concrete this renewal instruction can be completed by instruction " mov ax, 0 ", and ax has indicated quene state table The address of 232, processor 202 will complete what quene state table 232 was stored by exchange instruction subsequently Content with complete the content exchange that stored in quene state table 226, example in undertaking, then complete queue shape State table 232 will store " 00110000 ", and complete quene state table will store " 00000000 ", Processor 202 can determine pending complete team according to completing the content that quene state table 232 stored Row, complete the content of storage described in quene state table 226 simultaneously and are also updated to " 00000000 ", i.e. It is updated to all in solid hard disk storage system complete queue and all do not store the initial of pending data State.
Optionally, the atomic operation instruction supported during exchange instruction can be PCI Express bus specification Lock xchg, this instruction comprises two parameters: completes the address of quene state table 232, completes queue shape The address of state table 226.Exchange instruction with lock prefix ensure that this exchange instruction the term of execution, Complete quene state table 226 to be updated by solid state hard disc, it is ensured that completing quene state table 226 can be accurate Really record each state completing queue.
Such as Fig. 5, for ensureing that processor 202 can correctly access and update quene state table 226, place Reason device 202 can also carry out following operation: by completing the content that quene state table 226 is stored, has been stored in Become quene state table 236, quene state table 226 will be completed and lock；According to completing quene state table 236 institute The content of storage, determines and pending completes queue；Updated that quene state table 226 stored is interior Hold so that complete the content instruction that quene state table 226 stored: every in solid hard disk storage system What individual solid state hard disc was corresponding complete queue does not the most store pending data；Quene state table will be completed 226 add unblock.Wherein latching operation and common memory latching operation are conciliate in the locking to completing quene state table 226 Similar, such as: to add lock flag, processor for the memory headroom completed residing for quene state table 226 202 by complete the content that quene state table 226 stored read time, be " locking " shape by lock mark position State, in reality, Chang Suo flag uses " 1 " mark " to lock " state, and processor 202 has updated After quene state table 226, it is " unblock " state by lock mark position.Processor 202 is reading and is updating Complete to use latching operation during quene state table 226, it is ensured that period completes quene state table 226 and cannot be consolidated State hard disk is revised.
It should be noted that solid hard disk storage system potentially includes multiple processor and multiple solid in reality State hard disk, such as, include 2 processors, and 32 solid state hard discs, then solid state hard disc 1-32 passes through respectively Completing queue 1-32 and processor 1 interaction data, solid state hard disc 1-32 is respectively by completing queue 33-64 With processor 2 interaction data.A total of 64 complete queue, then complete in quene state table 226 Storage status indicator part also has 64 bit data (8 bytes), but processor 1 is actual Only with complete in quene state table 226, the part corresponding with completing queue 1-32 has relation, because of herein Reason device 1 when performing each alternative in this method embodiment, actual can be only for completing queue The part relevant to oneself in state table 226 operates, such as, complete the storage shape of queue 1-32 State mark (32) has taken 4 bytes in quene state table 226, then processor 1 is being held During row this method embodiment, it is only necessary to these 4 bytes are operated, such as this byte is added Lock, read, update, solve latching operation, remaining 4 byte completing quene state table 226 need not be entered Row operation.
A kind of a kind of data processing method based on solid hard disk storage system of above-mentioned offer, solid state hard disc is deposited Before processor in storage system has accessed queue, first access quene state table, determined that storage has Pending data complete queue after, accurately access this and complete queue, it is to avoid team will be fully completed Arranging equal poll one time to obtain pending data, this data processing method decreases processor to completing team The system loss caused in the polling procedure of row, accelerates processor to completing data pending in queue Acquisition process.
It should be noted that solid state hard disc is adopted when having updated quene state table 226 in embodiment of the method 1 Two kinds of alternatives, i.e. determined that quene state table 226 is updated and right after not being modified again Complete quene state table 226 to lock, implement processor in 2 with method and obtained quene state table 226 Content the two kinds of alternatives used when updating, i.e. use exchange instruction and to completing quene state table 226 lock, method that both solid state hard discs perform and the method that two kinds of processors perform actual can from By combining, however it is not limited to solid state hard disc and the method performed by processor in Fig. 4, or in Fig. 5, solid-state is hard The combination of the method performed by dish and processor.
Apparatus embodiments 1
This apparatus embodiments 1 provides a kind of solid state hard disc 802, its organizational structure schematic diagram as it is shown in fig. 7, This solid state hard disc 802 actual can for solid state hard disc arbitrary in the solid hard disk storage system shown in Fig. 2, As a example by solid state hard disc 204.
Solid state hard disc 802 includes:
It is stored in unit 804, for obtaining pending data, pending data is stored in queue 222。
Concrete, it is stored in step 402 and each optional side thereof in unit 804 actual execution embodiment of the method 1 Case, does not repeats them here.
Updating block 806, completes quene state table 226 for renewal so that complete quene state table 226 The content instruction stored: completing queue 222 storage has pending data, completes quene state table 226 The content stored includes: corresponding the completing in queue of each solid state hard disc in solid hard disk storage system Whether storage has pending data.
Concrete, updating block 804 is actual performs step 404 and each optional side thereof in embodiment of the method 1 Case, does not repeats them here.
Above-mentioned offer one solid state hard disc, this solid state hard disc after pending data have been stored in queue, Renewal completes quene state table, and this completes to have recorded in quene state table in solid hard disk storage system each Complete whether queue stores pending data.By this data processing method, processor is to it Complete queue when conducting interviews, need not will be fully completed the equal poll of queue one time to obtain pending data, But can accurately know that what storage had pending data completes queue by completing quene state table, enter And accurately access these and complete queue to obtain pending data, the use of this solid state hard disc decreases place Reason device, to completing the system loss that causes in the polling procedure of queue, accelerates processor to completing in queue The acquisition process of pending data.
Apparatus embodiments 2
This apparatus embodiments 2 provides a kind of data processing equipment, its organizational structure schematic diagram as shown in Figure 8, This data processing equipment 1002 is actual can be for the processor in the solid hard disk storage system shown in Fig. 2 202, when solid hard disk storage system includes multiple processor, this data processing equipment 1002 is permissible For any of which processor.
Data processing equipment 1002 includes:
Confirmation unit 1004, for according to completing the content that quene state table 226 is stored, determining and wait to locate That manages completes queue, and the pending queue that completes is: storage has the queue that completes of pending data, complete The content becoming quene state table 226 to be stored includes: each solid-state in this solid hard disk storage system What hard disk was corresponding completes whether to store in queue pending data.
Concrete, confirmation unit 1004 is actual performs step 602 and each optional side thereof in embodiment of the method 2 Case, does not repeats them here.
Processing unit 1006, for obtaining the pending pending data of storage in queue that complete, and Process this pending data.
Concrete, processing unit 1006 is actual performs step 604 and each optional side thereof in embodiment of the method 2 Case, does not repeats them here.
Above-mentioned offer one data processing equipment, before this data processing equipment has accessed queue, first visits Asked quene state table, determine storage have pending data complete queue after, accurately accessing should Complete queue, it is to avoid by being fully completed queue equal poll one time to obtain pending data, decrease To completing the system loss that causes in the polling procedure of queue, accelerate completing number pending in queue According to acquisition process.
Apparatus embodiments 3
This apparatus embodiments 3 provides a kind of data processing equipment 1202, applies to the solid-state shown in Fig. 2 Hard disk storage system, is specifically as follows processor 202 therein, its organizational structure schematic diagram such as Fig. 9 institute Showing, data processing equipment 1202 includes processor 1204, memorizer 1206, communication interface 1208 and Bus 1210.Wherein, processor 1204, memorizer 1206 and communication interface 1208 are by bus 1210 Realize communication connection each other.
Processor 1204 can use general central processing unit (Central Processing Unit, CPU), Microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), Or one or more integrated circuits, are used for performing relative program, to realize the enforcement of aforementioned the inventive method The technical scheme that example 2 is provided.
Memorizer 1206 can be read only memory (Read Only Memory, ROM), and static state is deposited Storage equipment, dynamic memory or random access memory (Random Access Memory, RAM). Memorizer 1206 can store operating system and other application programs.Coming real by software or firmware During the technical scheme that the existing embodiment of the present invention provides, being used for realizing preceding method embodiment 2 of the present invention provides The program code of technical scheme be saved in memorizer 1206, and performed by processor 1204.
Communication interface 1208 is in order to communicate with each solid state hard disc and storage device 216.
Bus 1210 can include a path, transmits information between data processing equipment 1202 all parts.
Hardware configuration shown in Fig. 9 and foregoing description apply also for present device embodiment 2 to be provided Data handling equipment.
Above-mentioned offer one data processing equipment, before this data processing equipment has accessed queue, performs It is stored in its internal program code, has first accessed quene state table, determine that storage has pending number According to complete queue after, accurately access this and complete queue, it is to avoid the equal poll of queue one will be fully completed All over to obtain pending data, decrease completing the system loss that causes in the polling procedure of queue, Accelerate the acquisition process completing data pending in queue.
System embodiment
Native system embodiment provides a kind of solid hard disk storage system, its composition structural representation such as Fig. 2 institute Show, including optional side arbitrary in storage device 216, bus 228, at least two such as apparatus embodiments 1 Solid state hard disc described in case, such as solid state hard disc 204 and solid state hard disc 210, also include that equipment such as is implemented Data processing equipment described in arbitrary alternative in example 2, such as processor 202.
What in solid hard disk storage system, each solid state hard disc was corresponding complete queue is stored in storage device 216； Complete quene state table 226 to be stored in storage device 216 to may be stored in processor 202 internal Storage device, or the storage device within a certain solid state hard disc, it specifically stores position and does not constitute restriction； Each equipment in solid hard disk storage system is communicated by bus 228.
Concrete, following solid hard disk storage system carries out the most complete data handling procedure.
1. read-write operation request write is submitted in queue 218 by processor 202.
2. processor 202 notifies solid state hard disc 240, submits in queue 218 and has pending read-write operation Request.
3. solid state hard disc 204 reads the read-write operation request submitted in queue 218, and according to this read-write Operation requests is written and read operation to storage granule 208, and obtains pending data.
4. solid state hard disc 204 is according to described data processing method arbitrary in embodiment of the method 1, will treat The data processed have write queue 222, and are updated completing quene state table 226.
5. processor 202 is according to described data processing method arbitrary in embodiment of the method 2, has accessed Become quene state table 226 and obtained the pending data in queue 222, completing number According to process.
Above-mentioned offer one solid hard disk storage system, the solid state hard disc in this solid hard disk storage system exists After pending data have been write queue, update quene state table so that complete quene state In this solid hard disk storage system of table record, each completes storage in queue the situation of pending data, Processor in solid hard disk storage system accesses after this completes quene state table, it is only necessary to accesses storage and needs Process data completes queue.This solid hard disk storage system avoids processor and is obtaining pending number During according to, need to be fully completed the equal poll of queue one time to obtain the process of pending data, Decrease completing the system loss that causes in the polling procedure of queue, accelerate completing queue to be waited locate The acquisition process of the data of reason, improves the work efficiency of solid hard disk storage system.
It should be understood that for aforesaid each method embodiment, in order to be briefly described, therefore by its all table Stating as a series of combination of actions, but those skilled in the art should know, the present invention is by being retouched The restriction of the sequence of movement stated because according to the present invention, some step can use other orders or with Shi Jinhang.Secondly, those skilled in the art also should know, embodiment described in this description all belongs to In preferred embodiment, necessary to involved action and the unit not necessarily present invention.
In the above-described embodiments, the description to each embodiment all emphasizes particularly on different fields, and does not has in certain embodiment The part described in detail, may refer to the associated description of other embodiments.
Last it is noted that above example is only in order to illustrate technical scheme, rather than to it Limit；Although the present invention being described in detail with reference to previous embodiment, the ordinary skill of this area Personnel it is understood that the technical scheme described in foregoing embodiments still can be modified by it, or Person carries out equivalent to wherein portion of techniques feature；And these amendments or replacement, do not make corresponding skill The essence of art scheme departs from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (14)

1. a data processing method based on solid hard disk storage system, it is characterised in that described solid State hard disk storage system includes storage device, processor and at least two solid state hard disc, described at least two Solid state hard disc includes that the first solid state hard disc, described first solid state hard disc include solid-state hard disk controller and storage Granule, described first solid state hard disc is by submitting queue to and completing queue and behaviour read and write alternately by described processor Make request and pending data, described storage device stores described submission queue and described completes team Row, described data processing method includes:
Described solid-state hard disk controller is according to the read-write operation request in described submission queue, by accessing institute State storage granule and obtain the pending data that described read-write operation request is corresponding, please by described read-write operation The pending data asking corresponding complete queue described in being stored in；
Update first and complete quene state table so that described first completes the content that quene state table is stored Instruction: described in complete queue storage and have pending data, described first completes quene state table is stored Content include: corresponding the completing in queue of each solid state hard disc in described at least two solid state hard disc Whether storage has pending data, and described first completes quene state table is stored in described storage device；
Described renewal first completes quene state table and specifically includes following operation S1 to S4:
S1: complete the first content that quene state table is stored by described first, is stored in second and completes queue State table；
S2: complete, by described second, the content that quene state table is stored, be stored in the 3rd and complete quene state Table, and update the described 3rd and complete the content that quene state table is stored so that the described 3rd completes queue The instruction of content that state table is stored: described in complete queue storage and have described pending data；
S3: judge that described first completes the second content and described second that quene state table stored and complete team The content that row state table is stored is the most identical；
S4: if identical, then complete the content that quene state table stored by the described 3rd and be stored in described One completes quene state table；If it is not the same, the most again perform described operation S1 to S3, until described One completes the second content and described second that quene state table stored completes what quene state table was stored Content is identical.
2. data processing method as claimed in claim 1, it is characterised in that described first content includes Described first completes all the elements that quene state table is stored, or described first completes quene state table institute Store completes, to described, the content that queue is relevant.
3. data processing method as claimed in claim 1 or 2, it is characterised in that described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, described atomic operation instruction Atomic_cas bag Include parameter: described first completes the address of quene state table, and described second completes quene state table is stored Content, and the described 3rd complete the content that quene state table is stored.
4. a solid state hard disc, it is characterised in that described solid state hard disc is used for solid hard disk storage system, Described solid hard disk storage system includes solid state hard disc described in storage device, processor and at least two, institute State solid state hard disc include solid-state hard disk controller and storage granule, described solid state hard disc by submit to queue and Complete queue and the mutual read-write operation request of described processor and pending data, in described storage device Storing described submission queue and described complete queue, described solid state hard disc includes:
It is stored in unit, for obtaining the pending data that read-write operation request is corresponding, described pending According to data, the described read-write operation request in described submission queue accesses what described storage granule obtained, Queue is completed described in pending data corresponding for described read-write operation request being stored in；
Updating block, completes quene state table for updating first so that described first completes quene state The instruction of content that table is stored: described in complete queue storage and have pending data, described first completes team The content that row state table is stored includes: each solid state hard disc pair in described at least two solid state hard disc That answers completes whether to store in queue pending data, and described first completes quene state table is stored in Described storage device；
Described updating block is specifically for following operation S1 to S4:
S1: complete the first content that quene state table is stored by described first, is stored in second and completes queue State table；
S2: complete, by described second, the content that quene state table is stored, be stored in the 3rd and complete quene state Table, and update the described 3rd and complete the content that quene state table is stored so that the described 3rd completes queue The instruction of content that state table is stored: described in complete queue storage and have described pending data；S3: sentence Disconnected described first completes the second content and described second that quene state table stored completes quene state table The content stored is the most identical；
S4: if identical, then complete the content that quene state table stored by the described 3rd and be stored in described One completes quene state table；If it is not the same, the most again perform described operation S1 to S3, until described One completes the second content and described second that quene state table stored completes what quene state table was stored Content is identical.
5. solid state hard disc as claimed in claim 4, it is characterised in that described first content includes described First completes all the elements that quene state table is stored, or described first completes quene state table and stored Complete, to described, the content that queue is relevant.
6. the solid state hard disc as described in claim 4 or 5, it is characterised in that described operation S3 and S4 has Body is completed by atomic operation instruction Atomic_cas, and described atomic operation instruction Atomic_cas includes ginseng Number: described first completes the address of quene state table, described second complete that quene state table stored interior Hold, and the described 3rd completes the content that quene state table is stored.
7. a data processing method based on solid hard disk storage system, it is characterised in that described solid State hard disk storage system includes storage device, processor and at least two solid state hard disc, described at least two Each solid state hard disc in solid state hard disc is by submitting queue to and to complete queue mutual with described processor Read-write operation and pending data, store described submission queue and described complete in described storage device Queue, described data processing method includes:
Described processor completes, according to first, the content that quene state table is stored, and determines pending completing Queue, the described pending queue that completes is: storage has a queue that completes of pending data, described the One completes the content that quene state table stored includes: each in described at least two solid state hard disc is solid What state hard disk was corresponding completes whether to store in queue pending data, and described first completes quene state Table is stored in described storage device；
Obtain the described pending described pending data completing to store in queue, wait to locate described in process The data of reason；
Described complete the content that quene state table is stored according to first, determine and pending complete queue tool Body includes: updates the 5th and completes the content that quene state table is stored so that the described 5th completes queue shape The content instruction that state table is stored: each solid state hard disc in described at least two solid state hard disc is corresponding Complete queue and the most do not store pending data；
Content that quene state table stored is completed by the described 5th first complete with described by exchange instruction Become the content exchange that quene state table is stored；
According to the described 5th completing the content that quene state table is stored after exchange, determine pending complete Become queue.
8. data processing method as claimed in claim 7, it is characterised in that described exchange instruction is former Child-operation instruction lock xchg, described atomic operation instruction lock xchg include parameter: the described 5th completes The address of quene state table, described first completes the address of quene state table.
9. a data processing method based on solid hard disk storage system, it is characterised in that described solid State hard disk storage system includes storage device, processor and at least two solid state hard disc, described at least two Each solid state hard disc in solid state hard disc is by submitting queue to and to complete queue mutual with described processor Read-write operation and pending data, store described submission queue and described complete in described storage device Queue, described data processing method includes:
Described processor completes, according to first, the content that quene state table is stored, and determines pending completing Queue, the described pending queue that completes is: storage has a queue that completes of pending data, described the One completes the content that quene state table stored includes: each in described at least two solid state hard disc is solid What state hard disk was corresponding completes whether to store in queue pending data, and described first completes quene state Table is stored in described storage device；
Obtain the described pending described pending data completing to store in queue, wait to locate described in process The data of reason；
Described complete the content that quene state table is stored according to first, determine and pending complete queue tool Body includes:
Complete, by described first, the content that quene state table is stored, be stored in the 6th and complete quene state table, Complete quene state table to lock described first；
Complete, according to the described 6th, the content that quene state table is stored, determine and pending complete queue；
Update described first and complete the content that quene state table is stored so that described first completes queue shape The content instruction that state table is stored: each solid state hard disc in described at least two solid state hard disc is corresponding Complete queue and the most do not store pending data, complete quene state table by described first and unlock.
10. a data processing equipment, it is characterised in that described data processing equipment is used for solid state hard disc Storage system, described solid hard disk storage system includes storage device, described data processing equipment and at least Two solid state hard discs, each solid state hard disc in described at least two solid state hard disc by submit to queue and Complete queue and the mutual read-write operation of described data processing equipment and pending data, described storage device In store described submission queue and described complete queue, described data processing equipment includes:
Confirmation unit, for completing, according to first, the content that quene state table is stored, determines pending Completing queue, the described pending queue that completes is: storage has the queue that completes of pending data, institute State first to complete the content that quene state table stored and include: each in described at least two solid state hard disc What individual solid state hard disc was corresponding completes whether to store in queue pending data, and described first completes queue State table is stored in described storage device；
Processing unit, for obtaining the described pending described pending data completing to store in queue, Process described pending data；
Described confirmation unit specifically for: update and the 5th complete the content that quene state table is stored so that Described 5th completes the content instruction that quene state table stored: every in described at least two solid state hard disc The queue that completes that one solid state hard disc is corresponding does not the most store pending data；
Content that quene state table stored is completed by the described 5th first complete with described by exchange instruction Become the content exchange that quene state table is stored；
According to the described 5th completing the content that quene state table is stored after exchange, determine pending complete Become queue.
11. data processing equipments as claimed in claim 10, it is characterised in that described exchange instruction is Atomic operation instruction lock xchg, described atomic operation instruction lock xchg include parameter: described 5th complete Becoming the address of quene state table, described first completes the address of quene state table.
12. 1 kinds of data processing equipments, it is characterised in that described data processing equipment is used for solid state hard disc Storage system, described solid hard disk storage system includes storage device, described data processing equipment and at least Two solid state hard discs, each solid state hard disc in described at least two solid state hard disc by submit to queue and Complete queue and the mutual read-write operation of described data processing equipment and pending data, described storage device In store described submission queue and described complete queue, described data processing equipment includes:
Confirmation unit, for completing, according to first, the content that quene state table is stored, determines pending Completing queue, the described pending queue that completes is: storage has the queue that completes of pending data, institute State first to complete the content that quene state table stored and include: each in described at least two solid state hard disc What individual solid state hard disc was corresponding completes whether to store in queue pending data, and described first completes queue State table is stored in described storage device；
Processing unit, for obtaining the described pending described pending data completing to store in queue, Process described pending data；
Described confirmation unit specifically for:
Complete, by described first, the content that quene state table is stored, be stored in the 6th and complete quene state table, Complete quene state table to lock described first；
Complete, according to the described 6th, the content that quene state table is stored, determine and pending complete queue；
Update described first and complete the content that quene state table is stored so that described first completes queue shape The content instruction that state table is stored: each solid state hard disc in described at least two solid state hard disc is corresponding Complete queue and the most do not store pending data, complete quene state table by described first and unlock.
13. 1 kinds of solid hard disk storage systems, it is characterised in that described solid hard disk storage system includes: At least two solid state hard disc as described in any one of claim 4 to 6, as described in claim 10 or 11 Data processing equipment, storage device；
What described solid state hard disc was corresponding complete queue is stored in described storage device；
Set up logical between described solid state hard disc, described data processing equipment, described storage device by bus Letter.
14. 1 kinds of solid hard disk storage systems, it is characterised in that described solid hard disk storage system includes: At least two solid state hard disc as described in any one of claim 4 to 6, data as claimed in claim 12 Processing means, storage device；
What described solid state hard disc was corresponding complete queue is stored in described storage device；
Set up logical between described solid state hard disc, described data processing equipment, described storage device by bus Letter.
CN201410766796.1A 2014-12-12 2014-12-12 Data processing method based on solid hard disk storage system, device and system Active CN104407820B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410766796.1A CN104407820B (en) 2014-12-12 2014-12-12 Data processing method based on solid hard disk storage system, device and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410766796.1A CN104407820B (en) 2014-12-12 2014-12-12 Data processing method based on solid hard disk storage system, device and system

Publications (2)

Publication Number Publication Date
CN104407820A CN104407820A (en) 2015-03-11
CN104407820B true CN104407820B (en) 2016-08-17

Family

ID=52645453

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410766796.1A Active CN104407820B (en) 2014-12-12 2014-12-12 Data processing method based on solid hard disk storage system, device and system

Country Status (1)

Country Link
CN (1) CN104407820B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106484549B (en) * 2015-08-31 2019-05-10 华为技术有限公司 A kind of exchange method, NVMe equipment, HOST and physical machine system
CN106527959B (en) * 2015-09-10 2019-07-26 阿里巴巴集团控股有限公司 Refresh the processing method and equipment of disk input output request
CN107346265B (en) * 2016-05-05 2021-05-18 北京忆恒创源科技有限公司 Method and device for realizing QoS
CN107562669B (en) * 2016-06-30 2020-04-07 北京忆芯科技有限公司 NVMe protocol command processing method, device and system
CN107818056B (en) * 2016-09-14 2021-09-07 华为技术有限公司 Queue management method and device
CN108628760B (en) * 2017-03-16 2021-05-18 北京忆恒创源科技有限公司 Method and device for atomic write command

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1431803A (en) * 2002-01-07 2003-07-23 日本电气株式会社 Nod device and packing transmitting control method
CN101621478A (en) * 2009-08-07 2010-01-06 中兴通讯股份有限公司 Method and device for array dispatch

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9467512B2 (en) * 2012-01-17 2016-10-11 Intel Corporation Techniques for remote client access to a storage medium coupled with a server

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1431803A (en) * 2002-01-07 2003-07-23 日本电气株式会社 Nod device and packing transmitting control method
CN101621478A (en) * 2009-08-07 2010-01-06 中兴通讯股份有限公司 Method and device for array dispatch

Also Published As

Publication number Publication date
CN104407820A (en) 2015-03-11

Similar Documents

Publication Publication Date Title
CN104407820B (en) Data processing method based on solid hard disk storage system, device and system
DE112013000601T5 (en) Command confirmation techniques for accessing a storage device by a remote client
JP2019083000A5 (en)
US11119691B1 (en) Method and apparatus to perform a function level reset in a memory controller
US10282103B1 (en) Method and apparatus to delete a command queue
CN104991821B (en) method and device for processing monitoring tasks in batches
CN105843937A (en) Data processing method and device
CN108694076A (en) Multinode storage operation
CN107193761B (en) Method and device for queue priority arbitration
US10732841B2 (en) Tracking ownership of memory in a data processing system through use of a memory monitor
CN108459824A (en) A kind of data modification write method and device
US20090198920A1 (en) Processing Units Within a Multiprocessor System Adapted to Support Memory Locks
CN107368426B (en) Test method and test device
CN109388485A (en) A kind of processing method, device, equipment and the storage medium of task execution thread
US10235215B2 (en) Memory lock mechanism for a multiprocessor system
CN107277022A (en) Processes Tag method and device
CN116149559A (en) Queue processing method, device, server, electronic equipment and storage medium
CN109656730B (en) Cache access method and device
CN108628760A (en) The method and apparatus of atom write order
US8214603B2 (en) Method and apparatus for handling multiple memory requests within a multiprocessor system
CN106844234B (en) Data writing method and device and double-active system
US20090198916A1 (en) Method and Apparatus for Supporting Low-Overhead Memory Locks Within a Multiprocessor System
CN108121774A (en) A kind of tables of data backup method and terminal device
CN108628761A (en) Atomic commands execute method and apparatus
US8271439B2 (en) Efficient synchronised updates to a data record in a data store

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant