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 ?
These operations include deciding which old flow entry to delete according to certain flow table replacement algorithm and flow entry deletion.
Haboush, Mohanty, Pattanayak and Al-Tarazi (2014) [8] have proposed a faulty node replacement algorithm for hybrid WSN.
In order to maintain the buffered data packets, the Least Recently Used (LRU) or Least Frequently Used (LFU) replacement algorithm is usually used.
Reference (Song & Xiaodong 2002) also proposed another form of a replacement algorithm called Low Inter reference Recency Set (LIRS).
However, hardware implementation of the random replacement algorithm is more complex compared with that of the pseudo-random algorithm.
LRU-WSR [24] is much like the second-chance replacement algorithm in which the flush-out to flash memory is performed by checking the cold-flag.
When page load fails, the operating system will replace some new needed pages from disk to the memory based on page replacement algorithm and update the page table.
The idea of a meta-algorithm can also refer to high-level strategies for a specific problem such as hierarchical web caching [11]: this paper experiments with challenging the high-level implicit strategy used in hierarchical caching that "a hit for a document at an l-level cache leads to the caching of the document in all intermediate caches (levels l - 1,..., 1) on the path towards the leaf cache that received the initial request" These alternative strategies for being more selective in choosing the caches that store a local copy of the requested document are considered to be meta-algorithms because they operate independently of the actual replacement algorithm running in each individual cache.
In this section, a simple example is firstly carried out to verify the performance of the proposed column replacement algorithm for a partially deterministic sensing matrix.
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.