摘要 |
<p>A method for storage management is provided by the present invention. The method includes the following steps: n linked lists are established for a message when the message enters into a queue, and the head nodes and the tail nodes of these n linked lists are stored (310); each linked list contains multiple chunks, and each chunk contains multiple blocks; the base addresses of all the blocks in the same chunk are the same; the offset difference between offset addresses of the adjacent blocks is a designated value; when the message is dequeued, firstly, the first chunks of the respective linked list No. 0 to the linked list No. n-1 are used sequentially; secondly, the second chunks of the respective linked list No. 0 to the linked list No. n-1 are used sequentially; the rest may be deduced by analogy, and the process is continued until the message is ended (320); the steps of using each chunk involves: each block in a chunk is used in sequence; the offset address of the next block is obtained by adding the designated value to the offset address of the current block; and after all the blocks in the current chunk have been used, the base address of the next chunk is obtained by using the base address of any block in the current chunk. Furthermore, a storage management system is provided by the present invention. By increasing the usage gap for each linked list, the requirement of processing one linked list node per cycle can be achieved by the present invention.</p> |
申请人 |
ZTE CORPORATION;WANG, CHUANG;WU, FENGBO;XIAO, JIE |
发明人 |
WANG, CHUANG;WU, FENGBO;XIAO, JIE |