Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis

Details Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis

2012-04-18

arxiv.org/abs/1204.4047v1

Computer Science

Data Structures and Algorithms

Scientific paper

Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families of graphs which grow with the length of the sequences.

Affiliated with

Also associated with

No associations

Rating

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis 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 Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411537