Dynamic Memory Allocation for Route Planning Servers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Route planning servers face inefficiencies due to static memory allocation, leading to unnecessary memory usage and prolonged processing times when data is processed with insufficient memory.
Innovation Solution
A memory allocation device and method that dynamically allocates memory by determining the required amount based on available memory pools, allowing for efficient allocation and reallocation of memory pieces to support route planning algorithms, ensuring sufficient memory is allocated only when needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If memory is allocated in predetermined units in a static manner, then memory allocation is simple, but unnecessary memory is allocated causing waste and prolonged processing time
Solution Approach 1:
The patent implements dynamic memory allocation where the memory allocation unit is adjusted based on the actual memory usage of the route planning algorithm. The controller monitors memory usage and dynamically changes the allocation unit size, transitioning from static predetermined units to adaptive dynamic units that match actual needs, thereby improving processing speed by eliminating memory allocation overhead.
Solution Approach 2:
The patent changes the parameter of memory allocation unit size from fixed predetermined values to variable values determined by actual memory usage. The controller calculates the actual memory usage and adjusts the allocation unit parameter accordingly, allowing the system to optimize between allocation simplicity and processing efficiency by adapting the allocation granularity to actual needs.
2Reliability
If memory is allocated in predetermined units, then allocation is straightforward, but insufficient memory causes slow data processing
Solution Approach 1:
The patent implements a feedback mechanism where the controller monitors the actual memory usage of the route planning algorithm and uses this information to adjust future memory allocations. The controller calculates actual memory usage, compares it with allocated memory, and adjusts the allocation unit size for subsequent allocations, ensuring that sufficient memory is always available while optimizing processing speed through appropriate allocation granularity.
Solution Approach 2:
The system performs self-adjustment of memory allocation parameters based on its own operational characteristics. The controller automatically monitors memory usage patterns and adjusts allocation units without external intervention, allowing the system to self-optimize memory allocation to match its actual processing needs, thereby ensuring both sufficient memory availability and optimal processing speed.
3Productivity
If more memory is allocated to ensure sufficient memory for processing, then processing speed improves, but unnecessary memory is wasted
Solution Approach 1:
The patent applies partial action by allocating memory in optimized units that match actual usage requirements rather than allocating excessive predetermined units. The controller calculates the precise memory usage and allocates only the necessary amount plus a calculated buffer, avoiding both insufficient memory and excessive allocation, thereby optimizing the balance between processing speed and resource efficiency.
Solution Approach 2:
The patent dynamically changes the memory allocation unit parameter based on actual usage patterns. By adjusting the allocation granularity from coarse predetermined units to fine-tuned dynamic units, the system optimizes memory utilization, allocating sufficient memory for fast processing while minimizing waste through precise parameter adjustment matching actual computational needs.
Data Source
AI summary
A memory allocation device includes a storage including at least one memory pool in which a memory piece used to search for a route is previously generated and a controller that determines whether it is possible to search for the route using the previously generated memory piece and determines an added amount of memory pieces to previously allocate a memory of the storage, when it is impossible to search for the route.