US 12,292,829 B2
Method and device for allocating storage addresses for data in memory
Xiaofu Meng, Xi'an (CN); Tian Zhi, Xi'an (CN); Zhenxing Zhang, Xi'an (CN); and Xunyu Chen, Xi'an (CN)
Assigned to CAMBRICON (XI'AN) SEMICONDUCTOR CO., LTD., Xi'an (CN)
Appl. No. 17/998,892
Filed by Cambricon (Xi'an) Semiconductor Co., Ltd., Xi'an (CN)
PCT Filed May 12, 2021, PCT No. PCT/CN2021/093466
§ 371(c)(1), (2) Date Nov. 15, 2022,
PCT Pub. No. WO2021/233187, PCT Pub. Date Nov. 25, 2021.
Claims priority of application No. 202010421439.7 (CN), filed on May 18, 2020; and application No. 202010421447.1 (CN), filed on May 18, 2020.
Prior Publication US 2023/0214322 A1, Jul. 6, 2023
Int. Cl. G06F 12/06 (2006.01); G06N 3/0464 (2023.01)
CPC G06F 12/06 (2013.01) [G06N 3/0464 (2023.01)] 17 Claims
OG exemplary drawing
 
1. A method of allocating a space address to data in a memory, comprising:
receiving a space assigning request aiming at storage space in the memory, wherein the space assigning request comprises a size of the data;
assigning target storage space to the data according to the received space assigning request;
allocating the space address to the data based on the assigned target storage space;
forming a plurality of memory blocks, wherein each memory block has a total storage size identifier and an available storage size identifier, wherein the total storage size identifier is configured to indicate a total storage size of the memory block, and the available storage size identifier is configured to indicate an available storage size of the memory block; and
taking the plurality of memory blocks as nodes to form a tree structure so that the data is assigned with the target storage space according to the tree structure when the space assigning request is received, wherein the tree structure comprises a plurality of nodes of multi-stage, wherein a total storage size of a parent node is a sum of total storage size of children nodes.