Program Memory Placement by Call Frequency for Faster Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hierarchical memory architectures struggle to determine which functions or variables are frequently accessed and which are seldom accessed, leading to inefficiencies in storage location arrangements.
Innovation Solution
A method and apparatus for adjusting program storage locations based on service scenarios, involving semi-static and dynamic adjustments of function/variable locations to optimize access efficiency by prioritizing high-frequency functions/variables in faster memory areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If functions/variables are stored in fixed location arrangement order, then storage structure is simple, but access efficiency is low
Solution Approach 1:
The patent implements dynamic adjustment of function/variable storage locations based on their call frequencies. The system monitors service scenarios and adjusts storage arrangements in real-time, transforming the static fixed-location model into a dynamic adaptive model that optimizes access efficiency while managing complexity through automated control
Solution Approach 2:
The system changes the storage location parameter of functions and variables based on their call frequency characteristics. By adjusting the storage location parameter dynamically according to usage patterns, the system achieves higher access efficiency without manual intervention, resolving the contradiction between efficiency improvement and complexity increase
2Speed
If frequently accessed functions are placed in faster memory areas, then access speed improves, but memory management complexity increases
Solution Approach 1:
The system enables functions and variables to effectively 'self-organize' based on their call frequencies. The memory management system automatically identifies frequently accessed elements and places them in faster memory areas without requiring manual intervention, reducing the perceived complexity while improving access speed
Solution Approach 2:
The patent implements a feedback mechanism that monitors call frequencies of functions and variables during service scenario execution. This feedback information is used to dynamically adjust storage locations, creating a closed-loop system that automatically optimizes memory placement for speed while managing complexity through automated control
3Productivity
If storage locations are adjusted dynamically during service execution, then access efficiency improves, but system complexity increases
Solution Approach 1:
The system performs preliminary analysis of service scenarios to identify frequently accessed functions and variables before execution. By pre-positioning these elements in optimal storage locations based on predicted usage patterns, the system improves execution speed while reducing the complexity of real-time adjustments during runtime
Data Source
AI summary
A method for adjusting a program storage location includes, before executing a service scenario, a computer device may preliminarily adjust a location of a function/variable in a storage area based on a predicted service scenario, and/or dynamically adjust locations of these functions in the storage area based on a call status of the functions in a process of executing an application service. A function/variable with a relatively high call frequency may be adjusted to a high-speed storage area, and a function/variable with a relatively low call frequency may be adjusted to a low-speed storage area, or these functions/variables are stored in the storage area according to a location order based on values of call frequencies.