| 摘要 |
Process for managing the storage of a list (L) of N items (I[i]) in a memory cache (M) of C items (I[i]) of said list, said N items being ordered in said list according to a rank i which depends of their last request time by a user, C, N and i being strictly positive integers, said process providing, upon the reception of a request for an item (I[i]), for calculating a popularity probability f(i) for said requested item, f being an acceleration function, and for deciding to move or not said requested item at a higher rank i according to said popularity probability. |
