Adaptive exact-fit storage management
Communications of the ACM
An efficient algorithm for heap storage allocation
ACM SIGPLAN Notices
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-time systems and their programming languages
Real-time systems and their programming languages
Improving the cache locality of memory allocation
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
CustoMalloc: efficient synthesized memory allocators
Software—Practice & Experience
Evaluating models of memory allocation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Memory allocation costs in large C and C++ programs
Software—Practice & Experience
Report of a workshop on future directions in programming languages and compilers
ACM SIGPLAN Notices
Tailored-List and Recombination-Delaying Buddy Systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The software lookaside buffler reduces search overhead with linked lists
Communications of the ACM
A comparison of next-fit, first-fit, and best-fit
Communications of the ACM
Communications of the ACM
Anomalous behavior of the fifty-percent rule in dynamic memory allocation
Communications of the ACM
Dynamic memory allocation in computer simulation
Communications of the ACM
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
A weighted buddy method for dynamic storage allocation
Communications of the ACM
A class of dynamic memory allocation algorithms
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Communications of the ACM
Data Structure Techniques
Proceedings of the 12th Ada-Europe International Conference
Ada-Europe '93 Proceedings of the 12th Ada-Europe International Conference
Dynamic storage allocation techniques.
Dynamic storage allocation techniques.
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
Implementation of a constant-time dynamic storage allocator
Software—Practice & Experience
A compacting real-time memory management system
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
| Hi-index | 0.00 |
The predictability of the computation time of program modules is very important for estimating an accurate worst-case execution time (WCET) of a task in real-time systems. Dynamic storage allocation (DSA) is a common programming technique. Although many DSA algorithms have been developed, they focus on the average execution time rather than the WCET, making it is very difficult to calculate their WCET accurately. In this paper, we propose a new algorithm called Half-Fit whose WCET can be calculated accurately. The algorithm finds a free block without searching on a free list or tree, allowing extra unusable memory called incomplete memory use. In a simulation following a queueing model of M/G//spl infin/, Half-Fit has the advantage over the binary buddy system of more efficient storage utilization. The binary buddy system is a conventional algorithm whose WCET can be calculated.