Process-level virtual machine embedded chain mode memory management method
Yue Hu, YueDong Wang
Abstract
Yue Hu, YueDong Wang
Abstract
This article puts forward an embedded chain mode memory management method and an associated memory data structure based on a process-level virtual machine platform. Compared to conventional dynamic memory management methods, the method disclosed in this article has advantages, for example, it is unnecessary to create chained lists for memory allocation to manage allocated memory blocks or occupy additional system memory units to store the information of the chained list of free blocks. It can effectively solve the problem of compromised system efficiency as a result of searching in the chained list of allocated blocks in the memory reclamation process, and can merge free blocks very conveniently to reduce memory fragments at the same time. Both theoretical analysis result and experimental result demonstrate that this method can effectively improve the dynamic memory management efficiency, and that benefit becomes more apparent as the memory allocation and release becomes more frequently.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article puts forward an embedded chain mode memory management method and an associated memory data structure based on a process-level virtual machine platform. Compared to conventional dynamic memory management methods, the method disclosed in this article has advantages, for example, it is unnecessary to create chained lists for memory allocation to manage allocated memory blocks or occupy additional system memory units to store the information of the chained list of free blocks. It can effectively solve the problem of compromised system efficiency as a result of searching in the chained list of allocated blocks in the memory reclamation process, and can merge free blocks very conveniently to reduce memory fragments at the same time. Both theoretical analysis result and experimental result demonstrate that this method can effectively improve the dynamic memory management efficiency, and that benefit becomes more apparent as the memory allocation and release becomes more frequently.
Key concepts: Computer science, Memory management, Interleaved memory, Flat memory model, Virtual memory, Extended memory, Merge (version control), Memory map