TLSF: A New Dynamic Memory Allocator for Real-Time Systems

  • Authors:
  • M. Masmano;I. Ripoll;A. Crespo;J. Real

  • Affiliations:
  • Universidad Politécnica de Valencia;Universidad Politécnica de Valencia;Universidad Politécnica de Valencia;Universidad Politécnica de Valencia

  • Venue:
  • ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic storage allocation (DSA) algorithms playan important role in the modern software engineeringparadigms and techniques (such as object oriented programming).Using DSA increases the flexibility and functionalitiesof applications. There exists a large number ofreferences to this particular issue in the literature. However,the use of DSA has been considered a source of indeterminismin the real-time domain, due to the unconstrained responsetime of DSA algorithms and the fragmentation problem.Nowadays, new real-time applications require more flexibility:the ability to adjust system configuration in responseto workload changes and application reconfiguration. Thisaspect adds new value to the definition and implementationof dynamic storage allocation algorithms.Considering these reasons, new DSA algorithms with abounded and acceptable timing behaviour must be developedto be used by Real-Time Operating Systems (RTOSs).In this paper a new DSA algorithm called Two-Level SegregatedFit memory allocator (TLSF), developed specificallyto be used by RTOS, is introduced. The TLSF algorithm providesexplicit allocation and deallocation of memory blockswith a temporal cost 驴(1).