Results 211 to 220 of about 87,332 (240)

Competitive Algorithms for Restricted Caching and Matroid Caching

2014
We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O( min {d,logr} ·logc)-competitive algorithm for the matroid caching problem,
Niv Buchbinder, Shahar Chen, Joseph Naor
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

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

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.
J. Jeong, M. Dubois
openaire   +1 more source

Caching algorithms for similarity search

2009
Similarity search in metric spaces is a general paradigm that can be used in several application fields. One of them is content-based image retrieval systems. In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must be efficient and scalable.
Lucchese C, Falchi F, Perego R, Rabitti F, Orlando S   +4 more
openaire   +3 more sources

CACHE (Critical Assessment of Computational Hit-finding Experiments): A public–private partnership benchmarking initiative to enable the development of computational methods for hit-finding

Nature Reviews Chemistry, 2022
Suzanne Ackloo, Rommie E Amaro, Cheryl H Arrowsmith   +2 more
exaly  

A Survey on Applications of Cache-Aided NOMA

IEEE Communications Surveys and Tutorials, 2023
Dipen Bepari, Soumen Mondal, Aniruddha Chandra   +2 more
exaly  

An efficient cache replacement algorithm for multimedia object caching

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, Zhang, W, Nanya, T, Chin, F, Li, K   +4 more
openaire   +1 more source

A lazy cache algorithm

Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, 1989
Y. Afek, G. Brown, M. Merritt
openaire   +1 more source

Performance Improvement of DAG-Aware Task Scheduling Algorithms with Efficient Cache Management in Spark

Electronics (Switzerland), 2021
Jian Dong, Hongwei Liu
exaly