CN104407820A - Solid state disk storage system based data processing method, device and system - Google Patents
Solid state disk storage system based data processing method, device and system Download PDFInfo
- Publication number
- CN104407820A CN104407820A CN201410766796.1A CN201410766796A CN104407820A CN 104407820 A CN104407820 A CN 104407820A CN 201410766796 A CN201410766796 A CN 201410766796A CN 104407820 A CN104407820 A CN 104407820A
- Authority
- CN
- China
- Prior art keywords
- complete
- state table
- quene state
- content
- quene
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
The embodiment of the invention discloses a solid state disk storage system based data processing method. The solid state disk storage system based data processing method comprises the steps that solid state disks obtain data to be processed and storing the data to be processed into a completion queue; a first completion queue state table is updated to contents stored in the first completion queue state table to indicate that the data to be processed are stored in the completion queue, wherein the contents stored in the first completion queue state table include the data to be processed, stored in the completion queues corresponding to all solid state disk. By means of the data processing method, a processor can accurately access the completion queues stored with the data to be processed through the completion queue state table, and system loss caused in the completion queue polling process of the processor is reduced.
Description
Technical field
The present invention relates to computer memory technical field, particularly relate to based on the data processing method of solid hard disk storage system, device and system.
Background technology
Existing solid state hard disc (Solid State Drive is called for short SSD) mainly comprises two parts: store particle, for storing data; Solid-state hard disk controller, is storing the data in particle for managed storage, and with other devices communicatings such as processor.As shown in Figure 1, solid hard disk storage system includes processor, solid state hard disc, submission queue (Submission Queue is called for short SQ) and completes queue (Comp-letion Queue is called for short CQ).Wherein, SQ is for storing the pending read-write operation request of solid state hard disc, and CQ is for storing that solid state hard disc completes according to read-write operation request, that processor is pending data.
The process that processor initiates read-write operation request to solid state hard disc is as follows: 1, processor sends read-write operation request to SQ; 2, pending read-write operation request is had in processor notice solid-state hard disk controller SQ; 3, solid-state hard disk controller obtains pending read-write operation request from SQ; 4, after solid state hard disc performs this read-write operation request, corresponding pending data are obtained, and by these pending data write CQ; 5, pending data are had in solid-state hard disk controller notification processor CQ; 6, processor obtains pending data from CQ, and completes data processing.In step 4, solid-state hard disk controller is after writing CQ by pending data, look-at-me can be sent in steps of 5 to processor, processor is made to interrupt current task to perform step 6, also look-at-me can not be sent to processor, then processor needs timing to inquire CQ, to obtain data pending in CQ, if and adopt look-at-me in step 5, because in solid state hard disc disposal system, the frequency of read-write operation request is higher, therefore the occurrence frequency of look-at-me is also higher, causes the interruption expense of processor also to promote thereupon.
Each solid state hard disc in existing solid hard disk storage system generally has the corresponding processor of a CQ, when solid hard disk storage system comprises multiple solid state hard disc, then processor can corresponding multiple CQ, if the solid-state hard disk controller of each solid state hard disc does not adopt look-at-me notification processor to access CQ, then processor needs the multiple CQ of automatic regular polling, to obtain the pending data that each solid state hard disc processor is sent, the polling procedure of this CQ will cause the larger expense of solid hard disk storage system.
Summary of the invention
For above-mentioned prior art, the present invention is proposed, the problem that utilize the present invention to solve solid hard disk storage system expense that in prior art, processor poll CQ causes is excessive.
The first aspect of the embodiment of the present invention provides a kind of data processing method based on solid hard disk storage system, and it is characterized in that, described solid hard disk storage system comprises at least two solid state hard discs, and described data processing method comprises:
Solid state hard disc obtains pending data, by described pending data stored in completing queue;
Described solid state hard disc upgrades first and completes quene state table, make described first to complete content instruction that quene state table stores: described in complete queue and store described pending data, described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data.
In conjunction with first aspect, in the first implementation of first aspect, described renewal first completes quene state table and specifically comprises following operation S1 to S4:
S1: complete the first content that quene state table stores by described first, complete quene state table stored in second;
S2: complete the content that quene state table stores by described second, quene state table is completed stored in the 3rd, and upgrade the described 3rd and complete the content that quene state table stores, make the described 3rd to complete content instruction that quene state table stores: described in complete queue and store described pending data;
S3: judge that described first completes the second content and described second that quene state table stores whether complete the content that quene state table stores identical;
S4: if identical, then complete the content that quene state table stores and complete quene state table stored in described first by the described 3rd; If not identical, then again perform described operation S1 to S3, until described first completes the second content and described second that quene state table stores to complete the content that quene state table stores identical.
In conjunction with the first implementation of first aspect, in the second implementation of first aspect, described first content comprises described first and completes all the elements that quene state table stores, or described first complete that quene state table stores complete the relevant content of queue to described.
In conjunction with the first implementation and the second implementation of first aspect, in the third implementation of first aspect, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, described atomic operation instruction Atomic_cas comprises parameter: the described first address completing quene state table, described second completes the content that quene state table stores, and the described 3rd completes the content that quene state table stores.
In conjunction with first aspect, in the 4th kind of implementation of first aspect, described renewal first completes quene state table and specifically comprises:
Complete the content that quene state table stores by described first, complete quene state table stored in the 4th, complete quene state table by described first and lock;
Upgrade the described 4th and complete quene state table, make the described 4th to complete content instruction that quene state table stores: described in complete queue and store described pending data;
Complete the content that quene state table stores by the described 4th and complete quene state table stored in described first, complete quene state table by described first and unlock.
The second aspect of the embodiment of the present invention provides a kind of solid state hard disc, it is characterized in that, described solid state hard disc is used for solid hard disk storage system, and described solid hard disk storage system comprises at least two described solid state hard discs, and described solid state hard disc comprises:
Stored in unit, for obtaining pending data, by described pending data stored in completing queue;
Updating block, quene state table is completed for upgrading first, make described first to complete content instruction that quene state table stores: described in complete queue and store described pending data, described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data.
In conjunction with second aspect, in the first implementation of second aspect, described updating block is specifically for operating S1 to S4 as follows:
S1: complete the first content that quene state table stores by described first, complete quene state table stored in second;
S2: complete the content that quene state table stores by described second, quene state table is completed stored in the 3rd, and upgrade the described 3rd and complete the content that quene state table stores, make the described 3rd to complete content instruction that quene state table stores: described in complete queue and store described pending data;
S3: judge that described first completes the second content and described second that quene state table stores whether complete the content that quene state table stores identical;
S4: if identical, then complete the content that quene state table stores and complete quene state table stored in described first by the described 3rd; If not identical, then again perform described operation S1 to S3, until described first completes the second content and described second that quene state table stores to complete the content that quene state table stores identical.
In conjunction with the first implementation of second aspect, in the second implementation of second aspect, described first content comprises described first and completes all the elements that quene state table stores, or described first complete that quene state table stores complete the relevant content of queue to described.
In conjunction with the first implementation and the second implementation of second aspect, in the third implementation of second aspect, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, described atomic operation instruction Atomic_cas comprises parameter: the described first address completing quene state table, described second completes the content that quene state table stores, and the described 3rd completes the content that quene state table stores.
In conjunction with second aspect, in the 4th kind of implementation of second aspect, described updating block specifically for:
Complete the content that quene state table stores by described first, complete quene state table stored in the 4th, complete quene state table by described first and lock;
Upgrade the described 4th and complete quene state table, make the described 4th to complete content instruction that quene state table stores: described in complete queue and store described pending data;
Complete the content that quene state table stores by the described 4th and complete quene state table stored in described first, complete quene state table by described first and unlock.
The third aspect of the embodiment of the present invention provides a kind of data processing method based on solid hard disk storage system, and it is characterized in that, described solid hard disk storage system comprises at least two solid state hard discs, and described data processing method comprises:
The content that quene state table stores is completed according to first, determine pending to complete queue, the described pending queue that completes is: what store pending data completes queue, and described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data;
Obtain and describedly pending complete the described pending data stored in queue, process described pending data.
In conjunction with the third aspect, in the first implementation of the third aspect, describedly complete according to first the content that quene state table stores, determine that the pending queue that completes specifically comprises:
Upgrade the 5th and complete the content that quene state table stores, make the described 5th to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data;
To complete by exchange instruction content and described first that quene state table stores by the described 5th and complete the content exchange that quene state table stores;
Complete according to the described 5th after exchanging the content that quene state table stores, determine pending to complete queue.
In conjunction with the first implementation of the third aspect, in the second implementation of the third aspect, described exchange instruction is atomic operation instruction lock xchg, described atomic operation instruction lock xchg comprises parameter: the described 5th address completing quene state table, the described first address completing quene state table.
In conjunction with the third aspect, described in the third implementation of the third aspect, complete according to first the content that quene state table stores, determine that the pending queue that completes specifically comprises:
Complete the content that quene state table stores by described first, complete quene state table stored in the 6th, complete quene state table by described first and lock;
Complete according to the described 6th the content that quene state table stores, determine pending to complete queue;
Upgrade described first and complete the content that quene state table stores, make described first to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data, completes quene state table add unblock by described first.
The fourth aspect of the embodiment of the present invention provides a kind of data processing equipment, it is characterized in that, described data processing equipment is used for solid hard disk storage system, and described solid hard disk storage system comprises at least two solid state hard discs, and described data processing equipment comprises:
Confirmation unit, for completing according to first the content that quene state table stores, determine pending to complete queue, the described pending queue that completes is: what store pending data completes queue, and described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data;
Processing unit, describedly pending completing the described pending data stored in queue for obtaining, processing described pending data.
In conjunction with fourth aspect, in the first implementation of fourth aspect, described confirmation unit specifically for:
Upgrade the 5th and complete the content that quene state table stores, make the described 5th to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data;
To complete by exchange instruction content and described first that quene state table stores by the described 5th and complete the content exchange that quene state table stores;
Complete according to the described 5th after exchanging the content that quene state table stores, determine pending to complete queue.
In conjunction with the first implementation of fourth aspect, in the second implementation of fourth aspect, described exchange instruction is atomic operation instruction lock xchg, described atomic operation instruction lock xchg comprises parameter: the described 5th address completing quene state table, the described first address completing quene state table.
In conjunction with fourth aspect, in the third implementation of fourth aspect, described confirmation unit specifically for:
Complete the content that quene state table stores by described first, complete quene state table stored in the 6th, complete quene state table by described first and lock;
Complete according to the described 6th the content that quene state table stores, determine pending to complete queue;
Upgrade described first and complete the content that quene state table stores, make described first to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data, completes quene state table add unblock by described first.
5th aspect of the embodiment of the present invention provides a kind of solid hard disk storage system, described solid hard disk storage system comprises: the solid state hard disc as described at least two second aspects as the embodiment of the present invention are arbitrary, data processing equipment as described in fourth aspect as the embodiment of the present invention is arbitrary, memory device;
What described solid state hard disc was corresponding complete queue is stored in described memory device;
Communication is set up by bus between described solid state hard disc, described data processing equipment, described memory device.
The embodiment of the present invention provides a kind of data processing method based on solid hard disk storage system, solid state hard disc by pending data stored in after completing queue, renewal completes quene state table, and this completes in quene state table to have recorded in solid hard disk storage system each completes in queue whether store pending data.By this data processing method, processor is when completing queue and conducting interviews to it, to need not all complete the equal poll of queue one time to obtain pending data, but by complete quene state table can accurately know store pending data complete queue, and then accurately access these complete queue to obtain pending data, decreasing processor to completing the system loss caused in the polling procedure of queue, accelerating processor to the acquisition process completing data pending in queue.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, do to the accompanying drawing used required in embodiment to introduce simply below, apparent, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
The composition structural representation of solid hard disk storage system of Fig. 1 for applying in prior art;
The composition structural representation of the solid hard disk storage system that Fig. 2 applies for the embodiment of the present invention;
The schematic flow sheet of the data processing method that Fig. 3 applies for the inventive method embodiment 1;
The composition structural representation of another solid hard disk storage system that Fig. 4 applies for the embodiment of the present invention;
The composition structural representation of the another solid hard disk storage system that Fig. 5 applies for the embodiment of the present invention;
The schematic flow sheet of the data processing method that Fig. 6 applies for the inventive method embodiment 2;
The composition structural representation of the solid state hard disc that Fig. 7 applies for present device embodiment 1;
The composition structural representation of the data processing equipment that Fig. 8 applies for present device embodiment 2;
The composition structural representation of the data processing equipment that Fig. 9 applies for present device embodiment 3.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Term " processor " in this instructions refers generally to the processing unit performing data processing task, can be and be referred to as processor core or process core, it can also be a kind of integrated circuit (IC) chip with the processing power of signal, such as general processor, digital signal processor (Digital Signal Processor, DSP), special IC (Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field Programmable Gate Array, FPGA) etc.
Term " solid-state hard disk controller " in this instructions refers generally to be integrated in solid state hard disc, to the equipment that the storage particle in solid state hard disc manages.
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 provides, this solid hard disk storage system comprises at least two solid state hard discs, i.e. solid state hard disc 204, solid state hard disc 210, solid state hard disc 204 comprises solid-state hard disk controller 206 and stores particle 208, and solid state hard disc 210 comprises solid-state hard disk controller 212 and stores particle 214.Processor 202, memory device 216, solid state hard disc 204 is communicated by bus 228 with solid state hard disc 210, wherein store quene state table 226 in memory device, each that have recorded in memory device in this table completes in queue whether store pending data, also store each in memory device submit queue to and complete queue, wherein the corresponding each processor of each solid state hard disc has one to complete queue and a submission queue, such as solid state hard disc 204 is by submitting queue 218 to and completing queue 222 and the mutual read-write operation request of processor 202 and pending data, solid state hard disc 210 is by submitting queue 220 to and completing queue 224 and the mutual read-write operation request of processor 202 and pending data.
It should be noted that, multiple processor may be comprised in actual solid hard disk storage system, then the corresponding each processor of each solid state hard disc all has one to submit to queue and one to complete queue, the memory location of quene state table 226 is completed in reality, submit to queue and each memory location completing queue can be same memory device with each, also can be different storage device, such as: complete quene state table 226 and can be stored in the register of processor 202, or be stored in be integrated in processor 202 memory device in, or be stored in the memory device that is integrated in solid state hard disc 204 or solid state hard disc 210, its concrete storage mode does not form restriction.
embodiment of the method 1
See Fig. 3, this method embodiment 1 is based on the solid hard disk storage system shown in Fig. 2, a kind of data processing method provided, should be noted that, the executive agent of this method embodiment is one of them solid state hard disc in the solid hard disk storage system shown in Fig. 2, and this method embodiment is taken as solid state hard disc 204 for convenience of describing, in fact, any one solid state hard disc in solid hard disk storage system all can embodiment to effectuate the present process, and data processing method comprises:
Step 402, solid state hard disc 204 obtains pending data, by pending data stored in completing queue 222.
Concrete, after processor 202 submits read-write operation request write to queue 218, notice solid state hard disc 204 is submitted in queue 218 pending read-write operation request.Solid-state hard disk controller 206 obtains the read-write operation request submitted in queue 218 according to this notice after, store particle 208 by access and obtain pending data corresponding to this read-write operation request, and by these pending data stored in completing queue 222.
Step 404, solid state hard disc 204 has upgraded quene state table 226, the content instruction that quene state table 226 is stored: complete queue 222 and store pending data, complete the content that quene state table 226 stores to comprise: what each solid state hard disc in solid hard disk storage system was corresponding completes in queue whether store pending data, in the solid hard disk storage system shown in Fig. 2, namely complete queue 222 and complete in queue 224 whether store pending data.
Concrete, table 1 completes a kind of implementation of quene state table 226 for this, queue number has been have recorded in table 1, to each of solid hard disk storage system completing queue, as this solid hard disk storage system comprises n solid state hard disc, namely comprise n and complete queue, so at least to comprise n capable for table 1, each completes queue number also to there being a store status mark, what indicate its correspondence completes in queue whether store pending data, for table 1, the queuing memory that completes that store status is designated " 1 " represents this storaging mark corresponding contains pending data, store status is designated " 0 " represents corresponding the completing in queue of this storaging mark and does not store pending data.If in step 402, solid state hard disc 204 by pending data stored in complete queue 222 queue number that completes in Table 1 be 1, and table 1 record for solid state hard disc 204 perform step 404 before state, then in step 404, solid state hard disc 204 needs renewal to complete quene state table 226, and the content making it record is converted to table 2 by table 1.
Should be noted that, each in this instructions completes quene state table, its content stored can be the as shown in table 1 corresponding relation completing queue number and store status and identify, also can be the data of n position, n now in solid hard disk storage system the corresponding relation completing queue and this n position is established, then this n-bit data can represent this n completes in queue whether store pending data, such as, when n is 8, complete in quene state table and only store " 00001010 ", solid state hard disc and processor can determine that second in this 8 bit data of establishing in advance and the 4th corresponding complete in queue, store pending data.
| Complete queue number | Store status identifies |
| 1 | 0 |
| 2 | 1 |
| … | |
| n | 0 |
Table 1
| Complete queue number | Store status identifies |
| 1 | 1 |
| 2 | 1 |
| … | |
| n | 0 |
Table 2
Due to multiple solid state hard disc may be comprised in solid hard disk storage system, therefore in reality, may occur that multiple solid state hard disc continuous access completes the situation of quene state table 226.Such as, solid state hard disc 204 by pending data stored in complete queue number be 8 complete queue after, the store status identification division completed in quene state table 226 is needed to be updated to " 00110001 " by " 00110000 ", due to the read-write operation of internal memory with 1 byte (8) for minimum operation unit, therefore solid state hard disc 204 cannot directly to complete queue number be 8 store status mark upgrade, solid state hard disc 204 needs " 00110000 " to fetch from completing quene state table 226 for this reason, again " 00110001 " is write back quene state table 226 after being updated to " 00110001 ", complete renewal, if at solid state hard disc 204 by " 00110000 " from after completing and fetching quene state table 226, period before " 00110001 " having been write back quene state table 226, the store status identification division completed in quene state table 226 is updated to " 10110000 " by solid state hard disc 210, then " 00110001 " can have been write back quene state table 226 by solid state hard disc 204 subsequently, override " 10110000 ", solid state hard disc 210 is caused to lose efficacy to the renewal completing quene state table 226, then complete quene state table 226 and correctly cannot record in solid hard disk storage system that each completes the situation that queue stores pending data.
Therefore, optionally, example in undertaking, as Fig. 4, in step 404, solid state hard disc 204 to the renewal process completing quene state table 226 can be:
S1: solid state hard disc 204, by the current content completing quene state table 226 and store, stored in completing quene state table 228, now, completing the content that stores in quene state table 226 and completing the content stored in quene state table 228 and be " 00110000 ".
S2: the content that solid state hard disc 204 will complete quene state table 228 and stores, stored in completing quene state table 230, now, completing the content stored in quene state table 228,230 and being " 00110000 "; Solid state hard disc 204 has upgraded quene state table 230, such as solid state hard disc 204 pending data have been incorporated queue number be 1 complete queue, then solid state hard disc 204 will complete quene state table 230 and will be updated to " 10110000 ", concrete, the update method completing quene state table 230 for being carried out or computing in " 00110000 " and " 10000000 ", can be obtained " 10110000 " herein.
S3: solid state hard disc 204 judges, after S2 is finished, current time completes content that quene state table 228 stores and whether complete the content that quene state table 226 stores identical.
S4: if it is identical with completing the content that quene state table 226 stores to complete content that quene state table 228 stores in S3, illustrate in S1 and S2 implementation, upgrade completing quene state table 226 without other solid state hard discs, then " 10110000 " have been write back quene state table 226 by solid state hard disc 204, complete renewal, if both are not identical, illustrate in S1 and S2 implementation, other solid state hard discs are had to upgrade completing quene state table 226, such as now completing the content that quene state table 226 stores is " 00110011 ", then " 10110000 " now can not have been write back quene state table 226 by solid state hard disc 204, but re-execute step S1 to S3, namely " 00110011 " is fetched stored in completing quene state table 228, quene state table 230 will be completed be updated to " 10110011 ", again rejudge and currently complete quene state table 226 and whether current to complete the content that quene state table 228 stores identical.Solid state hard disc 204 repeats step S1 to S3, until when it performs step S3, complete content that quene state table 226 stores identical with completing the content that quene state table 228 stores, solid state hard disc 204 has successfully upgraded quene state table 226.
Optionally, Atomic_cas instruction is supported in PCI Express bus specification, this instruction has three input parameters, i.e. Atomic_cas (the first address completing quene state table, second completes the content that quene state table stores, 3rd completes the content that quene state table stores), example in undertaking, solid state hard disc 204 in step s3, send Atomic_cas to bus and (complete the address of quene state table 226, complete the content that quene state table 228 stores, complete the content that quene state table 230 stores) instruction, then bus has judged the content that quene state table 228 stores, whether the content stored in the address of quene state table 226 is identical with completing, if identical, then the bus content that will complete quene state table 230 and store, according to the address completing quene state table 226, has write quene state table 226, has completed renewal, if not identical, then the current content stored in the address of quene state table 226 that completes is returned to solid state hard disc 204 by bus, and solid state hard disc 204 re-executes step S1 to S3.Simultaneously, because Atomic_cas instruction is originally as atomic operation, other solid state hard discs that then bus when performing Atomic_cas instruction, this bus configures cannot complete quene state table 226 by bus access, ensure that quene state table 226 correctly can record each and complete in queue whether store pending data.
Optionally, as Fig. 5, for having ensured that quene state table 226 correctly can record in solid hard disk storage system that each completes the situation that queue stores pending data.Solid state hard disc 204 can also perform following operation and complete renewal to completing quene state table 226: by the content completing quene state table 226 and store, stored in completing quene state table 234, will complete quene state table 226 and locking; Renewal completes quene state table 234, the content instruction that quene state table 234 is stored: complete queue 222 and store pending data; By completing content that quene state table 234 stores stored in completing quene state table 226, quene state table 226 will be completed and unlock.Wherein to complete quene state table 226 lock and unlocking operation and common memory latching operation similar, such as: for the memory headroom completed residing for quene state table 226 adds lock flag, solid state hard disc 204 by complete content that quene state table 226 stores read time, mark position will be locked for " locking " state, lock flag of being everlasting in reality uses " 1 " mark " to lock " state, solid state hard disc 204, by completing content that quene state table 234 stores stored in after completing quene state table 226, will lock mark position for " unblock " state.Solid state hard disc 204 adopts latching operation when reading and write completes quene state table 226, ensure that period completes quene state table 226 and cannot be revised by other solid state hard discs.
It should be noted that, in reality, solid hard disk storage system may comprise multiple processor and multiple solid state hard disc, such as, comprise 2 processors, 32 solid state hard discs, then solid state hard disc 1 is by completing queue 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, by completing queue 4 and processor 2 interaction data, the like.Always have 64 and complete queue, the store status identification division then completed in quene state table 226 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 that completes queue 2 corresponding has relation.
Therefore, optionally, solid state hard disc 204 is when performing each possibility in this method embodiment, can operate completing the full content that quene state table 226 stores, also can only operate for the partial content relevant to completing queue 222 completed in quene state table 226, such as complete quene state table and have recorded the state that 64 complete queue altogether, therefore at least comprise the space of 8 bytes, the store status mark wherein completing queue 222 has been arranged in the 1st byte of 8 bytes of quene state table 226, then solid state hard disc 204 is when performing this method embodiment, only need to operate this byte, such as this byte is locked, read, upgrade, unlocking operation, or aforementioned S1 to S4 is carried out to this byte operate, and need not whole 8 bytes completing quene state table 226 be operated.
It should be noted that, each step in this method embodiment does not form execution sequence relation successively, such as step 404 can perform with step 402 before, namely solid state hard disc 204 first upgrades completing quene state table 226, and then writes pending data to completing queue 222.
Above-mentionedly provide a kind of a kind of data processing method based on solid hard disk storage system, solid state hard disc in solid hard disk storage system by pending data stored in after completing queue, renewal completes quene state table, and this completes in quene state table to have recorded in solid hard disk storage system each completes in queue whether store pending data.By this data processing method, processor is when completing queue and conducting interviews to it, to need not all complete the equal poll of queue one time to obtain pending data, but by complete quene state table can accurately know store pending data complete queue, and then accurately access these complete queue to obtain pending data, this data processing method decreases processor to completing the system loss caused in the polling procedure of queue, accelerates processor to the acquisition process completing data pending in queue.
embodiment of the method 2
See Fig. 6, this method embodiment 2 is based on the solid hard disk storage system shown in Fig. 2, a kind of data processing method provided, should be noted that, the executive agent of this method embodiment is the processor 202 in the solid hard disk storage system shown in Fig. 2, in fact, when solid hard disk storage system comprises multiple processor, any one processor wherein all can embodiment to effectuate the present process, and data processing method comprises:
Step 602, processor 202 is according to the content completing quene state table 226 and store, determine pending to complete queue, the pending queue that completes is: what store pending data completes queue, complete the content that quene state table 226 stores to comprise: what each solid state hard disc in solid hard disk storage system was corresponding completes in queue whether store pending data, in the solid hard disk storage system shown in Fig. 2, namely complete queue 222 and complete in queue 224 whether store pending data.
Concrete, when each solid state hard disc in solid hard disk storage system does not adopt interrupt notification processor 202, processor 202 needs to access each at set intervals and completes queue to obtain the pending data wherein stored, before this, quene state table 226 first accessed by processor 202, and the state of queue is completed according to each wherein storage, that determines to store pending data completes queue.It should be noted that and complete consistent with embodiment of the method 1 of quene state table 226 in this method embodiment 2, its specific implementation details does not repeat them here.
Step 604, that determines in obtaining step 602 pending completes the pending data stored in queue, processes pending data.
Processor 202 have accessed quene state table 226 in step 602 and determine pending complete queue after, renewal is needed to complete quene state table 226, such as, the store status identification division completed in quene state table 226 is " 00110000 ", then processor 202 has learnt that queue number is 3 and to complete queue number be 4 complete in queue and store pending data, then processor 202 will be accessed these two in the next step and be completed queue and process storage pending data wherein, therefore complete and can not to record these two after quene state table 226 is accessed by processor 202 again and complete in queue and store pending data.Namely all complete queue all do not store pending data if the original state completing quene state table 226 is " 00000000 ", then complete after quene state table 226 accessed by processor 202 at every turn, need to be updated to " 00000000 " to start the record completing quene state of next round.But, because the solid hard disk storage system in this method embodiment comprises at least two solid state hard discs, if read quene state table 226 and renewal completes between quene state table 226 at processor 202, solid state hard disc is had to upgrade completing quene state table 226, when then next processor 202 has upgraded quene state table 226, will cover and this time upgrade, cause quene state table 226 correctly cannot record the state that each completes queue.
Therefore, optionally, as Fig. 4, processor 202 is in step 602 according to completing the content that quene state table 226 stores, determine that the pending queue that completes is specifically as follows: upgraded the content that quene state table 232 stores, the instruction of content that quene state table 232 is stored: what each solid state hard disc in solid hard disk storage system was corresponding complete queue does not all store pending data; Content that quene state table 232 stores and the content exchange completing quene state table 226 and store will be completed by exchange instruction; According to completing the content that quene state table 232 stores after exchanging, determine pending to complete queue.First processor 202 has upgraded quene state table 232, represent that queue does not store pending data as respectively completed " 0 " in quene state table in this solid hard disk storage system, 8 are had to complete quene state table 226, be " 00000000 " after then completing quene state table 232, this concrete update instruction can pass through instruction " mov ax, 0 " complete, ax has indicated the address of quene state table 232, processor 202 will be completed content that quene state table 232 stores by exchange instruction and complete the content exchange stored in quene state table 226 subsequently, example in undertaking, then complete in quene state table 232 and will store " 00110000 ", and complete in quene state table and will store " 00000000 ", processor 202 can be determined pending to complete queue according to completing content that quene state table 232 stores, complete the content stored described in quene state table 226 to be also updated to " 00000000 " simultaneously, namely be updated to and allly in solid hard disk storage system complete the original state that queue does not all store pending data.
Optionally, exchange instruction can for the atomic operation instruction lock xchg supported in PCI Express bus specification, and this instruction comprises two parameters: the address completing quene state table 232, completes the address of quene state table 226.Exchange instruction with lock prefix ensure that this exchange instruction the term of execution, completing quene state table 226 cannot be upgraded by solid state hard disc, ensure that quene state table 226 can accurate recording each complete the state of queue.
As Fig. 5, for ensureing that processor 202 correctly can be accessed and upgrade quene state table 226, processor 202 can also perform following operation: by the content completing quene state table 226 and store, stored in completing quene state table 236, will complete quene state table 226 and locking; According to the content completing quene state table 236 and store, determine pending to complete queue; Upgrade the content that quene state table 226 stores, the instruction of content that quene state table 226 is stored: what each solid state hard disc in solid hard disk storage system was corresponding complete queue does not all store pending data; Quene state table 226 will be completed and add unblock.Wherein to complete quene state table 226 lock and unlocking operation and common memory latching operation similar, such as: for the memory headroom completed residing for quene state table 226 adds lock flag, processor 202 by complete content that quene state table 226 stores read time, mark position will be locked for " locking " state, lock flag of being everlasting in reality uses " 1 " mark " to lock " state, after processor 202 has upgraded quene state table 226, mark position will be locked for " unblock " state.Processor 202 adopts latching operation when reading and renewal completes quene state table 226, ensure that period completes quene state table 226 and cannot be revised by solid state hard disc.
It should be noted that, in reality, solid hard disk storage system may comprise multiple processor and multiple solid state hard disc, such as comprise 2 processors, 32 solid state hard discs, then solid state hard disc 1-32 is respectively by completing queue 1-32 and processor 1 interaction data, and solid state hard disc 1-32 is respectively by completing queue 33-64 and processor 2 interaction data.Always have 64 and complete queue, the store status identification division then completed in quene state table 226 also has 64 bit data (8 bytes), but processor 1 in use actual only with complete in quene state table 226, the part corresponding with completing queue 1-32 has relation, therefore processor 1 is when performing each possibility in this method embodiment, actually can only to operate for the part relevant to oneself completed in quene state table 226, store status mark (32) such as completing queue 1-32 has taken 4 bytes in quene state table 226, then processor 1 is when performing this method embodiment, only need to operate these 4 bytes, such as this byte is locked, read, upgrade, unlocking operation, all the other 4 bytes completing quene state table 226 need not be operated.
Above-mentionedly provide a kind of a kind of data processing method based on solid hard disk storage system, before processor access in solid hard disk storage system completes queue, first access quene state table, determine to store pending data complete queue after, accurate access this complete queue, avoid and will all complete the equal poll of queue one time to obtain pending data, this data processing method decreases processor to completing the system loss caused in the polling procedure of queue, accelerates processor to the acquisition process completing data pending in queue.
It should be noted that, the two kinds of optional methods adopted when solid state hard disc has upgraded quene state table 226 in embodiment of the method 1, namely determined to carry out again after quene state table 226 is not modified upgrading and locking to completing quene state table 226, two kinds of optional methods adopting when processor has obtained quene state table 226 content and upgraded in 2 are implemented with method, namely adopt exchange instruction and lock to completing quene state table 226, the method that these two kinds of solid state hard discs perform and the method that two kinds of processors perform is actual can independent assortment, be not limited to solid state hard disc and the method performed by processor in Fig. 4, or the combination of solid state hard disc and the method performed by processor in Fig. 5.
apparatus embodiments 1
This apparatus embodiments 1 provides a kind of solid state hard disc 802, and as shown in Figure 7, this solid state hard disc 802 is actual can be solid state hard disc arbitrary in the solid hard disk storage system shown in Fig. 2 to its institutional framework schematic diagram, for solid state hard disc 204.
Solid state hard disc 802 comprises:
Stored in unit 804, for obtaining pending data, by pending data stored in completing queue 222.
Concrete, stored in step 402 and each possibility thereof in the actual manner of execution embodiment 1 of unit 804, do not repeat them here.
Updating block 806, for having upgraded quene state table 226, the content instruction that quene state table 226 is stored: complete queue 222 and store pending data, completes the content that quene state table 226 stores and comprises: what in solid hard disk storage system, each solid state hard disc was corresponding completes in queue whether store pending data.
Concrete, step 404 and each possibility thereof in the actual manner of execution embodiment 1 of updating block 804, do not repeat them here.
Above-mentionedly provide a kind of solid state hard disc, this solid state hard disc by pending data stored in after completing queue, renewal completes quene state table, and this completes in quene state table to have recorded in solid hard disk storage system each completes in queue whether store pending data.By this data processing method, processor is when completing queue and conducting interviews to it, to need not all complete the equal poll of queue one time to obtain pending data, but by complete quene state table can accurately know store pending data complete queue, and then accurately access these complete queue to obtain pending data, the use of this solid state hard disc decreases processor to completing the system loss caused in the polling procedure of queue, accelerates processor to the acquisition process completing data pending in queue.
apparatus embodiments 2
This apparatus embodiments 2 provides a kind of data processing equipment, its institutional framework schematic diagram as shown in Figure 8, this data processing equipment 1002 is actual can for the processor 202 in the solid hard disk storage system shown in Fig. 2, when solid hard disk storage system comprises multiple processor, this data processing equipment 1002 can be wherein arbitrary processor.
Data processing equipment 1002 comprises:
Confirmation unit 1004, for according to completing the content that quene state table 226 stores, determine pending to complete queue, the pending queue that completes is: what store pending data completes queue, completes the content that quene state table 226 stores and comprises: what each solid state hard disc in this solid hard disk storage system was corresponding completes in queue whether store pending data.
Concrete, step 602 and each possibility thereof in the actual manner of execution embodiment 2 of confirmation unit 1004, do not repeat them here.
Processing unit 1006, pending completes the pending data stored in queue for obtaining, and processes this pending data.
Concrete, step 604 and each possibility thereof in the actual manner of execution embodiment 2 of processing unit 1006, do not repeat them here.
Above-mentionedly provide a kind of data processing equipment, before queue accessed by this data processing equipment, first access quene state table, determine to store pending data complete queue after, accurate access this complete queue, avoiding all completing the equal poll of queue one time to obtain pending data, decreasing completing the system loss caused in the polling procedure of queue, accelerating the acquisition process to completing data pending in queue.
apparatus embodiments 3
This apparatus embodiments 3 provides a kind of data processing equipment 1202, apply to the solid hard disk storage system shown in Fig. 2, be specifically as follows processor 202 wherein, as shown in Figure 9, data processing equipment 1202 comprises processor 1204, storer 1206, communication interface 1208 and bus 1210 to its institutional framework schematic diagram.Wherein, processor 1204, storer 1206 and communication interface 1208 realize communication connection each other by bus 1210.
Processor 1204 can adopt general central processing unit (Central Processing Unit, CPU), microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuit, for performing relative program, to realize the technical scheme that aforementioned the inventive method embodiment 2 provides.
Storer 1206 can be ROM (read-only memory) (Read Only Memory, ROM), static storage device, dynamic memory or random access memory (Random Access Memory, RAM).Storer 1206 can store operating system and other application programs.When being realized the technical scheme that the embodiment of the present invention provides by software or firmware, be kept in storer 1206 for the program code realizing the technical scheme that preceding method embodiment 2 of the present invention provides, and performed by processor 1204.
Communication interface 1208 is in order to communicate with memory device 216 with each solid state hard disc.
Bus 1210 can comprise a path, between data processing equipment 1202 all parts, transmit information.
Hardware configuration shown in Fig. 9 and foregoing description are also applicable to the data processing equipment that present device embodiment 2 provides.
Above-mentionedly provide a kind of data processing equipment, before queue accessed by this data processing equipment, perform the program code being stored in its inside, first access quene state table, determine to store pending data complete queue after, accurately access this complete queue, avoid and will all complete the equal poll of queue one time to obtain pending data, decreasing completing the system loss caused in the polling procedure of queue, accelerating the acquisition process to completing data pending in queue.
system embodiment
Native system embodiment provides a kind of solid hard disk storage system, its composition structural representation as shown in Figure 2, comprise memory device 216, the solid state hard disc of bus 228, at least two as described in possibility arbitrary in apparatus embodiments 1, such as solid state hard disc 204 and solid state hard disc 210, also comprise the data processing equipment as described in possibility arbitrary in apparatus embodiments 2, such as processor 202.
What in solid hard disk storage system, each solid state hard disc was corresponding complete queue is stored in memory device 216; Complete quene state table 226 and can be stored in the memory device that memory device 216 can also be stored in processor 202 inside, or the memory device of a certain solid state hard disc inside, its concrete memory location does not form restriction; Each equipment in solid hard disk storage system is communicated by bus 228.
Concrete, following solid hard disk storage system carries out once 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 carries out read-write operation according to this read-write operation request to storage particle 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, pending data has been write queue 222, and has upgraded completing quene state table 226.
5. processor 202 is according to described data processing method arbitrary in embodiment of the method 2, has accessed quene state table 226 and has obtained the pending data in queue 222, having completed data processing.
Above-mentionedly provide a kind of solid hard disk storage system, solid state hard disc in this solid hard disk storage system is after having write queue by pending data, renewal completes quene state table, make in this solid hard disk storage system of quene state table record that each completes in queue the situation storing pending data, processor access in solid hard disk storage system is after this completes quene state table, only need to access store pending data complete queue.This solid hard disk storage system avoids processor in the process obtaining pending data, need will all to complete the equal poll of queue one time to obtain the process of pending data, decrease completing the system loss caused in the polling procedure of queue, accelerating the acquisition process to completing data pending in queue, improving the work efficiency of solid hard disk storage system.
It should be noted that: for aforesaid each embodiment of the method, in order to simple description, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not by the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in instructions all belongs to preferred embodiment, and involved action and unit might not be that the present invention is necessary.
In the above-described embodiments, the description of each embodiment is all emphasized particularly on different fields, in certain embodiment, there is no the part described in detail, can see the associated description of other embodiments.
Last it is noted that above embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to previous embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein portion of techniques feature; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (19)
1. based on a data processing method for solid hard disk storage system, it is characterized in that, described solid hard disk storage system comprises at least two solid state hard discs, and described data processing method comprises:
Obtain pending data, by described pending data stored in completing queue;
Upgrade first and complete quene state table, make described first to complete content instruction that quene state table stores: described in complete queue and store described pending data, described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data.
2. data processing method as claimed in claim 1, is characterized in that, described renewal first completes quene state table and specifically comprises following operation S1 to S4:
S1: complete the first content that quene state table stores by described first, complete quene state table stored in second;
S2: complete the content that quene state table stores by described second, quene state table is completed stored in the 3rd, and upgrade the described 3rd and complete the content that quene state table stores, make the described 3rd to complete content instruction that quene state table stores: described in complete queue and store described pending data;
S3: judge that described first completes the second content and described second that quene state table stores whether complete the content that quene state table stores identical;
S4: if identical, then complete the content that quene state table stores and complete quene state table stored in described first by the described 3rd; If not identical, then again perform described operation S1 to S3, until described first completes the second content and described second that quene state table stores to complete the content that quene state table stores identical.
3. data processing method as claimed in claim 2, is characterized in that, described first content comprises described first and completes all the elements that quene state table stores, or described first complete that quene state table stores complete the relevant content of queue to described.
4. data processing method as claimed in claim 2 or claim 3, it is characterized in that, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, described atomic operation instruction Atomic_cas comprises parameter: the described first address completing quene state table, described second completes the content that quene state table stores, and the described 3rd completes the content that quene state table stores.
5. data processing method as claimed in claim 1, it is characterized in that, described renewal first completes quene state table and specifically comprises:
Complete the content that quene state table stores by described first, complete quene state table stored in the 4th, complete quene state table by described first and lock;
Upgrade the described 4th and complete quene state table, make the described 4th to complete content instruction that quene state table stores: described in complete queue and store described pending data;
Complete the content that quene state table stores by the described 4th and complete quene state table stored in described first, complete quene state table by described first and unlock.
6. a solid state hard disc, is characterized in that, described solid state hard disc is used for solid hard disk storage system, and described solid hard disk storage system comprises at least two described solid state hard discs, and described solid state hard disc comprises:
Stored in unit, for obtaining pending data, by described pending data stored in completing queue;
Updating block, quene state table is completed for upgrading first, make described first to complete content instruction that quene state table stores: described in complete queue and store described pending data, described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data.
7. solid state hard disc as claimed in claim 6, it is characterized in that, described updating block is specifically for operating S1 to S4 as follows:
S1: complete the first content that quene state table stores by described first, complete quene state table stored in second;
S2: complete the content that quene state table stores by described second, quene state table is completed stored in the 3rd, and upgrade the described 3rd and complete the content that quene state table stores, make the described 3rd to complete content instruction that quene state table stores: described in complete queue and store described pending data;
S3: judge that described first completes the second content and described second that quene state table stores whether complete the content that quene state table stores identical;
S4: if identical, then complete the content that quene state table stores and complete quene state table stored in described first by the described 3rd; If not identical, then again perform described operation S1 to S3, until described first completes the second content and described second that quene state table stores to complete the content that quene state table stores identical.
8. solid state hard disc as claimed in claim 7, is characterized in that, described first content comprises described first and completes all the elements that quene state table stores, or described first complete that quene state table stores complete the relevant content of queue to described.
9. solid state hard disc as claimed in claim 7 or 8, it is characterized in that, described operation S3 and S4 completes especially by atomic operation instruction Atomic_cas, described atomic operation instruction Atomic_cas comprises parameter: the described first address completing quene state table, described second completes the content that quene state table stores, and the described 3rd completes the content that quene state table stores.
10. solid state hard disc as claimed in claim 6, is characterized in that, described updating block specifically for:
Complete the content that quene state table stores by described first, complete quene state table stored in the 4th, complete quene state table by described first and lock;
Upgrade the described 4th and complete quene state table, make the described 4th to complete content instruction that quene state table stores: described in complete queue and store described pending data;
Complete the content that quene state table stores by the described 4th and complete quene state table stored in described first, complete quene state table by described first and unlock.
11. 1 kinds, based on the data processing method of solid hard disk storage system, is characterized in that, described solid hard disk storage system comprises at least two solid state hard discs, and described data processing method comprises:
The content that quene state table stores is completed according to first, determine pending to complete queue, the described pending queue that completes is: what store pending data completes queue, and described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data;
Obtain and describedly pending complete the described pending data stored in queue, process described pending data.
12. data processing methods as claimed in claim 11, is characterized in that, describedly complete according to first the content that quene state table stores, and determine that the pending queue that completes specifically comprises:
Upgrade the 5th and complete the content that quene state table stores, make the described 5th to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data;
To complete by exchange instruction content and described first that quene state table stores by the described 5th and complete the content exchange that quene state table stores;
Complete according to the described 5th after exchanging the content that quene state table stores, determine pending to complete queue.
13. data processing methods as claimed in claim 12, it is characterized in that, described exchange instruction is atomic operation instruction lock xchg, and described atomic operation instruction lock xchg comprises parameter: the described 5th address completing quene state table, the described first address completing quene state table.
14. data processing methods as claimed in claim 11, is characterized in that, describedly complete according to first the content that quene state table stores, and determine that the pending queue that completes specifically comprises:
Complete the content that quene state table stores by described first, complete quene state table stored in the 6th, complete quene state table by described first and lock;
Complete according to the described 6th the content that quene state table stores, determine pending to complete queue;
Upgrade described first and complete the content that quene state table stores, make described first to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data, completes quene state table add unblock by described first.
15. 1 kinds of data processing equipments, is characterized in that, described data processing equipment is used for solid hard disk storage system, and described solid hard disk storage system comprises at least two solid state hard discs, and described data processing equipment comprises:
Confirmation unit, for completing according to first the content that quene state table stores, determine pending to complete queue, the described pending queue that completes is: what store pending data completes queue, and described first completes the content that quene state table stores comprises: what each solid state hard disc in described at least two solid state hard discs was corresponding completes in queue whether store pending data;
Processing unit, describedly pending completing the described pending data stored in queue for obtaining, processing described pending data.
16. data processing equipments as claimed in claim 15, is characterized in that, described confirmation unit specifically for:
Upgrade the 5th and complete the content that quene state table stores, make the described 5th to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data;
To complete by exchange instruction content and described first that quene state table stores by the described 5th and complete the content exchange that quene state table stores;
Complete according to the described 5th after exchanging the content that quene state table stores, determine pending to complete queue.
17. data processing equipments as claimed in claim 16, it is characterized in that, described exchange instruction is atomic operation instruction lock xchg, and described atomic operation instruction lock xchg comprises parameter: the described 5th address completing quene state table, the described first address completing quene state table.
18. data processing equipments as claimed in claim 15, described confirmation unit specifically for:
Complete the content that quene state table stores by described first, complete quene state table stored in the 6th, complete quene state table by described first and lock;
Complete according to the described 6th the content that quene state table stores, determine pending to complete queue;
Upgrade described first and complete the content that quene state table stores, make described first to complete content instruction that quene state table stores: what each solid state hard disc in described at least two solid state hard discs was corresponding complete queue does not all store pending data, completes quene state table add unblock by described first.
19. 1 kinds of solid hard disk storage systems, is characterized in that, described solid hard disk storage system comprises: at least two solid state hard discs as described in claim 6 to 10, the data processing equipment as described in claim 15 to 18, memory device;
What described solid state hard disc was corresponding complete queue is stored in described memory device;
Communication is set up by bus between described solid state hard disc, described data processing equipment, described memory device.
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 true CN104407820A (en) | 2015-03-11 |
| CN104407820B 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) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106484549A (en) * | 2015-08-31 | 2017-03-08 | 华为技术有限公司 | A kind of exchange method, NVMe equipment, HOST and physical machine system |
| WO2017041673A1 (en) * | 2015-09-10 | 2017-03-16 | 阿里巴巴集团控股有限公司 | Processing method and device for flush input and output request of magnetic disk |
| CN107346265A (en) * | 2016-05-05 | 2017-11-14 | 北京忆恒创源科技有限公司 | Realize QoS method and apparatus |
| CN107818056A (en) * | 2016-09-14 | 2018-03-20 | 杭州华为数字技术有限公司 | A kind of queue management method and device |
| CN108628760A (en) * | 2017-03-16 | 2018-10-09 | 北京忆恒创源科技有限公司 | The method and apparatus of atom write order |
| CN111352873A (en) * | 2016-06-30 | 2020-06-30 | 北京忆芯科技有限公司 | NVMe protocol command processing method and device |
Citations (3)
| 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 |
| US20130198311A1 (en) * | 2012-01-17 | 2013-08-01 | Eliezer Tamir | Techniques for Use of Vendor Defined Messages to Execute a Command to Access a Storage Device |
-
2014
- 2014-12-12 CN CN201410766796.1A patent/CN104407820B/en active Active
Patent Citations (3)
| 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 |
| US20130198311A1 (en) * | 2012-01-17 | 2013-08-01 | Eliezer Tamir | Techniques for Use of Vendor Defined Messages to Execute a Command to Access a Storage Device |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106484549A (en) * | 2015-08-31 | 2017-03-08 | 华为技术有限公司 | A kind of exchange method, NVMe equipment, HOST and physical machine system |
| WO2017041673A1 (en) * | 2015-09-10 | 2017-03-16 | 阿里巴巴集团控股有限公司 | Processing method and device for flush input and output request of magnetic disk |
| CN106527959A (en) * | 2015-09-10 | 2017-03-22 | 阿里巴巴集团控股有限公司 | Processing method and device for refreshing disk input output request |
| CN107346265A (en) * | 2016-05-05 | 2017-11-14 | 北京忆恒创源科技有限公司 | Realize QoS method and apparatus |
| CN107346265B (en) * | 2016-05-05 | 2021-05-18 | 北京忆恒创源科技有限公司 | Method and device for realizing QoS |
| CN111352873A (en) * | 2016-06-30 | 2020-06-30 | 北京忆芯科技有限公司 | NVMe protocol command processing method and device |
| CN111352873B (en) * | 2016-06-30 | 2021-10-08 | 北京忆芯科技有限公司 | NVMe protocol command processing method and device |
| CN107818056A (en) * | 2016-09-14 | 2018-03-20 | 杭州华为数字技术有限公司 | A kind of queue management method and device |
| CN108628760A (en) * | 2017-03-16 | 2018-10-09 | 北京忆恒创源科技有限公司 | The method and apparatus of atom write order |
| CN108628760B (en) * | 2017-03-16 | 2021-05-18 | 北京忆恒创源科技有限公司 | Method and device for atomic write command |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104407820B (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104407820A (en) | Solid state disk storage system based data processing method, device and system | |
| US9043776B2 (en) | Transferring files to a baseboard management controller (‘BMC’) in a computing system | |
| CN105260136A (en) | Data read-write method and distributed storage system | |
| US11016805B2 (en) | Programmatically applying labels to nodes in cluster orchestration platforms | |
| CN104462127A (en) | Recorded data updating method and device | |
| US20090198920A1 (en) | Processing Units Within a Multiprocessor System Adapted to Support Memory Locks | |
| CN104104705A (en) | Access method and device of distributed storage system | |
| CN116149559A (en) | Queue processing method, device, server, electronic equipment and storage medium | |
| US20090198849A1 (en) | Memory Lock Mechanism for a Multiprocessor System | |
| CN103036947A (en) | Virtual machine transferring method based on kernel-based virtual machine (KVM) and virtual machine transferring method based on KVM | |
| CN105389268A (en) | Data storage system and operating method thereof | |
| US10282371B1 (en) | Object storage device with probabilistic data structure | |
| US8214603B2 (en) | Method and apparatus for handling multiple memory requests within a multiprocessor system | |
| CN102163164B (en) | Processing method and processor for critical data in shared memory | |
| CN110134423B (en) | Firmware updating method and device and computer readable storage medium | |
| CN105808556B (en) | Database operation method and database engine | |
| US20090198916A1 (en) | Method and Apparatus for Supporting Low-Overhead Memory Locks Within a Multiprocessor System | |
| CN109542860B (en) | Service data management method based on HDFS and terminal equipment | |
| US10678744B2 (en) | Method and system for lockless interprocessor communication | |
| US8566686B2 (en) | System and method for optimizing read-modify-write operations in a RAID 6 volume | |
| US9696986B2 (en) | Managing a code load | |
| CN103645865B (en) | A kind of processing method of command timeout | |
| CN104267975A (en) | Card, device and method for processing extensive application data | |
| US8332546B2 (en) | Fully asynchronous direct memory access controller and processor work | |
| CN111427868B (en) | Processing method and device for operation request in database migration and electronic equipment |
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 |