Results 231 to 240 of about 41,858 (279)

Accelerating k -mer-based sequence filtering

Martayan I, Vandamme L, Constantinides B, Cazaux B, Paperman C, Limasset A.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Web caching through modified cache replacement algorithm

2012 International Conference on Recent Trends in Information Technology, 2012
Web caching is a mechanism used to improve network performance by reducing network traffic, load on the Web Server and delay in accessing the Web page. This is achieved by storing frequently accessed Web pages on proxy cache placed within the network. Caching can be taken place either at client side or in the proxy Server.
V. Sathiyamoorthi, V. Murali Bhaskaran
openaire   +1 more source

The Cache Replacement Problem for Multimedia Object Caching

2005 First International Conference on Semantics, Knowledge and Grid, 2005
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.
Wenyu Qu, Keqiu Li, Hong Shen, Yingwei Jin, Takashi Nanya   +4 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.
J. Alghazo, A. Akaaboune, N. Botros
openaire   +1 more source

Cache Replacement Algorithms for YouTube

2014 IEEE 28th International Conference on Advanced Information Networking and Applications, 2014
In recent years, many social network systems like, YouTube, Facebook, Twitter, etc. have been a part of our everyday life. Among these systems, YouTube which plays video programs of different interesting themes for users has been one of the most attractive ones.
Ming-Chang Lee, Fang-Yie Leu, Ying-Ping Chen   +2 more
openaire   +1 more source

Effective cache replacement policy for packet processing cache

International Journal of Communication Systems, 2020
SummaryOwing to the explosive increase in Internet traffic, increasing the throughput and energy efficiency of core routers is an important issue for future internet. Accessing the ternary content addressable memory (TCAM) in a core router can significantly degrade its throughput and energy efficiency owing to its low operating frequency and power ...
openaire   +1 more source

OA-Cache: Oracle Approximation-Based Cache Replacement at the Network Edge

IEEE Transactions on Network and Service Management, 2023
This is the author accepted manuscript. The final version is available is available from IEEE via the DOI in this record ; With the explosive increase in mobile data traffic generated by various application services like video-on-demand and stringent quality of experience requirements of users, mobile edge caching is a promising paradigm to reduce ...
Shuting Qiu, Qilin Fan, Xiuhua Li, Xu Zhang, Geyong Min, Yongqiang Lyu   +5 more
openaire   +2 more sources

Counter-based cache replacement algorithms

2005 International Conference on Computer Design, 2006
Recent 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,
M. Kharbutli, Y. Solihin
openaire   +1 more source

Cache replacement with dynamic exclusion

Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92, 1992
Most recent cache designs use direct-mapped caches to provide the fast access time required by modern high speed CPU's. Unfortunately, direct-mapped caches have higher miss rates than set-associative caches, largely because direct-mapped caches are more sensitive to conflicts between items needed frequently in the same phase of program execution.
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, Srihari Makineni, Don Newell   +2 more
openaire   +1 more source