Dynamic management method of DSP data area

Abstract

The invention discloses a dynamic management method of a DSP data area, comprising the following steps: according the type of object data on a DSP node and the storage requirement of each object data, partitioning the address space of the DSP data area, wherein each partitioned zone corresponds to one memory resource object; building an object data pool in each memory resource object, wherein the size of the data block in the same object data pool is same, and the size of each data block corresponds to the storage requirement of the object data stored in the object data pool; building the relevance of the partitioned zone and the object data pool, and initializing the control information of the object data pool; and performing the distribution and the release of the data block in the object data pool. The method can dynamically manage the memory data area of the DSP according to practical application, is efficient and does not have memory fragments.

Description

technical field [0001] The invention relates to the technical field of signal processing, in particular to a dynamic management method of a DSP data area. Background technique [0002] With the wide application of embedded real-time systems in various fields, the development of embedded software has also received more and more attention. On the premise of meeting the real-time requirements of the system, how to improve the rapidity, reliability and efficiency of memory allocation is a major problem faced by embedded software systems. The rapidity of memory allocation starts from the real-time requirements of the embedded system, and requires the memory to be as fast as possible during the allocation process. Therefore, in the embedded system, it is impossible to adopt the complex and cumbersome memory allocation strategy in the general operating system. Both adopt simple and fast memory allocation schemes; the reliability of memory allocation requires that the request for m...

AI Technical Summary

Problems solved by technology

[0005] 1. The size of each memory area is pre-estimated and does not match the size of the application's data block. When an application needs to apply for memory, it often needs to search each memory area according to the size of the requested memory to find a memory block of an appropriate size. memory fragmentation

[0006] 2. Since the size of the memory block in the memory area does not match the size of the application data block, when the requested memory block is smaller than the free block in the memory area, the small memory block will be merged; when the requested memory block is larger than the free block in the memory area When , large memory blocks will be split, therefore, memory allocation is inefficient

Images