Results 141 to 150 of about 41,981 (173)
Some of the next articles are maybe not open access.

Cooperative Cache Replacement Policy for MANETs

International Journal of Advanced Pervasive and Ubiquitous Computing, 2014
Mobile 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., 2004
In 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

An efficient cache replacement algorithm for multimedia object caching.

Comput. Syst. Sci. Eng., 2012
Multimedia 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   +1 more source

Advanced Replacement Policies for WWW Caching

2000
WWW caching necessitates advanced replacement policies that include sophisticated control logic and efficient contents management. This paper presents a constructive approach for the design and analysis of such advanced policies. Based on this approach, we develop a new caching policy, namely, PSS-W.
Kai Cheng, Yahiko Kambayashi
openaire   +1 more source

Replacement strategies for XQuery caching systems

Data & Knowledge Engineering, 2004
To improve the query performance over XML documents in a distributed environment, we develop a semantic caching system named ACE-XQ for XQuery queries. ACE-XQ applies innovative query containment and rewriting techniques to answer user queries using cached queries.
Li Chen 0016   +2 more
openaire   +1 more source

An overview of web caching replacement algorithms

IEEE Communications Surveys & Tutorials, 2004
The increasing demand for World Wide Web (WWW) services has made document caching a necessity to decrease download times and reduce Internet traffic. To make effective use of caching, an informative decision has to be made as to which documents are to be evicted from the cache in case of cache saturation.
Abdullah Balamash, Marwan Krunz
openaire   +1 more source

Cache Replacement in Mobile Adhoc Networks

International Journal of Distributed Systems and Technologies, 2012
Caching 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   +1 more source

Re-examining cache replacement policies

2008 IEEE International Conference on Computer Design, 2008
The replacement policies commonly used in modern processors perform an average of 57% worse than an optimal replacement policy for commercial applications using large, shared caches in a chip-multiprocessor (CMP). Recent proposals that improve the performance of smaller, uniprocessor caches with SPEC CPU workloads do not achieve similar benefits with ...
Jason Zebchuk   +2 more
openaire   +1 more source

Cost-sensitive cache replacement algorithms

The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings., 2003
Cache replacement algorithms originally developed in the context of simple uniprocessor systems aim to reduce the miss count. However, in modern systems, cache misses have different costs. The cost may be latency, penalty, power consumption, bandwidth consumption, or any other ad-hoc numerical property attached to a miss.
Jaeheon Jeong, Michel Dubois 0001
openaire   +1 more source

A survey of Web cache replacement strategies

ACM Computing Surveys, 2003
Web caching is an important technique to scale the Internet. One important performance factor of Web caches is the replacement strategy. Due to specific characteristics of the World Wide Web, there exist a huge number of proposals for cache replacement.
Stefan Podlipnig   +1 more
exaly   +2 more sources

Home - About - Disclaimer - Privacy