z-logo
open-access-imgOpen Access
User-oriented cache deletion algorithm in a delayed update-tolerant web cache server for supporting a non-formal education
Author(s) -
Yudai Kurashita,
Kazumasa Takami
Publication year - 2019
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2019.09.444
Subject(s) - computer science , cache algorithms , cache , algorithm , cache invalidation , page cache , smart cache , web page , cache oblivious algorithm , operating system , cache coloring , cache pollution , cpu cache , world wide web
In developing countries, it is often difficult to use web content for e-learning because Internet accessing is unavailable or limited. To support education in such a situation, the authors previously proposed a system that uses a delayed update-tolerant web cache server and a wireless LAN. This system stores e-learning webpages requested by free school children in a cache memory, which is then carried to the free school so that the children can access the webpages in an off-line environment. The present paper proposes a cache deletion algorithm that reflects children’s requests for content retention in the cache server. It is called a user-oriented least recently used (LRU) algorithm. We have developed an experimental system that implemented this algorithm and carried out a learning experiment under conditions that simulated actual usage. We compared the proposed algorithm with existing cache deletion algorithms, including the least recently used (LRU), the least frequently used (LFU) and the least frequently recently used (LFRU) algorithms, in terms of the frequently accessed leaning cache retention rate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom