WO2017156683A1 - 基于链表的应用缓存管理方法及装置 - Google Patents
基于链表的应用缓存管理方法及装置 Download PDFInfo
- Publication number
- WO2017156683A1 WO2017156683A1 PCT/CN2016/076296 CN2016076296W WO2017156683A1 WO 2017156683 A1 WO2017156683 A1 WO 2017156683A1 CN 2016076296 W CN2016076296 W CN 2016076296W WO 2017156683 A1 WO2017156683 A1 WO 2017156683A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- linked list
- node
- memory
- cache management
- based application
- 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.)
- Ceased
Links
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/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/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
- G06F12/0871—Allocation or management of cache space
Definitions
- the present invention relates to the field of storage technologies, and in particular, to a linked list based application cache management method and apparatus.
- a cache is used to realize storage of various data to achieve high-speed data access.
- the iOS platform adopting NSCache (NSCache is a convenient class for caching some object classes introduced by iOS) memory caching mechanism does not strictly limit the memory size occupied by cache data.
- the iOS platform can only delete the cached data that is finally stored if the total memory of the currently stored cached data exceeds the memory limit after storing the new cached data. In this new storage data storage process, the total capacity of the cached data may exceed the system's memory limit, resulting in low storage speed and efficiency of the cached data.
- the invention provides a linked list based application cache management method and device, which aims to solve the iOS platform adopting NSCache in a new cache data storage process, because the total capacity of the cached data may exceed the system memory limit The technical problem of cache data storage speed and low efficiency.
- the present invention provides a linked list based application cache management method, and the linked list based application cache management method includes the following steps:
- the linked list-based application cache management method includes:
- the linked list node is added to the linked list when the second memory is less than or equal to the maximum memory.
- the linked list based application cache management method further includes:
- the method based on the linked list application cache management further includes:
- the node corresponding to the cached data traversed is set as the head node of the linked list.
- the data field of the linked list node includes a survival time of the linked list node, and after the step of adding the linked list node to the linked list when the first memory is less than or equal to the maximum memory
- the linked list based application cache management method further includes:
- the linked list node is deleted when the linked list node currently reaches the survival time.
- the present invention further provides a linked list based application cache management apparatus, where the linked list based application cache management apparatus includes:
- a module is configured to: when receiving the cached data of the application, create a linked list node based on the received cached data, and obtain a memory size of the received cached data,
- a first obtaining module configured to acquire a maximum memory of the linked list and a current occupied memory size of the linked list
- a first calculating module configured to add the received memory size of the cached data to a currently occupied memory size of the linked list to obtain a first memory
- a first adding module configured to add the linked list node to the linked list when the first memory is less than or equal to the maximum memory.
- the linked list based application cache management device further comprises:
- a second obtaining module configured to acquire a time interval between a last access time and a current time of each node in the linked list when the first memory is greater than the maximum memory
- a first deleting module configured to delete a node with the largest time interval in the linked list
- a second calculating module configured to add the received memory size of the cached data to a current memory size of the linked list after the node is deleted to obtain a second memory
- a second adding module configured to add the linked list node to the linked list when the second memory is less than or equal to the maximum memory.
- the linked list based application cache management device further comprises:
- a third obtaining module configured to acquire, after receiving an access request for the cached data, identifier information of the cached data corresponding to the access request;
- a traversing module configured to traverse the linked list based on the identification information to access cache data corresponding to the access request.
- the linked list based application cache management device further comprises:
- a setting module configured to set a node corresponding to the cached data traversed to a head node of the linked list.
- the data field of the linked list node includes a survival time of the linked list node
- the linked list based application cache management device further includes:
- a determining module configured to determine, according to a creation time of the linked list node, whether the linked list node currently reaches the survival time
- a second deleting module configured to delete the linked list node when the linked list node currently reaches the surviving time.
- the invention creates a linked list node based on the received cached data when receiving the cached data of the application, and acquires the received memory size of the cached data; and then acquires the maximum memory of the linked list and the current of the linked list.
- the occupied memory size; then the received memory size of the cached data is added to the currently occupied memory size of the linked list to obtain a first memory; and finally, when the first memory is less than or equal to the maximum memory, Adding the linked list node to the linked list, adding the received cache data to the linked list when the first memory is less than or equal to the maximum memory, avoiding cache in the linked list during the new cache data storage process
- the data exceeds the maximum memory of the linked list, which improves the storage speed and efficiency of the cached data.
- FIG. 1 is a schematic flowchart diagram of a first embodiment of a method for managing application cache based on a linked list according to the present invention
- FIG. 2 is a schematic flowchart of a second embodiment of a method for managing application cache based on a linked list according to the present invention
- FIG. 3 is a schematic flowchart of a third embodiment of a method for managing application cache based on a linked list according to the present invention.
- FIG. 4 is a schematic flowchart of a fourth embodiment of a method for managing application cache based on a linked list according to the present invention.
- FIG. 5 is a schematic diagram of functional modules of a first embodiment of a linked list based application cache management apparatus according to the present invention
- FIG. 6 is a schematic diagram of functional modules of a second embodiment of a linked list based application cache management apparatus according to the present invention.
- FIG. 7 is a schematic diagram of functional modules of a third embodiment of a linked list based application cache management apparatus according to the present invention.
- FIG. 8 is a schematic diagram of functional modules of a fourth embodiment of a linked list based application cache management apparatus according to the present invention.
- FIG. 1 is a schematic flowchart diagram of a first embodiment of a method for managing application cache based on a linked list.
- the linked list based application cache management method includes:
- Step S110 when receiving the cached data of the application, creating a linked list node based on the received cached data, and acquiring a memory size of the received cached data;
- the linked list may be a doubly linked list or a single linked list.
- Creating a linked list node refers to storing the cached data in a data field of the newly created linked list node, wherein the direct successor of the newly created linked list node is the head node of the current linked list.
- the memory size of the received cached data is obtained, for example, the memory of the received cached data is 50M or the like.
- the application cache management method based on the linked list in this embodiment can be applied to an iOS platform, such as an iOS platform for developing various applications of the mobile terminal.
- Step S120 Obtain a maximum memory of the linked list and a current occupied memory size of the linked list.
- the maximum memory of the linked list refers to the maximum capacity of the linked list set when the linked list is established, and the currently occupied memory size of the linked list refers to the memory size of all cached data currently stored in the linked list.
- Step S130 adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain a first memory
- Step S140 adding the linked list node to the linked list when the first memory is less than or equal to the maximum memory.
- the linked list is The node serves as the head node of the linked list.
- the linked list node when the cache data of the application is received, the linked list node is created based on the received cache data, and the received memory size of the cached data is acquired; then the maximum memory of the linked list is obtained and the The currently occupied memory size of the linked list; then the received memory size of the cached data is added to the currently occupied memory size of the linked list to obtain a first memory; finally, the first memory is less than or equal to the maximum
- the linked list node is added to the linked list, so that the received cache data is added to the linked list when the first memory is less than or equal to the maximum memory, thereby avoiding the new cache data storage process.
- the cached data in the linked list exceeds the maximum memory of the linked list, which improves the storage speed and efficiency of the cached data.
- the linked list-based application cache management method further includes:
- Step S150 When the first memory is greater than the maximum memory, obtain a time interval between a last access time and a current time of each node in the linked list.
- the last access time of each node in the linked list refers to the access time of the last access of each node in the linked list.
- Step S160 deleting a node with the largest time interval in the linked list
- Deleting the node with the largest time interval in the linked list refers to deleting the last accessed access time in the linked list from the current time, that is, deleting the node in the linked list that has not been accessed for the longest time.
- Step S170 adding the received memory size of the cached data to the currently occupied memory size of the linked list after the node is deleted to obtain a second memory;
- Step S180 adding the linked list node to the linked list when the second memory is less than or equal to the maximum memory.
- the linked list node is added to the linked list.
- the linked list node is used as the head node of the linked list.
- the time interval between the last access time and the current time of each node in the linked list is obtained; and then the node with the largest time interval in the linked list is deleted.
- the received memory size of the cached data is added to the currently occupied memory size of the linked list after the node is deleted to obtain a second memory; and finally, when the second memory is less than or equal to the maximum memory Adding the linked list node to the linked list, when the first memory is greater than the maximum memory, first deleting the node with the largest time interval in the linked list to ensure that the second memory is less than or equal to the maximum memory.
- the linked list node is added to the linked list, thereby further avoiding that the cached data in the linked list exceeds the maximum memory of the linked list in the new cache data storage process, thereby improving the storage speed and efficiency of the cached data.
- the linked list based application cache management method further includes:
- Step S190 Acquire, after receiving an access request for the cached data, identifier information of the cached data corresponding to the access request;
- an access request for the cached data is generated, and the access request carries the identification information of the cached data, and the access to the cached data is received.
- the access request is parsed to obtain the identification information of the cached data corresponding to the access request.
- Step S200 traversing the linked list based on the identifier information to access cache data corresponding to the access request.
- the linked list is traversed based on the identifier information to access the cached data corresponding to the access request.
- the iOS platform adopting NSCache caches data access, it needs to match the identification information with the key of the cached data.
- each cached data key is similar, that is, when there are a large number of similar keys, the system consumes a large amount of time.
- the matching of the key results in a lower read performance of the cached data, that is, the read speed and efficiency of the cached data are lower.
- the linked list-based application cache management method further includes: setting a node corresponding to the traversed cache data as a head node of the linked list.
- the identifier information of the cached data corresponding to the access request is obtained; and then the linked list is traversed based on the identifier information to access the cached data corresponding to the access request, according to the The identification information of the cached data traverses the linked list to implement access of the cached data, thereby improving the speed and efficiency of reading the cached data.
- a fourth embodiment of the linked list based application cache management method of the present invention is proposed based on the first embodiment.
- the data field of the linked list node includes the survival time of the linked list node.
- the linked list-based application cache management method further includes:
- Step S210 determining, according to the creation time of the linked list node, whether the linked list node currently reaches the survival time
- the data field of the created linked list node includes the survival time of the linked list node, and is started after the linked list node is added to the linked list to determine whether the linked list node is currently reached. The survival time.
- Step S220 deleting the linked list node when the linked list node currently reaches the survival time.
- the link table node is deleted according to the survival time of the linked list node, that is, the timing storage of the cache data is realized, and the access efficiency of the cache data is further improved.
- FIG. 5 is a schematic diagram of functional modules of a first embodiment of a linked list based application cache management apparatus according to the present invention.
- the linked list based application cache management device includes:
- the creating module 110 is configured to: when receiving the cached data of the application, create a linked list node based on the received cached data, and obtain a memory size of the received cached data,
- the linked list may be a doubly linked list or a single linked list.
- Creating a linked list node refers to storing the cached data in a data field of the newly created linked list node, wherein the direct successor of the newly created linked list node is the head node of the current linked list.
- the memory size of the received cached data is obtained, for example, the memory of the received cached data is 50M or the like.
- the application cache management method based on the linked list in this embodiment can be applied to an iOS platform, such as an iOS platform for developing various applications of the mobile terminal.
- the first obtaining module 120 is configured to acquire a maximum memory of the linked list and a current occupied memory size of the linked list.
- the maximum memory of the linked list refers to the maximum capacity of the linked list set when the linked list is established, and the currently occupied memory size of the linked list refers to the memory size of all cached data currently stored in the linked list.
- the first calculating module 130 is configured to add the received memory size of the cached data to a currently occupied memory size of the linked list to obtain a first memory;
- the first adding module 140 is configured to add the linked list node to the linked list when the first memory is less than or equal to the maximum memory.
- the first adding module 140 adds the linked list node to the linked list.
- the linked list node is used as the head node of the linked list.
- the creating module 110 creates a linked list node based on the received cached data, and acquires the received memory size of the cached data; the first obtaining module 120 then acquires the The maximum memory of the linked list and the current occupied memory size of the linked list; the first calculating module 130 then adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain a first memory; Finally, when the first memory is less than or equal to the maximum memory, the first adding module 140 adds the linked list node to the linked list, so that when the first memory is less than or equal to the maximum memory, it is received.
- the cached data is added to the linked list, which avoids the cached data in the linked list exceeding the maximum memory of the linked list in the new cached data storage process, and improves the storage speed and efficiency of the cached data.
- the linked list based application cache management apparatus further includes:
- the second obtaining module 150 is configured to acquire, when the first memory is greater than the maximum memory, a time interval between a last access time and a current time of each node in the linked list;
- the last access time of each node in the linked list refers to the access time of the last access of each node in the linked list.
- a first deleting module 160 configured to delete a node with the largest time interval in the linked list
- the first deletion module 160 deletes the node with the largest time interval in the linked list, and refers to the node whose last accessed access time in the linked list is the longest from the current time, that is, the node that has not been accessed for the longest time in the deleted linked list.
- the second calculating module 170 is configured to add the received memory size of the cached data to the currently occupied memory size of the linked list after the node is deleted to obtain a second memory;
- the second adding module 180 is configured to add the linked list node to the linked list when the second memory is less than or equal to the maximum memory.
- the second adding module 180 adds the linked list node to the linked list.
- the linked list node is used as the head node of the linked list.
- the second obtaining module 150 acquires a time interval between the last access time and the current time of each node in the linked list; and then the first deleting module 160 Deleting the node with the largest time interval in the linked list; then the second computing module 170 adds the received memory size of the cached data to the currently occupied memory size of the linked list after the node is deleted to obtain the second memory; Finally, when the second memory is less than or equal to the maximum memory, the second adding module 180 adds the linked list node to the linked list, so that when the first memory is greater than the maximum memory, the linked list is first deleted.
- the node with the largest interval is used to ensure that the second memory is less than or equal to the maximum memory, and finally the linked list node is added to the linked list, thereby further avoiding the cached data in the linked list exceeding the linked list in the new cached data storage process.
- the maximum memory increases the storage speed and efficiency of cached data.
- the linked list based application cache management apparatus further includes:
- the third obtaining module 190 is configured to acquire, after receiving the access request of the cached data, the identifier information of the cached data corresponding to the access request;
- the cached data in the linked list needs to be called, an access request for the cached data is generated, and the access request carries the identification information of the cached data, and the access to the cached data is received.
- the third obtaining module 190 parses the access request to obtain the identification information of the cached data corresponding to the access request.
- the traversing module 200 is configured to traverse the linked list based on the identification information to access cache data corresponding to the access request.
- the linked list is traversed based on the identifier information to access the cached data corresponding to the access request.
- the iOS platform adopting NSCache caches data access, it needs to match the identification information with the key of the cached data.
- each cached data key is similar, that is, when there are a large number of similar keys, the system consumes a large amount of time.
- the matching of the key results in a lower read performance of the cached data, that is, the read speed and efficiency of the cached data are lower.
- the linked list-based application cache management apparatus further includes: a setting module, configured to set a node corresponding to the cached data traversed to a head node of the linked list.
- a node corresponding to the cached data traversed by the setting module as a head node of the linked list, so that when the new cached data is subsequently received, if the first memory is larger than the maximum memory, deleting the a tail node of the linked list; the memory size of the cached data received is added to the current memory size of the linked list after the node is deleted to obtain a second memory; and the second memory is less than or equal to the maximum In the case of memory, the linked list node is added to the linked list.
- the process of storing the cache data when the first memory is larger than the maximum memory is reduced, and the storage speed and efficiency of the cache data are improved.
- the third obtaining module 190 acquires the identification information of the cached data corresponding to the access request when receiving the access request of the cached data; and then the traversing module 200 traverses the linked list based on the identifier information to access the access The corresponding cache data is requested, and the cache data access is realized by traversing the linked list according to the identification information of the cache data, thereby improving the speed and efficiency of the cache data reading.
- a fourth embodiment of the linked list-based application cache management apparatus of the present invention is proposed based on the first embodiment.
- the data field of the linked list node includes the survival time of the linked list node.
- the linked list based application cache management device further includes:
- the determining module 210 is configured to determine, according to the creation time of the linked list node, whether the linked list node currently reaches the survival time;
- the data field of the created linked list node includes the survival time of the linked list node, and is started after the linked list node is added to the linked list to determine whether the linked list node is currently reached. The survival time.
- the second deleting module 220 is configured to delete the linked list node when the linked list node currently reaches the lifetime.
- the determining module 210 determines, according to the creation time of the linked list node, whether the linked list node currently reaches the survival time, and then when the linked list node currently reaches the surviving time, the second deleting module 220 Deleting the linked list node realizes deleting the linked list node according to the survival time of the linked list node, that is, the timing storage of the cached data is realized, and the access efficiency of the cached data is further improved.
- the foregoing embodiment method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be through hardware, but in many cases, the former is better.
- Implementation Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
- the optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the methods described in various embodiments of the present invention.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
本发明公开了一种基于链表的应用缓存管理方法，包括：在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；获取所述链表的最大内存及所述链表的当前占用的内存大小；将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。本发明还公开了一种基于链表的应用缓存管理装置。本发明实现了在第一内存小于或等于所述最大内存时将接收到的缓存数据添加至链表中，避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
Description
技术领域
本发明涉及存储技术领域，尤其涉及一种基于链表的应用缓存管理方法及装置。
背景技术
随着移动通讯技术的快速发展，移动终端的应用也越来越丰富。在采用iOS开发应用的过程中，会用到缓存实现各种数据的存储以达到数据高速存取的目的。
目前，采用NSCache（NSCache是iOS引入的一个方便的缓存某些object的类）内存缓存机制的iOS平台，没有严格限制缓存数据占用的内存大小。iOS平台只能在存储新的缓存数据后，若当前存储的缓存数据总的内存超过内存限制，则删除其中最终存储的缓存数据。采用这种存储方式在新的缓存数据存储过程中，缓存数据的总容量可能超出系统的内存限制，导致缓存数据的存储速度及效率低。
发明内容
本发明提供一种基于链表的应用缓存管理方法及装置，旨在解决采用NSCache的iOS平台在新的缓存数据存储过程中，由于缓存数据的总容量可能超出系统的内存限制而导致
缓存数据的存储速度及效率低的技术问题。
为实现上述目的，本发明提供的一种基于链表的应用缓存管理方法，所述基于链表的应用缓存管理方法包括以下步骤：
在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小，
获取所述链表的最大内存及所述链表的当前占用的内存大小；
将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；
在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
优选地，将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存的步骤之后，所述基于链表的应用缓存管理方法包括：
在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；
删除所述链表中时间间隔最大的结点；
将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；
在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
优选地，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：
在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；
基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
优选地，基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据的步骤之后，所述基于链表的应用缓存管理方法还包括：
将遍历到的缓存数据对应的结点设置为所述链表的头结点。
优选地，所述链表结点的数据域包含所述链表结点的存活时间，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：
基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；
在所述链表结点当前达到所述存活时间时，删除所述链表结点。
此外，为实现上述目的，本发明还提供一种基于链表的应用缓存管理装置，所述基于链表的应用缓存管理装置包括：
创建模块，用于在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小，
第一获取模块，用于获取所述链表的最大内存及所述链表的当前占用的内存大小；
第一计算模块，用于将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；
第一添加模块，用于在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
优选地，所述基于链表的应用缓存管理装置还包括：
第二获取模块，用于在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；
第一删除模块，用于删除所述链表中时间间隔最大的结点；
第二计算模块，用于将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；
第二添加模块，用于在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
优选地，所述基于链表的应用缓存管理装置还包括：
第三获取模块，用于在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；
遍历模块，用于基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
优选地，所述基于链表的应用缓存管理装置还包括：
设置模块，用于将遍历到的缓存数据对应的结点设置为所述链表的头结点。
优选地，所述链表结点的数据域包含所述链表结点的存活时间，所述基于链表的应用缓存管理装置还包括：
确定模块，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；
第二删除模块，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
本发明通过在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；接着获取所述链表的最大内存及所述链表的当前占用的内存大小；然后将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；最后在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表，实现了在第一内存小于或等于所述最大内存时将接收到的缓存数据添加至链表中，避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
附图说明
图1为本发明基于链表的应用缓存管理方法第一实施例的流程示意图；
图2为本发明基于链表的应用缓存管理方法第二实施例的流程示意图；
图3为本发明基于链表的应用缓存管理方法第三实施例的流程示意图；
图4为本发明基于链表的应用缓存管理方法第四实施例的流程示意图；
图5为本发明基于链表的应用缓存管理装置第一实施例的功能模块示意图；
图6为本发明基于链表的应用缓存管理装置第二实施例的功能模块示意图；
图7为本发明基于链表的应用缓存管理装置第三实施例的功能模块示意图；
图8为本发明基于链表的应用缓存管理装置第四实施例的功能模块示意图。
本发明目的的实现、功能特点及优点将结合实施例，参照附图做进一步说明。
具体实施方式
应当理解，此处所描述的具体实施例仅仅用以解释本发明，并不用于限定本发明。
本发明提供一种基于链表的应用缓存管理方法。参照图1，图1为本发明基于链表的应用缓存管理方法第一实施例的流程示意图。
在本实施例中，该基于链表的应用缓存管理方法包括：
步骤S110，在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；
本实施例中，链表可以为双向链表或单链表，创建链表结点是指将缓存数据存储至新建的链表结点的数据域，其中，新建链表结点的直接后继为当前链表的头结点。同时，获取接收到的缓存数据的内存大小，譬如接收到的缓存数据的内存为50M等。其中，本实施例基于链表的应用缓存管理方法可以应用与iOS平台，譬如开发移动终端各种应用的iOS平台。
步骤S120，获取所述链表的最大内存及所述链表的当前占用的内存大小；
其中，所述链表的最大内存是指在建立链表时设置的链表的最大容量，所述链表的当前占用的内存大小是指链表当前存储的所有缓存数据的内存大小。
步骤S130，将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；
步骤S140，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
在所述第一内存小于或等于所述最大内存时，表示链表当前存储的缓存数据未超过其最大容量，将所述链表结点添加至所述链表，本实施例中，具体是指将链表结点作为所述链表的头结点。
本实施例中，通过在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；接着获取所述链表的最大内存及所述链表的当前占用的内存大小；然后将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；最后在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表，实现了在第一内存小于或等于所述最大内存时将接收到的缓存数据添加至链表中，避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
基于第一实施例提出本发明基于链表的应用缓存管理方法的第二实施例，参照图2，在本实施例中，在步骤S130之后，该基于链表的应用缓存管理方法还包括：
步骤S150，在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；
其中，链表中各个结点的上一次访问时间是指链表中各个结点最后一次被访问的访问时间。
步骤S160，删除所述链表中时间间隔最大的结点；
删除所述链表中时间间隔最大的结点是指删除链表中最后一次被访问的访问时间距当前时间最久的结点，即删除链表中最久没有被访问的结点。
步骤S170，将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；
步骤S180，在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
链表中时间间隔最大的结点被删除以后，在所述第二内存小于或等于所述最大内存时，即链表的当前占用的内存大小与接收到的所述缓存数据的内存大小之和小于最大内存时，将所述链表结点添加至所述链表，本实施例中，具体是指将链表结点作为所述链表的头结点。
本实施例中，通过在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；接着删除所述链表中时间间隔最大的结点；然后将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；最后在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表，实现了在第一内存大于所述最大内存时，首先删除链表中时间间隔最大的结点，以保证第二内存小于或等于所述最大内存，最后将所述链表结点添加至所述链表，进一步避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
基于第一实施例提出本发明基于链表的应用缓存管理方法的第三实施例，参照图3，在本实施例中，在步骤S40之后，该基于链表的应用缓存管理方法还包括：
步骤S190，在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；
其中，在采用iOS平台开发移动终端各种应用的过程中，需要调用链表内的缓存数据时，生成缓存数据的访问请求，该访问请求携带有缓存数据的标识信息，在接收到缓存数据的访问请求时，解析所述访问请求以获取所述访问请求对应的缓存数据的标识信息。
步骤S200，基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
在获得缓存数据的标识信息之后，基于所述标识信息遍历所述链表，以访问所述访问请求对应的缓存数据。现有采用NSCache的iOS平台在缓存数据访问时，需要将标识信息与缓存数据的key进行一一匹配，在各个缓存数据key相似时，即具有大量相似的key时，系统会消耗大量的时间在key的匹配对比上，导致缓存数据的读取性能较低即缓存数据的读取速度及效率较低。
在其他实施例中，在步骤S200之后，该基于链表的应用缓存管理方法还包括：将遍历到的缓存数据对应的结点设置为所述链表的头结点。
通过将遍历到的缓存数据对应的结点设置为所述链表的头结点，使得在后续接收到新的缓存数据时，若所述第一内存大于所述最大内存，则删除所述链表的尾结点；将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。减少了第一内存大于所述最大内存时存储缓存数据的流程，提高了缓存数据的存储速度及效率。
本实施例通过在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；接着基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据，通过根据缓存数据的标识信息遍历所述链表实现了缓存数据的访问，提高了缓存数据读取的速度及效率。
基于第一实施例提出本发明基于链表的应用缓存管理方法的第四实施例，参照图4，在本实施例中，所述链表结点的数据域包含所述链表结点的存活时间，在步骤S40之后，该基于链表的应用缓存管理方法还包括：
步骤S210，基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；
本实施例中，在存储缓存数据时，创建的链表结点的数据域包含所述链表结点的存活时间，在链表结点添加至链表后开始计时，以确定所述链表结点当前是否达到所述存活时间。
步骤S220，在所述链表结点当前达到所述存活时间时，删除所述链表结点。
本实施例通过基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间，接着在所述链表结点当前达到所述存活时间时，删除所述链表结点，实现了根据链表结点的存活时间删除链表结点，即实现了缓存数据的定时存储，进一步提高了缓存数据的存取效率。
本发明进一步提供一种基于链表的应用缓存管理装置。参照图5，图5为本发明基于链表的应用缓存管理装置第一实施例的功能模块示意图。
在本实施例中，该基于链表的应用缓存管理装置包括：
创建模块110，用于在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小，
本实施例中，链表可以为双向链表或单链表，创建链表结点是指将缓存数据存储至新建的链表结点的数据域，其中，新建链表结点的直接后继为当前链表的头结点。同时，获取接收到的缓存数据的内存大小，譬如接收到的缓存数据的内存为50M等。其中，本实施例基于链表的应用缓存管理方法可以应用与iOS平台，譬如开发移动终端各种应用的iOS平台。
第一获取模块120，用于获取所述链表的最大内存及所述链表的当前占用的内存大小；
其中，所述链表的最大内存是指在建立链表时设置的链表的最大容量，所述链表的当前占用的内存大小是指链表当前存储的所有缓存数据的内存大小。
第一计算模块130，用于将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；
第一添加模块140，用于在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
在所述第一内存小于或等于所述最大内存时，表示链表当前存储的缓存数据未超过其最大容量，第一添加模块140将所述链表结点添加至所述链表，本实施例中，具体是指将链表结点作为所述链表的头结点。
本实施例中，通过在接收到应用的缓存数据时，创建模块110基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；第一获取模块120接着获取所述链表的最大内存及所述链表的当前占用的内存大小；第一计算模块130然后将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；最后在所述第一内存小于或等于所述最大内存时，第一添加模块140将所述链表结点添加至所述链表，实现了在第一内存小于或等于所述最大内存时将接收到的缓存数据添加至链表中，避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
基于第一实施例提出本发明基于链表的应用缓存管理装置的第二实施例，参照图6，在本实施例中，该基于链表的应用缓存管理装置还包括：
第二获取模块150，用于在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；
其中，链表中各个结点的上一次访问时间是指链表中各个结点最后一次被访问的访问时间。
第一删除模块160，用于删除所述链表中时间间隔最大的结点；
第一删除模块160删除所述链表中时间间隔最大的结点是指删除链表中最后一次被访问的访问时间距当前时间最久的结点，即删除链表中最久没有被访问的结点。
第二计算模块170，用于将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；
第二添加模块180，用于在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
链表中时间间隔最大的结点被删除以后，在所述第二内存小于或等于所述最大内存时，即链表的当前占用的内存大小与接收到的所述缓存数据的内存大小之和小于最大内存时，第二添加模块180将所述链表结点添加至所述链表，本实施例中，具体是指将链表结点作为所述链表的头结点。
本实施例中，通过在所述第一内存大于所述最大内存时，第二获取模块150获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；接着第一删除模块160删除所述链表中时间间隔最大的结点；然后第二计算模块170将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；最后在所述第二内存小于或等于所述最大内存时，第二添加模块180将所述链表结点添加至所述链表，实现了在第一内存大于所述最大内存时，首先删除链表中时间间隔最大的结点，以保证第二内存小于或等于所述最大内存，最后将所述链表结点添加至所述链表，进一步避免了在新的缓存数据存储过程中链表中缓存数据超过链表的最大内存，提高了缓存数据的存储速度与效率。
基于第一实施例提出本发明基于链表的应用缓存管理装置的第三实施例，参照图7，在本实施例中，该基于链表的应用缓存管理装置还包括：
第三获取模块190，用于在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；
其中，在采用iOS平台开发移动终端各种应用的过程中，需要调用链表内的缓存数据时，生成缓存数据的访问请求，该访问请求携带有缓存数据的标识信息，在接收到缓存数据的访问请求时，第三获取模块190解析所述访问请求以获取所述访问请求对应的缓存数据的标识信息。
遍历模块200，用于基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
在获得缓存数据的标识信息之后，基于所述标识信息遍历所述链表，以访问所述访问请求对应的缓存数据。现有采用NSCache的iOS平台在缓存数据访问时，需要将标识信息与缓存数据的key进行一一匹配，在各个缓存数据key相似时，即具有大量相似的key时，系统会消耗大量的时间在key的匹配对比上，导致缓存数据的读取性能较低即缓存数据的读取速度及效率较低。
在其他实施例中，该基于链表的应用缓存管理装置还包括：设置模块，用于将遍历到的缓存数据对应的结点设置为所述链表的头结点。
通过设置模块将遍历到的缓存数据对应的结点设置为所述链表的头结点，使得在后续接收到新的缓存数据时，若所述第一内存大于所述最大内存，则删除所述链表的尾结点；将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。减少了第一内存大于所述最大内存时存储缓存数据的流程，提高了缓存数据的存储速度及效率。
本实施例通过在接收到缓存数据的访问请求时，第三获取模块190获取所述访问请求对应的缓存数据的标识信息；接着遍历模块200基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据，通过根据缓存数据的标识信息遍历所述链表实现了缓存数据的访问，提高了缓存数据读取的速度及效率。
基于第一实施例提出本发明基于链表的应用缓存管理装置的第四实施例，参照图8，在本实施例中，所述链表结点的数据域包含所述链表结点的存活时间，该基于链表的应用缓存管理装置还包括：
确定模块210，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；
本实施例中，在存储缓存数据时，创建的链表结点的数据域包含所述链表结点的存活时间，在链表结点添加至链表后开始计时，以确定所述链表结点当前是否达到所述存活时间。
第二删除模块220，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
本实施例通过确定模块210基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间，接着在所述链表结点当前达到所述存活时间时，第二删除模块220删除所述链表结点，实现了根据链表结点的存活时间删除链表结点，即实现了缓存数据的定时存储，进一步提高了缓存数据的存取效率。
需要说明的是，在本文中，术语“包括”、“包含”或者其任何其它变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者装置不仅包括那些要素，而且还包括没有明确列出的其它要素，或者是还包括为这种过程、方法、物品或者装置所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者装置中还存在另外的相同要素。
上述本发明实施例序号仅仅为了描述，不代表实施例的优劣。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到上述实施例方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质（如ROM/RAM、磁碟、光盘）中，包括若干指令用以使得一台终端设备（可以是手机，计算机，服务器，空调器，或者网络设备等）执行本发明各个实施例所述的方法。
以上仅为本发明的优选实施例，并非因此限制本发明的专利范围，凡是利用本发明说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本发明的专利保护范围内。
Claims (16)
- 一种基于链表的应用缓存管理方法，其特征在于，所述基于链表的应用缓存管理方法包括以下步骤：在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小；获取所述链表的最大内存及所述链表的当前占用的内存大小；将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
- 如权利要求1所述的基于链表的应用缓存管理方法，其特征在于，将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存的步骤之后，所述基于链表的应用缓存管理方法包括：在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；删除所述链表中时间间隔最大的结点；将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
- 如权利要求1所述的基于链表的应用缓存管理方法，其特征在于，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
- 如权利要求3所述的基于链表的应用缓存管理方法，其特征在于，基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据的步骤之后，所述基于链表的应用缓存管理方法还包括：将遍历到的缓存数据对应的结点设置为所述链表的头结点。
- 如权利要求1所述的基于链表的应用缓存管理方法，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求2所述的基于链表的应用缓存管理方法，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求3所述的基于链表的应用缓存管理方法，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求4所述的基于链表的应用缓存管理方法，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表的步骤之后，所述基于链表的应用缓存管理方法还包括：基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 一种基于链表的应用缓存管理装置，其特征在于，所述基于链表的应用缓存管理装置包括：创建模块，用于在接收到应用的缓存数据时，基于接收到的缓存数据创建链表结点，并获取接收到的所述缓存数据的内存大小，第一获取模块，用于获取所述链表的最大内存及所述链表的当前占用的内存大小；第一计算模块，用于将接收到的所述缓存数据的内存大小与所述链表的当前占用的内存大小相加以获得第一内存；第一添加模块，用于在所述第一内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
- 如权利要求9所述的基于链表的应用缓存管理装置，其特征在于，所述基于链表的应用缓存管理装置还包括：第二获取模块，用于在所述第一内存大于所述最大内存时，获取所述链表中各个结点的上一次访问时间与当前时间的时间间隔；第一删除模块，用于删除所述链表中时间间隔最大的结点；第二计算模块，用于将接收到的所述缓存数据的内存大小与结点删除后所述链表的当前占用的内存大小相加以获得第二内存；第二添加模块，用于在所述第二内存小于或等于所述最大内存时，将所述链表结点添加至所述链表。
- 如权利要求9所述的基于链表的应用缓存管理装置，其特征在于，所述基于链表的应用缓存管理装置还包括：第三获取模块，用于在接收到缓存数据的访问请求时，获取所述访问请求对应的缓存数据的标识信息；遍历模块，用于基于所述标识信息遍历所述链表以访问所述访问请求对应的缓存数据。
- 如权利要求11所述的基于链表的应用缓存管理装置，其特征在于，所述基于链表的应用缓存管理装置还包括：设置模块，用于将遍历到的缓存数据对应的结点设置为所述链表的头结点。
- 如权利要求9所述的基于链表的应用缓存管理装置，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，所述基于链表的应用缓存管理装置还包括：确定模块，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；第二删除模块，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求10所述的基于链表的应用缓存管理装置，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，所述基于链表的应用缓存管理装置还包括：确定模块，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；第二删除模块，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求11所述的基于链表的应用缓存管理装置，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，所述基于链表的应用缓存管理装置还包括：确定模块，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；第二删除模块，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
- 如权利要求12所述的基于链表的应用缓存管理装置，其特征在于，所述链表结点的数据域包含所述链表结点的存活时间，所述基于链表的应用缓存管理装置还包括：确定模块，用于基于所述链表结点的创建时间确定所述链表结点当前是否达到所述存活时间；第二删除模块，用于在所述链表结点当前达到所述存活时间时，删除所述链表结点。
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2016277745A AU2016277745B2 (en) | 2016-03-14 | 2016-03-14 | Linked-list-based method and device for application caching management |
| PCT/CN2016/076296 WO2017156683A1 (zh) | 2016-03-14 | 2016-03-14 | 基于链表的应用缓存管理方法及装置 |
| US15/414,628 US10241927B2 (en) | 2016-03-14 | 2017-01-25 | Linked-list-based method and device for application caching management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2016/076296 WO2017156683A1 (zh) | 2016-03-14 | 2016-03-14 | 基于链表的应用缓存管理方法及装置 |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US15/414,628 Continuation US10241927B2 (en) | 2016-03-14 | 2017-01-25 | Linked-list-based method and device for application caching management |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2017156683A1 true WO2017156683A1 (zh) | 2017-09-21 |
Family
ID=59851471
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2016/076296 Ceased WO2017156683A1 (zh) | 2016-03-14 | 2016-03-14 | 基于链表的应用缓存管理方法及装置 |
Country Status (2)
| Country | Link |
|---|---|
| AU (1) | AU2016277745B2 (zh) |
| WO (1) | WO2017156683A1 (zh) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109144892A (zh) * | 2018-08-27 | 2019-01-04 | 南京国电南自轨道交通工程有限公司 | 一种管理内存中高频变化数据的缓冲链表数据结构设计方法 |
| US10241927B2 (en) * | 2016-03-14 | 2019-03-26 | Shenzhen Skyworth-Rgb Electronic Co., Ltd. | Linked-list-based method and device for application caching management |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7536529B1 (en) * | 2005-06-10 | 2009-05-19 | American Megatrends, Inc. | Method, system, apparatus, and computer-readable medium for provisioning space in a data storage system |
| CN103984639A (zh) * | 2014-04-29 | 2014-08-13 | 宁波三星电气股份有限公司 | 一种动态内存分配方法 |
| CN104850507A (zh) * | 2014-02-18 | 2015-08-19 | 腾讯科技（深圳）有限公司 | 一种数据缓存方法和数据缓存装置 |
| CN105786723A (zh) * | 2016-03-14 | 2016-07-20 | 深圳创维－Rgb电子有限公司 | 基于链表的应用缓存管理方法及装置 |
-
2016
- 2016-03-14 WO PCT/CN2016/076296 patent/WO2017156683A1/zh not_active Ceased
- 2016-03-14 AU AU2016277745A patent/AU2016277745B2/en not_active Ceased
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7536529B1 (en) * | 2005-06-10 | 2009-05-19 | American Megatrends, Inc. | Method, system, apparatus, and computer-readable medium for provisioning space in a data storage system |
| CN104850507A (zh) * | 2014-02-18 | 2015-08-19 | 腾讯科技（深圳）有限公司 | 一种数据缓存方法和数据缓存装置 |
| CN103984639A (zh) * | 2014-04-29 | 2014-08-13 | 宁波三星电气股份有限公司 | 一种动态内存分配方法 |
| CN105786723A (zh) * | 2016-03-14 | 2016-07-20 | 深圳创维－Rgb电子有限公司 | 基于链表的应用缓存管理方法及装置 |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10241927B2 (en) * | 2016-03-14 | 2019-03-26 | Shenzhen Skyworth-Rgb Electronic Co., Ltd. | Linked-list-based method and device for application caching management |
| CN109144892A (zh) * | 2018-08-27 | 2019-01-04 | 南京国电南自轨道交通工程有限公司 | 一种管理内存中高频变化数据的缓冲链表数据结构设计方法 |
Also Published As
| Publication number | Publication date |
|---|---|
| AU2016277745B2 (en) | 2021-02-11 |
| AU2016277745A1 (en) | 2017-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019037396A1 (zh) | 账户清结算方法、装置、设备及存储介质 | |
| WO2013131444A1 (zh) | 分享内容的方法、终端、服务器及系统、计算机存储介质 | |
| WO2020224247A1 (zh) | 基于区块链的数据溯源方法、装置、设备及可读存储介质 | |
| WO2013017004A1 (zh) | 文件的扫描方法、系统、客户端及服务器 | |
| WO2017041538A1 (zh) | 终端用户界面的受控显示方法及装置 | |
| WO2018126888A1 (zh) | 电视功能的快捷启动设置方法及装置 | |
| WO2015196960A1 (en) | Method and system for checking security of url for mobile terminal | |
| WO2019196213A1 (zh) | 接口测试方法、装置、设备及计算机可读存储介质 | |
| WO2019051902A1 (zh) | 终端控制方法、空调器及计算机可读存储介质 | |
| WO2019161615A1 (zh) | 账单录入方法、系统、光学字符识别服务器和存储介质 | |
| WO2019169814A1 (zh) | 自动生成中文注释的方法、装置、设备及存储介质 | |
| WO2018023926A1 (zh) | 电视与移动终端的互动方法及系统 | |
| WO2015120774A1 (en) | Network access method and apparatus applied to mobile application | |
| WO2015144089A1 (en) | Application recommending method and apparatus | |
| WO2017071352A1 (zh) | 密码的推送方法、推送系统及终端设备 | |
| WO2018233301A1 (zh) | 产品推荐方法、装置、设备以及计算机可读存储介质 | |
| WO2018076811A1 (zh) | 数据分享方法、装置、存储介质及电子设备 | |
| WO2016058258A1 (zh) | 终端远程控制方法和系统 | |
| WO2017190451A1 (zh) | 图片推送方法和装置 | |
| WO2015169177A1 (en) | Web page display method and apparatus | |
| WO2012028079A1 (zh) | 一种移动终端备份数据的导入方法及装置 | |
| WO2019085301A1 (zh) | 座机未接来电的反馈方法、装置、设备及可读存储介质 | |
| WO2017166037A1 (zh) | 一种数据篡改的检测装置及方法 | |
| WO2016090991A1 (zh) | 流媒体数据的下载方法及装置 | |
| WO2018098879A1 (zh) | 数字水印加密方法及装置 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| ENP | Entry into the national phase |
Ref document number: 2016277745 Country of ref document: AU Date of ref document: 20160314 Kind code of ref document: A |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 16893848 Country of ref document: EP Kind code of ref document: A1 |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 16893848 Country of ref document: EP Kind code of ref document: A1 |