CN108804340A - Method, storage medium, electronic equipment and the system of Android system data record - Google Patents
Method, storage medium, electronic equipment and the system of Android system data record Download PDFInfo
- Publication number
- CN108804340A CN108804340A CN201810284113.7A CN201810284113A CN108804340A CN 108804340 A CN108804340 A CN 108804340A CN 201810284113 A CN201810284113 A CN 201810284113A CN 108804340 A CN108804340 A CN 108804340A
- Authority
- CN
- China
- Prior art keywords
- spatial cache
- data
- data pointer
- pointer
- recovered
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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; CALCULATING OR 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
Abstract
The invention discloses a kind of method, storage medium, electronic equipment and the systems of Android system data record, it is related to Android system development technique field, a continuous memory headroom is arranged for storing discrete data pointer in the present invention, and discrete data pointer is stored in using continuous mode in memory headroom；It is space size the first spatial cache, the second spatial cache and third spatial cache incremented by successively by memory headroom dilatation, then an initial spatial cache is set in a register.First, the read or write speed of register is significantly faster than memory, thus data pointer quickly will be buffered and be recovered in initial spatial cache；Secondly, the data that need not be traversed in all cachings carry out data record, but only recycle the corresponding data of hash pointer in initial spatial cache and the first spatial cache, data record amount is much smaller than traditional scheme, realization is effectively managed and recycles to data, greatly improves data record efficiency.
Description
Technical field
The present invention relates to Android system development technique fields, and in particular to a kind of method of Android system data record is deposited
Storage media, electronic equipment and system.
Background technology
The driving of dependence data, the data in traditional development process are needed in the execution of Android development process Programs
Management gives system to be recycled and be handled.If the data for giving system recycling and processing are dealt with improperly and may be gone out
It now recycles not in time or recycles situations such as slow, thus memory can be caused to remain high for a long time in some cases, it is serious
When may will produce the exception of memory overwriting.
The recycling algorithm design comparison of traditional scheme is simple, is exactly the entire pointer vessel space of simple traversal, then
Corresponding data is found according to the pointer information traversed, whether judgement data have adduction relationship, straight if without adduction relationship
Capable recycling is tapped into, if there is adduction relationship is just without recycling.This strategy can be slow, and needs to be traversed for every time all
Data buffer storage can reduce organic efficiency.
Meanwhile the recycling of data is needed there are one the mechanism that periodically recycles, traditional reclaim mechanism be by timer come
The recycling of property performance period, this take-back strategy list EMS memory occupation constantly carry out at recycling data when being not very high
Reason, can reduce system performance, the resource overhead of system has greatly been lost, increase power dissipation overhead etc. in this way.
Invention content
In view of the deficiencies in the prior art, the purpose of the present invention is to provide a kind of sides of Android system data record
Method, storage medium, electronic equipment and system effectively can be managed and recycle to data, greatly improve data and return
It produces effects rate.
To achieve the above objectives, the technical solution adopted by the present invention is that a kind of method of Android system data record, including
Following steps：
S1 is arranged a continuous memory headroom for storing discrete data pointer, discrete data pointer is used
Continuous mode is stored in the memory headroom；
S2 carries out dilatation to the memory headroom, and dilatation is delayed for space size the first spatial cache incremented by successively, second
Deposit space and third spatial cache, then an initial spatial cache be set in a register, the initial spatial cache with it is described
Third spatial cache size is identical；
The corresponding data pointer of data is first stored in the initial spatial cache by S3 when there is data to need caching；When
When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data pointer that will be recovered
Corresponding data record；The data pointer not being recovered is filled up into first spatial cache, the second spatial cache successively again
With third spatial cache；
S4, after first spatial cache, the second spatial cache and third spatial cache fill up, when trigger data is returned
Receive, first recycle useless data pointer in the initial spatial cache and first spatial cache, after the number that will be recovered
According to the corresponding data record of pointer；Data pointer is moved step by step again to fill up first spatial cache, the second caching successively
Space and third spatial cache.
Based on the above technical solution, wherein the third spatial cache size is the three of first spatial cache
Times, the second spatial cache size is twice of first spatial cache.
Based on the above technical solution, when memory overhead is more than predetermined threshold value, trigger data recycling.
Based on the above technical solution, step S3 is specifically included：
The corresponding data pointer of data is first stored in the initial spatial cache by S301 when there is data to need caching；
When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data being recovered are referred to
The corresponding data record of needle；The data pointer not being recovered is moved to the third spatial cache again；
The corresponding data pointer of data is first stored in the initial caching by S302 when there is data to need caching again
Space；When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the number that will be recovered
According to the corresponding data record of pointer；The data in the data pointer not being recovered movement and the third spatial cache are referred to again
Needle is moved to second spatial cache after merging；
The corresponding data pointer of data is first stored in described initial slow by S303 when there is data to need caching again
Deposit space；When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after will be recovered
The corresponding data record of data pointer；The data pointer not being recovered is moved to the third spatial cache again；It touches again
Send out data pointer recycling when, will data pointer in the third spatial cache and second spatial cache merge after move
To first spatial cache；
S304 repeats step S301 to S304, until first spatial cache, the second spatial cache and third caching are empty
Between be filled successively.
The invention also discloses a kind of storage medium, computer program, the computer journey are stored on the storage medium
The method that the Android system data record is realized when sequence is executed by processor.
The invention also discloses a kind of electronic equipment, including memory and processor, stored in processor on memory
The computer program of upper operation, processor execute the method for realizing the Android system data record when computer program.
The invention also discloses a kind of systems of Android system data record, including：
Data pointer preserving module is used to be arranged a continuous memory headroom and is used to store discrete data pointer,
Discrete data pointer is stored in using continuous mode in the memory headroom；
Data pointer dilatation module is used to carry out dilatation to the memory headroom, and dilatation is that space size is incremented by successively
The first spatial cache, the second spatial cache and third spatial cache, then in a register be arranged an initial spatial cache, institute
It is identical as the third spatial cache size to state initial spatial cache；
Data pointer recycling module is used for when there is data to need caching, first preserves the corresponding data pointer of data
In the initial spatial cache；When trigger data recycles, first data pointer useless in the initial spatial cache is recycled,
Afterwards by the corresponding data record of the data pointer being recovered；The data pointer not being recovered described first is filled up successively again to delay
Deposit space, the second spatial cache and third spatial cache；First spatial cache, the second spatial cache and third spatial cache
After filling up, when trigger data recycling, first data useless in the initial spatial cache and first spatial cache are referred to
Needle recycles, after by the corresponding data record of the data pointer being recovered；Data pointer is moved step by step again described to fill up successively
First spatial cache, the second spatial cache and third spatial cache.
Based on the above technical solution, the third spatial cache size is three times of first spatial cache,
The second spatial cache size is twice of first spatial cache.
Based on the above technical solution, the data pointer recycling module is additionally operable to preset whenever memory overhead is more than
When threshold value, trigger data recycling.
Based on the above technical solution, the data pointer recycling module is specifically used for：
When there are data to need caching, the corresponding data pointer of data is first stored in the initial spatial cache；When tactile
When sending out data record, first useless data pointer in the initial spatial cache is recycled, after the data pointer pair that will be recovered
The data record answered；The data pointer not being recovered is moved to the third spatial cache again；
When there are data to need caching again, the corresponding data pointer of data is first stored in the initial spatial cache；
When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data being recovered are referred to
The corresponding data record of needle；The data pointer in the data pointer not being recovered movement and the third spatial cache is closed again
Second spatial cache is moved to after and；
When there are data to need caching again, it is empty that the corresponding data pointer of data is first stored in the initial caching
Between；When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data that will be recovered
The corresponding data record of pointer；The data pointer not being recovered is moved to the third spatial cache again；Number is triggered again
According to pointer recycling when, will data pointer in the third spatial cache and second spatial cache merge after be moved to institute
State the first spatial cache；
It repeats the above steps, until first spatial cache, the second spatial cache and third spatial cache are filled out successively
It is full.
Compared with the prior art, the advantages of the present invention are as follows：
A continuous memory headroom is arranged for storing discrete data pointer in the present invention, and discrete data pointer is adopted
It is stored in memory headroom with continuous mode；And dilatation is carried out to memory headroom, dilatation is incremented by successively the of space size
One spatial cache, the second spatial cache and third spatial cache, then an initial spatial cache is set in a register, it is initial slow
It deposits space size and is equal to third spatial cache.First, the read or write speed of register is significantly faster than memory, thus data pointer will
Quickly it is buffered and is recovered in initial spatial cache；Secondly, the data in all cachings need not be traversed when data record
Data record is carried out, but only recycles the corresponding data of hash pointer in initial spatial cache and the first spatial cache,
Traversal speed when data record can greatly be improved, and data record amount is much smaller than traditional scheme, it is effective right to realize
Data are managed and recycle, and greatly improve data record efficiency.
This programme has abandoned the drawback in traditional scheme and has made the data record strategy of scheduled cycle into memory threshold
Strategy, when memory overhead be more than predetermined threshold value (citing, for example, total memory 80% usage amount, can also according to actual conditions come
Carry out self-defined) when, trigger data recycling.By the design of this take-back strategy, traditional scheme can be effectively avoided
The related drawback of middle periodic data recycling.
Description of the drawings
Fig. 1 is the flow diagram of the method for Android system data record in the embodiment of the present invention；
Fig. 2 is the structural schematic diagram of the system of Android system data record in the embodiment of the present invention.
Specific implementation mode
Invention is further described in detail with reference to the accompanying drawings and embodiments.
Embodiment 1：
Shown in Figure 1, the embodiment of the present invention provides a kind of method of Android system data record, includes the following steps：
S1 is arranged a continuous memory headroom for storing discrete data pointer, discrete data pointer is used
Continuous mode is stored in memory headroom；
The design method in data buffer storage pond is mainly cached by a memory variable in traditional scheme, if deposited
It is the cache logic that data are realized by multiple variables when multiple data.Defect present in traditional scheme is several
According to not being continuous in memory, that is to say, that the dispersion storage of data in memory, so to data management when ratio
It is more difficult.
These data pointers are stored in one piece continuously in order to solve the problems, such as that data are discrete in memory in the present invention
In memory headroom, although the address for the data that actual data pointer indicates in memory is discrete, in memory
Data pointer is preserved using continuous mode, and discrete data can be got by data pointer, consequently facilitating realizing
Management to data.
S2 carries out dilatation to memory headroom, and dilatation is space size the first spatial cache incremented by successively, the second caching sky
Between and third spatial cache, then an initial spatial cache is set in a register, initial spatial cache size is equal to third
Spatial cache；Wherein third spatial cache size is three times of the first spatial cache, and the second spatial cache size is the first caching
Twice of space.
The corresponding data pointer of data is first stored in initial spatial cache by S3 when there is data to need caching；Work as triggering
When data record, first useless data pointer in initial spatial cache is recycled, after by the corresponding number of the data pointer being recovered
According to recycling, useless data pointer is the pointer for being not pointed towards any useful object.Again by the data pointer not being recovered according to
It is secondary to fill up the first spatial cache, the second spatial cache and third spatial cache；
S4, after the first spatial cache, the second spatial cache and third spatial cache fill up, when trigger data recycling, first
By useless data pointer recycling in initial spatial cache and the first spatial cache, after by the corresponding number of the data pointer being recovered
According to recycling；Data pointer is moved to fill up the first spatial cache, the second spatial cache and third spatial cache successively step by step again.
A continuous memory headroom is arranged for storing discrete data pointer in the present invention, and discrete data pointer is adopted
It is stored in memory headroom with continuous mode；And dilatation is carried out to memory headroom, dilatation is incremented by successively the of space size
One spatial cache, the second spatial cache and third spatial cache, then an initial spatial cache is set in a register, it is initial slow
It deposits space size and is equal to third spatial cache.First, the read or write speed of register is significantly faster than memory, thus data pointer will
Quickly it is buffered and is recovered in initial spatial cache；Secondly, the data in all cachings need not be traversed when data record
Data record is carried out, but only recycles the corresponding data of hash pointer in initial spatial cache and the first spatial cache,
Traversal speed when data record can greatly be improved, and data record amount is much smaller than traditional scheme, it is effective right to realize
Data are managed and recycle, and greatly improve data record efficiency.
When memory overhead is more than predetermined threshold value, trigger data recycling.This programme has abandoned the drawback in traditional scheme
Made the data record strategy of scheduled cycle into memory threshold strategy, when memory overhead be more than predetermined threshold value (citing, such as
80% usage amount of total memory, can also carry out self-defined according to actual conditions) when, trigger data recycling.Pass through this
The design of kind take-back strategy, can effectively avoid the related drawback that periodic data recycles in traditional scheme.
Step S3 is specifically included：
The corresponding data pointer of data is first stored in initial spatial cache by S301 when there is data to need caching；When tactile
When sending out data record, first useless data pointer in initial spatial cache is recycled, after the data pointer being recovered is corresponding
Data record；The data pointer not being recovered is moved to third spatial cache again；
The corresponding data pointer of data is first stored in initial spatial cache by S302 when there is data to need caching again；
When trigger data recycles, first useless data pointer in initial spatial cache is recycled, after the data pointer pair that will be recovered
The data record answered；It is moved after the data pointer in the data pointer not being recovered movement and third spatial cache is merged again
To the second spatial cache；
It is empty to be first stored in initial caching when there is data to need caching again by S303 for the corresponding data pointer of data
Between；When trigger data recycles, first useless data pointer in initial spatial cache is recycled, after the data pointer that will be recovered
Corresponding data record；The data pointer not being recovered is moved to third spatial cache again；Trigger data pointer returns again
Receipts when, will data pointer in third spatial cache and the second spatial cache merge after be moved to the first spatial cache；
S304 repeats step S301 to S304, until the first spatial cache, the second spatial cache and third spatial cache according to
It is secondary to be filled.
Embodiment 2：
A kind of storage medium is stored with computer program on the storage medium, real when computer program is executed by processor
The method of current embodiment 1.
Embodiment 3：
A kind of electronic equipment, including memory and processor store the computer run on a processor on memory
Program, processor execute the method for realizing embodiment 1 when computer program.
Embodiment 4：
Shown in Figure 2, the embodiment of the invention discloses a kind of systems of Android system data record, including：
Data pointer preserving module is used to be arranged a continuous memory headroom and is used to store discrete data pointer,
Discrete data pointer is stored in using continuous mode in memory headroom；
Data pointer dilatation module is used to carry out dilatation to memory headroom, and dilatation is incremented by successively the of space size
One spatial cache, the second spatial cache and third spatial cache, then an initial spatial cache is set in a register, it is initial slow
It deposits space size and is equal to third spatial cache；Wherein third spatial cache size is three times of the first spatial cache, and second is slow
Deposit twice that space size is the first spatial cache.
Data pointer recycling module is used for when there is data to need caching, first preserves the corresponding data pointer of data
In initial spatial cache；When trigger data recycles, first useless data pointer in initial spatial cache is recycled, after will be returned
The corresponding data record of data pointer of receipts；The data pointer not being recovered is filled up into the first spatial cache, second successively again
Spatial cache and third spatial cache；After first spatial cache, the second spatial cache and third spatial cache fill up, work as triggering
Data record first recycles useless data pointer in initial spatial cache and the first spatial cache, after the data that will be recovered
The corresponding data record of pointer；Again by data pointer step by step move with fill up successively the first spatial cache, the second spatial cache and
Third spatial cache.
Data pointer recycling module is additionally operable to when memory overhead is more than predetermined threshold value, trigger data recycling.This programme
The drawback abandoned in traditional scheme has made the data record strategy of scheduled cycle into memory threshold strategy, works as memory overhead
More than predetermined threshold value (citing, for example, total memory 80% usage amount, can also be carried out according to actual conditions self-defined) when
It waits, trigger data recycling.By the design of this take-back strategy, periodic data in traditional scheme can effectively be avoided to recycle
Related drawback.
Data pointer recycling module is specifically used for：
When there are data to need caching, the corresponding data pointer of data is first stored in initial spatial cache；When triggering number
When according to recycling, first useless data pointer in initial spatial cache is recycled, after by the corresponding data of the data pointer being recovered
Recycling；The data pointer not being recovered is moved to third spatial cache again；
When there are data to need caching again, the corresponding data pointer of data is first stored in initial spatial cache；When tactile
When sending out data record, first useless data pointer in initial spatial cache is recycled, after the data pointer being recovered is corresponding
Data record；It is moved to the after the data pointer in the data pointer not being recovered movement and third spatial cache is merged again
Two spatial caches；
When there are data to need caching again, the corresponding data pointer of data is first stored in initial spatial cache；When
When trigger data recycles, first useless data pointer in initial spatial cache is recycled, after the data pointer being recovered is corresponded to
Data record；The data pointer not being recovered is moved to third spatial cache again；Trigger data pointer recycles again
When, it is moved to the first spatial cache after the data pointer in third spatial cache and the second spatial cache is merged；
It repeats the above steps, until the first spatial cache, the second spatial cache and third spatial cache are filled successively.
The present invention is not limited to the above-described embodiments, for those skilled in the art, is not departing from
Under the premise of the principle of the invention, several improvements and modifications can also be made, these improvements and modifications are also considered as the protection of the present invention
Within the scope of.The content not being described in detail in this specification belongs to the prior art well known to professional and technical personnel in the field.
Claims (10)
1. a kind of method of Android system data record, which is characterized in that include the following steps：
A continuous memory headroom is arranged for storing discrete data pointer, by discrete data pointer using continuous in S1
Mode be stored in the memory headroom；
S2 carries out dilatation to the memory headroom, and dilatation is space size the first spatial cache incremented by successively, the second caching sky
Between and third spatial cache, then an initial spatial cache, the initial spatial cache and the third are set in a register
Spatial cache size is identical；
The corresponding data pointer of data is first stored in the initial spatial cache by S3 when there is data to need caching；Work as triggering
When data record, first useless data pointer in the initial spatial cache is recycled, after the data pointer being recovered is corresponded to
Data record；The data pointer not being recovered is filled up into first spatial cache, the second spatial cache and successively again
Three spatial caches；
S4, after first spatial cache, the second spatial cache and third spatial cache fill up, when trigger data recycling, first
By useless data pointer recycling in the initial spatial cache and first spatial cache, after the data pointer that will be recovered
Corresponding data record；Again by data pointer step by step move with fill up successively first spatial cache, the second spatial cache and
Third spatial cache.
2. a kind of method of Android system data record as described in claim 1, it is characterised in that：The wherein described third caching
Space size is three times of first spatial cache, and the second spatial cache size is the two of first spatial cache
Times.
3. a kind of method of Android system data record as described in claim 1, it is characterised in that：Whenever memory overhead is more than
When predetermined threshold value, trigger data recycling.
4. a kind of method of Android system data record as described in claim 1, it is characterised in that：Step S3 is specifically included：
The corresponding data pointer of data is first stored in the initial spatial cache by S301 when there is data to need caching；When tactile
When sending out data record, first useless data pointer in the initial spatial cache is recycled, after the data pointer pair that will be recovered
The data record answered；The data pointer not being recovered is moved to the third spatial cache again；
The corresponding data pointer of data is first stored in the initial spatial cache by S302 when there is data to need caching again；
When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data being recovered are referred to
The corresponding data record of needle；The data pointer in the data pointer not being recovered movement and the third spatial cache is closed again
Second spatial cache is moved to after and；
It is empty to be first stored in the initial caching when there is data to need caching again by S303 for the corresponding data pointer of data
Between；When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data that will be recovered
The corresponding data record of pointer；The data pointer not being recovered is moved to the third spatial cache again；Number is triggered again
According to pointer recycling when, will data pointer in the third spatial cache and second spatial cache merge after be moved to institute
State the first spatial cache；
S304 repeats step S301 to S304, until first spatial cache, the second spatial cache and third spatial cache according to
It is secondary to be filled.
5. a kind of storage medium, computer program is stored on the storage medium, it is characterised in that：The computer program is located
It manages when device executes and realizes Claims 1-4 any one of them method.
6. a kind of electronic equipment, including memory and processor, the computer journey run on a processor is stored on memory
Sequence, it is characterised in that：Processor realizes Claims 1-4 any one of them method when executing computer program.
7. a kind of system of Android system data record, which is characterized in that including：
Data pointer preserving module is used to be arranged continuous memory headroom and is used to store discrete data pointer, will be from
Scattered data pointer is stored in using continuous mode in the memory headroom；
Data pointer dilatation module is used to carry out dilatation to the memory headroom, and dilatation is incremented by successively the of space size
One spatial cache, the second spatial cache and third spatial cache, then an initial spatial cache is set in a register, it is described first
Beginning spatial cache is identical as the third spatial cache size；
Data pointer recycling module is used to, when there is data to need caching, the corresponding data pointer of data is first stored in institute
State initial spatial cache；When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after will
The corresponding data record of data pointer being recovered；It is empty that the data pointer not being recovered is filled up into first caching successively again
Between, the second spatial cache and third spatial cache；First spatial cache, the second spatial cache and third spatial cache are filled out
Man Hou first returns data pointer useless in the initial spatial cache and first spatial cache when trigger data recycling
Receive, after by the corresponding data record of the data pointer being recovered；Data pointer is moved to fill up described first successively step by step again
Spatial cache, the second spatial cache and third spatial cache.
8. a kind of system of Android system data record as claimed in claim 7, it is characterised in that：The third spatial cache
Size is three times of first spatial cache, and the second spatial cache size is twice of first spatial cache.
9. a kind of system of Android system data record as claimed in claim 7, it is characterised in that：The data pointer recycling
Module is additionally operable to when memory overhead is more than predetermined threshold value, trigger data recycling.
10. a kind of system of Android system data record as claimed in claim 7, it is characterised in that：The data pointer returns
Module is received to be specifically used for：
When there are data to need caching, the corresponding data pointer of data is first stored in the initial spatial cache；When triggering number
When according to recycling, first useless data pointer in the initial spatial cache is recycled, after the data pointer being recovered is corresponding
Data record；The data pointer not being recovered is moved to the third spatial cache again；
When there are data to need caching again, the corresponding data pointer of data is first stored in the initial spatial cache；When tactile
When sending out data record, first useless data pointer in the initial spatial cache is recycled, after the data pointer pair that will be recovered
The data record answered；After the data pointer in the data pointer not being recovered movement and the third spatial cache is merged again
It is moved to second spatial cache；
When there are data to need caching again, the corresponding data pointer of data is first stored in the initial spatial cache；When
When trigger data recycles, first useless data pointer in the initial spatial cache is recycled, after the data pointer that will be recovered
Corresponding data record；The data pointer not being recovered is moved to the third spatial cache again；Trigger data refers to again
Needle recycling when, will data pointer in the third spatial cache and second spatial cache merge after be moved to described the
One spatial cache；
It repeats the above steps, until first spatial cache, the second spatial cache and third spatial cache are filled successively.
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 true CN108804340A (en) | 2018-11-13 |
| CN108804340B 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 |
|---|
| 朱洪军等: "移动应用程序内存泄露机制分析与检测方案设计", 《计算机工程与应用》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108804340B (en) | 2020-09-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102163175B (en) | Hybrid address mapping method based on locality analysis | |
| CN100447744C (en) | Method and system for managing stack | |
| CN105095116A (en) | Cache replacing method, cache controller and processor | |
| CN106445405A (en) | Flash storage-oriented data access method and apparatus | |
| CN102136993B (en) | A kind of methods, devices and systems of Data Migration | |
| CN104756088A (en) | Flexible wear management for non-volatile memory | |
| CN101694640B (en) | Method for realizing replacement policies of shared second-level cache under multi-core architecture | |
| Sun et al. | A high performance and energy-efficient cold data eviction algorithm for 3D-TSV hybrid ReRAM/MLC NAND SSD | |
| CN101488919B (en) | Memory address allocation method and apparatus | |
| CN104503703A (en) | Cache processing method and device | |
| CN104679684B (en) | Semiconductor devices and its operating method | |
| CN106201918B (en) | A kind of method and system based on big data quantity and extensive caching quick release | |
| CN102521161B (en) | Data caching method, device and server | |
| CN106775684A (en) | A kind of disk buffering power loss recovery method based on new nonvolatile memory | |
| CN102354301A (en) | Cache partitioning method | |
| CN102169464B (en) | Caching method and device used for non-volatile memory, and intelligent card | |
| CN108804340A (en) | Method, storage medium, electronic equipment and the system of Android system data record | |
| Swain et al. | Analysis and predictability of page replacement techniques towards optimized performance | |
| CN104375955A (en) | Cache device and control method thereof | |
| Shin et al. | Performance analysis of buffer management policy considering internal parallelism of solid state drives | |
| CN103778069A (en) | High-speed cache block length adjusting method and device of high-speed cache memory | |
| CN107967306B (en) | Method for rapidly mining association blocks in storage system | |
| CN104850508A (en) | Memory access method based on data locality | |
| CN113377538B (en) | Storage computing collaborative scheduling method and system for GPU data reuse | |
| CN106569961B (en) | Cache module based on memory access continuity and memory access method thereof |
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 |