Editing Page replacement algorithm (section)

===Random===
Random replacement algorithm replaces a random page in memory. This eliminates the overhead cost of tracking page references. Usually it fares better than FIFO, and for looping memory references it is better than LRU, although generally LRU performs better in practice. [[OS/390]] uses global LRU approximation and falls back to random replacement when LRU performance degenerates, and the [[Intel i860]] processor used a random replacement policy (Rhodehamel 1989<ref>{{cite conference |title=The Bus Interface and Paging Units of the i860 Microprocessor |first=Michael W. |last=Rhodehamel |date=2-4 October 1989 |conference=1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors |conference-url=https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=257 |publisher=IEEE |location=Cambridge, MA, USA |pages=380–384 |isbn=0-8186-1971-6 |doi=10.1109/ICCD.1989.63392 |language=en |id=INSPEC Accession Number 3719504}}</ref>).