because the multiple data blocks d0 , d1 , d2 . . . of the raid data band correspond to different respective flash memory storing units lun , each data block will be performed by its corresponding read - and - write processing unit . in order to realize parallel processing and maximize system performance , interleaving and random input of the input of the data block will be permitted by the raid method constructed by the present invention . fig2 illustrates the interleaving input and random data of the data block . d0 , d1 and d2 represent the respective data blocks of the raid data band , and part0 , part1 and part2 represent a portion data of the data block which may be 64 byte , 1 kbyte , or other data of arbitrary length ( less than or equal to the length of the data block d ). for example , d2 part0 indicates the first portion of data of the data block d2 , and d1 part2 indicates the third portion of data of the data block d1 . the purpose for calculating raid 5 is effectively to obtain the xor parity check code of the data block of d0 , d1 , d2 . . . etc . it is based on the following events : the switching law works for the xor operation , therefore , a data block with an upside - down sequence does not affect the accuracy of the parity check code . although there is interleaving for data written by different read - and - write processing units , there is no random sequence in the same data block . a read - and - write processing unit may control multiple flash memory units and store different respective data blocks , but there is no interleaving between data blocks in the same processor . accordingly , in order to ensure the accuracy of the check code , the input of the constructing data of raid 5 needs to meet the following conditions : the data in the same raid data band could be random , but it cannot be random between different raid data bands . the data in the same raid data band could be interleaving , but it cannot be interleaving between different raid data bands . transmission of the data of the next raid data band can only be started after the check code of the current data band is taken by the processor of the check apparatus . in the raid system , the calculation method of the parity check code is as follows : a label is added in each input data block to indicate the read - and - write processing unit which is processing the data block , the raid processor corresponding to the data block , and the raid data band which belongs to the data block . a check code buffer is arranged within the raid processor to set a data block pointer for the read - and - write processing unit . as shown in fig3 , the data block pointer is utilized to record the position of the current data block on the received input data . when the data is received , the data will perform the xor operation with data in the check code buffer pointed by the corresponding data block pointer , and it will be written into the check code buffer . the point value is increased by the data block pointer according to the length of input data . the point value of the data block returns to zero when it reaches the length of the data block , which means that the xor operation of a data block is completed . at the same time , the data block which is finished by the processor will be increased by one . the processing amount of the data blocks on the current data band which is finished by the raid processor is recorded . the check code of a portion of data bands which have been calculated is confirmed according to the processing amount of the data blocks and the position of each pointer . when the check code of a portion of data bands has been calculated , the raid processor could inform the corresponding read - and - write processing unit to start taking the check code and write into the corresponding flash memory unit . when all of the check codes have been taken , the buffer resets to zero , re - starts the calculation of the next raid data band , and starts a new run of circulation . because only one buffer of size of a complete data block ( usually 16 kb ) is needed for the reservation by each raid processor , it can be completely implemented by a sram inside the chip . the utilization of a dram outside the chip can be avoided to simplify the design . the raid processor broadcasts a short message to all read - and - write processing units on the message main thread , in order to prevent the read - and - write processing units from exceeding the raid data band . the short message includes the following information : the number of the data band which is read by the read - and - write processing unit based on the permission of the current raid processor , and information about whether the check code of the current raid processor could be read or not . a read - and - write processing unit could control one lun or multiple luns . when the read - and - write processing unit finds that the next operation is temporarily an illegal operation ( for example , corresponding to data writing of the next raid data band ), it switches to other strings and operates another flash memory unit chip . the strings of the flash memory chip with fast writing give resources to the slow strings . therefore , the progress of each string is approximately the same . the implementation of the method of present invention relies on decreasing the probability of illegal operations . accordingly , each read - and - write processing unit could operate with almost full loading . the applied approach is advancing the timing point of reading the check code as much as possible . because the read - and - write processing unit corresponding to the check apparatus usually has more leisure , the reading of the check code will be finished immediately after finishing the process of the last data block . the whole system could be on the writing of the next data band . therefore , the window of being incapable of transmitting data is decreased . in addition , the scheduling time of the flash memory chip is several times longer than the data transmission time , and two radis writing points could be operated in the system simultaneously . therefore , even if one is temporarily forbidden , another one can still be operated . therefore , through the estimation , the performance loss caused by the synchronizing effect of the raid 5 is less than 5 % under all kinds of environments . when a read - and - write processing unit cannot perform the next operation ( for example , the next step is an illegal operation ), it will be necessary to wait for another processing unit . accordingly , a circulation will be developed to become deadlocked . the deadlock should be strictly avoided . deadlocks are caused by incorrect instruction execution sequences , and the execution sequence of instructions is different from the transmission sequence of instructions . since random execution merely exists on different strings in the method of the present invention , it is executed in a strict sequence within the same string . the software transmission instruction should obey the following simple rules to avoid a deadlock : the sequence is only required for the instructions of the raid processor , and other instructions could be transmitted arbitrarily . there is no sequence requirement for the data scheduling instructions within the same raid data band . the check scheduling instruction should be transmitted after all of the data scheduling instructions in the current raid data band and before all of the data scheduling instructions in the next raid data band . fig4 is a structural diagram of the storage system based on the flash memory constructed by the above method . the storage system includes a raid processor and multiple flash memories . the raid processor includes multiple read - and - write processing units , a raid short message unit , a data block pointer unit , a data block counter , and a parity check code buffer . a read - and - write processing unit could control one lun or several luns . the scheduling instruction of the check code is submitted to the raid processor . the instruction transmission could be initiated by the driving from the host , or be initiated by hardware . in order to avoid a deadlock , the instruction transmission should obey the rules determined by the raid processor . in other words , the check scheduling instruction should be transmitted after submitting all of the data scheduling instructions in the current raid data band and before all of the data scheduling instructions in the next raid data band . the read - and - write processing unit executes its corresponding instruction , and obeys the rules of the short message of the raid controller during the execution . the read - and - write processing unit reads the data block of the current data band , and starts to read data of the next raid data band only when the check code of the current data band is taken by the processor of the check apparatus . the data block pointer unit is utilized to record the input position of the current data block for each respective flash memory . the data block counter counts the number of data blocks operated by a flash memory . the parity check code buffer is utilized to temporarily store the parity check code . the raid short message unit is utilized to broadcast a short message to all of the read - and - write processing units to prevent the read - and - write processing units from exceeding the raid data band . the short message includes the following information : the data band number which is read by the read - and - write processing unit with the permission of the current raid processor , and information about whether the check code of the current raid processor could be read or not . the read - and - write processing unit reads the corresponding data block , performs the xor operation for the position of the current data pointer and the data in the parity check code buffer , and writes the data to the parity check code buffer . when the xor operation is finished , the data block pointer unit increases the length value of the input data and moves the corresponding data block pointer . after the corresponding flash memory lun has finished the operation of data block which means that the data block pointer returns to zero , the data block counter increases by one . when the data block counter achieves the sum of the data blocks included by the raid data band , the data in the parity check code storage is written to the corresponding flash memory unit . the raid controller begins the calculation operation of the next raid data band until the operation of data is finished . as illustrated before , the system could be extended to include applications with multiple raid processors which are shown in fig5 . advantages include having multiple raid processors operate independently . moreover , the accurate calculation and writing of the raid is performed without the writing sequence of central control . also , the performance loss caused by raid is almost zero . finally , the raid width could be distributed dynamically . finally , it should be noted that the above embodiments are merely for illustrating the technical methods of the present invention , not for limitation . people skilled in the art should understand that the core features of the present invention can not only be applied in ssd , but also in arrays based on traditional disks or arrays of a storage medium of the next generation . the present invention could be implemented by fpga , computable logics , asic , or specific chips . the amount of raid writing points could be extended further if needed , and dual processors could be arranged for each of the writing points to eliminate the time window in which data transmission cannot be performed . the implementation of raid could be raid 5 , raid 6 , or other raid structures . people skilled in the art could amend or replace the present invention , and the amended technical embodiments will not exceed the scope and content of the present invention .