Supporting concurrent remove operations and add-to-front operations on a Least Recently Used (LRU) queue
Abstract:
A remove operation and an add-to-front operation may be currently performed with respect to nodes in an Least Recently Used (LRU) queue. A remove operation for a node may proceed if a lock can be obtained on the node to be removed and a predecessor node. During the remove operation, an add-to-front operation may proceed if a lock can be obtained on a dummy node that precedes the current front node of the LRU queue.
Information query
Patent Agency Ranking
0/0