CN108804340B - Android system data recovery method, storage medium, electronic device and system - Google Patents
Android system data recovery method, storage medium, electronic device and system Download PDFInfo
- Publication number
- CN108804340B CN108804340B CN201810284113.7A CN201810284113A CN108804340B CN 108804340 B CN108804340 B CN 108804340B CN 201810284113 A CN201810284113 A CN 201810284113A CN 108804340 B CN108804340 B CN 108804340B
- Authority
- CN
- China
- Prior art keywords
- data
- cache space
- space
- pointers
- recovery
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
- G06F12/0811—Multiuser, multiprocessor or multiprocessing cache systems with multilevel cache hierarchies
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention discloses a method, a storage medium, electronic equipment and a system for recovering data of an android system, and relates to the technical field of android system development, wherein a continuous memory space is arranged for storing discrete data pointers, and the discrete data pointers are stored in the memory space in a continuous mode; and expanding the memory space into a first cache space, a second cache space and a third cache space with sequentially increasing space sizes, and setting an initial cache space in the register. Firstly, the read-write speed of the register is obviously higher than that of the memory, so that the data pointer can be cached and recycled in the initial cache space quickly; and secondly, data recovery is not needed to be performed by traversing all the data in the cache, but only the data corresponding to the useless data pointers in the initial cache space and the first cache space are recovered, the data recovery amount is far smaller than that of the traditional scheme, effective management and recovery of the data are realized, and the data recovery efficiency is greatly improved.
Description
Technical Field
The invention relates to the technical field of android system development, in particular to a method, a storage medium, electronic equipment and a system for android system data recovery.
Background
In the Android development process, the execution of a program needs to be driven by data, and data management in the traditional development process is handed to a system for recovery and processing. If the data recovered and processed by the system is not processed properly, the recovery may be not timely or slow, which may lead to a long-term high memory under certain circumstances, and in severe cases, an exception that the memory is out of range may be generated.
The traditional scheme has simpler recovery algorithm design, namely, the whole pointer container space is simply traversed, corresponding data is found according to traversed pointer information, whether the data has reference relation or not is judged, if not, the data is directly recovered, and if so, the data is not recovered. This strategy can be slow and each time all data caches need to be traversed, recovery efficiency can be reduced.
Meanwhile, a mechanism for periodically recovering data is needed for recovering the data, the conventional recovery mechanism realizes periodic recovery through a timer, and the recovery strategy is used for continuously recovering the data when the single memory is not occupied very much, so that the system performance is reduced, the resource overhead of the system is greatly lost, the power consumption overhead is increased, and the like.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a data recovery method, a storage medium, an electronic device and a system for an android system, which can effectively manage and recover data and greatly improve the data recovery efficiency.
In order to achieve the above purpose, the technical scheme adopted by the invention is a method for recovering data of an android system, which comprises the following steps:
s1, setting a continuous memory space for storing discrete data pointers, and storing the discrete data pointers in the memory space in a continuous mode;
s2, expanding the memory space into a first cache space, a second cache space and a third cache space with sequentially increasing space size, and setting an initial cache space in a register, wherein the initial cache space is the same as the third cache space in size;
s3, when data needs to be cached, first storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence;
s4, when the first, second, and third cache spaces are full, and data recovery is triggered, first recovering useless data pointers in the initial cache space and the first cache space, and then recovering data corresponding to the recovered data pointers; and moving the data pointer step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
On the basis of the above technical solution, the size of the third cache space is three times that of the first cache space, and the size of the second cache space is two times that of the first cache space.
On the basis of the technical scheme, data recovery is triggered when the memory overhead is greater than a preset threshold value.
On the basis of the above technical solution, step S3 specifically includes:
s301, when data needs to be cached, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space;
s302, when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space and then moving the data pointer to the second cache space;
s303, when data needs to be cached again, firstly storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space; when data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
and S304, repeating the steps S301 to S304 until the first buffer space, the second buffer space and the third buffer space are filled in sequence.
The invention also discloses a storage medium, wherein a computer program is stored on the storage medium, and when being executed by a processor, the computer program realizes the data recovery method of the android system.
The invention also discloses electronic equipment which comprises a memory and a processor, wherein the memory is stored with a computer program running on the processor, and the method for recovering the data of the android system is realized when the processor executes the computer program.
The invention also discloses a system for recovering the data of the android system, which comprises the following steps:
the data pointer storage module is used for setting a continuous memory space for storing discrete data pointers and storing the discrete data pointers in the memory space in a continuous mode;
the data pointer capacity expansion module is used for expanding the memory space, wherein the capacity expansion is performed on a first cache space, a second cache space and a third cache space which are sequentially increased in space size, and an initial cache space is arranged in a register and is the same as the third cache space in size;
the data pointer recovery module is used for storing a data pointer corresponding to data in the initial cache space when the data needs to be cached; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence; after the first cache space, the second cache space and the third cache space are all filled, when data recovery is triggered, the useless data pointers in the initial cache space and the first cache space are recovered, and then the data corresponding to the recovered data pointers are recovered; and moving the data pointer step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
On the basis of the above technical solution, the size of the third cache space is three times that of the first cache space, and the size of the second cache space is two times that of the first cache space.
On the basis of the technical scheme, the data pointer recovery module is further used for triggering data recovery when the memory overhead is greater than a preset threshold value.
On the basis of the above technical solution, the data pointer recovery module is specifically configured to:
when data needs to be cached, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space;
when data needs to be cached again, firstly storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space and then moving the data pointer to the second cache space;
when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space; when data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
and repeating the steps until the first cache space, the second cache space and the third cache space are sequentially filled.
Compared with the prior art, the invention has the advantages that:
the invention sets a continuous memory space for storing discrete data pointers, and stores the discrete data pointers in the memory space in a continuous mode; and carrying out capacity expansion on the memory space, wherein the capacity expansion is a first cache space, a second cache space and a third cache space which are sequentially increased in space size, and then setting an initial cache space in the register, wherein the size of the initial cache space is equal to that of the third cache space. Firstly, the read-write speed of the register is obviously higher than that of the memory, so that the data pointer can be cached and recycled in the initial cache space quickly; secondly, when the data are recovered, data recovery is not needed to be carried out by traversing all the data in the cache, but only the data corresponding to the useless data pointers in the initial cache space and the first cache space are recovered, so that the traversal speed during the data recovery can be greatly improved, the data recovery amount is far smaller than that of the traditional scheme, the data can be effectively managed and recovered, and the data recovery efficiency is greatly improved.
The scheme abandons the disadvantages in the traditional scheme, changes the periodic data recovery strategy into the memory threshold strategy, and triggers data recovery when the memory overhead is greater than the preset threshold (for example, 80% of the total memory can be used, and can be customized according to the actual situation). Through the design of the recovery strategy, the related defects of periodic data recovery in the traditional scheme can be effectively avoided.
Drawings
Fig. 1 is a schematic flow diagram of a method for recovering data of an android system in an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a system for recovering data of the android system in the embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Example 1:
referring to fig. 1, an embodiment of the present invention provides a method for recovering data of an android system, including the following steps:
s1, setting a continuous memory space for storing discrete data pointers, and storing the discrete data pointers in the memory space in a continuous mode;
in the traditional scheme, a design method of a data cache pool mainly caches data through one memory variable, and if a plurality of data exist, a cache logic of the data is realized through a plurality of variables. The traditional scheme has the defect that data is not continuous in the memory, namely the data is stored in the memory in a scattered way, so that the data management is difficult.
In the invention, in order to solve the problem of data dispersion in the memory, the data pointers are stored in a continuous memory space, although the addresses of the data actually indicated by the data pointers in the memory are discrete, the data pointers in the memory are stored in a continuous mode, and the discrete data can be acquired through the data pointers, thereby facilitating the management of the data.
S2, carrying out capacity expansion on the memory space, wherein the capacity expansion is a first cache space, a second cache space and a third cache space which are sequentially increased in space size, and then setting an initial cache space in the register, wherein the size of the initial cache space is equal to that of the third cache space; the size of the third cache space is three times that of the first cache space, and the size of the second cache space is two times that of the first cache space.
S3, when data needs to be cached, first storing a data pointer corresponding to the data in an initial cache space; when data recovery is triggered, useless data pointers in the initial cache space are recovered, and then data corresponding to the recovered data pointers are recovered, wherein the useless data pointers are pointers which do not point to any useful objects. Filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence;
s4, when the first cache space, the second cache space and the third cache space are all filled, when data recovery is triggered, the useless data pointers in the initial cache space and the first cache space are recovered, and then the data corresponding to the recovered data pointers are recovered; and then the data pointer is moved step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
The invention sets a continuous memory space for storing discrete data pointers, and stores the discrete data pointers in the memory space in a continuous mode; and carrying out capacity expansion on the memory space, wherein the capacity expansion is a first cache space, a second cache space and a third cache space which are sequentially increased in space size, and then setting an initial cache space in the register, wherein the size of the initial cache space is equal to that of the third cache space. Firstly, the read-write speed of the register is obviously higher than that of the memory, so that the data pointer can be cached and recycled in the initial cache space quickly; secondly, when the data are recovered, data recovery is not needed to be carried out by traversing all the data in the cache, but only the data corresponding to the useless data pointers in the initial cache space and the first cache space are recovered, so that the traversal speed during the data recovery can be greatly improved, the data recovery amount is far smaller than that of the traditional scheme, the data can be effectively managed and recovered, and the data recovery efficiency is greatly improved.
And triggering data recovery when the memory overhead is greater than a preset threshold value. The scheme abandons the disadvantages in the traditional scheme, changes the periodic data recovery strategy into the memory threshold strategy, and triggers data recovery when the memory overhead is greater than the preset threshold (for example, 80% of the total memory can be used, and can be customized according to the actual situation). Through the design of the recovery strategy, the related defects of periodic data recovery in the traditional scheme can be effectively avoided.
Step S3 specifically includes:
s301, when data needs to be cached, a data pointer corresponding to the data is stored in an initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; then moving the data pointer which is not recycled to a third cache space;
s302, when data needs to be cached again, a data pointer corresponding to the data is stored in an initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space, and then moving the data pointer to the second cache space;
s303, when data needs to be cached again, firstly storing a data pointer corresponding to the data in an initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; then moving the data pointer which is not recycled to a third cache space; when the data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
s304, repeating the steps S301 to S304 until the first buffer space, the second buffer space and the third buffer space are filled in sequence.
Example 2:
a storage medium having stored thereon a computer program which, when executed by a processor, implements the method of embodiment 1.
Example 3:
an electronic device comprising a memory having stored thereon a computer program for running on a processor and a processor that, when executing the computer program, implements the method of embodiment 1.
Example 4:
referring to fig. 2, an embodiment of the present invention discloses a system for recovering data of an android system, including:
the data pointer storage module is used for setting a continuous memory space for storing discrete data pointers and storing the discrete data pointers in the memory space in a continuous mode;
the data pointer capacity expansion module is used for expanding the memory space, wherein the capacity expansion is performed on the memory space into a first cache space, a second cache space and a third cache space, the space sizes of the first cache space, the second cache space and the third cache space are sequentially increased, an initial cache space is arranged in the register, and the size of the initial cache space is equal to that of the third cache space; the size of the third cache space is three times that of the first cache space, and the size of the second cache space is two times that of the first cache space.
The data pointer recovery module is used for storing a data pointer corresponding to data in an initial cache space when the data need to be cached; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence; after the first cache space, the second cache space and the third cache space are all filled, when data recovery is triggered, the useless data pointers in the initial cache space and the first cache space are recovered, and then the data corresponding to the recovered data pointers are recovered; and then the data pointer is moved step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
The data pointer recovery module is further configured to trigger data recovery whenever the memory overhead is greater than a preset threshold. The scheme abandons the disadvantages in the traditional scheme, changes the periodic data recovery strategy into the memory threshold strategy, and triggers data recovery when the memory overhead is greater than the preset threshold (for example, 80% of the total memory can be used, and can be customized according to the actual situation). Through the design of the recovery strategy, the related defects of periodic data recovery in the traditional scheme can be effectively avoided.
The data pointer recovery module is specifically configured to:
when data needs to be cached, a data pointer corresponding to the data is stored in an initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; then moving the data pointer which is not recycled to a third cache space;
when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space, and then moving the data pointer to the second cache space;
when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; then moving the data pointer which is not recycled to a third cache space; when the data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
and repeating the steps until the first cache space, the second cache space and the third cache space are filled in sequence.
The present invention is not limited to the above-described embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are within the skill of the art.
Claims (8)
1. A method for recovering data of an android system is characterized by comprising the following steps:
s1, setting a continuous memory space for storing discrete data pointers, and storing the discrete data pointers in the memory space in a continuous mode;
s2, expanding the memory space into a first cache space, a second cache space and a third cache space with sequentially increasing space size, and setting an initial cache space in a register, wherein the initial cache space is the same as the third cache space in size; wherein the third cache space is three times the first cache space in size and the second cache space is two times the first cache space in size;
s3, when data needs to be cached, first storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence;
s4, when the first, second, and third cache spaces are full, and data recovery is triggered, first recovering useless data pointers in the initial cache space and the first cache space, and then recovering data corresponding to the recovered data pointers; and moving the data pointer step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
2. The android system data recovery method of claim 1, wherein: and triggering data recovery when the memory overhead is greater than a preset threshold value.
3. The android system data recovery method of claim 1, wherein: step S3 specifically includes:
s301, when data needs to be cached, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space;
s302, when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space and then moving the data pointer to the second cache space;
s303, when data needs to be cached again, firstly storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space; when data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
and S304, repeating the steps S301 to S304 until the first buffer space, the second buffer space and the third buffer space are filled in sequence.
4. A storage medium having a computer program stored thereon, characterized in that: the computer program, when executed by a processor, implements the method of any of claims 1 to 3.
5. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program that runs on the processor, characterized in that: a processor implementing the method of any one of claims 1 to 3 when executing the computer program.
6. The utility model provides a system for tall and erect system data recovery of ann, its characterized in that includes:
the data pointer storage module is used for setting a continuous memory space for storing discrete data pointers and storing the discrete data pointers in the memory space in a continuous mode;
the data pointer capacity expansion module is used for expanding the memory space, wherein the capacity expansion is performed on a first cache space, a second cache space and a third cache space which are sequentially increased in space size, and an initial cache space is arranged in a register and is the same as the third cache space in size; wherein the third cache space is three times the first cache space in size and the second cache space is two times the first cache space in size;
the data pointer recovery module is used for storing a data pointer corresponding to data in the initial cache space when the data needs to be cached; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; filling the first cache space, the second cache space and the third cache space with the data pointers which are not recycled in sequence; after the first cache space, the second cache space and the third cache space are all filled, when data recovery is triggered, the useless data pointers in the initial cache space and the first cache space are recovered, and then the data corresponding to the recovered data pointers are recovered; and moving the data pointer step by step to fill the first buffer space, the second buffer space and the third buffer space in sequence.
7. The android system data recovery system of claim 6, in which: the data pointer recovery module is further configured to trigger data recovery whenever the memory overhead is greater than a preset threshold.
8. The android system data recovery system of claim 6, in which: the data pointer recovery module is specifically configured to:
when data needs to be cached, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space;
when data needs to be cached again, firstly storing a data pointer corresponding to the data in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; combining the data pointer movement which is not recycled with the data pointer in the third cache space and then moving the data pointer to the second cache space;
when data needs to be cached again, a data pointer corresponding to the data is stored in the initial cache space; when data recovery is triggered, recovering useless data pointers in the initial cache space, and then recovering data corresponding to the recovered data pointers; moving the data pointer which is not recycled to the third cache space; when data pointer recovery is triggered again, merging the data pointers in the third cache space and the second cache space and then moving the merged data pointers to the first cache space;
and repeating the steps until the first cache space, the second cache space and the third cache space are sequentially filled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810284113.7A CN108804340B (en) | 2018-04-02 | 2018-04-02 | Android system data recovery method, storage medium, electronic device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810284113.7A CN108804340B (en) | 2018-04-02 | 2018-04-02 | Android system data recovery method, storage medium, electronic device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108804340A CN108804340A (en) | 2018-11-13 |
| CN108804340B true CN108804340B (en) | 2020-09-04 |
Family
ID=64095493
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810284113.7A Active CN108804340B (en) | 2018-04-02 | 2018-04-02 | Android system data recovery method, storage medium, electronic device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108804340B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070180541A1 (en) * | 2004-06-08 | 2007-08-02 | Nikon Corporation | Cryptographic architecture with instruction masking and other techniques for thwarting differential power analysis |
| CN103186469A (en) * | 2011-12-27 | 2013-07-03 | 上海博泰悦臻电子设备制造有限公司 | Memory allocation method and device, and memory recovery method |
| CN105760228A (en) * | 2016-01-29 | 2016-07-13 | 珠海汇迪科技有限公司 | Method for improving game fluency under low-memory Android device |
| CN106909457A (en) * | 2015-12-23 | 2017-06-30 | 北京奇虎科技有限公司 | EMS memory management process and device |
-
2018
- 2018-04-02 CN CN201810284113.7A patent/CN108804340B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070180541A1 (en) * | 2004-06-08 | 2007-08-02 | Nikon Corporation | Cryptographic architecture with instruction masking and other techniques for thwarting differential power analysis |
| CN103186469A (en) * | 2011-12-27 | 2013-07-03 | 上海博泰悦臻电子设备制造有限公司 | Memory allocation method and device, and memory recovery method |
| CN106909457A (en) * | 2015-12-23 | 2017-06-30 | 北京奇虎科技有限公司 | EMS memory management process and device |
| CN105760228A (en) * | 2016-01-29 | 2016-07-13 | 珠海汇迪科技有限公司 | Method for improving game fluency under low-memory Android device |
Non-Patent Citations (1)
| Title |
|---|
| 移动应用程序内存泄露机制分析与检测方案设计;朱洪军等;《计算机工程与应用》;20161231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108804340A (en) | 2018-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106055489B (en) | Memory device and operation method thereof | |
| US7366855B2 (en) | Page replacement method using page information | |
| CN106802867B (en) | Solid state storage device and data programming method thereof | |
| CN104503703B (en) | The treating method and apparatus of caching | |
| CN105242871A (en) | Data writing method and apparatus | |
| KR20180115614A (en) | Opportunity window hints for background operations in ssd | |
| CN104216838A (en) | Double-cache data processing method and system | |
| CN103513956B (en) | A kind of method of processor processes data and device | |
| CN108829345B (en) | Data processing method and terminal device for log file | |
| US20200210334A1 (en) | Cache Hit Ratio Simulation Using A Partial Data Set | |
| CN109313604A (en) | Dynamic Configuration of Compressed Virtual Storage | |
| US20060294330A1 (en) | Managing memory pages | |
| CN110059024B (en) | Memory space data caching method and device | |
| US20170262485A1 (en) | Non-transitory computer-readable recording medium, data management device, and data management method | |
| CN102169464B (en) | Caching method and device used for non-volatile memory, and intelligent card | |
| CN106569961B (en) | Cache module based on memory access continuity and memory access method thereof | |
| CN110275678B (en) | STT-MRAM-based solid state memory device random access performance improvement method | |
| CN108804340B (en) | Android system data recovery method, storage medium, electronic device and system | |
| CN107562806A (en) | Mix the adaptive perception accelerated method and system of memory file system | |
| CN113190473B (en) | Cache data management method and medium based on energy collection nonvolatile processor | |
| CN103761052B (en) | A kind of method managing cache and storage device | |
| CN106201918A (en) | A kind of method and system quickly discharged based on big data quantity and extensive caching | |
| CN104317735A (en) | High-capacity cache and method for data storage and readout as well as memory allocation and recovery | |
| CN116775507B (en) | Hardware acceleration block selection method and device in garbage collection of solid state disk controller | |
| CN118503151A (en) | GPGPU (graphics processing Unit) secondary data cache dynamic bypass method |
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 |