Improving memory efficiency of dynamic memory allocators for real-time embedded systems

Junghee Lee, Joonhwan Yi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)230-239
Number of pages10
JournalETRI Journal
Volume33
Issue number2
DOIs
Publication statusPublished - 2011 Apr 1
Externally publishedYes

Fingerprint

Real time systems
Embedded systems
Data storage equipment
Budget control

Keywords

  • Dynamic storage management
  • Main memory
  • Real-time systems

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Improving memory efficiency of dynamic memory allocators for real-time embedded systems. / Lee, Junghee; Yi, Joonhwan.

In: ETRI Journal, Vol. 33, No. 2, 01.04.2011, p. 230-239.

Research output: Contribution to journalArticle

@article{538c43cd956843f483f65c3f2a35b863,
title = "Improving memory efficiency of dynamic memory allocators for real-time embedded systems",
abstract = "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.",
keywords = "Dynamic storage management, Main memory, Real-time systems",
author = "Junghee Lee and Joonhwan Yi",
year = "2011",
month = "4",
day = "1",
doi = "10.4218/etrij.11.0110.0268",
language = "English",
volume = "33",
pages = "230--239",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "ETRI",
number = "2",

}

TY - JOUR

T1 - Improving memory efficiency of dynamic memory allocators for real-time embedded systems

AU - Lee, Junghee

AU - Yi, Joonhwan

PY - 2011/4/1

Y1 - 2011/4/1

N2 - 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.

AB - 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.

KW - Dynamic storage management

KW - Main memory

KW - Real-time systems

UR - http://www.scopus.com/inward/record.url?scp=79954437239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79954437239&partnerID=8YFLogxK

U2 - 10.4218/etrij.11.0110.0268

DO - 10.4218/etrij.11.0110.0268

M3 - Article

AN - SCOPUS:79954437239

VL - 33

SP - 230

EP - 239

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 2

ER -