Access scheduling method and system of memory, electronic equipment and storage medium
By allocating target memory that meets network resource consumption conditions in multi-level sub-objects within the enterprise, the problem of inefficiency of user access in different regions is solved, and efficient data access and load optimization are achieved.
Patent Information
- Application Number
- CN202510760666.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-09
- Publication Date
- 2025-07-08
- Estimated Expiration
- 2045-06-09
Smart Images

Figure CN120276684A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of computer technology, and particularly to a method and system for accessing and scheduling a memory, an electronic device, and a storage medium. Background Art
[0002] In the era of big data, more and more enterprises rely more strongly on data storage and access. In some enterprises, an enterprise has multiple subordinate departments, and different departments may be distributed in different regions. How to achieve data storage and sharing within the enterprise has become an important issue faced by the enterprise. In the related art, an enterprise central database is constructed, and all the data of the enterprise is stored in this database. Then, internal personnel of the enterprise can access the enterprise data by accessing this central database. However, due to business requirements, multiple subordinate departments of the enterprise are distributed in different regions. On the one hand, the access efficiency of users in different regions to the central database is different. The farther the location of the user is from the configured location of the central database, the lower the data access efficiency. On the other hand, all users within the enterprise access data by accessing the central database, resulting in a relatively high access pressure on the central database and affecting the data access efficiency of the central database. Summary of the Invention
[0003] This application provides a method and system for accessing and scheduling a memory, an electronic device, and a storage medium, so as to at least solve the problem of low access efficiency of the data possessed by a target object in the related art.
[0004] This application provides a method for accessing and scheduling a memory, including: receiving an access request sent by a target terminal, where the access request is used to request to access target data from multiple memories of a target object, the target object includes multiple levels of sub-objects with a hierarchical relationship, the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects, and each memory is used to store the data of the corresponding level of sub-object;
[0005] Searching for multiple reference memories storing the target data from the multiple memories;
[0006] Allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the target terminal is used to access the target data from the target memory, and the target memory is a memory that meets the network resource consumption condition when the target terminal accesses the data among the multiple reference memories.
[0007] This application also provides a system for accessing and scheduling a memory, including: a scheduler, and multiple memories configured for a target object, the scheduler is connected to each memory, the target object includes multiple levels of sub-objects with a hierarchical relationship, and the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects;
[0008] A memory for storing data of sub-objects at corresponding levels;
[0009] A scheduler for receiving an access request sent by a target terminal, where the access request is used to request to access target data from multiple memories of a target object; finding multiple reference memories storing the target data from the multiple memories; and allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multi-level sub-objects, where the target terminal is used to access the target data from the target memory, and the target memory is a memory that meets the network resource consumption condition when the target terminal accesses data among the multiple reference memories.
[0010] This application also provides an electronic device, including: a memory for storing a computer program; a processor for implementing the steps of any of the above memory access scheduling methods when executing the computer program.
[0011] This application also provides a computer-readable storage medium storing a computer program, where the computer program implements the steps of any of the above memory access scheduling methods when executed by a processor.
[0012] This application also provides a computer program product including a computer program, where the computer program implements the steps of any of the above memory access scheduling methods when executed by a processor.
[0013] Through this application, the target object includes multi-level sub-objects with a hierarchical relationship, and multiple memories are configured in one-to-one correspondence with the multi-level sub-objects. Each memory is used to store data of sub-objects at the corresponding level. Then, when an access request for accessing target data sent by the target terminal is received, multiple reference memories storing the target data are found from the multiple memories. Then, a target memory that meets the network resource consumption condition when the target terminal accesses data is allocated from the reference memories according to the attribution relationship between the target terminal and the multi-level sub-objects. That is, by configuring multiple memories and distributing the data of the target object according to the hierarchical relationship of the sub-objects in the target object through the multiple memories, on the one hand, the access speed of the terminal to the data is optimized, and on the other hand, the access load of the memory is reduced. It can solve the technical problem of low access efficiency of the data possessed by the target object in the related art and achieve the effect of improving the access efficiency of the data possessed by the target object. BRIEF DESCRIPTION OF THE DRAWINGS
[0014] To more clearly illustrate the embodiments of this application, the following will briefly introduce the drawings required for the embodiments. Obviously, the drawings in the following description are only some embodiments of this application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.
[0015] Figure 1 is a hardware block diagram of a memory access scheduling method according to an embodiment of the present application;
[0016] Figure 2 is a flowchart of a memory access scheduling method according to an embodiment of the present application;
[0017] Figure 3 is a four - level cache architecture diagram of a memory - based access scheduling method according to an embodiment of the present application;
[0018] Figure 4 is a functional module structure diagram of a memory - based access scheduler according to an embodiment of the present application;
[0019] Figure 5 is an example diagram of a permission matrix of a memory - based access scheduling system according to an embodiment of the present application;
[0020] Figure 6 is a module interaction structure diagram of a memory - based access scheduler according to an embodiment of the present application;
[0021] Figure 7 is a flowchart of cross - regional mirror distribution of a manufacturing enterprise for a memory - based access scheduling method according to an embodiment of the present application;
[0022] Figure 8 is a system block diagram of a memory access scheduling system according to an embodiment of the present application;
[0023] Figure 9 is a structural block diagram of a memory access scheduling device according to an embodiment of the present application. Detailed implementation manners
[0024] Next, the technical solutions in the embodiments of the present application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the protection scope of the present application.
[0025] It should be noted that in the description of the present application, the terms "include", "comprise" or any other variation thereof are intended to cover a non - exclusive inclusion, such that a process, method, article or device including a series of elements not only includes those elements but also includes other elements not explicitly listed, or further includes elements inherent to such process, method, article or device. The terms "first", "second", etc. in the present application are used to distinguish similar objects and are not used to describe a specific order or sequence.
[0026] To enable those skilled in the art of the present technology to better understand the solution of this application, the following provides a further detailed description of this application in conjunction with the accompanying drawings and specific embodiments.
[0027] In combination with the specific application environment architecture or specific hardware architecture on which the execution of the access scheduling method of the memory depends, the specific application environment architecture or specific hardware architecture is described herein.
[0028] The method embodiments provided in the embodiments of this application can be executed in a server device or a similar computing device. Taking the execution on a server device as an example, Figure 1 is the hardware structure block diagram of the access scheduling of the memory in the embodiments of this application. As Figure 1 shown, the server device may include one or more ( Figure 1 only one is shown in the figure) processors 102 (the processor 102 may include, but is not limited to, processing devices such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data. Among them, the above-mentioned server device may further include a transmission device 106 for communication functions and an input / output device 108. Those of ordinary skill in the art can understand that Figure 1 the structure shown is only schematic and does not limit the structure of the above-mentioned server device. For example, the server device may further include more or fewer components than Figure 1 shown in the figure, or have a different configuration from Figure 1 shown in the figure.
[0029] The memory 104 can be used to store computer programs. For example, software programs and modules of application software, such as the computer program corresponding to the startup method of the operating system in the embodiments of this application. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, implements the above-mentioned method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memories, or other non-volatile solid-state memories. In some instances, the memory 104 may further include a memory remotely set relative to the processor 102, and these remote memories can be connected to the server device through a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.
[0030] The transmission device 106 is used to receive or send data via a network. Specific examples of the above network may include a wireless network provided by a communication provider of a server device. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, abbreviated as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used to communicate with the Internet wirelessly.
[0031] Embodiments of the present application provide a method for accessing and scheduling a memory. The method is described in detail in combination with the execution process of the method for accessing and scheduling a memory.
[0032] The following explains the professional terms appearing in the present application:
[0033] Image: An executable file containing an operating system, applications, and configurations, used for quickly deploying a computing environment;
[0034] Base Image: A standard environment image uniformly maintained by an enterprise, such as a development language image and an operating system image;
[0035] Application Image: A business-specific image built based on a base image;
[0036] Image Sharding: Splitting a large image into independent data blocks of 256MB (configurable), supporting parallel downloading and verification;
[0037] SM4 (SM4 Block Cipher Algorithm): A national cryptographic block cipher algorithm used for image signature and transmission encryption;
[0038] Spark: A general computing framework integrating offline computing, real-time computing, SQL query, machine learning, and graph computing;
[0039] CDN (Content Delivery Network): A content delivery network, a network architecture that accelerates content transmission through distributed nodes;
[0040] DHT (Distributed Hash Table): A distributed hash table, a decentralized protocol for resource location in a P2P (Peer to Peer) peer network, realizing fast discovery of image shards;
[0041] LRU (Least recently used): The least recently used algorithm, a cache eviction algorithm that preferentially removes the content that has not been used for the longest time;
[0042] LFU (Least Frequently Used): The least frequently used algorithm, a cache eviction algorithm based on access frequency, which preferentially evicts the content with the fewest access times;
[0043] RBAC (Role - Based Access Control): Role - based access control, a security management mechanism that assigns permissions through roles. In this solution, it is refined to department / role / IP segment.
[0044] In this embodiment, a method for accessing and scheduling a memory is provided. Figure 2 It is a flowchart of the method for accessing and scheduling a memory according to an embodiment of the present application, as Figure 2 shown. The method includes the following steps:
[0045] Step S202: Receive an access request sent by a target terminal. Among them, the access request is used to request to access target data from multiple memories of a target object. The target object includes multiple levels of sub - objects with a hierarchical relationship. The multiple memories are configured in one - to - one correspondence with the multiple levels of sub - objects. Each memory is used to store data of the corresponding level of sub - object;
[0046] Step S204: Search for multiple reference memories storing the target data from the multiple memories;
[0047] Step S206: Allocate a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub - objects. Among them, the target terminal is used to access the target data from the target memory, and the target memory is a memory among the multiple reference memories that meets the network resource consumption conditions when the target terminal accesses data.
[0048] Through the above steps, the target object includes multiple levels of sub - objects with a hierarchical relationship. The multiple memories are configured in one - to - one correspondence with the multiple levels of sub - objects. Each memory is used to store data of the corresponding level of sub - object. Furthermore, when an access request for requesting to access target data sent by the target terminal is received, multiple reference memories storing the target data are found from the multiple memories. Then, according to the attribution relationship between the target terminal and the multiple levels of sub - objects, a target memory that meets the network resource consumption conditions when the target terminal accesses data is allocated from the reference memories. That is, by configuring multiple memories and distributing the data of the target object through the multiple memories according to the hierarchical relationship of the sub - objects in the target object, on the one hand, the access speed of the terminal to the data is optimized, and on the other hand, the access load of the memory is reduced, which can solve the technical problem of low access efficiency of the data possessed by the target object in the related art and achieve the effect of improving the access efficiency of the data possessed by the target object.
[0049] Optionally, in the above embodiments, the access scheduling method for the above memory can be but is not limited to being applied to a scheduler configured for the memory. The scheduler is connected to multiple memories configured for the target object, and is used to schedule the data stored in the multiple memories. The scheduler is also connected to the terminal subordinate to the target object, so as to receive the access request of the target terminal, and allocate the target memory to be accessed to the target terminal according to the storage situation of the data requested to be accessed in the multiple memories.
[0050] The embodiments of the present application solve the problems in the access scenario of the internal data of the target object. According to the requirements of the object hierarchy in the target object, the target object can be divided into multiple sub-objects with a hierarchical relationship (for example, when the target object is an enterprise, the sub-objects can be multiple departments or sub-departments included in the enterprise. For example, when the target object is an institution, the sub-objects can be the first-level sub-institutions, second-level sub-institutions,..., N-level sub-institutions included in the institution). According to the object hierarchy division method in the target object, multiple memories with a hierarchical relationship are configured for the target object, and each level of sub-object corresponds to a memory, which is used to store all the data of the corresponding hierarchical sub-object, so as to realize hierarchical storage of the data of the target object.
[0051] Optionally, in the embodiments of the present application, the target object has multiple terminal devices under its jurisdiction. There is an attribution relationship between the terminal and the sub-objects included in the target object. The attribution relationship can be but is not limited to including a direct attribution relationship and an indirect attribution relationship. When a certain terminal is a terminal bound under a sub-object, there is a direct attribution relationship between the terminal and the sub-object. When a certain terminal is bound to a subordinate sub-object of a certain sub-object, there is an indirect attribution relationship between the terminal and the sub-object, and there is a direct attribution relationship between the terminal and the subordinate sub-object.
[0052] In the embodiment provided in step S204, multiple memories are configured in a one-to-one correspondence with multiple levels of sub-objects, that is, there is a hierarchical relationship among the multiple memories, and each memory is used to store the data of the sub-objects at the corresponding level. Therefore, the high-level memory stores the service data in all the lower-level memories subordinate to it. For example, among multiple sub-objects, there are first-level sub-objects, second-level sub-objects, and third-level sub-objects. The second-level sub-objects are the sub-objects subordinate to the first-level sub-objects, and the third-level sub-objects are the sub-objects subordinate to the second-level sub-objects. According to the hierarchical relationship of the sub-objects, a first memory is configured for the first-level sub-objects, a second memory is configured for the second-level sub-objects, and a third memory is configured for the third-level sub-objects. Different memories are used to store the full amount of data of the sub-objects at the corresponding levels. Therefore, in addition to storing all the data of the third memory, the second memory also stores other specific data of the second-level sub-objects. In addition to storing all the data in the second memory, the first memory also stores other specific data of the first-level sub-objects. Therefore, the data stored in different-level memories is different, so the data requested by the target terminal for access may be stored in the memories at different levels of the target object at the same time.
[0053] In the embodiment provided in step S206, the attribution relationships between the terminal and the sub-objects at different levels are different. Furthermore, when the terminal accesses the memories configured for the sub-objects at different levels, the access distances are different, resulting in different access speeds of the terminal to different memories. For example, compared with downloading target data from the first memory of the first-level sub-objects with an indirect attribution relationship, when the terminal downloads target data from the second memory corresponding to the second-level sub-objects with a direct attribution relationship, since the access distance between the terminal and the second memory is closer than the access distance between the terminal and the first memory, the speed at which the terminal reads the target data from the second memory is higher than the speed at which the terminal reads the target data from the first memory. Therefore, in the embodiment of the present application, the method of allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects may be to detect the access distance of the target terminal to each of the multiple reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, and determine the memory with the shortest access distance among the multiple reference memories as the target memory.
[0054] Optionally, in the embodiments of the present application, the target memory may be selected from multiple reference memories according to the access distance between the terminal and the memory and the access load of the memory. That is, the method of allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multi-level sub-objects may be as follows: detecting the target access distance of the target terminal to each reference memory in the multiple reference memories according to the attribution relationship between the target terminal and the multi-level sub-objects; detecting the current target access load of each reference memory, where the target access load is used to indicate the access situation of service data in the corresponding reference memory, and the target access load can characterize the transmission resources that the reference memory can allocate for the target terminal when responding to the access request of the target terminal; furthermore, the first data transmission parameter between the target terminal and the corresponding reference memory can be predicted according to the target access distance, where the first data transmission parameter is used to indicate the data transmission quality of the target terminal at the target access distance; predicting the second data transmission parameter between the target terminal and the corresponding reference memory according to the target access load, where the second data transmission parameter is used to indicate the data transmission quality of the target terminal under the target access load; using the first weight parameter and the second weight parameter to perform weighted summation on the first data transmission parameter and the second data transmission parameter to obtain the target data transmission parameter of the reference memory, where the target data transmission parameter is used to indicate the data transmission quality between the terminal and the memory, the first weight parameter is used to indicate the influence of the access distance on the transmission quality, and the second weight parameter is used to indicate the influence of the access load on the transmission quality; determining the memory in the multiple reference memories whose target data transmission parameter is greater than or equal to the target parameter threshold as the target memory.
[0055] As an alternative implementation manner, allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multi-level sub-objects includes: detecting the access information of the reference memory according to the attribution relationship between the target terminal and the multi-level sub-objects, where the access information is used to indicate the network resource consumption situation when the target terminal accesses the corresponding reference memory; allocating a target memory for the target terminal from the multiple reference memories according to the access information, where the target terminal is used to access target data from the target memory.
[0056] Optionally, in the embodiments of the present application, there is a cascading relationship between the multi-level sub-objects, the target terminal belongs to a specific sub-object, and the sub-objects construct a cascading relationship between them according to the hierarchical relationship. Detecting the access information of the reference memory according to the attribution relationship between the target terminal and the multi-level sub-objects will obtain the access information of multiple reference memories. The access information indicates the network resource consumption situation when the target terminal accesses the corresponding reference memory. According to the access information, the reference memory with less network resource consumption can be determined, and the optimal reference memory can be selected as the target memory.
[0057] Optionally, in the embodiments of the present application, an intelligent memory allocation strategy is implemented. The core is to optimize the access path of target data according to the attribution relationship between the target terminal and multiple levels of sub-objects. Specifically, when the scheduler receives an access request from the target terminal, it first analyzes the attribution relationship between the terminal and sub-objects at different levels within the enterprise (such as department acceleration points, regional cache pools, etc.), that is, the department or geographical location to which the terminal belongs. Next, the scheduler detects and analyzes the network resource consumption when the terminal accesses the reference memory in each level of sub-objects, which includes but is not limited to key metrics such as transmission latency, bandwidth utilization rate, and packet loss rate. Based on the above information, the scheduler adopts a dynamic optimization algorithm to intelligently select and allocate the optimal target memory from multiple possible reference memories to the target terminal, ensuring that the terminal can obtain the target data from its nearest or most frequently accessed level with the lowest network resource consumption.
[0058] Through the above method, not only the latency of data access is reduced, the transmission efficiency is improved, but also the load on the enterprise-level central library is alleviated, and the bandwidth usage of the entire network is optimized. Thus, while ensuring data security, the efficient utilization of resources and a significant improvement in user experience are achieved. This allocation mechanism is particularly suitable for image distribution in a private cloud environment and can achieve adaptive resource scheduling and data distribution according to the specific business requirements and network conditions of the enterprise.
[0059] As an alternative implementation, detecting the access information of the reference memory according to the attribution relationship between the target terminal and multiple levels of sub-objects includes: obtaining the target attribution information of the target terminal, where the target attribution information is used to indicate the attribution relationship between the target terminal and multiple levels of sub-objects; determining the data transmission rate corresponding to the target attribution information from the attribution information and transmission rate with a corresponding relationship, where the access information includes the data transmission rate.
[0060] Optionally, in the embodiments of the present application, the attribution information can be but is not limited to an object identifier, which is used to mark the sub-object directly attributed to the target terminal. The attribution information can also be the address information of the target terminal, and the sub-object to which the target terminal belongs can be directly located according to this address information.
[0061] Optionally, in the embodiments of the present application, the access information includes but is not limited to network latency, packet loss rate, network bandwidth, communication rate, memory utilization rate, etc. when the target terminal communicates with the reference memory.
[0062] Optionally, in the embodiments of the present application, focusing on optimizing the efficiency of the target terminal to access the target data, by carefully analyzing the attribution relationship between the target terminal and each sub-object in the multi-level distribution system of the private cloud image, the accurate control of the data transmission rate is achieved. First, the scheduler will obtain the target attribution information of the target terminal, which clarifies the specific department, geographical location or network level to which the terminal belongs, thereby establishing a link between the terminal and each level of sub-objects (such as department acceleration points, regional cache pools, etc.). Subsequently, based on the correspondence relationship between the pre-collected and established attribution information and the transmission rate, the scheduler searches for the data transmission rate value that matches the current target attribution information as one of the key parameters for evaluating network resource consumption. Here, the access information mainly includes the data transmission rate when the terminal accesses a specific memory.
[0063] Through the above method, it is ensured that the terminal can obtain the required image from the most suitable memory level at the best speed, while avoiding network congestion and unnecessary cross-level data transfer, effectively improving the image distribution speed and the experience quality of terminal users in the private cloud environment, while maintaining the overall stability of the system and the resource utilization efficiency.
[0064] As an alternative implementation, allocating a target memory for the target terminal from multiple reference memories according to the access information includes: screening out the first memory whose data transmission rate with the target terminal is greater than or equal to the target rate from multiple reference memories, where the access information includes the data transmission rate; determining the first memory as the target memory.
[0065] Optionally, in the embodiments of the present application, screening out the first memory whose data transmission rate with the target terminal is greater than or equal to the target rate from multiple reference memories, that is, screening out the memory with the fastest transmission rate and the highest transmission efficiency as the target memory, is an optimal memory selection scheme for obtaining the target data.
[0066] Optionally, in the embodiments of the present application, an intelligent memory allocation strategy based on access information is adopted, aiming to provide the most suitable data access point for each target terminal to optimize the data transmission efficiency and user experience. When the target terminal initiates a data access request, the scheduler first screens out the first memory whose data transmission rate with the terminal is higher than or equal to a preset target rate threshold from a series of preset reference memories as the preferred resource point for the target terminal to access the target data. This determination step may also comprehensively consider other access information, such as network latency, memory utilization rate, and data integrity verification records, etc., to ensure that the target memory not only has a suitable transmission rate, but also has reliable data storage and stable network connection.
[0067] Through the above intelligent selection mechanism, the scheduler can dynamically adjust the data distribution path, enabling the target terminal to access the required data under the optimal network conditions, significantly improving the image distribution speed in the private cloud environment and the access experience of end-users. At the same time, it effectively controls the consumption of network resources, achieving the efficiency and economy of data distribution.
[0068] As an alternative implementation, after allocating the target memory for the target terminal from multiple reference memories according to the access information, the method further includes: configuring the access path for the target terminal to access the target memory according to the connection relationship between the target terminal and the target memory; controlling the target terminal to access the target data stored in the target memory according to the access path.
[0069] Optionally, in this embodiment, the access path is a transmission path filtered from multiple data transmission paths connecting the target terminal and the target memory, and the data transmission quality of the transmission path is greater than the target transmission quality. For example, the access path can, but is not limited to, include the access path through the local area network, the access path through the Internet, and the access path through the P2P (Peer-to-Peer) method.
[0070] Through the above method, by configuring the access path for the terminal to access the memory according to the connection relationship between the terminal and the memory, the access efficiency of the terminal to access the data in the memory is optimized. It can not only dynamically adjust the data source according to the real-time needs and network conditions of the terminal, but also achieve more efficient and secure data transmission by optimizing the data access path, greatly improving the efficiency of enterprise internal data management and the user experience.
[0071] As an alternative implementation, configuring the access path information for the target terminal to access the target memory according to the connection relationship between the target terminal and the target memory includes: when the connection relationship is used to indicate that the target terminal is connected to the target memory through a communication link, configuring the target communication link as the access path for the target terminal to access the target memory; when the connection relationship is used to indicate that the target terminal is connected to the target memory through a local area network, configuring the local area network access path of the target memory as the access path for the target terminal to access the target memory; when the connection relationship is used to indicate that the target terminal is connected to the target memory through the Internet, configuring the Internet access path of the target memory as the access path for the target terminal to access the target memory.
[0072] Optionally, in the embodiments of the present application, according to the connection relationship between the target terminal and the target memory, the access path information is intelligently configured to ensure the efficiency and security of data transmission. Specifically, the scheduler first identifies the connection type between the target terminal and the target memory, and then based on different connection methods, provides customized path configurations for data access. When the target terminal is directly connected to the target memory through a specific communication link, this target communication link will be identified as the optimal access path, which means that data can be directly transmitted through this link without passing through additional intermediate nodes, thereby reducing transmission latency and increasing the data transmission rate; when the target terminal and the target memory are within the same local area network, the local area network access path will be preferentially configured as the target access path. Transmissions within the local area network usually have lower latency and higher transmission rates. Therefore, accessing the target memory through the local area network can significantly improve data access efficiency, and the data transmission security in the local area network environment is also relatively higher; if the target terminal and the target memory are connected through the Internet, the Internet access path will be configured as the target access path according to the characteristics of the Internet. The configuration of the Internet path will take into account the instability of the public network and potential security risks and may adopt encryption transmission protocols and traffic control strategies to ensure the security of data transmission and the access experience of end users.
[0073] Through the above method, it is possible to flexibly adapt to the connection requirements in different scenarios, select the most suitable network environment for data transmission, and thus achieve high efficiency and high reliability of data access. This path configuration mechanism based on the connection relationship is a key technology for realizing intelligent resource scheduling and optimizing the user experience in the private cloud image multi-level distribution system.
[0074] As an alternative implementation manner, after allocating the target memory for the target terminal from multiple reference memories according to the access information, the method further includes: when the sub-object to which the target memory belongs is a sub-object having an indirect attribution relationship with the target terminal among multiple sub-objects, searching for the reference sub-object directly attributed to the target terminal from multiple sub-objects; synchronizing the target data to the second memory configured for the reference sub-object.
[0075] Optionally, in the embodiments of the present application, the indirect attribution relationship refers to other attribution relationships except that the terminal is directly attributed to the corresponding sub-object. When the sub-object to which the target memory belongs is a sub-object having an indirect attribution relationship with the target terminal, for example, the sub-object to which the current target terminal belongs is R & D Department 1 in Wuhan, but the sub-object corresponding to the target memory is Wuhan R & D Center. At this time, there is an indirect attribution relationship between the target terminal and Wuhan R & D Center. At this time, the memory corresponding to Wuhan R & D Center will synchronize the target data to the second memory.
[0076] Optionally, in the embodiments of the present application, after the process of intelligently allocating the target memory for the target terminal based on the access information, a secondary optimization mechanism is introduced, aiming to deploy the data closer to the end user, so as to provide a faster and more personalized data access service. Specifically, once it is confirmed that the target memory belongs to a sub-object with an indirect attribution relationship, a search program is immediately started to accurately find the reference sub-object directly attributed to the target terminal from among numerous sub-objects. For example, if the target terminal belongs to the R & D department, but the initially allocated target memory is located at an acceleration point in the test department that has an indirect relationship with it, the cache node directly attributed to the R & D department will be automatically searched for. After finding the directly attributed reference sub-object, the target data will be synchronized to the second memory configured in the reference sub-object. This data synchronization action ensures that the directly attributed sub-object can also provide the required data resources, thus avoiding additional transmission delays and network resource waste caused by the attribution relationship.
[0077] In the above manner, even if the initial memory allocation is based on an indirect attribution relationship, the scheduler can, through subsequent intelligent adjustment, migrate the data to the storage environment directly associated with the target terminal, making data access faster and significantly improving the user experience. This multi-level data management and dynamic memory adjustment strategy fully embodies the design essence of the private cloud image multi-level distribution system, that is, on the premise of meeting security and permission requirements, continuously optimizing the data distribution path and storage layout to achieve the best data transmission performance and resource utilization efficiency.
[0078] As an alternative implementation manner, synchronizing the target data to the second memory configured for the reference sub-object includes: sending a target transmission instruction to the target memory, where the target transmission instruction is used to instruct the target memory to call the transmission link between the target memory and the second memory to transmit the target data to the second memory.
[0079] Optionally, in the embodiments of the present application, in order to achieve efficient data sharing and maximize the utilization of cache resources, when it is necessary to move the target data from the initially allocated target memory to the second memory that is closer to the end user and directly belongs to it, the scheduler will take a refined transmission control measure. The specific operation is that the scheduler sends a dedicated target transmission instruction to the target memory. This instruction carries clear information indicating that the target memory activates the dedicated transmission link with the second memory, and then transmits the target data to the second memory. This instruction not only contains the identification information of the target data, but also clarifies the transmission direction and the target, that is, to migrate the data from the original storage location to the more appropriate second memory. By invoking the pre-established transmission link, the scheduler can ensure the smooth and efficient data migration process, while reducing the network burden caused by cross-layer data transmission. Here, the transmission link may be a high-speed connection within a local area network or an Internet communication path optimized for data synchronization, depending on the network environment and data transmission requirements between the target memory and the second memory.
[0080] Through the above process, precise control of data flow is achieved, promoting the intelligent distribution of data in the multi-level cache system in the private cloud environment, and providing a more efficient, personalized and responsive data access experience for end users.
[0081] As an alternative implementation, before receiving the access request sent by the target terminal, the method further includes: obtaining the reference access information of the reference terminal under the target sub-object in the multi-level sub-objects within a reference time period before the current moment, where the reference access information is used to indicate the data access demand situation of the reference terminal within the reference time period; predicting the target access information of the reference terminal within a target time period after the current moment based on the reference access information; and managing the data stored in the third memory allocated to the target sub-object within the target time period according to the target access information.
[0082] Optionally, in the embodiments of the present application, before the target terminal officially initiates a data access request, it can actively collect and analyze the historical access behaviors of terminals within multi-level sub-objects to predict and prepare for future data requirements in advance. First, it will obtain the access information of the reference terminals under the target sub-object within the most recent reference time period. These information comprehensively reflect key information such as the access frequency, access time points, and access volume of the reference terminals to specific data or images, constituting detailed reference access information. With the help of data analysis and machine learning technologies, based on the above reference access information, the scheduler can make accurate predictions and infer the possible data access requirements of the reference terminals within the target time period after the current moment, that is, the target access information. This prediction process not only takes into account the regularities in the historical records but may also incorporate external factors such as work schedules and business cycles, making the prediction results closer to the actual requirements. With the target access information as a basis, the scheduler will then dynamically manage the third memory allocated to the target sub-object and pre-load the data that is expected to be frequently accessed within the target time period into the third memory.
[0083] Through the above mechanism, the scheduler can complete the data deployment and optimization in advance before the end-user actually needs the data, effectively shortening the data response time, improving the access speed, and at the same time reducing the network latency and bandwidth consumption caused by temporarily loading data.
[0084] As an alternative implementation, before receiving the access request sent by the target terminal, the method further includes: detecting the data information of the data stored in the fourth memory among multiple memories, where the data information is used to indicate the access situation of the corresponding data in the fourth memory within the reference time period before the current moment; managing the data stored in the fourth memory according to the data information.
[0085] Optionally, in the embodiments of the present application, before receiving an access request from a target terminal, a proactive data management strategy is adopted, aiming to optimize the allocation and utilization of storage resources. Specifically, during implementation, the scheduler deeply monitors the fourth memory among multiple memories, focusing on the access situation of various types of data stored on this device within a certain reference time period in the past, and collects comprehensive data information including data access frequency, access time distribution, and data size. This information provides a basis for subsequent intelligent data management decisions. Based on the collected data information, the scheduler can intelligently evaluate the popularity and importance of each piece of data, and then dynamically adjust the data layout in the fourth memory. For data that has been rarely accessed or not accessed at all within the reference time period, the scheduler will trigger a data cleaning process to delete it from the fourth memory or migrate it to the low-frequency access storage area, thereby releasing storage space and improving resource utilization efficiency. At the same time, for hot data, that is, data with high access frequency and strong usage requirements, the scheduler will adopt an update retention strategy to ensure the continuous availability of this data in the fourth memory, and may even preload more relevant data shards to meet possible high-frequency access requirements in the future.
[0086] Through this strategy, the scheduler realizes the refined management of data in the memory, not only reducing invalid or inefficient data storage, lowering storage costs, but also improving the access speed and response efficiency of hot data, enhancing the user experience.
[0087] As an alternative implementation, the present application also provides a low-cost, highly reliable, and easy-to-control private cloud image distribution method and system. This method hierarchically deploys the cloud image repository, stores images that meet the requirements of hierarchical departments at different levels, and solves problems such as slow cross-regional transmission, resource waste, and insufficient security by performing security management during image transmission.
[0088] The main design idea of the present application is as follows:
[0089] Figure 3 It is the four-level cache architecture diagram of an access scheduling method based on memory in the embodiments of the present application, as Figure 3As shown, taking an enterprise with data storage requirements as the target object as an example, the enterprise is divided into a multi-level organizational structure according to internal hierarchical division requirements, such as headquarters, business regions, departments, etc. Corresponding storage mechanisms are configured for different organizational structures to store the data of this hierarchical organizational structure. For example, there is a four-layer node system including the central library corresponding to the headquarters, the regional cache pool configured for the business region, the department acceleration node configured for the department, and the edge cache machine configured for the terminal server. Intelligent routing is performed before mirror transmission, where: The enterprise-level central library stores full-scale mirrors, supports version management, signature verification, and audit logs; The regional cache pool caches high-frequency mirrors and synchronizes with the central library asynchronously; The department acceleration point caches department-specific mirrors and supports P2P collaborative transmission; The edge cache machine caches common mirror shards. The client sends a request instruction for the mirror file to the scheduler. The scheduler queries the mirror file in the four-level cache. First, it judges whether the mirror file exists in the edge cache machine. If it exists, the scheduler tells the client the path of the edge cache machine where the mirror file is located, and the client obtains the mirror file in the edge cache machine through this path; If the mirror file does not exist in the edge cache machine, it searches whether the mirror file exists in the department acceleration point. If it exists, the scheduler tells the client the path of the department acceleration point where the mirror file is located, and the client obtains the mirror file in the department acceleration point through this path. At the same time, the scheduler controls the department acceleration point to synchronize the mirror file to the edge cache machine; If the mirror file does not exist in the department acceleration point, it searches whether the mirror file exists in the regional cache pool. If it exists, the scheduler tells the client the path of the regional cache pool where the mirror file is located, and the client obtains the mirror file in the regional cache pool through this path. At the same time, the scheduler controls the regional cache pool to synchronize the mirror file to the department acceleration point, and the department acceleration point synchronizes the mirror file to the edge cache machine; If the mirror file does not exist in the regional cache pool, it directly queries the mirror file from the enterprise-level central library. The scheduler tells the client the path of the enterprise-level central library where the mirror file is located, and the client obtains the mirror file in the enterprise-level central library through this path. At the same time, the scheduler controls the enterprise-level central library to synchronize the mirror file to the regional cache pool, the regional cache pool synchronizes the mirror file to the department acceleration point, and the department acceleration point synchronizes the mirror file to the edge cache machine.
[0090] Figure 4 It is a functional module structure diagram of an access scheduler based on a memory in an embodiment of the present application. As Figure 4 shown, the functional modules of the scheduler include five core functional modules: a mirror management module, a cache scheduling module, a security authentication module, a transmission protocol module, and an audit tracking module. Among them:
[0091] The mirror management module is responsible for the creation, release, removal, and version management of mirrors, integrates a mirror signature engine (SM4 algorithm) and a metadata warehouse, and provides Web UI and API interfaces for administrators to operate.
[0092] The cache scheduling module outputs cache scheduling instructions to each node, including functions such as heat analysis engine, cache preloading, and intelligent eviction strategy: The heat analysis engine calculates the access frequency, department distribution, and time characteristics of each image in real time based on Spark; The cache preloading function pushes images to the regional cache pool in advance according to the business cycle (such as Monday morning every week); When the cache utilization rate exceeds 80%, the intelligent eviction strategy function uses an improved LRU algorithm to preferentially evict images that have not been used for 30 days and are not basic images.
[0093] The security authentication module includes functions such as image signature, transmission encryption subsystem, and RBAC-based permission control. Among them: The image signature module performs integrity verification on the image file based on the national cryptography SM4 algorithm; The transmission encryption subsystem realizes the secure transmission of images based on the TLS1.3 protocol; The permission control module defines corresponding operation permissions according to the four-level cache system and the roles of department employees, and strictly controls the access to images. Figure 5 It is an example diagram of the permission matrix of a memory-based access scheduling system according to an embodiment of the present application. As Figure 5 shown, different roles have different operation permissions for the image memories of different nodes. For example, the system administrator has full operation permissions and has read and write operation permissions for the central library, regional pool, and department points; The department manager only has the permission to manage the images of his own department, has read-only permission for the central library, and has read and write operation permissions for the regional pool and department points; Ordinary employees have the permissions to run and download images, have read-only operation permissions for the central library and regional pool, and have read and write operation permissions for department points.
[0094] The transmission protocol module includes functions such as hybrid transmission mode, shard verification algorithm, and traffic control. Among them: The hybrid transmission mode ensures obtaining the highest-priority image cache according to the cache situation of each level (priority: edge cache machine > department acceleration node > regional cache pool > enterprise-level central library); The distribution verification algorithm uses SHA-256 hash to verify each image shard (such as a shard with a size of 256MB) to ensure the integrity of image transmission; The traffic control function limits the P2P transmission bandwidth not to exceed 30% of the total bandwidth to avoid the network being overly occupied by P2P traffic and causing network congestion.
[0095] The audit tracking module records complete operation logs, including the source IP, time, version, and usage label of each image download, supports SQL query and visualization analysis; Integrates a machine learning model to automatically identify abnormal operations (such as high-frequency downloads at night) to further improve the image security management system.
[0096] Figure 6 It is a module interaction structure diagram of a memory-based access scheduler according to an embodiment of the present application. As Figure 6As shown, the client sends an access request to the mirror management module of the scheduler. The mirror management module controls the security authentication module to verify the user's permissions. The security authentication module returns the permission verification result to the client. Then, the mirror management module controls the cache scheduling module to query the mirror location in the memory. After finding the corresponding requested mirror, the transmission protocol module selects the specific transmission method of the memory storing the corresponding mirror and establishes a transmission link between the client and the memory. The client downloads the shards from the mirror memory according to the transmission method and the transmission link. After the download is completed, the transmission protocol module reports the download log to the mirror management module. The mirror management module controls the audit tracking module to record the operation information.
[0097] The specific embodiments of this application are as follows:
[0098] Embodiment 1: Cross-regional mirror distribution for manufacturing enterprises
[0099] Implementation scenario: An automobile manufacturing enterprise has R & D centers in Shanghai, Wuhan, and Chongqing, and needs to frequently distribute in-vehicle system mirrors (with an average size of 8GB).
[0100] Implementation process:
[0101] 1. Mirror creation:
[0102] The R & D team at the Shanghai headquarters constructs the in-vehicle system mirror v1.0 based on the base mirror (Ubuntu 20.04 + QNX microkernel). After being approved by the system administrator, the central library generates a mirror signature (SM4 algorithm) and records the metadata:
[0103] json:
[0104] {,
[0105] "image_id": "caros_v1.0",
[0106] "size": "8.2GB",
[0107] "version": "1.0",
[0108] "creator": "R & D Department 1",
[0109] "department": "In-vehicle System Department",
[0110] "last_used": "2025-03-25 09:00:00",
[0111] };
[0112] 2. Intelligent cache scheduling:
[0113] The scheduler automatically analyzes historical data: the usage of the in-vehicle system image surges at 9 am every Monday; the regional cache pools (Shanghai, Wuhan, Chongqing) preload image v1.0 at 23:00 on Sunday; the department acceleration points (the testing departments of each R & D center) cache shards of frequently accessed UI components (about 1.5 GB).
[0114] 3. Image distribution:
[0115] Figure 7 It is a cross-regional image distribution flowchart of a manufacturing enterprise for a memory-based access scheduling method according to an embodiment of the present application.
[0116] When R & D personnel in Wuhan start a container, as Figure 7 shown, the client requests the caros_v1.0 shard from the scheduler. The scheduler queries whether the department acceleration node has a locally cached UI shard. If the department acceleration node has a UI shard, the department acceleration node returns the UI shard storage information to the scheduler. The scheduler sends the storage path of the UI shard to the client. The client requests the UI shard from the department acceleration node through the UI shard storage path, and the department acceleration node sends the UI shard to the client. The scheduler queries whether the regional cache pool has a kernel shard. If the regional cache pool has a kernel shard, the regional cache pool returns the kernel shard storage information to the scheduler. The scheduler sends the storage path of the kernel shard to the client. The client requests the kernel shard from the regional cache pool through the kernel shard storage path, and the regional cache pool sends the kernel shard to the client. At the same time, the regional cache pool synchronizes the kernel shard to the department acceleration node for the subsequent client to obtain the kernel shard from the department acceleration node.
[0117] 4. Security control:
[0118] Only employees of the in-vehicle system department can download the complete image. The TLS 1.3 protocol encrypts all data links to ensure transmission security. An audit log record is generated after the image is downloaded, as shown in Table 1:
[0119] Table 1
[0120]
[0121] Implementation effects:
[0122] 1. The cross-regional download time is shortened from 1.2 hours to 18 minutes;
[0123] 2. The bandwidth cost is reduced by 62% (from 150,000 yuan per month to 57,000 yuan);
[0124] 3. The risk of image leakage is reduced to zero (through the permission matrix and audit tracking).
[0125] Embodiment 2. Secure distribution of the financial enterprise database image:
[0126] Implementation scenario: The mirror image (15GB) of the core database of a certain bank needs to be distributed to the test environments of 30 branches across the country.
[0127] Security enhancement measures:
[0128] 1. Mirror image signature and verification:
[0129] The central library generates a mirror image hash value: SHA-256: d3b07384d113edec49eaa6238ad5ff00, signs the hash value using the national cryptographic SM4 algorithm, and generates a signature file caros_v1.0.sig. After the client downloads it, verify it through the following command:
[0130] sm4verify caros_v1.0 caros_v1.0.sig;
[0131] 2. Permission control matrix, as shown in Table 2:
[0132] Table 2
[0133]
[0134] 3. Transmission security;
[0135] When the regional pool synchronizes with the central library, a dedicated line + IPsec encryption is adopted;
[0136] The department acceleration points are deployed in the bank's internal network and are only allowed to be accessed through VPN;
[0137] The mirror image shard transmission uses the TLS 1.3 protocol, and the key is updated every 15 minutes.
[0138] Implementation effects:
[0139] 1. The accuracy rate of mirror image tampering detection is 100%;
[0140] 2. The risk of sensitive data leakage is reduced by 99%;
[0141] 3. The compliance audit response time is shortened from 48 hours to 2 hours.
[0142] Beneficial effects brought by the above embodiments:
[0143] 1. The first four-layer cache architecture is created: realizing the gradient sinking of the mirror image from the headquarters to the terminal, reducing the cross-regional transmission requirements;
[0144] 2. Intelligent traffic scheduling: The average distribution speed is increased by 40% - 60% through the dynamic routing algorithm;
[0145] 3. Enterprise-level security enhancement: The accuracy rate of mirror image tampering detection is 100%; the permission control granularity is refined to departments / roles / IP segments;
[0146] 4. Cost Optimization: After implementation by a manufacturing enterprise, the bandwidth cost is reduced by 58% and the mirror deployment time is shortened by 70%.
[0147] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by means of software plus a necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases, the former is a better implementation method.
[0148] The embodiments of the present application also provide an access scheduling system for a memory. Figure 8 It is a system block diagram of an access scheduling system for a memory according to an embodiment of the present application, as Figure 8 shown. The system includes:
[0149] A scheduler, and multiple memories configured for a target object. The scheduler is connected to each memory. The target object includes multiple levels of sub-objects with a hierarchical relationship, and the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects;
[0150] A memory for storing data of the sub-object corresponding to the corresponding level;
[0151] The scheduler is used to receive an access request sent by a target terminal. The access request is used to request to access target data from multiple memories of the target object; find multiple reference memories storing the target data from the multiple memories; and allocate a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects. The target terminal is used to access the target data from the target memory, and the target memory is a memory that meets the network resource consumption condition when the target terminal accesses the data among the multiple reference memories.
[0152] Through the above system, the target object includes multiple levels of sub-objects with a hierarchical relationship, and the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects. Each memory is used to store data of the sub-object corresponding to the corresponding level. Then, after receiving an access request for accessing target data sent by the target terminal, multiple reference memories storing the target data are found from the multiple memories. Then, according to the attribution relationship between the target terminal and the multiple levels of sub-objects, a target memory that meets the network resource consumption condition when the target terminal accesses the data is allocated from the reference memories. That is, by configuring multiple memories, the data of the target object is distributedly stored according to the hierarchical relationship of the sub-objects in the target object. On the one hand, the access speed of the terminal to the data is optimized, and on the other hand, the access load of the memory is reduced, which can solve the technical problem of low access efficiency of the data possessed by the target object in the related art and achieve the effect of improving the access efficiency of the data possessed by the target object.
[0153] Optionally, there is a connection relationship between the memories, and the scheduler is further configured to send a data synchronization request to a fifth memory among the multiple memories, where the synchronization request is used to request synchronizing the reference data stored in the fifth memory to a sixth memory other than the fifth memory among the multiple memories; the fifth memory is configured to, in response to the data synchronization request, calculate data verification information of the reference data, where the data verification information is used to indicate the data content of the reference data; transmit a data packet carrying the reference data and the data verification information to the sixth memory; the sixth memory is configured to, when receiving the data packet, perform data verification on the reference data in the data packet using the data verification information in the data packet, and store the reference data in the sixth memory when the data verification passes.
[0154] An embodiment of the present application further provides an access scheduling device for a memory, Figure 9 which is a structural block diagram of an access scheduling device for a memory according to an embodiment of the present application, as Figure 9 shown, the device includes:
[0155] A receiving module 902, configured to receive an access request sent by a target terminal, where the access request is used to request accessing target data from multiple memories of a target object, the target object includes multiple levels of sub-objects with a hierarchical relationship, the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects, and each memory is configured to store data of the corresponding level of sub-object;
[0156] A searching module 904, configured to search for multiple reference memories storing the target data from the multiple memories;
[0157] An allocation module 906, configured to allocate a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the target terminal is configured to access the target data from the target memory, and the target memory is a memory among the multiple reference memories that meets the network resource consumption condition when the target terminal accesses data.
[0158] Through the above device, the target object includes multiple levels of sub-objects with a hierarchical relationship, and multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects. Each memory is used to store data of the corresponding level of sub-objects. Then, after receiving an access request from the target terminal to access the target data, multiple reference memories storing the target data are found from the multiple memories. Then, according to the attribution relationship between the target terminal and the multiple levels of sub-objects, a target memory that meets the network resource consumption conditions when the target terminal accesses the data is allocated from the reference memories. That is, by configuring multiple memories and storing the data of the target object distributively by the multiple memories according to the hierarchical relationship of the sub-objects in the target object, on the one hand, the access speed of the terminal to the data is optimized, and on the other hand, the access load of the memory is reduced, which can solve the technical problem of low access efficiency of the data possessed by the target object in the related art and achieve the effect of improving the access efficiency of the data possessed by the target object.
[0159] Optionally, the allocation module includes:
[0160] A detection unit, configured to detect the access information of the reference memory according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the access information is used to indicate the network resource consumption when the target terminal accesses the corresponding reference memory;
[0161] An allocation unit, configured to allocate a target memory for the target terminal from the multiple reference memories according to the access information, where the target terminal is used to access the target data from the target memory.
[0162] Optionally, the detection unit is further configured to obtain the target attribution information of the target terminal, where the target attribution information is used to indicate the attribution relationship between the target terminal and the multiple levels of sub-objects; determine the data transmission rate corresponding to the target attribution information from the corresponding attribution information and transmission rate, where the access information includes the data transmission rate.
[0163] Optionally, the allocation unit is further configured to screen out a first memory from the multiple reference memories whose data transmission rate with the target terminal is greater than or equal to the target rate, where the access information includes the data transmission rate; determine the first memory as the target memory.
[0164] Optionally, the device further includes:
[0165] A configuration module, configured to configure an access path for the target terminal to access the target memory according to the connection relationship between the target terminal and the target memory;
[0166] A control module, configured to control the target terminal to access the target data stored in the target memory according to the access path.
[0167] Optionally, the configuration module includes:
[0168] A first configuration unit, configured to, when the connection relationship is used to indicate that the target terminal is connected to the target memory through a communication link, configure the target communication link as an access path for the target terminal to access the target memory;
[0169] A second configuration unit, configured to, when the connection relationship is used to indicate that the target terminal is connected to the target memory through a local area network, configure the local area network access path of the target memory as an access path for the target terminal to access the target memory;
[0170] A third configuration unit, configured to, when the connection relationship is used to indicate that the target terminal is connected to the target memory through the Internet, configure the Internet access path of the target memory as an access path for the target terminal to access the target memory.
[0171] Optionally, the apparatus further includes:
[0172] A lookup module, configured to, when the sub-object to which the target memory belongs is a sub-object having an indirect attribution relationship with the target terminal among multiple sub-objects, lookup a reference sub-object to which the target terminal directly belongs from the multiple sub-objects;
[0173] A synchronization module, configured to synchronize the target data to a second memory configured for the reference sub-object.
[0174] Optionally, the synchronization module includes:
[0175] A sending unit, configured to send a target transfer instruction to the target memory, where the target transfer instruction is used to instruct the target memory to call a transfer link between the target memory and the second memory to transfer the target data to the second memory.
[0176] Optionally, the apparatus further includes:
[0177] An obtaining module, configured to obtain reference access information of a reference terminal under a target sub-object in a multi-level sub-object within a reference time period before the current moment, where the reference access information is used to indicate the data access requirement situation of the reference terminal within the reference time period;
[0178] A prediction module, configured to predict target access information of the reference terminal within a target time period after the current moment based on the reference access information;
[0179] A storage module, configured to manage data stored in a third memory allocated to the target sub-object within the target time period according to the target access information.
[0180] Optionally, the apparatus further includes:
[0181] A detection module, configured to detect data information of data stored in a fourth memory among multiple memories, where the data information is used to indicate the access situation of the corresponding data in the fourth memory within a reference time period before the current moment;
[0182] A management module, configured to manage the data stored in the fourth memory according to the data information.
[0183] For the description of the features in the corresponding embodiment of the access scheduling device of the memory, reference can be made to the relevant description in the corresponding embodiment of the access scheduling method of the memory, which will not be elaborated here one by one.
[0184] An embodiment of the present application further provides an electronic device, including a memory and a processor. A computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above embodiments of the access scheduling method of the memory.
[0185] An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, where the computer program is configured to execute the steps in any one of the above embodiments of the access scheduling method of the memory when running.
[0186] In an exemplary embodiment, the above computer-readable storage medium may include, but is not limited to: various media such as a USB flash drive, a read-only memory (ROM for short), a random access memory (RAM for short), a mobile hard disk, a magnetic disk, or an optical disc that can store a computer program.
[0187] An embodiment of the present application further provides a computer program product, where the computer program product includes a computer program, and the computer program implements the steps in any one of the above embodiments of the access scheduling method of the memory when executed by a processor.
[0188] An embodiment of the present application further provides another computer program product, including a non-volatile computer-readable storage medium. The non-volatile computer-readable storage medium stores a computer program, and the computer program implements the steps in any one of the above embodiments of the access scheduling method of the memory when executed by a processor.
[0189] Those skilled in the art may further realize that the units and algorithm steps of each example described in connection with the embodiments disclosed herein can be implemented by electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of each example have been generally described according to their functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered as exceeding the scope of this application.
[0190] The above has introduced in detail a method for accessing and scheduling a memory provided by this application. Specific examples are used herein to elaborate on the principle and implementation manner of this application. The description of the above embodiments is only used to help understand the method and its core idea of this application. It should be noted that for those of ordinary skill in the art in this technical field, without departing from the principle of this application, several improvements and modifications can still be made to this application, and these improvements and modifications also fall within the protection scope of the claims of this application.
Claims
1. A method for access scheduling of a memory, characterized in that, Including: Receiving an access request sent by a target terminal, where the access request is used to request access to target data from multiple memories of a target object, the target object includes multiple levels of sub-objects with a hierarchical relationship, the multiple memories are configured in one-to-one correspondence with the multiple levels of sub-objects, and each memory is used to store data of the corresponding level of sub-object; Searching for multiple reference memories storing the target data from the multiple memories; Allocating a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the target terminal is used to access the target data from the target memory, and the target memory is a memory among the multiple reference memories that meets the network resource consumption condition when the target terminal accesses data.
2. The method according to claim 1, wherein: The allocating the target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects includes: Detecting access information of the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the access information is used to indicate the network resource consumption situation when the target terminal accesses the corresponding reference memory; Allocating a target memory for the target terminal from the multiple reference memories according to the access information, where the target terminal is used to access the target data from the target memory.
3. The method according to claim 2, wherein: The detecting the access information of the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects includes: Obtaining target attribution information of the target terminal, where the target attribution information is used to indicate the attribution relationship between the target terminal and the multiple levels of sub-objects; Determining a data transmission rate corresponding to the target attribution information from the attribution information and the transmission rate with a corresponding relationship, where the access information includes the data transmission rate.
4. The method according to claim 2, wherein: The allocating a target memory for the target terminal from the multiple reference memories according to the access information includes: Screening out first memories with a data transmission rate greater than or equal to a target rate between the target terminal and the multiple reference memories, where the access information includes the data transmission rate; Determining the first memory as the target memory.
5. The method according to claim 2, wherein: After the allocating a target memory for the target terminal from the multiple reference memories according to the access information, the method further includes: Configuring an access path for the target terminal to access the target memory according to the connection relationship between the target terminal and the target memory; Controlling the target terminal to access the target data stored in the target memory according to the access path.
6. The method according to claim 5, wherein: Configuring the access path information for the target terminal to access the target memory according to the connection relationship between the target terminal and the target memory includes: When the connection relationship is used to indicate that the target terminal is connected to the target memory through a communication link, configuring the target communication link as the access path for the target terminal to access the target memory; When the connection relationship is used to indicate that the target terminal is connected to the target memory through a local area network, configuring the local area network access path of the target memory as the access path for the target terminal to access the target memory; When the connection relationship is used to indicate that the target terminal is connected to the target memory through the Internet, configuring the Internet access path of the target memory as the access path for the target terminal to access the target memory.
7. The method according to claim 2, wherein: After allocating the target memory for the target terminal from multiple reference memories according to the access information, the method further includes: When the sub-object to which the target memory belongs is a sub-object that has an indirect attribution relationship with the target terminal among multiple sub-objects, searching for a reference sub-object to which the target terminal directly belongs from multiple sub-objects; Synchronizing the target data to a second memory configured for the reference sub-object.
8. The method according to claim 7, wherein: Synchronizing the target data to the second memory configured for the reference sub-object includes: Sending a target transfer instruction to the target memory, where the target transfer instruction is used to instruct the target memory to call a transfer link with the second memory to transfer the target data to the second memory.
9. The method according to claim 1, wherein: Before receiving the access request sent by the target terminal, the method further includes: Obtaining reference access information of a reference terminal under a target sub-object in multiple levels of sub-objects within a reference time period before the current moment, where the reference access information is used to indicate the data access requirement situation of the reference terminal within the reference time period; Predicting target access information of the reference terminal within a target time period after the current moment based on the reference access information; Managing the data stored in a third memory allocated to the target sub-object within the target time period according to the target access information.
10. The method according to claim 1, wherein: Before receiving the access request sent by the target terminal, the method further includes: Detecting data information of the data stored in a fourth memory among multiple memories, where the data information is used to indicate the access situation of the corresponding data in the fourth memory within a reference time period before the current moment; Managing the data stored in the fourth memory according to the data information.
11. An access scheduling system for a memory, characterized in that, Including: A scheduler, and a plurality of memories configured for a target object, the scheduler being connected to each of the memories, the target object including multiple levels of sub-objects having a hierarchical relationship, and the plurality of memories being configured in one-to-one correspondence with the multiple levels of sub-objects; The memory is used to store data of the sub-object at the corresponding level; The scheduler is configured to receive an access request sent by a target terminal, where the access request is used to request to access target data from the multiple memories of the target object; find multiple reference memories storing the target data from the multiple memories; and allocate a target memory for the target terminal from the reference memories according to the attribution relationship between the target terminal and the multiple levels of sub-objects, where the target terminal is used to access the target data from the target memory, and the target memory is a memory among the multiple reference memories that meets the network resource consumption condition when the target terminal accesses data.
12. The scheduling system according to claim 11, wherein There is a connection relationship among the plurality of memories; The scheduler is configured to send a data synchronization request to a fifth memory among the multiple memories, where the synchronization request is used to request to synchronize reference data stored in the fifth memory to a sixth memory other than the fifth memory among the multiple memories; The fifth memory is configured to respond to the data synchronization request, calculate data verification information of the reference data, where the data verification information is used to indicate the data content of the reference data; and transmit a data packet carrying the reference data and the data verification information to the sixth memory; The sixth memory is configured to, when receiving the data packet, use the data verification information in the data packet to perform data verification on the reference data in the data packet, and store the reference data in the sixth memory when the data verification passes.
13. An electronic device, characterized in that, Including: A memory for storing a computer program; A processor, when executing the computer program, implements the steps of the memory access scheduling method according to any one of claims 1 to 10.
14. A computer-readable storage medium, characterized in that, A computer program is stored in the computer-readable storage medium, where the computer program, when executed by a processor, implements the steps of the memory access scheduling method according to any one of claims 1 to 10.
15. A computer program product, comprising a computer program, characterized in that, The computer program, when executed by a processor, implements the steps of the memory access scheduling method according to any one of claims 1 to 10.
Citation Information
Patent Citations
Memory access method and device, chip and electronic equipment
CN114356223A
Data drilling service platform, access method and related equipment
CN116016475A
Resource access method and device, equipment and storage medium
CN116996575A
Data access scheduling method and device of memory
CN118502679A
Data transmission system
CN119620949A