FIFO anomaly is unbounded

Details FIFO anomaly is unbounded FIFO anomaly is unbounded

2010-03-05

arxiv.org/abs/1003.1336v2

Acta Univ. Sapientiae, Informatica, 2,1 (2010) 80-89

Computer Science

Operating Systems

Scientific paper

Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson and Shedler constructed reference strings for which page replacement algorithm FIFO produces near twice more page faults in a larger memory than in a smaller one. They formulated the conjecture that 2 is a general bound. We prove that this ratio can be arbitrarily large.

Affiliated with

Also associated with

No associations

Rating

FIFO anomaly is unbounded does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with FIFO anomaly is unbounded, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FIFO anomaly is unbounded will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269418