The invention introduces a method for dynamic partitioning, performed by a processing unit, including at least the following steps. A storage-unit ID (identifier) associated with a storage unit is acquired, where the storage unit is coupled to the processing unit. Parameters corresponding to the storage-unit ID are obtained and the length of a physical super-page is calculated according to the parameters. The length of a data buffer is obtained and the quantity of logical partitions is calculated according to the length of the physical super-page and the length of the data buffer. The quantity of logical partitions is stored in a DRAM (Dynamic Random Access Memory).
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method for dynamic partitioning, performed by a processing unit, comprising: acquiring a storage-unit ID (identifier) associated with a storage unit, wherein the storage unit is coupled to the processing unit; obtaining a plurality of parameters corresponding to the storage-unit ID; calculating a length of a physical super-page according to the parameters; obtaining a length of a data buffer; calculating a quantity of logical partitions according to the length of the physical super-page and the length of the data buffer; and storing the quantity of logical partitions in a DRAM (Dynamic Random Access Memory).
2. The method of claim 1 , wherein the step for acquiring a storage-unit ID associated with a storage unit further comprises: querying the storage-unit ID to the storage unit via an access interface.
3. The method of claim 1 , wherein the step for obtaining a plurality of parameters corresponding to the storage-unit ID further comprises: searching a lookup table of a ROM (Read Only Memory) to obtain a page length, a quantity of storage sub-units and a quantity of data pages of each storage sub-unit.
6. The method of claim 1 , further comprising: in a sequential read procedure, determining whether data of all pages of a block has been received completely and all data reads have not been processed completely; and if so, sending an EOC (end of cache-read) command to the storage unit via an access interface and sending a block read command to the storage unit via the access interface to inform that the following read commands are used for reading data of the next block.
7. The method of claim 6 , further comprising: in the sequential read procedure, after reading data of all pages of a logical partition of the block, increasing a counter by one.
8. The method of claim 7 , wherein the step for determining whether data of all pages of a block has been received completely further comprises: reading the quantity of logical partitions of the DRAM; determining whether the counter equals the quantity of logical partitions multiplied by a quantity of pages of one data plane; and if so, determining that data of all pages of the block has been received completely.
9. The method of claim 6 , further comprising: otherwise, sending a cache-read command for reading data of all pages of the next logical partition to the storage unit via the access interface.
10. An apparatus for dynamic partitioning, performed by a processing unit, comprising: an access interface, coupled to a storage unit; a processing unit, acquiring a storage-unit ID (identifier) associated with the storage unit via the access interface, wherein the storage unit is coupled to the processing unit; obtaining a plurality of parameters corresponding to the storage-unit ID; calculating a length of a physical super-page according to the parameters; obtaining a length of a data buffer; calculating a quantity of logical partitions according to the length of the physical super-page and the length of the data buffer; and storing the quantity of logical partitions in a DRAM (Dynamic Random Access Memory).
11. The apparatus of claim 10 , wherein the processing unit queries the storage-unit ID to the storage unit via an access interface.
12. The apparatus of claim 10 , wherein the processing unit searches a lookup table of a ROM (Read Only Memory) to obtain a page length, a quantity of storage sub-units and a quantity of data pages of each storage sub-unit.
15. The apparatus of claim 10 , wherein the processing unit, in a sequential read procedure, determines whether data of all pages of a block has been received completely and all data reads have not been processed completely; and if so, sends an EOC (end of cache-read) command to the storage unit via the access interface and sends a block read command to the storage unit via the access interface to inform that the following read commands are used for reading data of the next block.
16. The apparatus of claim 15 , wherein, in the sequential read procedure, the processing unit increases a counter by an increment of one after reading data of all pages of a logical partition of the block.
17. The apparatus of claim 16 , wherein the processing unit reads the quantity of logical partitions of the DRAM; determines whether the counter equals the quantity of logical partitions multiplied by a quantity of pages of one data plane; and if so, determines that data of all pages of the block has been received completely.
18. The apparatus of claim 15 , wherein, otherwise, the processing unit sends a cache-read command for reading data of all pages of the next logical partition to the storage unit via the access interface.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
May 3, 2016
December 5, 2017
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.