Open AccessImproving Memory Efficiency of Dynamic Memory Allocators for Real‐Time Embedded Systems
Author(s) -
Lee Junghee,
Yi Joonhwan
Publication year - 2011
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.11.0110.0268
Subject(s) - allocator , c dynamic memory allocation , computer science , bounded function , fragmentation (computing) , memory management , parallel computing , embedded system , operating system , semiconductor memory , mathematics , mathematical analysis
Dynamic memory allocators for real‐time embedded systems need to fulfill three fundamental requirements: bounded worst‐case execution time, fast average execution time, and minimal fragmentation. Since embedded systems generally run continuously during their whole lifetime, fragmentation is one of the most important factors in designing the memory allocator. This paper focuses on minimizing fragmentation while other requirements are still satisfied. To minimize fragmentation, a part of a memory region is segregated by the proposed budgeting method that exploits the memory profile of the given application. The budgeting method can be applied for any existing memory allocators. Experimental results show that the memory efficiency of allocators can be improved by up to 18.85% by using the budgeting method. Its worst‐case execution time is analyzed to be bounded.