The Advance and Analysis of Memory allocations

Many high-complexity computing problems appear with the increasing integration of computing devices with human life. Therefore, the requirements for the performance of computing devices are getting higher and higher. Currently, the development speed of Central Processing Unit (CPU) 's computing power is gradually slowing down. Therefore, it has become an important research direction to study software optimization technology to improve the efficiency of computing equipment. Memory allocations are one of the critical technology in computing devices. The performance of memory allocation operations constitutes an essential aspect of software design. At the same time, it is a significant bottleneck that limits the performance of computing devices. First, this paper reviews the computing device's storage structure and memory allocation mechanisms. Then, an essential aspect of performance in memory allocation is parallel performance. The Binary Search Tree (BST) and ptmalloc as classical methods are evaluated. As a result, this paper compares the performance of the implemented allocator with others' and analyzes the reason for the differences. Based on the comparison and analysis of experimental results, this paper proposes several optimization methods to improve memory allocation efficiency.