Linked-list-based method and device for application caching management
AssigneeShenzhen Skyworth-Rgb Electronic Co., Ltd.
InventorRui He
Life of this patent
Estimating the term…
Abstract
A linked-list-based method for application caching management is disclosed, the method including: when receiving application cached data, creating a node in a linked list for the cached data and obtaining a memory size of the cached data; obtaining a maximum memory size and a currently occupied memory size of the linked list; adding the memory size of the received cached data to the currently occupied memory size of the linked list to obtain a first memory size; and adding the node to the linked list if the first memory size is smaller than or equal to the maximum memory size. A linked-list-based device for application caching management is also provided.
Claims12
A linked-list-based method for application caching management, the method comprising:
- creating a node in a linked list according to received application cached data and obtaining a memory size of the received application cached data;
- obtaining a maximum memory size and a currently occupied memory size of the linked list;
- adding the memory size of the received cached data and the currently occupied memory size of the linked list to obtain a first memory size;
- and
- adding the node to the linked list when the first memory size is smaller than or equal to the maximum memory size;
- obtaining identification information of cached data corresponding to a received cached-data access request;
- and
- traversing the linked list to access the cached data corresponding to the access request based on the identification information.
A linked-list-based device for application caching management, the device comprising one or more processors and a non-transitory program storage medium containing program code executable by the processor(s), the program code comprising:
- a creation module, configured to create a node in a linked list according to received application cached data and obtaining a memory size of the received application cached data,
- a first acquisition module, configured to obtain a maximum memory size and a currently occupied memory size of the linked list;
- a first computation module, configured to add the memory size of the received cached data and the currently occupied memory size of the linked list to obtain a first memory size, and
- a first addition module, configured to add the node to the linked list when the first memory size is smaller than or equal to the maximum memory size;
- a third acquisition module configured to obtain identification information of cached data corresponding to a received cached-data access request, and
- a traversal module configured to traverse the linked list to access the cached data corresponding to the access request based on the identification information.
Dependencies are inferred from the claim text.