存储分配算法采用首次适应(FF)法。根据指针fhead查找空闲分区链，当找到第一个可满足分配请求的空闲区时便分配之。当某空闲区被分配后的剩余空闲空间大于规定的碎片最小容量MIN，则形成一个较小的空闲区留在空闲分区链中。

回收时，根据MAT将指定分区链入空闲分区链。若该分区有前邻或后邻分区，则将它们拼接成一块较大的空闲区。

-Storage allocation algorithm uses the first time to adapt to (FF) method. According to district guidelines fhead Find free chain, when the first can be found to satisfy the allocation request free zone will be distribution. When a free zone was assigned the remaining free space after the provisions of debris larger than the smallest capacity MIN, then the formation of a smaller area to stay in idle idle partition chain. Recovery time, according to the specified partition MAT chain into the idle partition chain. If the district after former neighbors or neighborhood district, they will be spliced into a larger free area.