Filters








2,039 Hits in 3.3 sec

More on weighted servers or FIFO is better than LRU

Leah Epstein, Csanád Imreh, Rob van Stee
2003 Theoretical Computer Science  
For ratios below 2.2, we present a best possible algorithm which is trackless.  ...  We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio.  ...  We also analyze a modiÿed version of the other well-known paging algorithm LRU, and we obtain that in the weighted case FIFO is better than LRU, which has the competitive ratio 1 + x.  ... 
doi:10.1016/s0304-3975(03)00287-1 fatcat:z2w2jxo25bb6tezsbfyjjrfgge

LRU is better than FIFO under the independent reference model

J. van den Berg, A. Gandolfi
1992 Journal of Applied Probability  
Using the FKG inequality, we prove that the miss ratio for LRU is smaller than or equal to the miss ratio for FIFO.  ...  Consider a two-level storage system operating with the least recently used (LRU) or the first-in, first-out (FIFO) replacement strategy.  ...  -··,x..)eA LRU is better than FIFO under the independent reference model 241 See also Aven et al. (1987) , Section 4.6, for a discussion of the above results. We prove the following theorem.  ... 
doi:10.1017/s0021900200106825 fatcat:ekqt7qdxxjbonl3tzwb7b7oxqa

More on Weighted Servers or Fifo is Better than Lru [chapter]

Leah Epstein, Csanád Imreh, Rob van Stee
2002 Lecture Notes in Computer Science  
For ratios below 2.2, we present a best possible algorithm which is trackless.  ...  We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio.  ...  We also analyze a modiÿed version of the other well-known paging algorithm LRU, and we obtain that in the weighted case FIFO is better than LRU, which has the competitive ratio 1 + x.  ... 
doi:10.1007/3-540-45687-2_21 fatcat:62owgbqb4vd3rn7qrjt56xgff4

Proficient Pair of Replacement Algorithms on L1 and L2 Cache for Merge Sort [article]

Richa Gupta, Sanjiv Tokekar
2010 arXiv   pre-print
Simulation on L1 shows, among the considered existing replacement algorithms FIFO is performing better than others.  ...  While the proposed replacement algorithm PBR_L1 is working about 1.7% to 44 % better than FIFO for various cache sizes.  ...  In CASE I the comparison is donr for the pairs LRU-LRU; LRU-LFU; LRU-FIFO. With the help of Fig. 3 , it can be realized that the pair LRU-FIFO is giving better results than the other two pairs.  ... 
arXiv:1003.4088v1 fatcat:2rswvanygvfgrg6xhsg2hh27im

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

Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 arXiv   pre-print
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.  ...  Important results in understanding why LRU is often observed to perform better than FIFO in practice were obtained in [6, 9] , showing that on some access graphs, LRU is strictly better than FIFO, and  ... 
arXiv:1204.4047v2 fatcat:24l7mfu3hfhhdhk4te4c5rc26e

It's Time to Revisit LRU vs. FIFO

Ohad Eytan, Danny Harnik, Effi Ofer, Roy Friedman, Ronen I. Kat
2020 USENIX Workshop on Hot Topics in Storage and File Systems  
Our main evaluation workload is a new set of traces that we collected from a large public cloud object storage service and on this new trace FIFO exhibits better overall cost than LRU.  ...  Several past works have considered this question and commonly stipulated that while FIFO is much easier to implement, the improved hit ratio of LRU outweighs this.  ...  As expected, LRU is often slightly better than FIFO in terms of pure hit rate, yet many times FIFO is similar or even better than LRU.  ... 
dblp:conf/hotstorage/EytanHOFK20 fatcat:zopng72b7bh7zk6a3ll3j4xdai

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

Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 Lecture Notes in Computer Science  
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.  ...  Important results in understanding why LRU is often observed to perform better than FIFO in practice were obtained in [6, 9] , showing that on some access graphs, LRU is strictly better than FIFO, and  ... 
doi:10.1007/978-3-642-31155-0_29 fatcat:pevelzhhejc3nnmk3gwfsid3am

ENHANCED PERFORMANCE OF CACHE MEMORY

Nishtha .
2018 International Journal of Advanced Research in Computer Science  
The focus of this paper is to understand the cache overall performance using the new strategy of cache replacement. We proposed a new strategy in which we use Hybrid LRU replacement policy.  ...  This proposed model is for hit rate and reducing miss rate.  ...  The efficiency of Least recently used (LRU) reasons either decrease or same number of interrupts .it is slightly better than FIFO replacement algorithm.  ... 
doi:10.26483/ijarcs.v9i3.5952 fatcat:yui4mpk5aneh5emu4h5242d36m

An approximate analysis of the LRU and FIFO buffer replacement schemes

Asit Dan, Don Towsley
1990 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90  
In the case of the FIFO policy, the solution algorithm is iterative and the computational complexity of each iteration is O(K).  ...  In the case of the analysis of the LRU policy, the computational complexity for estimating the buffer hit probability is O(KB) where B is the size of the buffer and K denotes the number of items having  ...  Both LRU and FIFO track the optimal allocation policy, and the performance of LRU is always better than FIFO.  ... 
doi:10.1145/98457.98525 dblp:conf/sigmetrics/DanT90 fatcat:fhn5nh2lnrahxddmau2voghvy4

Relative Interval Analysis of Paging Algorithms on Access Graphs [article]

Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 arXiv   pre-print
However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model.  ...  The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained.  ...  is strictly better than FIFO on paths and cycles.  ... 
arXiv:1305.0669v1 fatcat:pbbszwll6zfbtplb3mt5aiek2e

Relative Interval Analysis of Paging Algorithms on Access Graphs [chapter]

Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 Lecture Notes in Computer Science  
However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model.  ...  The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained.  ...  is strictly better than FIFO on paths and cycles.  ... 
doi:10.1007/978-3-642-40104-6_17 fatcat:y6lbarxl25bxfkzvfb62pirq5u

An approximate analysis of the LRU and FIFO buffer replacement schemes

Asit Dan, Don Towsley
1990 Performance Evaluation Review  
In the case of the FIFO policy, the solution algorithm is iterative and the computational complexity of each iteration is O(K).  ...  In the case of the analysis of the LRU policy, the computational complexity for estimating the buffer hit probability is O(KB) where B is the size of the buffer and K denotes the number of items having  ...  Both LRU and FIFO track the optimal allocation policy, and the performance of LRU is always better than FIFO.  ... 
doi:10.1145/98460.98525 fatcat:474g4dvvvfdalij5jmwfysuy4a

A Novel Longest Distance First Page Replacement Algorithm

Gyanendra Kumar, Parul Tomar
2017 Indian Journal of Science and Technology  
From the results, the average page fault of LDF is better than FIFO and LRU of taken data set.  ...  algorithms like FIFO, LRU.  ...  From the results it has been clearly shown that the performance of LDF is better than the FIFO and LRU and less than Optimal algorithm in terms of page faults.  ... 
doi:10.17485/ijst/2017/v10i19/115500 fatcat:oazesemnejhd3oxfk4p2fsatma

A Novel Longest Distance First Page Replacement Algorithm

Gyanendra Kumar, Parul Tomar
2017 Indian Journal of Science and Technology  
From the results, the average page fault of LDF is better than FIFO and LRU of taken data set.  ...  algorithms like FIFO, LRU.  ...  From the results it has been clearly shown that the performance of LDF is better than the FIFO and LRU and less than Optimal algorithm in terms of page faults.  ... 
doi:10.17485/ijst/2017/v10i30/115500 fatcat:btsq7qixt5hntlqsh4bbafadqe

Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite

Hussein Al-Zoubi, Aleksandar Milenkovic, Milena Milenkovic
2004 Proceedings of the 42nd annual Southeast regional conference on - ACM-SE 42  
In order to better understand the behavior of different policies, we introduced new measures, such as cumulative distribution of cache hits in the LRU stack.  ...  The cumulative distribution of cache hits in the LRU stack indicates a very good potential for way prediction using LRU information, since the percentage of hits to the bottom of the LRU stack is relatively  ...  PLRUt, and both are much better than LRU.  ... 
doi:10.1145/986537.986601 dblp:conf/ACMse/Al-ZoubiMM04 fatcat:yy3nxllshzao7hpvbcmlol6cua
« Previous Showing results 1 — 15 out of 2,039 results