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.

• Publication year

  2022

• Venue

  2022 International Conference on Cloud Computing, Big Data Applications and Software Engineering (CBASE)

• Publication date

  2022-09-01

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1109/CBASE57816.2022.00016
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Limits on fundamental limits to computation

  2014cited by this paper
• Dynamically managed data for CPU-GPU architectures

  2012cited by this paper
• Implications of Historical Trends in the Electrical Efficiency of Computing

  2011cited by this paper
• TLSF: a new dynamic memory allocator for real-time systems

  2004cited by this paper
• Real-time performance of dynamic memory allocation algorithms

  2002cited by this paper
• Performance of an Efficient Parallel Data Transmission System Bap

  2000cited by this paper
• Von Neumann Computers

  1999cited by this paper
• Cache Memories

  1998cited by this paper
• A Linux-based Real-Time Operating System

  1997cited by this paper
• Moore's law: past, present and future

  1997cited by this paper
• A case for intelligent RAM

  1997cited by this paper
• A fast, scalable mutual exclusion algorithm

  1995cited by this paper
• Fast Allocation of Processes in Distributed and Parallel Systems

  1993cited by this paper
• An Elementary Processor Architecture with Simultaneous Instruction Issuing from Multiple Threads

  1992cited by this paper
• Cache Memories

  1982cited by this paper
• Performance of an Efficient Parallel Data Transmission System

  1967cited by this paper

• No citing papers are available for this paper.