Editing Cache replacement policies (section)

==== {{anchor|Multi queue (MQ)}}Multi-queue ====
The multi-queue replacement (MQ) algorithm was developed to improve the performance of a second-level buffer cache, such as a server buffer cache, and was introduced in a paper by Zhou, Philbin, and Li.<ref name="zhou">[[Yuanyuan Zhou]], James Philbin, and Kai Li. [http://static.usenix.org/event/usenix01/zhou.html The Multi-Queue Replacement Algorithm for Second Level Buffer Caches.] USENIX, 2002.</ref> The MQ cache contains an ''m'' number of LRU queues: Q<sub>0</sub>, Q<sub>1</sub>, ..., Q<sub>''m''-1</sub>. The value of ''m'' represents a hierarchy based on the lifetime of all blocks in that queue.<ref>Eduardo Pinheiro, Ricardo Bianchini, Energy conservation techniques for disk array-based servers, Proceedings of the 18th annual international conference on Supercomputing, June 26-July 01, 2004, Malo, France</ref>

[[File:MultiQueueReplacementAlgortithm.jpg|center|alt=Diagram of the multi-queue replacement algorithm]]