Buddy算法的μC/OS-Ⅱ高可靠内存管理方案

针对现有μC/OS-Ⅱ内存管理方案分配内存不灵活、可靠性不高的特点,提出一种适用于μC/OS-Ⅱ增强内存管理可靠性的方案.该方案借鉴Buddy算法的思想,将可用内存划分为一系列2的幂次方规模大小的内存块,申请小块内存得不到分配时可以将大块内存块平分后得到满足.回收内存块时,地址连续的相同大小的内存块可以合并成大内存块,...

Strategy of Higher Reliability Memory Management in μC/OS- Ⅱ with Buddy Algorithm

This paper proposes a highly reliable strategy of memory management for μC/OS - II which originally has a low reliable and inflexible strategy of memory management. The new strategy divides the unused memory into a series of blocks whose size are regulatory power of 2. If the small memory blocks can＇t meet the allocation requirement, it gets a half block of bigger memory blocks. When the memory block is retrieved, two memory blocks of same size and contiguous addresses can be combined into one bigger memory block. What＇s more, the strategy uses the index array to locate the needed memory block quickly. Comparative experiments show that the relia bility of the new strategy impoves 4 times higher than the original strategy and the memory management is more flexible.