Eliminating external fragmentation in a non-moving garbage collector for Java
CASES '00 Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems
Hoard: a scalable memory allocator for multithreaded applications
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Linux Journal
A real-time garbage collector with low overhead and consistent utilization
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Real-Time Performance of Dynamic Memory Allocation Algorithms
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
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
A comparison of memory allocators for real-time applications
JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
Queue - Security
Programmable temporal isolation in real-time and embedded execution environments
Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems
Handles revisited: optimising performance and memory costs in a real-time collector
Proceedings of the international symposium on Memory management
Short-term memory for self-collecting mutators
Proceedings of the international symposium on Memory management
Hi-index | 0.00 |
We propose a real real-time memory management system called Compact-fit that offers both time and space predictability. Compact-fit is a compacting memory management system for allocating, deallocating, and accessing memory in real time. The system provides predictable memory fragmentation and response times that are constant or linear in the size of the request, independently of the global memory state. We present two Compact-fit implementations and compare them to established memory management systems, which all fail to provide predictable memory fragmentation. The experiments confirm our theoretical complexity bounds and demonstrate competitive performance. In addition, we can control the performance versus fragmentation trade-off via our concept of partial compaction. The system can be parameterized with the needed level of compaction, improving the performance while keeping memory fragmentation predictable.