IC Card Memory Defragmentation Without Swap Area
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for defragmenting IC Card memory require a swap area and numerous writing operations, leading to high resource usage and inefficiency, especially when recalculating links in a tree structure file system, and fail to resume defragmentation during asynchronous resets.
Innovation Solution
A method that identifies and merges contiguous free memory portions by moving files in blocks, updating links, and using a counter and state to resume defragmentation from interruptions, eliminating the need for a swap area and reducing processing resources by storing only the start address, size, and links of two free memory portions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a swap area is used to store files during defragmentation, then files can be temporarily stored and memory portions can be compacted, but the method involves too much IC Card resources including time, memory space and processing resources
Solution Approach 1:
The patent extracts the swap area component from the defragmentation system, eliminating the need for temporary storage space. Instead of using a swap area to hold files during defragmentation, the method performs in-place defragmentation by directly moving files within the existing memory structure, thus removing the additional memory space requirement and reducing overall system complexity.
Solution Approach 2:
The patent changes the parameter of memory usage from requiring additional swap space to using only the existing memory portions. By modifying the defragmentation algorithm to work in-place rather than requiring a separate swap area, the method reduces memory space requirements while maintaining defragmentation functionality.
2Reliability
If files are moved in a swap area and back to memory portions, then memory compaction is achieved, but numerous writing operations are required from memory portions into the swap area and vice versa
Solution Approach 1:
The patent removes the swap area intermediary from the file moving process. Instead of copying files from memory portions to swap area and then back to memory portions, the method performs direct in-place movement of files within the memory structure, eliminating the redundant writing operations to and from the swap area.
Solution Approach 2:
The patent inverts the traditional defragmentation approach by not moving files out to a swap area and back, but rather moving files directly to their final positions within the memory structure. This reversal of the process eliminates unnecessary intermediate steps and reduces the number of writing operations required.
3Reliability
If the method moves children nodes from memory portions to swap area and back, then defragmentation is performed, but all links from parent nodes and to children nodes must be recalculated
Solution Approach 1:
The patent extracts the link recalculation step from the defragmentation process by performing in-place movement of files. Since files are not moved to and from a swap area, their logical positions within the file system structure remain consistent, eliminating the need to recalculate all links from parent nodes to children nodes.
Solution Approach 2:
The patent inverts the approach by maintaining link consistency through in-place file movement rather than through swap area operations. By keeping files within their original memory portions and only adjusting their positions within those portions, the method avoids the need to recalculate links that would be required if files were moved to different memory portions via a swap area.
4Reliability
If defragmentation is performed with many writing operations, then memory portions are compacted, but the process consumes too much time and processing resources
Solution Approach 1:
The patent removes the swap area intermediary that causes multiple writing operations. By performing direct in-place defragmentation, the method reduces the number of write operations from multiple cycles (memory to swap and back) to a single pass, significantly reducing the time and processing resources required for defragmentation.
Solution Approach 2:
The patent inverts the traditional multi-pass defragmentation approach into a single-pass in-place method. Instead of moving files through a swap area in multiple stages, the method compacts files directly within their memory portions in one operation, reducing both time and processing resource consumption.
Data Source
Figure 1a~1c
Figure 2~5
Figure 3
AI summary
Method to defrag a memory (M) for an IC Card comprising a plurality of files (1, 2, 3) stored in memory portions (P1, P2, P3) of the memory (M), each file (1, 2, 3) including respective links (L1, L2, L3) to one or more other files (1, 2, 3). The method comprises the steps of: -detecting a start address (fl) of a first free memory portion (M1) of the memory (M); -detecting an address (ai) of a memory portion (P1) following the start address (fl) and storing one file to be moved (1); -detecting files (2) including links (L2) to the address (ai) of the file to be moved (1); - moving the file to be moved (1) at the start address (fl) of the first free memory portion (M1); -updating the links to point at the start address (fl); wherein the above steps are repeated until at least two free memory portions (M1, M2) following the moved files (1) are separated by one or more of files (1, 2, 3).