Euromicro Conference on Real-Time Systems · 2004 · 105 citations · 7 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureOperating SystemsReal-time SystemsMemory ManagementMemory Subsystem DesignReal-time Systems ArchitectureReal-time Systems DesignRun-time ReconfigurationDynamic Memory AllocationDynamic Storage AllocationFragmentationMemory Allocation For Real-time SystemsReconfigurationResponse TimeStorage AllocationSystem Configuration
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA increases the flexibility and functionalities of applications. There exists a large number of references to this particular issue in the literature. However, the use of DSA has been considered a source of indeterminism in the real-time domain, due to the unconstrained response time of DSA algorithms and the fragmentation problem. Nowadays, real-time applications require more flexibility: the ability to adjust system configuration in response to workload changes and application reconfiguration. This aspect adds value to the definition and implementation of dynamic storage allocation algorithms. Considering these reasons, DSA algorithms with a bounded and acceptable timing behaviour must be developed to be used by real-time operating systems (RTOSs). In this paper a DSA algorithm called two-level segregated fit memory allocator (TLSF), developed specifically to be used by RTOS, is introduced. The TLSF algorithm provides explicit allocation and deallocation of memory blocks with a temporal cost /spl Theta/(1).
7
The memory fragmentation problem
Mark S. Johnstone, Paul R. Wilson · 1998 · 199 citations
James L. Peterson, Theodore A. Norman · Communications of the ACM · 1977 · 148 citations · Full text
Real-time performance of dynamic memory allocation algorithms
Isabelle Puaut · 2003 · 60 citations