Results 221 to 230 of about 2,022 (254)
Some of the next articles are maybe not open access.
Counter-based cache replacement algorithms
2005 International Conference on Computer Design, 2006Recent studies have shown that in highly associative caches, the performance gap between the least recently used (LRU) and the theoretical optimal replacement algorithms is large, suggesting that alternative replacement algorithms can improve the performance of the cache. One main reason for this performance gap is that in the LRU replacement algorithm,
Mazen Kharbutli, Yan Solihin
openaire +2 more sources
An efficient cache replacement algorithm for multimedia object caching.
Comput. Syst. Sci. Eng., 2007Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for improving the scalability of web services, especially in the environment of mobile networks.
Shen, H +4 more
openaire +2 more sources
Cooperative Cache Replacement Policy for MANETs
International Journal of Advanced Pervasive and Ubiquitous Computing, 2014Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low.
Prashant Kumar +3 more
openaire +1 more source
SF-LRU cache replacement algorithm
Records of the 2004 International Workshop on Memory Technology, Design and Testing, 2004., 2004In this paper we propose a replacement algorithm, SF-LRU (second chance-frequency - least recently used) that combines the LRU (least recently used) and the LFU (least frequently used) using the second chance concept. A comprehensive comparison is made between our algorithm and both LRU and LFU algorithms.
Jaafar Alghazo +2 more
openaire +2 more sources
Cache Replacement in Mobile Adhoc Networks
International Journal of Distributed Systems and Technologies, 2012Caching of frequently accessed data in Mobile Adhoc NETwork (MANET) is a technique that can improve data access performance and availability. In the situation of sufficient cache space one may think of keeping all the data items in the cache. However, this has overhead in terms of multiple copies of same data distributed all over the network and there ...
Naveen Chauhan +2 more
openaire +2 more sources
A New Cache Replacement Algorithm in SMO
2002In the methods for training Support Vector Machines (SVM), precomputed elements in the Hessian matrix are usually cached in order to avoid recomputation. However, the least-recent-used replacement algorithm that is widely used is not suitable since the elements are requested in an irregular way.
Jianmin Li 0001 +2 more
openaire +1 more source
On optimal replacement of nonuniform cache objects
IEEE Transactions on Computers, 2000This paper studies a generalized version of the well-known page replacement problem. It assumes that page sizes and page fault penalties are nonuniform. This problem arises in distributed information systems, in particular the World Wide Web. It is shown that finding an optimal solution of this problem is an NP-complete problem.
openaire +1 more source
Replacement algorithms for object caching
Proceedings of the 1998 ACM symposium on Applied Computing, 1998openaire +1 more source
Hormone-Replacement Therapy and the Risk of Breast Cancer
Ca-A Cancer Journal for Clinicians, 1990Barbara S Hulka
exaly

