WO2017156683A1

WO2017156683A1 - Linked list-based application cache management method and device

Info

Publication number: WO2017156683A1
Application number: PCT/CN2016/076296
Authority: WO
Inventors: 何锐
Original assignee: 深圳创维－Rgb电子有限公司
Priority date: 2016-03-14
Filing date: 2016-03-14
Publication date: 2017-09-21
Also published as: AU2016277745B2; AU2016277745A1

Abstract

The present invention discloses a linked list-based application cache management method, comprising: when the cache data of an application are received, a linked list node is created on the basis of the received cache data, and the memory size of the received cache data is obtained; the maximum memory of the linked list and the size of the currently occupied memory of the linked list are obtained; the memory size of the received cache data and the size of the currently occupied memory of the liked list are added to obtain a first memory; and when the first memory is smaller than or equal to the maximum memory, the linked list node is added into the linked list. The present invention further discloses a linked list-based application cache management device. The present invention implements that the received cache data is added into the linked list when the first memory is smaller than or equal to the maximum memory, thereby preventing the cache data in the linked list during a new cache data storage process from exceeding the maximum memory of the linked list, and improving the storage speed and efficiency of the cache data.

Description

Linked table based application cache management method and device

Technical field

The present invention relates to the field of storage technologies, and in particular, to a linked list based application cache management method and apparatus.

Background technique

With the rapid development of mobile communication technology, the application of mobile terminals is becoming more and more abundant. In the process of developing an application using iOS, a cache is used to realize storage of various data to achieve high-speed data access.

At present, 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.

Summary of the invention

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.

To achieve the above objective, 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:

When receiving the cached data of the application, creating a linked list node based on the received cached data, and obtaining a memory size of the received cached data,

Obtaining a maximum memory of the linked list and a current occupied memory size of the linked list;

Adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain a first memory;

Adding the linked list node to the linked list when the first memory is less than or equal to the maximum memory.

Preferably, after the step of adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain the first memory, the linked list-based application cache management method includes:

And acquiring, 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;

Deleting the node with the largest time interval in the linked list;

Adding the received memory size of the cached data to the current occupied memory size of the linked list after the node is deleted to obtain a second memory;

The linked list node is added to the linked list when the second memory is less than or equal to the maximum memory.

Preferably, 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:

Obtaining identification information of the cached data corresponding to the access request when receiving the access request of the cached data;

And traversing the linked list based on the identifier information to access cache data corresponding to the access request.

Preferably, after the step of traversing the linked list to access the cached data corresponding to the access request, 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.

Preferably, 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:

Determining whether the linked list node currently reaches the survival time based on a creation time of the linked list node;

The linked list node is deleted when the linked list node currently reaches the survival time.

In addition, in order to achieve the above object, 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.

Preferably, 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.

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;

And a traversing module, configured to traverse the linked list based on the identification information to access cache data corresponding to the access request.

And a setting module, configured to set a node corresponding to the cached data traversed to a head node of the linked list.

Preferably, the data field of the linked list node includes a survival time of the linked list node, and 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;

And 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.

DRAWINGS

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;

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;

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;

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;

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.

The implementation, functional features, and advantages of the present invention will be further described in conjunction with the embodiments.

detailed description

It is understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

The invention provides a linked list based application cache management method. Referring to FIG. 1, FIG. 1 is a schematic flowchart diagram of a first embodiment of a method for managing application cache based on a linked list.

In this embodiment, 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;

In this embodiment, 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. . At the same time, 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.

When the first memory is less than or equal to the maximum memory, it indicates that the cache data currently stored in the linked list does not exceed its maximum capacity, and the linked list node is added to the linked list. In this embodiment, specifically, the linked list is The node serves as the head node of the linked list.

In this embodiment, 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 When the memory is added, 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 second embodiment of the linked list-based application cache management method of the present invention is proposed based on the first embodiment. Referring to FIG. 2, in the embodiment, after the step S130, 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.

After the node with the largest time interval in the linked list is deleted, when the second memory is less than or equal to the maximum memory, that is, the sum of the currently occupied memory size of the linked list and the received memory size of the cached data is less than the maximum In the case of the memory, the linked list node is added to the linked list. In this embodiment, specifically, the linked list node is used as the head node of the linked list.

In this embodiment, when the first memory is greater than the maximum memory, 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. Point; then, 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. Finally, 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 third embodiment of the linked list based application cache management method of the present invention is proposed based on the first embodiment. Referring to FIG. 3, in the embodiment, after the step S40, 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;

In the process of developing various applications of the mobile terminal by using the iOS platform, when 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. At the time of the request, 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.

After obtaining the identification information of the cached data, the linked list is traversed based on the identifier information to access the cached data corresponding to the access request. When the iOS platform adopting NSCache caches data access, it needs to match the identification information with the key of the cached data. When 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.

In other embodiments, after the step S200, 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.

Setting the node corresponding to the cached data to the 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 linked list a tail node; the memory size of the received cache data is added to the current memory size of the linked list after the node is deleted to obtain a second memory; when the second memory is less than or equal to the maximum memory Adding the linked list node 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.

In this embodiment, when the access request of the cached data is received, 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. Referring to FIG. 4, in the embodiment, the data field of the linked list node includes the survival time of the linked list node. After the step S40, 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;

In this embodiment, when the cache data is stored, 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.

In this embodiment, by determining, according to the creation time of the linked list node, whether the linked list node currently reaches the survival time, and then 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.

The invention further provides a linked list based application cache management device. Referring to FIG. 5, 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.

In this embodiment, 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 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 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.

When the first memory is less than or equal to the maximum memory, indicating that the cache data currently stored in the linked list does not exceed its maximum capacity, the first adding module 140 adds the linked list node to the linked list. In this embodiment, Specifically, the linked list node is used as the head node of the linked list.

In this embodiment, when the cache data of the application is received, 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 second embodiment of the linked list based application cache management apparatus of the present invention is proposed based on the first embodiment. Referring to FIG. 6, in the embodiment, 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;

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.

After the node with the largest time interval in the linked list is deleted, when the second memory is less than or equal to the maximum memory, that is, the sum of the currently occupied memory size of the linked list and the received memory size of the cached data is less than the maximum In the case of the memory, the second adding module 180 adds the linked list node to the linked list. In this embodiment, specifically, the linked list node is used as the head node of the linked list.

In this embodiment, when the first memory is greater than the maximum memory, 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 third embodiment of the linked list based application cache management apparatus of the present invention is proposed based on the first embodiment. Referring to FIG. 7, in the embodiment, 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;

In the process of developing various applications of the mobile terminal by using the iOS platform, when 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. When requested, 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.

In other embodiments, 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.

Setting 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.

In this embodiment, 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. Referring to FIG. 8, in the 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 second deleting module 220 is configured to delete the linked list node when the linked list node currently reaches the lifetime.

In this embodiment, 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.

It is to be understood that the term "comprises", "comprising", or any other variants thereof, is intended to encompass a non-exclusive inclusion, such that a process, method, article, or device comprising a series of elements includes those elements. It also includes other elements not explicitly listed, or elements that are inherent to such a process, method, article, or device. An element that is defined by the phrase "comprising a ..." does not exclude the presence of additional equivalent elements in the process, method, item, or device that comprises the element.

The serial numbers of the embodiments of the present invention are merely for the description, and do not represent the advantages and disadvantages of the embodiments.

Through the description of the above embodiments, those skilled in the art can clearly understand that 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.

The above are only the preferred embodiments of the present invention, and are not intended to limit the scope of the invention, and the equivalent structure or equivalent process transformations made by the description of the present invention and the drawings are directly or indirectly applied to other related technical fields. The same is included in the scope of patent protection of the present invention.

Claims

A linked list based application cache management method, characterized in that the linked list based application cache management method comprises the following steps:

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;

Obtaining a maximum memory of the linked list and a current occupied memory size of the linked list;

Adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain a first memory;

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 according to claim 1, wherein after the step of adding the received memory size of the cached data to the currently occupied memory size of the linked list to obtain the first memory, The linked list based application cache management method includes:

And acquiring, 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;

Deleting the node with the largest time interval in the linked list;

Adding the received memory size of the cached data to the current occupied memory size of the linked list after the node is deleted to obtain a second memory;

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 according to claim 1, wherein when the first memory is less than or equal to the maximum memory, the step of adding the linked list node to the linked list is performed. The linked list based application cache management method further includes:

Obtaining identification information of the cached data corresponding to the access request when receiving the access request of the cached data;

And traversing the linked list based on the identifier information to access cache data corresponding to the access request.
The linked list based application cache management method according to claim 3, wherein after the step of traversing the linked list based on the identification information to access cache data corresponding to the access request, the linked list based application cache management The method also includes:

The node corresponding to the cached data traversed is set as the head node of the linked list.
The linked list-based application cache management method according to claim 1, wherein the data field of the linked list node includes a lifetime of the linked list node, and the first memory is less than or equal to the maximum memory. After the step of adding the linked list node to the linked list, the linked list based application cache management method further includes:

Determining whether the linked list node currently reaches the survival time based on a creation time of the linked list node;

The linked list node is deleted when the linked list node currently reaches the survival time.
The linked list-based application cache management method according to claim 2, wherein the data field of the linked list node includes a lifetime of the linked list node, and the first memory is less than or equal to the maximum memory. After the step of adding the linked list node to the linked list, the linked list based application cache management method further includes:

Determining whether the linked list node currently reaches the survival time based on a creation time of the linked list node;

The linked list node is deleted when the linked list node currently reaches the survival time.
The linked list-based application cache management method according to claim 3, wherein the data field of the linked list node includes a lifetime of the linked list node, and the first memory is less than or equal to the maximum memory. After the step of adding the linked list node to the linked list, the linked list based application cache management method further includes:

Determining whether the linked list node currently reaches the survival time based on a creation time of the linked list node;

The linked list node is deleted when the linked list node currently reaches the survival time.
The linked list-based application cache management method according to claim 4, wherein the data field of the linked list node includes a lifetime of the linked list node, and the first memory is less than or equal to the maximum memory. After the step of adding the linked list node to the linked list, the linked list based application cache management method further includes:

Determining whether the linked list node currently reaches the survival time based on a creation time of the linked list node;

The linked list node is deleted when the linked list node currently reaches the survival time.
A linked list based application cache management device, wherein the linked list based application cache management device comprises:

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 apparatus according to claim 9, wherein the linked list based application cache management apparatus 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 apparatus according to claim 9, wherein the linked list based application cache management apparatus 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;

And 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 apparatus according to claim 11, wherein the linked list based application cache management apparatus further comprises:

And a setting module, configured to set a node corresponding to the cached data traversed to a head node of the linked list.
The linked list-based application cache management device according to claim 9, wherein the data field of the linked list node includes a lifetime of the linked list node, and the linked list based application cache management device further comprises:

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;

And a second deleting module, configured to delete the linked list node when the linked list node currently reaches the surviving time.
The linked list-based application cache management device according to claim 10, wherein the data field of the linked list node includes a lifetime of the linked list node, and the linked list based application cache management device further comprises:

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;

And a second deleting module, configured to delete the linked list node when the linked list node currently reaches the surviving time.
The linked list-based application cache management device according to claim 11, wherein the data field of the linked list node includes a lifetime of the linked list node, and the linked list based application cache management device further comprises:

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;

And a second deleting module, configured to delete the linked list node when the linked list node currently reaches the surviving time.
The linked list-based application cache management device according to claim 12, wherein the data field of the linked list node includes a survival time of the linked list node, and the linked list based application cache management device further comprises:

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;

And a second deleting module, configured to delete the linked list node when the linked list node currently reaches the surviving time.