replacement algorithm

replacement algorithm

The method used to determine which entry in an associative cache to flush to main memory when it is desired to cache a new block of data. The "least recently used" algorithm flushed the block which has not been accessed for the longest time. A random replacement algorithm picks any block with equal probability.
References in periodicals archive ?
In order to maintain the buffered data packets, the Least Recently Used (LRU) or Least Frequently Used (LFU) replacement algorithm is usually used.
Based on this optimal solution, an efficient cache replacement algorithm for multimedia object caching was developed.
Chen, "Dual queues cache replacement algorithm based on sequentiality detection," in SCIENCE CHINA INFORMATION SCIENCES, Volume 55, Number 1, Research paper, 2011.
Some applications of web information systems described include a density mobility scheme for improving coverage in wireless sensor networks, a fuzzy logic based mobile intelligent system for evaluating and selecting hotels in tourism, a model for virtual tobacco growth, and a caching replacement algorithm for video-on-demand systems.
GMS uses a more tightly coordinated replacement algorithm than N-Chance.
1995], which in turn take their inspiration from an optimal off-line replacement algorithm that was studied for virtual memory [Belady 1966].
There is an analog to Belady's anomaly, which applies in this case, even when the replacement algorithm is a stack algorithm like LRU.
The OnCore development environment taps the full power of 405 by enabling designers to modify the TLB replacement algorithm to match application software requirements.
The section on page replacement algorithms presents adaptive replacement algorithm templates.
The replacement algorithm is usually Least-Recently-Used or its approximation: if a cache miss occurs, the block whose last reference was earliest among all cached blocks is replaced.
Although researchers are concerned about overlay network technologies and massively distributed systems and applications in general, they keep the users and their needs in mind as they cover resiliency (transaction rate limiters, incentives against hidden action, protection from poisons, robust identity systems), adaptive systems (secure access in mobile P2P systems, range caching, summarization), storage (erasure codes, file replacement algorithm, flexible routing), cooperative systems (secure software delivery, bandwidth conservation, safe mediator-free environments), search and retrieval (faster access, a community-based search engine), applications (vertical handover support, security for games and numerical computation), streaming, file sharing and topology.