CN111897487B - Method, device, electronic equipment and medium for managing data - Google Patents
Method, device, electronic equipment and medium for managing data Download PDFInfo
- Publication number
- CN111897487B CN111897487B CN202010544948.9A CN202010544948A CN111897487B CN 111897487 B CN111897487 B CN 111897487B CN 202010544948 A CN202010544948 A CN 202010544948A CN 111897487 B CN111897487 B CN 111897487B
- Authority
- CN
- China
- Prior art keywords
- storage
- data
- stored
- group
- memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application discloses a method, a device, electronic equipment and a medium for managing data. In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.
Description
Technical Field
The present application relates to data storage technologies, and in particular, to a method, an apparatus, an electronic device, and a medium for managing data.
Background
As the communications age and society rise, smart devices have evolved with the use of more and more users.
Among them, with the rapid development of the communication age, generation of a large amount of data has become a normal state. In the process of data application, the data is often required to be stored correspondingly. For example, with the development of network technology, the increasing amount of network data and the increasing rate of networks, the size of network caches is also increasing. Further, for the cache domain, shared cache is a common resource allocation policy in the communication domain. The buffer memory has the advantages that the buffer memory is shared by a plurality of queues, the buffer memory utilization rate can be greatly improved, and the buffer memory resources are reasonably utilized.
However, the shared cache structure existing in the related art occupies more management resources. Therefore, how to implement a scheme that can reasonably store data becomes a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The embodiment of the application provides a method, a device, electronic equipment and a medium for managing data, which are used for solving the problem that a shared cache structure in the related technology occupies more management resources.
According to an aspect of an embodiment of the present application, a method for managing data is provided, which is characterized by including:
acquiring a target storage area;
dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, and the storage capacity of each storage group corresponds to that of the corresponding storage group;
dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;
and storing the data to be stored by using the first number of storage groups and the second number of storage subareas.
Optionally, in another embodiment of the above method according to the present application, after dividing each of the memory groups into a second number of memory sub-regions based on a second preset rule, the method further includes:
acquiring a third number of data storage queues, wherein the third number is smaller than or equal to the first number;
allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;
And recording each mapping relation into a mapping database.
Optionally, in another embodiment of the above method according to the present application, after dividing each of the memory groups into a second number of memory sub-regions based on a second preset rule, the method further includes:
acquiring storage parameters of data to be stored;
determining a storage queue corresponding to the data to be stored based on a storage queue identifier in the data to be stored;
determining the first storage group mapped with the storage queue corresponding to the data to be stored based on the mapping database;
and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.
Optionally, in another embodiment of the above method according to the present application, after the determining the first storage group mapped to the storage queue corresponding to the data to be stored, the method includes:
when the data size of the data to be stored is detected to be not lower than the preset capacity, acquiring a priority label corresponding to the data to be stored;
when the priority label corresponding to the data to be stored is determined to meet the preset priority condition, the preset priority data stored in the first storage group is cleared, and the data to be stored is stored in the first storage group;
And when the priority label corresponding to the data to be stored is determined not to meet the preset priority condition, the data to be stored is cleared.
Optionally, in another embodiment of the above method according to the present application, after said storing the data to be stored in the first memory subarea of the first memory group, the method includes:
updating address offset information and queue length information of the first data storage queue, wherein the address offset information comprises queue head information and queue tail information, the address offset information is used for representing the position of currently stored data in the first data storage queue, and the queue length information is used for representing the storage capacity of the first data storage queue.
Optionally, in another embodiment of the above method according to the present application, after said storing the data to be stored in the first memory subarea of the first memory group, the method includes:
detecting the remaining storage space of the first storage group;
when the fact that the residual storage space of the first storage group is smaller than the target capacity is detected, acquiring a second storage group in an idle state;
and establishing a mapping relation between the second storage group and the first data storage queue.
Optionally, in another embodiment of the above method according to the present application, the storage capacity of each storage group corresponds to that of the storage group, including:
the storage capacity of each storage group is the same;
and, the memory capacity of each memory subarea in the same memory group corresponds to that of the memory subarea, including:
in the same memory group, the memory capacity of each memory subarea is the same.
According to another aspect of an embodiment of the present application, there is provided an apparatus for managing data, including:
an acquisition module configured to acquire a target storage area;
the first dividing module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group has at least a storage capacity capable of storing one data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;
a second dividing module, configured to divide each storage group into a second number of storage subareas based on a second preset rule, where the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;
and the storage module is used for storing data to be stored by utilizing the first number of storage groups and the second number of storage subareas.
According to still another aspect of an embodiment of the present application, there is provided an electronic apparatus including:
a memory for storing executable instructions; and
and the display is used for displaying with the memory to execute the executable instructions so as to complete the operation of any method for managing the data.
According to still another aspect of the embodiments of the present application, there is provided a computer-readable storage medium storing computer-readable instructions that, when executed, perform the operations of any of the above-described methods of managing data.
In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.
The technical scheme of the application is further described in detail through the drawings and the embodiments.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description, serve to explain the principles of the application.
The application may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a schematic diagram of a method for managing data according to the present application;
FIG. 2 is a flow chart of the stored data according to the present application;
FIG. 3 is a flow chart of another method for storing data according to the present application;
FIG. 4 is a schematic diagram of a method for managing data according to the present application;
FIG. 5 is a schematic diagram of a buffer allocation flow for managing data according to the present application;
FIG. 6 is a schematic diagram of an apparatus for managing data according to the present application;
fig. 7 is a schematic structural diagram of an electronic device for managing data according to the present application.
Detailed Description
Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present application unless it is specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description.
The following description of at least one exemplary embodiment is merely exemplary in nature and is in no way intended to limit the application, its application, or uses.
Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but are intended to be part of the specification where appropriate.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
In addition, the technical solutions of the embodiments of the present application may be combined with each other, but it is necessary to be based on the fact that those skilled in the art can implement the technical solutions, and when the technical solutions are contradictory or cannot be implemented, the combination of the technical solutions should be considered as not existing, and not falling within the scope of protection claimed by the present application.
It should be noted that all directional indicators (such as up, down, left, right, front, and rear … …) in the embodiments of the present application are merely used to explain the relative positional relationship, movement conditions, etc. between the components in a specific posture (as shown in the drawings), and if the specific posture is changed, the directional indicators are correspondingly changed.
A method for managing data according to an exemplary embodiment of the present application is described below with reference to fig. 1 to 5. It should be noted that the following application scenarios are only shown for facilitating understanding of the spirit and principles of the present application, and embodiments of the present application are not limited in this respect. Rather, embodiments of the application may be applied to any scenario where applicable.
The application also provides a method, a device, a target terminal and a medium for managing data.
Fig. 1 schematically shows a flow diagram of a method of managing data according to an embodiment of the application. As shown in fig. 1, the method includes:
s101, acquiring a target storage area.
S102, dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of each storage group.
It should be noted that, in the present application, the device for acquiring the target storage area is not specifically limited, and may be, for example, an intelligent device, a server, or the like.
Likewise, the scheme for storing data in the application can be applied to the field of caching. The cache refers to a memory capable of performing high-speed data exchange, and exchanges data with the CPU before the memory, so that the speed is high. The L1Cache (level one Cache) is the CPU level one Cache. The capacity and structure of the built-in L1cache have a large impact on the performance of the CPU, but the cache memory is composed of static RAM, the structure is complex, and the capacity of the L1cache cannot be made too large in the case that the CPU die area cannot be too large. The capacity of the L1cache is typically 32-256 KB. The L2Cache (second level Cache) is a second level Cache of the CPU, and is divided into an internal chip and an external chip. The internal chip secondary buffer memory has the same operation rate as the main frequency, and the external secondary buffer memory has only half of the main frequency.
Furthermore, the working principle of the buffer memory is that when the CPU is to read a data, the data is firstly searched from the CPU buffer memory, and the data is immediately read and sent to the CPU for processing; if the data is not found, the data is read from the memory with relatively low speed and sent to the CPU for processing, and meanwhile, the data block where the data is located is transferred into the cache, so that the reading of the whole data is carried out from the cache later, and the memory is not required to be transferred. It is this read mechanism that makes the hit rate of the CPU read cache very high, i.e. the data that the CPU next reads is mostly in the CPU cache. This also greatly saves the time for the CPU to directly read the memory, and also makes it substantially unnecessary to wait for the CPU to read the data.
S103, dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds.
S104, storing the data to be stored by using the first number of storage groups and the second number of storage subareas.
Further, in order to avoid the problem of unordered management of the cache area in the related art, the present application may first divide the target storage area into a first number of storage groups based on a first preset rule. It should be noted that, each storage group has at least a storage capacity capable of storing one data to be stored, and the storage capacity of each storage group is the same.
Similarly, in order to avoid the problem of unordered management of the cache area in the related art, the present application may further divide each storage group into a second number of storage sub-areas based on a second preset rule. It should be noted that the storage capacity of each memory subarea in the same memory group is the same.
The present application is not limited to the first number and the second number, and may be 3 or 5, for example. Furthermore, the first number and the second number may be the same, or the first number and the second number may be different.
In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.
Optionally, in a possible embodiment of the present application, after S103 (dividing each storage group into a second number of storage sub-areas based on a second preset rule), the following steps may be further implemented:
acquiring a third number of data storage queues;
allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;
and recording each mapping relation into a mapping database.
Furthermore, after obtaining the plurality of storage groups and the plurality of storage subareas, the application can also allocate one or more storage groups for each data storage queue and respectively establish a mapping relation between each data storage queue and the corresponding storage group. It can be understood that the storage group corresponding to the data storage queue is the storage data for storing the storage queue.
It should be noted that the third number of the present application should be less than or equal to the first number. For example, when the number of data storage queues is 3, the storage groups included in the target storage area should be 3 or more. To ensure that each data storage queue is assigned a different storage group.
For example, in the cache domain, each of the data storage queues is assigned a corresponding at least one storage group as explained in the following steps:
step 1: the whole cache is equally divided into N groups, wherein the cache sizes of each group are equal, and the cache size of each group is larger than at least one data to be cached.
Step 2: and (3) continuously dividing each group of caches in the step (1) into G storage subareas with the same size, namely, one group of caches in the step (1) is a storage group formed by the G storage subareas.
Step 3: the size of the number N of storage groups in the step 1 is related to the size of the cache management resource.
Step 4: a cache set is allocated for each enqueue data packet. For convenience of management, caches in one storage group are continuously allocated; and when the data is distributed to the last buffer subarea in one group, applying for the next buffer subarea, and distributing the data to the corresponding data queue.
Step 5: the caches of the same set of cache sub-areas are allocated to only one data queue.
Optionally, after dividing each memory group into a second number of memory subareas based on a second preset rule, the present application may further implement the following steps:
acquiring storage parameters of data to be stored;
Determining a storage queue corresponding to the data to be stored based on a storage queue identifier in the data to be stored;
determining a first storage group mapped with a storage queue corresponding to data to be stored based on a mapping database;
and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.
Further, after the data to be stored is obtained, the storage queue corresponding to the data to be stored can be determined according to the storage queue identifier carried by the data to be stored. And determining a first storage group in which the data to be stored is stored according to the storage group mapped by each storage queue stored in the mapping database. And storing the data to be stored in the first memory subarea of the first memory group.
And acquiring storage parameters of the data to be stored, wherein the storage parameters comprise data size parameters and storage queue identifiers.
In the application, when the data to be stored in the cache area is acquired, the corresponding storage parameters can be acquired, wherein the storage parameters comprise the data size parameter and the storage queue identifier. It can be appreciated that the present application can store the data to be stored in the corresponding data queue according to the storage queue identifier of the data to be stored.
Further, according to the storage parameters of the data to be stored, the first storage group where the first data storage queue corresponding to the data to be stored is located can be determined, and the data to be stored is stored in the first storage subarea of the first storage group.
The preset capacity is not particularly limited, that is, the preset capacity may be any number of storage capacities.
As shown in fig. 2, a flow chart of data storage according to the present application is shown, and as can be seen from fig. 2, corresponding data to be stored may be obtained first, and a data queue to be transmitted may be determined by using a queue identifier corresponding to the data to be stored. And when the remaining storage capacity of the data queue is determined to be larger than the data size of the data to be stored, the data to be stored can be stored in the first storage subarea of the first storage group. It should be noted that, the first memory subarea in the present application may be any memory subarea of a first memory group.
Further optionally, after determining the first storage group mapped to the storage queue corresponding to the data to be stored, the present application may further implement the following steps:
when the data size of the data to be stored is detected to be not lower than the preset capacity, acquiring a priority label corresponding to the data to be stored;
When the priority label corresponding to the data to be stored is determined to meet the preset priority condition, clearing the stored data of the preset priority of the first storage group, and storing the data to be stored in the first storage group;
and when the priority label corresponding to the data to be stored is determined not to meet the preset priority condition, the data to be stored is cleared.
Fig. 3 is a schematic flow chart of data storage according to the present application. As can be seen from fig. 3, the corresponding data to be stored may be obtained first, and the data queue to be transmitted may be determined by using the queue identifier corresponding to the data to be stored. And when the remaining storage capacity of the data queue is determined to be larger than the data size of the data to be stored, the data to be stored can be stored in the first storage subarea of the first storage group.
It should be noted that, when the data size of the data to be stored is detected to be not lower than the preset capacity, the remaining storage space representing the current data queue does not have a space for storing the data to be stored. The method and the device need to detect the priority label corresponding to the data to be stored, and when the priority label meets the preset priority condition, the data to be stored is stored preferentially. For example, it may include storing the data to be stored in the first storage group after clearing the lower priority stored data of the first storage group. Further, when the priority label corresponding to the data to be stored is detected not to meet the preset priority condition, the data is judged to be low in importance, and the data can be directly cleared.
Further alternatively, the present application may further include a specific embodiment after S103 (storing the data to be stored in the first memory sub-area of the first memory group), as shown in fig. 4, including:
s201, determining a storage queue corresponding to the data to be stored based on a storage queue identification in the data to be stored.
S202, determining a first storage group mapped to a storage queue corresponding to data to be stored based on a mapping database.
And S203, when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.
Optionally, after storing the data to be stored in the first memory sub-region of the first memory group, the following steps may be further performed:
updating address offset information and queue length information of the first data storage queue, wherein the address offset information comprises queue head information and queue tail information, the address offset information is used for representing the position of currently stored data in the first data storage queue, and the queue length information is used for representing the storage capacity of the first data storage queue.
Furthermore, in order to reasonably utilize the cache and prevent the situation that the data burst of a certain queue seriously affects other queues, a threshold value should be set for the storage group that can be allocated to each queue, so as to limit the cache length of each queue. For example, a head of line address including a memory group address and a memory sub-region offset address, and a tail of line address including a memory group address and a memory sub-region offset address in each queue may be recorded. And recording the captain information of the occupied memory subarea of each queue, namely the memory capacity of each queue.
In one possible implementation mode, the application can store the head information, the tail information and the captain information in each data queue in three RAMs respectively, wherein the RAM addresses are queue numbers, and the RAM data are head information, tail information and captain information.
As can be seen from fig. 5, in order to perform the buffer allocation according to the address offset information and the queue length information of the updated first data storage queue, the number of memory subareas in one storage group is two, the addresses are G1 and G2 respectively, and in the allocation process, the addresses of each storage group are continuously allocated, so that the offset addresses 0-G-1 of the storage group in use need to be recorded; g1 (0), G2 (0) represents that the storage group is not allocated, and the next allocation is started from G1 (0); g1 (i), G2 (0), i ε [1:G-1] representing starting allocation from G1 (i); g1 (0), G2 (j), j ε [1:G-1] represents starting allocation from G2 (j); g1 (G) or G2 (G) represents that the cache set has been allocated, starting from another cache set and waiting for a new cache set to be allocated by the second level cache module; s323, in the step S31, the number of the residual buffer sub-areas can be calculated by i and j, and the formula is 2G-i-j. When the allocation of the cache is completed, G1, G2, i, j and the like need to be modified.
Further, after the data is enqueued, the buffer control module may write the data frame into the corresponding buffer according to the allocated buffer sub-region address and the buffer sub-region sequence, and implement the following steps:
wherein updating address offset information and captain information of the first data storage queue may include:
acquiring captain information, wherein the captain information acquired at the moment is the frame length before enqueuing; if the queue length before data enqueuing is zero, writing a data head address Ph into the queue head information of the buffer queue management module, wherein the queue head information comprises a buffer subarea group address and a buffer subarea offset address; updating the tail information, and writing the tail address Pt of the data frame in the step S32 into the tail information of the buffer queue management module, wherein the tail information comprises a buffer subarea address and a buffer subarea offset address; and updating the captain information, and re-writing the captain after the captain is enqueued by adding the captain with the new enqueue frame length into the captain information.
S204, detecting the residual storage space of the first storage group.
S205, when the residual storage space of the first storage group is detected to be smaller than the target capacity, acquiring a second storage group in an idle state.
S206, establishing a mapping relation between the second storage group and the first data storage queue.
Further, the application also includes the case of calling out the stored data already stored in the data queue:
receiving a data dequeue application, and initiating the dequeue application by dequeue scheduling, wherein the dequeue application comprises information such as dequeue queues, the number N' of dequeue cache subregions and the like;
dequeue queue queries, comprising: inquiring queue length information, and if the length L of the queue buffer subarea is zero, not dequeuing; if L > =n ', N' cache sub-regions are output; if L < N', then outputting L data;
inquiring the information of the head of the queue to obtain the address Sh of the cache subarea group of the head of the dequeue and the offset address i of the cache subarea;
when the dequeue instruction is generated, generating dequeue instructions according to the number of dequeues required, wherein each dequeue instruction corresponds to a buffer subarea requiring dequeue and comprises a buffer subarea group address and a group offset address of the buffer subarea; sequentially generating dequeue instructions from the group offset address of the first buffer subregion by the address of the first queue, and giving dequeue addresses Sh (i) and Sh (i+1) until the dequeue number is finished or Sh (G-1) addresses, wherein G is the number of buffer subregions contained in the buffer subregion group; if the dequeue number of the first cache sub-region group is insufficient, dequeuing from the next cache sub-region group is needed, the address of the next cache sub-region group is obtained from the cache linked list information, and dequeuing instructions are continuously generated in sequence.
After the dequeue instruction is generated, recording the address St (j) of the next jump buffer subarea of the last dequeue; reading out data frames from the cache in sequence according to the address of the cache subarea group and the offset address of the cache subarea in the generated dequeue instruction; when the queue information is updated, the queue head information can be updated, and the address St (j) of the middle buffer memory subarea is written into the queue tail information RAM; updating queue length information, subtracting the number of the dequeue buffer memory subareas from the queue length L, and re-writing the queue length information into a queue length information RAM; if the dequeue of the last buffer subarea Sh (G-1) of the buffer subarea group is successful during dequeuing, the buffer subarea group Sh is released, and the linked list information and the idle buffer information in the secondary buffer management are updated; updating the information of the cache linked list, clearing the next hop address corresponding to the Sh address in the cache linked list, and setting the next hop address as invalid; updating the free cache FIFO and rewriting the address Sh into the free cache FIFO.
In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.
In another embodiment of the present application, as shown in fig. 6, the present application further provides an apparatus for managing data. The device comprises an acquisition module 301, a determination module 301, a storage module 303, wherein,
an acquisition module configured to acquire a target storage area;
the first dividing module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group has at least a storage capacity capable of storing one data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;
a second dividing module, configured to divide each storage group into a second number of storage subareas based on a second preset rule, where the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;
and the storage module is used for storing data to be stored by utilizing the first number of storage groups and the second number of storage subareas.
In the application, after the target storage area is acquired, the target storage area can be divided into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, each storage group is divided into a second number of storage subareas based on a second preset rule, and the first number of storage groups and the second number of storage subareas are utilized to store the data to be stored. By applying the technical scheme of the application, after the data to be stored is acquired, the data can be stored into the storage subareas in the corresponding storage groups in a targeted manner according to the corresponding queue identifications. Thereby avoiding the problem of unordered data storage in any cache area in the related art.
In another embodiment of the present application, the obtaining module 301 further includes:
an obtaining module 301, configured to obtain a third number of data storage queues, where the third number is less than or equal to the first number;
the acquiring module 301 is configured to allocate at least one corresponding storage group for each data storage queue, and establish a mapping relationship between each data storage queue and the corresponding storage group;
the obtaining module 301 is configured to record each mapping relation into a mapping database.
In another embodiment of the present application, the obtaining module 301 further includes:
an obtaining module 301, configured to obtain storage parameters of the data to be stored;
an obtaining module 301, configured to determine a storage queue corresponding to the data to be stored based on a storage queue identifier in the data to be stored;
an obtaining module 301, configured to determine, based on the mapping database, the first storage group mapped to the storage queue corresponding to the data to be stored;
the obtaining module 301 is configured to store the data to be stored in the first memory subarea of the first memory group when detecting that the data size of the data to be stored is lower than a preset capacity.
In another embodiment of the present application, the obtaining module 301 further includes:
the acquiring module 301 is configured to acquire a priority label corresponding to the data to be stored when detecting that the data size of the data to be stored is not lower than the preset capacity;
an obtaining module 301, configured to clear preset priority data stored in the first storage group and store the data to be stored in the first storage group when determining that a priority label corresponding to the data to be stored meets a preset priority condition;
the obtaining module 301 is configured to clear the data to be stored when it is determined that the priority label corresponding to the data to be stored does not meet the preset priority condition.
In another embodiment of the present application, the method further comprises an updating module 304, wherein:
the updating module 304 is configured to update address offset information and queue length information of the first data storage queue, where the address offset information includes queue head information and queue tail information, the address offset information is used to represent a location of currently stored data in the first storage queue, and the queue length information is used to represent a storage capacity of the first data storage queue.
In another embodiment of the present application, the update module 304 further includes:
an update module 304 configured to detect a remaining storage space of the first storage group;
an updating module 304 configured to acquire a second storage group in an idle state when detecting that the remaining storage space of the first storage group is smaller than a target capacity;
an updating module 304 is configured to establish a mapping relationship between the second storage group and the first data storage queue.
In another embodiment of the present application, the storage capacity of each of the storage groups is the same;
and, the memory capacity of each memory subarea in the same memory group corresponds to that of the memory subarea, including:
in the same memory group, the memory capacity of each memory subarea is the same.
Fig. 7 is a block diagram of a logic structure of an electronic device, according to an example embodiment. For example, electronic device 400 may be a mobile phone, computer, digital broadcast terminal, messaging device, game console, tablet device, medical device, exercise device, personal digital assistant, or the like.
Referring to fig. 7, an electronic device 400 may include one or more of the following components: a processor 401 and a memory 402.
Processor 401 may include one or more processing cores such as a 4-core processor, an 8-core processor, etc. The processor 401 may be implemented in at least one hardware form of DSP (Digital Signal Processing ), FPGA (Field-Programmable Gate Array, field programmable gate array), PLA (Programmable Logic Array ). The processor 401 may also include a main processor, which is a processor for processing data in an awake state, also called a CPU (Central Processing Unit ), and a coprocessor; a coprocessor is a low-power processor for processing data in a standby state. In some embodiments, the processor 401 may integrate a GPU (Graphics Processing Unit, image processor) for rendering and drawing of content required to be displayed by the display screen. In some embodiments, the processor 401 may also include an AI (Artificial Intelligence ) processor for processing computing operations related to machine learning.
Memory 402 may include one or more computer-readable storage media, which may be non-transitory. Memory 402 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 402 is used to store at least one instruction for execution by processor 401 to implement the interactive special effect calibration method provided by the method embodiments of the present application.
In some embodiments, the electronic device 400 may further optionally include: a peripheral interface 403 and at least one peripheral. The processor 401, memory 402, and peripheral interface 403 may be connected by a bus or signal line. The individual peripheral devices may be connected to the peripheral device interface 403 via buses, signal lines or a circuit board. Specifically, the peripheral device includes: at least one of radio frequency circuitry 404, a touch display 405, a camera 406, audio circuitry 407, a positioning component 408, and a power supply 409.
Peripheral interface 403 may be used to connect at least one Input/Output (I/O) related peripheral to processor 401 and memory 402. In some embodiments, processor 401, memory 402, and peripheral interface 403 are integrated on the same chip or circuit board; in some other embodiments, either or both of the processor 401, memory 402, and peripheral interface 403 may be implemented on separate chips or circuit boards, which is not limited in this embodiment.
The Radio Frequency circuit 404 is configured to receive and transmit RF (Radio Frequency) signals, also known as electromagnetic signals. The radio frequency circuitry 404 communicates with a communication network and other communication devices via electromagnetic signals. The radio frequency circuit 404 converts an electrical signal into an electromagnetic signal for transmission, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 404 includes: antenna systems, RF transceivers, one or more amplifiers, tuners, oscillators, digital signal processors, codec chipsets, subscriber identity module cards, and so forth. The radio frequency circuitry 404 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocol includes, but is not limited to: metropolitan area networks, various generations of mobile communication networks (2G, 3G, 4G, and 5G), wireless local area networks, and/or WiFi (Wireless Fidelity ) networks. In some embodiments, the radio frequency circuitry 404 may also include NFC (Near Field Communication ) related circuitry, which is not limiting of the application.
The display screen 405 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 405 is a touch display screen, the display screen 405 also has the ability to collect touch signals at or above the surface of the display screen 405. The touch signal may be input as a control signal to the processor 401 for processing. At this time, the display screen 405 may also be used to provide virtual buttons and/or a virtual keyboard, also referred to as soft buttons and/or a soft keyboard. In some embodiments, the display screen 405 may be one, providing a front panel of the electronic device 400; in other embodiments, the display screen 405 may be at least two, and disposed on different surfaces of the electronic device 400 or in a folded design; in still other embodiments, the display 405 may be a flexible display disposed on a curved surface or a folded surface of the electronic device 400. Even more, the display screen 405 may be arranged in an irregular pattern that is not rectangular, i.e. a shaped screen. The display 405 may be made of LCD (Liquid Crystal Display ), OLED (Organic Light-Emitting Diode) or other materials.
The camera assembly 406 is used to capture images or video. Optionally, camera assembly 406 includes a front camera and a rear camera. Typically, the front camera is disposed on the front panel of the terminal and the rear camera is disposed on the rear surface of the terminal. In some embodiments, the at least two rear cameras are any one of a main camera, a depth camera, a wide-angle camera and a tele camera, so as to realize that the main camera and the depth camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize a panoramic shooting and Virtual Reality (VR) shooting function or other fusion shooting functions. In some embodiments, camera assembly 406 may also include a flash. The flash lamp can be a single-color temperature flash lamp or a double-color temperature flash lamp. The dual-color temperature flash lamp refers to a combination of a warm light flash lamp and a cold light flash lamp, and can be used for light compensation under different color temperatures.
The audio circuit 407 may include a microphone and a speaker. The microphone is used for collecting sound waves of users and environments, converting the sound waves into electric signals, and inputting the electric signals to the processor 401 for processing, or inputting the electric signals to the radio frequency circuit 404 for realizing voice communication. For purposes of stereo acquisition or noise reduction, the microphone may be multiple and separately disposed at different locations of the electronic device 400. The microphone may also be an array microphone or an omni-directional pickup microphone. The speaker is used to convert electrical signals from the processor 401 or the radio frequency circuit 404 into sound waves. The speaker may be a conventional thin film speaker or a piezoelectric ceramic speaker. When the speaker is a piezoelectric ceramic speaker, not only the electric signal can be converted into a sound wave audible to humans, but also the electric signal can be converted into a sound wave inaudible to humans for ranging and other purposes. In some embodiments, audio circuit 407 may also include a headphone jack.
The location component 408 is used to locate the current geographic location of the electronic device 400 to enable navigation or LBS (Location Based Service, location-based services). The positioning component 408 may be a positioning component based on the united states GPS (Global Positioning System ), the beidou system of china, the grainer system of russia, or the galileo system of the european union.
The power supply 409 is used to power the various components in the electronic device 400. The power supply 409 may be an alternating current, a direct current, a disposable battery, or a rechargeable battery. When power supply 409 comprises a rechargeable battery, the rechargeable battery may support wired or wireless charging. The rechargeable battery may also be used to support fast charge technology.
In some embodiments, the electronic device 400 further includes one or more sensors 410. The one or more sensors 410 include, but are not limited to: acceleration sensor 411, gyroscope sensor 412, pressure sensor 413, fingerprint sensor 414, optical sensor 415, and proximity sensor 416.
The acceleration sensor 411 may detect the magnitudes of accelerations on three coordinate axes of the coordinate system established with the electronic device 400. For example, the acceleration sensor 411 may be used to detect components of gravitational acceleration on three coordinate axes. The processor 401 may control the touch display screen 405 to display a user interface in a lateral view or a longitudinal view according to the gravitational acceleration signal acquired by the acceleration sensor 411. The acceleration sensor 411 may also be used for the acquisition of motion data of a game or a user.
The gyro sensor 412 may detect a body direction and a rotation angle of the electronic device 400, and the gyro sensor 412 may collect a 3D motion of the user on the electronic device 400 in cooperation with the acceleration sensor 411. The processor 401 may implement the following functions according to the data collected by the gyro sensor 412: motion sensing (e.g., changing UI according to a tilting operation by a user), image stabilization at shooting, game control, and inertial navigation.
The pressure sensor 413 may be disposed at a side frame of the electronic device 400 and/or at an underlying layer of the touch screen 405. When the pressure sensor 413 is disposed on a side frame of the electronic device 400, a grip signal of the user on the electronic device 400 may be detected, and the processor 401 performs a left-right hand recognition or a shortcut operation according to the grip signal collected by the pressure sensor 413. When the pressure sensor 413 is disposed at the lower layer of the touch display screen 405, the processor 401 controls the operability control on the UI interface according to the pressure operation of the user on the touch display screen 405. The operability controls include at least one of a button control, a scroll bar control, an icon control, and a menu control.
The fingerprint sensor 414 is used to collect a fingerprint of the user, and the processor 401 identifies the identity of the user based on the fingerprint collected by the fingerprint sensor 414, or the fingerprint sensor 414 identifies the identity of the user based on the collected fingerprint. Upon recognizing that the user's identity is a trusted identity, the user is authorized by the processor 401 to perform relevant sensitive operations including unlocking the screen, viewing encrypted information, downloading software, paying for and changing settings, etc. The fingerprint sensor 414 may be provided on the front, back, or side of the electronic device 400. When a physical key or vendor Logo is provided on the electronic device 400, the fingerprint sensor 414 may be integrated with the physical key or vendor Logo.
The optical sensor 415 is used to collect the ambient light intensity. In one embodiment, the processor 401 may control the display brightness of the touch display screen 405 according to the ambient light intensity collected by the optical sensor 415. Specifically, when the intensity of the ambient light is high, the display brightness of the touch display screen 405 is turned up; when the ambient light intensity is low, the display brightness of the touch display screen 405 is turned down. In another embodiment, the processor 401 may also dynamically adjust the shooting parameters of the camera assembly 406 according to the ambient light intensity collected by the optical sensor 415.
A proximity sensor 416, also referred to as a distance sensor, is typically provided on the front panel of the electronic device 400. The proximity sensor 416 is used to collect distance between the user and the front of the electronic device 400. In one embodiment, when the proximity sensor 416 detects a gradual decrease in the distance between the user and the front of the electronic device 400, the processor 401 controls the touch display 405 to switch from the bright screen state to the off screen state; when the proximity sensor 416 detects that the distance between the user and the front surface of the electronic device 400 gradually increases, the processor 401 controls the touch display screen 405 to switch from the off-screen state to the on-screen state.
Those skilled in the art will appreciate that the structure shown in fig. 7 is not limiting of the electronic device 400 and may include more or fewer components than shown, or may combine certain components, or may employ a different arrangement of components.
In an exemplary embodiment, there is also provided a non-transitory computer readable storage medium, such as memory 404, including instructions executable by processor 420 of electronic device 400 to perform a method of managing data as described above, the method comprising: acquiring a target storage area; dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, and the storage capacity of each storage group corresponds to that of the corresponding storage group; dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea; and storing the data to be stored by using the first number of storage groups and the second number of storage subareas. Optionally, the above instructions may also be executed by the processor 420 of the electronic device 400 to perform the other steps involved in the above-described exemplary embodiments. For example, the non-transitory computer readable storage medium may be ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.
In an exemplary embodiment, there is also provided an application/computer program product comprising one or more instructions executable by the processor 420 of the electronic device 400 to perform the above-described method of managing data, the method comprising: acquiring a target storage area; dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity capable of storing one piece of data to be stored, and the storage capacity of each storage group corresponds to that of the corresponding storage group; dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea; and storing the data to be stored by using the first number of storage groups and the second number of storage subareas. Optionally, the above instructions may also be executed by the processor 420 of the electronic device 400 to perform the other steps involved in the above-described exemplary embodiments.
Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It is to be understood that the application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (8)
1. A method of managing data, comprising:
acquiring a target storage area;
dividing the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group at least has a storage capacity for storing one data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;
dividing each storage group into a second number of storage subareas based on a second preset rule, wherein the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;
storing data to be stored by utilizing the first number of storage groups and the second number of storage subareas;
wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:
acquiring a third number of data storage queues, wherein the third number is smaller than or equal to the first number;
Allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;
recording each mapping relation into a mapping database;
wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:
acquiring storage parameters of the data to be stored;
determining a storage queue corresponding to the data to be stored based on a storage queue identifier in the data to be stored;
determining a first storage group mapped with a storage queue corresponding to the data to be stored based on a mapping database;
and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.
2. The method of claim 1, wherein after said determining said first storage group mapped to a storage queue corresponding to said data to be stored, comprising:
when the data size of the data to be stored is detected to be not lower than the preset capacity, acquiring a priority label corresponding to the data to be stored;
When the priority label corresponding to the data to be stored is determined to meet the preset priority condition, the preset priority data stored in the first storage group is cleared, and the data to be stored is stored in the first storage group;
and when the priority label corresponding to the data to be stored is determined not to meet the preset priority condition, the data to be stored is cleared.
3. The method of claim 1, after said storing said data to be stored in a first memory sub-region of said first memory group, comprising:
updating address offset information and queue length information of a first data storage queue, wherein the address offset information comprises queue head information and queue tail information, the address offset information is used for representing the position of currently stored data in the first data storage queue, and the queue length information is used for representing the storage capacity of the first data storage queue.
4. The method of claim 3, after said storing said data to be stored in a first memory sub-region of said first memory group, comprising:
detecting the remaining storage space of the first storage group;
when the fact that the residual storage space of the first storage group is smaller than the target capacity is detected, acquiring a second storage group in an idle state;
And establishing a mapping relation between the second storage group and the first data storage queue.
5. The method of any of claims 1-4, wherein the storage capacity of each of the storage groups corresponds to comprising:
the storage capacity of each storage group is the same;
and, the memory capacity of each memory subarea in the same memory group corresponds to that of the memory subarea, including:
in the same memory group, the memory capacity of each memory subarea is the same.
6. An apparatus for managing data, comprising:
an acquisition module configured to acquire a target storage area;
the first dividing module is configured to divide the target storage area into a first number of storage groups based on a first preset rule, wherein each storage group is provided with at least one storage capacity for storing data to be stored, and the storage capacity of each storage group corresponds to the storage capacity of the corresponding storage group;
a second dividing module, configured to divide each storage group into a second number of storage subareas based on a second preset rule, where the storage capacity of each storage subarea in the same storage group corresponds to that of each storage subarea;
a storage module configured to store data to be stored using the first number of storage groups and the second number of storage sub-regions;
Wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:
acquiring a third number of data storage queues, wherein the third number is smaller than or equal to the first number;
allocating at least one corresponding storage group for each data storage queue, and respectively establishing a mapping relation between each data storage queue and the corresponding storage group;
recording each mapping relation into a mapping database;
wherein after dividing each memory group into a second number of memory sub-regions based on a second preset rule, the method further comprises:
acquiring storage parameters of the data to be stored;
determining a storage queue corresponding to the data to be stored based on a storage queue identifier in the data to be stored;
determining a first storage group mapped with a storage queue corresponding to the data to be stored based on a mapping database;
and when the data size of the data to be stored is detected to be lower than the preset capacity, storing the data to be stored in a first memory subarea of the first memory group.
7. An electronic device, comprising:
A memory for storing executable instructions; the method comprises the steps of,
a processor for displaying with the memory to execute the executable instructions to perform operations of the method of managing data of any one of claims 1-5.
8. A computer readable storage medium storing computer readable instructions which, when executed, perform the operations of the method of managing data of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010544948.9A CN111897487B (en) | 2020-06-15 | 2020-06-15 | Method, device, electronic equipment and medium for managing data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010544948.9A CN111897487B (en) | 2020-06-15 | 2020-06-15 | Method, device, electronic equipment and medium for managing data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111897487A CN111897487A (en) | 2020-11-06 |
| CN111897487B true CN111897487B (en) | 2023-08-18 |
Family
ID=73206690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010544948.9A Active CN111897487B (en) | 2020-06-15 | 2020-06-15 | Method, device, electronic equipment and medium for managing data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111897487B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112732194B (en) * | 2021-01-13 | 2022-08-19 | 同盾科技有限公司 | Irregular data storage method, device and storage medium |
| CN113148507B (en) * | 2021-03-11 | 2022-08-26 | 上海电气慧程智能系统有限公司 | Planning method and device for biological sample access path and electronic equipment |
| CN113407741B (en) * | 2021-06-04 | 2022-09-20 | 北京三快在线科技有限公司 | Material management method, device, electronic equipment and storage medium |
| CN113778342B (en) * | 2021-09-17 | 2024-03-29 | 土巴兔集团股份有限公司 | Data storage method and related equipment thereof |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4435752A (en) * | 1973-11-07 | 1984-03-06 | Texas Instruments Incorporated | Allocation of rotating memory device storage locations |
| WO2005066761A2 (en) * | 2003-12-29 | 2005-07-21 | Intel Corporation | Method, system, and program for managing parity raid data reconstruction |
| US9112818B1 (en) * | 2010-02-05 | 2015-08-18 | Marvell Isreal (M.I.S.L) Ltd. | Enhanced tail dropping in a switch |
| KR101754348B1 (en) * | 2016-06-17 | 2017-07-06 | 고려대학교 산학협력단 | Analyzing system for managing information storage table control method thereof |
| CN109683809A (en) * | 2018-11-19 | 2019-04-26 | 深圳市艾锐达光电有限公司 | A kind of date storage method and terminal |
| CN110968549A (en) * | 2019-11-18 | 2020-04-07 | Oppo（重庆）智能科技有限公司 | File storage method and device, electronic equipment and medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7146466B2 (en) * | 2004-03-23 | 2006-12-05 | International Business Machines | System for balancing multiple memory buffer sizes and method therefor |
| US9898213B2 (en) * | 2015-01-23 | 2018-02-20 | Commvault Systems, Inc. | Scalable auxiliary copy processing using media agent resources |
| US9996404B2 (en) * | 2016-09-01 | 2018-06-12 | Oracle International Corporation | Message cache management for message queues |
-
2020
- 2020-06-15 CN CN202010544948.9A patent/CN111897487B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4435752A (en) * | 1973-11-07 | 1984-03-06 | Texas Instruments Incorporated | Allocation of rotating memory device storage locations |
| WO2005066761A2 (en) * | 2003-12-29 | 2005-07-21 | Intel Corporation | Method, system, and program for managing parity raid data reconstruction |
| US9112818B1 (en) * | 2010-02-05 | 2015-08-18 | Marvell Isreal (M.I.S.L) Ltd. | Enhanced tail dropping in a switch |
| KR101754348B1 (en) * | 2016-06-17 | 2017-07-06 | 고려대학교 산학협력단 | Analyzing system for managing information storage table control method thereof |
| CN109683809A (en) * | 2018-11-19 | 2019-04-26 | 深圳市艾锐达光电有限公司 | A kind of date storage method and terminal |
| CN110968549A (en) * | 2019-11-18 | 2020-04-07 | Oppo（重庆）智能科技有限公司 | File storage method and device, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111897487A (en) | 2020-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111897487B (en) | Method, device, electronic equipment and medium for managing data | |
| CN110944374B (en) | Communication mode selection method and device, electronic equipment and medium | |
| CN110134521B (en) | Resource allocation method, device, resource manager and storage medium | |
| CN108762881B (en) | Interface drawing method and device, terminal and storage medium | |
| CN113127181B (en) | Memory management method, device and storage medium | |
| CN110659127A (en) | Method, device and system for processing task | |
| CN108920606B (en) | Map data processing method, map data processing device, terminal equipment and storage medium | |
| CN110673944B (en) | Method and device for executing task | |
| CN108848492B (en) | Method, device, terminal and storage medium for starting user identity identification card | |
| CN110968815B (en) | Page refreshing method, device, terminal and storage medium | |
| CN115766490A (en) | Calibration data acquisition method, calibration data storage method, device and equipment | |
| CN111666076B (en) | Layer adding method, device, terminal and storage medium | |
| CN111459410B (en) | Memory space allocation method and device, electronic equipment and storage medium | |
| CN111008083B (en) | Page communication method and device, electronic equipment and storage medium | |
| CN111275607A (en) | Interface display method and device, computer equipment and storage medium | |
| CN110908802A (en) | Method, device, equipment and storage medium for calling service | |
| CN111897488B (en) | Method, device, electronic equipment and medium for managing data | |
| CN111914985A (en) | Configuration method and device of deep learning network model and storage medium | |
| CN112597417B (en) | Page updating method and device, electronic equipment and storage medium | |
| CN115344537A (en) | Storage space allocation method and device, file system and storage medium | |
| CN111708669B (en) | Analysis method, device, equipment and storage medium for system operation | |
| CN111191254B (en) | Access verification method, device, computer equipment and storage medium | |
| CN114785766A (en) | Control method of intelligent equipment, terminal and server | |
| CN110032421B (en) | Method and device for managing atlas in memory, terminal and storage medium | |
| CN110851435B (en) | Data storage method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |