Results 271 to 280 of about 88,406 (306)

Algorithms for Cache Placement

2011
The results of the preceding chapter show that the SCPP is very difficult to solve, even if only approximate solutions are required. We describe some approximation algorithms that can be used to give solutions to the problem, and decrease the gap between known solutions and nonapproximation results.
Carlos A. S. Oliveira, Panos M. Pardalos
openaire   +1 more source

A novel cooperative caching algorithm for massive P2P caches

Peer-to-Peer Networking and Applications, 2013
For an ISP (Internet Service Provider) that has deployed P2P caches in more than one ASs (autonomous systems), cooperative caching which makes their caches cooperate with each other can save more cost of carrying P2P traffic than independent caching.
Yan Zhang, Xu Zhou, Yinlong Liu, Bo Wang, Song Ci   +4 more
openaire   +1 more source

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-oblivious Algorithms

2012
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of the memory hierarchy of current computers. We study several graph algorithms and techniques of their design in this model. We consider graph searching, identifying connected components and computing maximal matching.
openaire   +2 more sources

Noisy intermediate-scale quantum algorithms

Reviews of Modern Physics, 2022
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw   +2 more
exaly  

Variational quantum algorithms

Nature Reviews Physics, 2021
Marco Cerezo, Andrew Arrasmith, Ryan Babbush   +2 more
exaly