Methods for pool allocation of heap data at runtime

A technology of data and data objects, which is applied in the field of memory allocation, can solve problems such as loosely related heap data objects, and achieve the effect of improving the effect
CN101763308BActive Publication Date: 2012-02-22INST OF COMPUTING TECH CHINESE ACAD OF SCI
0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Patents(China)
Current Assignee / Owner
INST OF COMPUTING TECH CHINESE ACAD OF SCI
Publication Date
2012-02-22

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The present invention provides a method for pool allocation of heap data at runtime, which includes receiving a memory pool allocation request for heap data; examining the call point context, and wrapping the address of the call point contained in the wrapping function and calling the top layer The address of the call point of the function is added to the variable-length call chain; a memory pool is selected for the heap data object allocated from the variable-length call chain; space is allocated for the heap data from the memory pool. The invention can solve the problem that unclosed heap data objects are allocated from the same memory pool because they are allocated at the same call site, and the problem that closely related heap data objects are allocated from different memory pools because they are allocated at different call sites , which improves the effect of pool allocation.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of memory allocation, in particular to a method for pool allocation of heap data during operation. Background technique

[0002] With the rapid development of processor technology, the speed gap between processor speed and storage system has become larger and larger. The speed of the storage system is becoming a bottleneck for the further improvement of the overall operating speed of the computer. In order to improve the speed of the storage system, various methods have been proposed in the prior art, among which the method of improving data locality can improve the performance of the storage system without increasing the bandwidth requirement, and thus has been widely used.

[0003] The heap is an area in the program memory space, and the memory dynamically needed when the program is running is allocated from the heap. For example, a C program applies for memory from the heap through system functions such as malloc...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More