Linear-Time Memory Allocation Algorithm for Improving KIS/CSP/ESW IPL Time 90fd - 9117 > 26%
Original Publication Date: 2004-Jul-13
Included in the Prior Art Database: 2004-Jul-13
A Linear Time Memory Management Scheme Used to Correct a Non-Linear Direct System Call Behavior in an Embedded Environment.
Linear-Time Memory Allocation Algorithm for Improving KIS /CSP/ESW IPL Time 90fd - 9117 > 26%
Method for Linear Memory Allocation in an Embedded System
Herein described is a method for an optimized memory management method. Figure 1.1 shows the high level design which enabled an embedded environment which exhibited non-linear behavior for memory allocation to be converted into a linear environment.
Caller needs Memory
Return Success, Allocated memory, from Linear storage
Successfully able to Initialize/enlarge memory manager with direct system Call
New/delete call from an application
Memory Manager Initialized?
Return Error. Out of memory
Enlarge Memory Manager.
Figure 1.1 High Level Overview of Method
The optimized method shown in Figure 1.1 enabled memory allocation requests to exhibit linear behavior on an embedded system which happened to exhibit non-linear behavior with the direct system memory allocation call itself. Shown in Figure 1.2 is the direct system call in green which exhibited non-linear behavior. This discussion will focus on how the linear, optimized function shown in red works
Y-Axis optim. norm.
Periods of non-linear growth for allocation/ delete time may cause degraded performance.
New method has a linear slope.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30