Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

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

Active Publication Date: 2012-02-22
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to overcome the problem that the existing technology cannot solve the problem that the heap data objects that are not closely related are allocated from the same memory pool because they are allocated at the same call site, and the heap data objects that are closely related are allocated from different call sites. Different memory pool allocation issues, thus providing a method for pool allocation of heap data at runtime

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Methods for pool allocation of heap data at runtime
  • Methods for pool allocation of heap data at runtime
  • Methods for pool allocation of heap data at runtime

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0052] The method of the present invention will be described below in conjunction with the drawings and specific embodiments.

[0053] It is already known in the description of the background technology that when the dynamic pool allocation method disclosed in reference 4 uses wrapper functions, heap data objects that are not closely related are allocated from the same memory pool because they are allocated at the same call site. problem, and the problem of closely related heap data objects being allocated from different memory pools because they are allocated at different call sites. Therefore, how the present invention solves the above two problems will be described separately below.

[0054] Issues where unrelated heap data objects are allocated from the same memory pool

[0055] For ease of understanding, an example is given here. For example, in a program in Table 1 below, a wrapper function safe_malloc (line 1-line 8) is used. In the main function, line 100 allocates ...

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

PUM

No PUM Login to View More

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.

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

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F12/02
Inventor 王振江武成岗
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com