Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms in C
CustoMalloc: efficient synthesized memory allocators
Software—Practice & Experience
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Bounds for Some Functions Concerning Dynamic Storage Allocation
Journal of the ACM (JACM)
Communications of the ACM
Composing high-performance memory allocators
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
The Real-Time Specification for Java
Computer
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
Real-Time Performance of Dynamic Memory Allocation Algorithms
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
An algorithm with constant execution time for dynamic storage allocation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
TLSF: A New Dynamic Memory Allocator for Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
MSA: a memory-aware utility accrual scheduling algorithm
Proceedings of the 2005 ACM symposium on Applied computing
A compacting real-time memory management system
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Memory reservation and shared page management for real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Real-Time applications can require dynamic storage management. However this feature has been sistematically avoided due to the general belief about the poor performance of allocation and deallocation operations in time and space. Actually, the use of Java technologies in real-time require to analyse in detail the performance of this feature due to its intensive use. In a previous paper, the authors proposed a new dynamic storage allocator that perform malloc and free operations in constant time (O(1)) with a very high efficiency. In this paper, we compare the behaviour of several allocators under "real-time" loads measuring the temporal cost and the fragmentation incurred by each allocator. In order to compare the temporal cost of the allocators, two parameters have been considered: number of instructions and processor cycles. To measure the fragmentation, we have calculated the relation between the maximum memory used by the each allocator relative to the point of the maximum amount of memory used by the load. Additionally, we have measured the impact of delayed deallocation in a similar way a periodic garbage collector server will do. The results of this paper show that TLSF allocator obtains the best resuts when both aspects, temporal and spatial are considered.