Filters








2,570 Hits in 3.0 sec

On adaptive replacement based on LRU with working area restriction algorithm

Edson T. Midorikawa, Ricardo L. Piantola, Hugo H. Cassettari
2008 ACM SIGOPS Operating Systems Review  
Simulations include an analysis of the performance sensibility with the variation of the control parameters and its application in a multiprogrammed environment.  ...  Recently, we have proposed LRU-WAR, an adaptive replacement algorithm whose objective is to minimize failures detected in LRU policy, preserving its simplicity and low overhead.  ...  ACKNOWLEDGMENTS We would like to thank the anonymous referees of our previous papers for their comments and suggestions.  ... 
doi:10.1145/1453775.1453790 fatcat:ku6zsgc3vncczok7evg22qzh3y

Pro-active Page Replacement for Scientific Applications: A Characterization

M. Vilayannur, A. Sivasubramaniam, M. Kandemir
2005 IEEE International Symposium on Performance Analysis of Systems and Software, 2005. ISPASS 2005.  
Paging policies implemented by today's operating systems cause scientific applications to exhibit poor performance, when the application's working set does not fit in main memory.  ...  hints etc) of an application that can be exploited by the operating system to make intelligent prefetching and replacement decisions.  ...  In a more recent work [JZ02] , the authors propose an efficient buffer cache replacement policy called LIRS (Low Interference Recency Set) that uses recency to evaluate Inter-Reference Recency for making  ... 
doi:10.1109/ispass.2005.1430579 dblp:conf/ispass/VilayannurSK05 fatcat:qucjgf4p75f5dgtqvyqinavpxe

An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms

Pooja Khulbe, Sanjay Kumar, Nidhi Yadav
2014 International Journal of Computer Applications  
Our major attempt in this paper is to extend our previous work HLRU and to compare characteristics of some former methods with HLRU.  ...  H-LRU [1] with other existing algorithms and prove that it has a better performance in average than former methods.  ...  In the other word, a page with most STR values with minimum TNR value will be selected for eviction. Hybrid LRU: Hybrid LRU also referred as HLRU is also an extension of LRU.  ... 
doi:10.5120/17469-8415 fatcat:tgzoswmmjzb65kpg6ebew5asqa

Cache Friendliness-Aware Managementof Shared Last-Level Caches for HighPerformance Multi-Core Systems

Dimitris Kaseridis, Muhammad Faisal Iqbal, Lizy Kurian John
2014 IEEE transactions on computers  
In this work we describe a quasi-partitioning scheme for last-level caches that combines the memory-level parallelism, cache friendliness and interference sensitivity of competing applications, to efficiently  ...  Applications with small temporal locality and high cache space demand rate that tend to occupy a big portion of the cache, evicting useful cache lines that belong to other applications.  ...  . 2) Cache Friendly Applications: These applications can efficiently share the cache capacity using an LRU-like replacement policy and can in general benefitted by additional cache space ( Fig. 1(b) )  ... 
doi:10.1109/tc.2013.18 fatcat:lyqd5vduzzcdln6k7mfzbbi3yi

The page fault frequency replacement algorithm

Wesley W. Chu, Holger Opderbeck
1972 Proceedings of the December 5-7, 1972, fall joint computer conference, part I on - AFIPS '72 (Fall, part I)  
Next we describe the PFF Algorithm and compare its performance with the LRU and Working Set Replacement Algorithms.  ...  Using an LRU Algorithm, pages are always replaced when a page fault occurs. This does not apply to the Working Set Algorithm.  ... 
doi:10.1145/1479992.1480077 dblp:conf/afips/ChuO72 fatcat:esftfovl7rbwpjfsjka4bxqcze

Flash-aware Virtual Memory System for Consumer Electronics

Xiaobo Ji, Fan Zeng
2015 International Journal of Multimedia and Ubiquitous Engineering  
In this paper, an efficient flash-aware virtual memory system called FVMS is proposed for consumer electronics equipped with flash memory as secondary storage media.  ...  asymmetric I/O operation costs to reduce the number of flash page write operations and prevent serious degradation of page hit ratio, and 3) an efficient garbage collection policy taking into consideration  ...  Acknowledgements This work is supported by Natural Science Foundation Project of CQ CSTC under Grant No. cstc2013jcyjA40059.  ... 
doi:10.14257/ijmue.2015.10.8.32 fatcat:a2oehhmdkjaljf26ww42lkkrhq

An Adaptive Data Management Policy For Heterogeneous Mobile Databases

2020 International Journal of Emerging Trends in Engineering Research  
Existing policies consist of Message Digest algorithms used along with cache replacement algorithms.  ...  It is an ever growing field and very much in demand, thus proving to be an excellent area to carry out research. With a large amount of data, management of such data is the key issue.  ...  The proposed data management policy performs better than both LRU and FIFO. It works well especially with large amount of data, due to its efficient management.  ... 
doi:10.30534/ijeter/2020/166892020 fatcat:adgya6rvqfa4vdx2t4jmwk2uw4

LRU-PEA: A smart replacement policy for non-uniform cache architectures on chip multiprocessors

Javier Lira, Carlos Molina, Antonio Gonzalez
2009 2009 IEEE International Conference on Computer Design  
We call this technique LRU-PEA (Least Recently Used with a Priority Eviction Approach).  ...  Moreover, an adaptive replacement policy that efficiently reduces misses in the last-level cache could boost performance, particularly if set associativity is adopted.  ...  In particular, the LRU-PEA significantly reduce energy consumption in PARSEC applications with large working sets, such as canneal, freqmine and streamcluster.  ... 
doi:10.1109/iccd.2009.5413142 dblp:conf/iccd/LiraMG09 fatcat:3vgjtp5obja5fn2h6zaoykubqi

IMPLEMENTATION OF LRU ALGORITHM FOR LOCATION UPDATE IN WIRELESS M2M COMMUNICATION

Samruddhi C. Thawkar .
2014 International Journal of Research in Engineering and Technology  
Least Recent Used (LRU) algorithm is implemented for optimally pruning the nodes from the network for efficient location update which is considered as the best paging algorithm.  ...  This paper presents different paging algorithms that are studied on the basis of certain parameters such as endto-end delay, compression rate, data transmission energy and call-mobility-ratio.  ...  The work is still under construction. The results will be presented in the future. The research work in this paper was supported by G. H. Raisoni College of engineering, Nagpur.  ... 
doi:10.15623/ijret.2014.0304020 fatcat:s4up5w22cncnzahhjqnkpxgfma

Author retrospective for analytical cache models with applications to cache partitioning

G. Edward Suh, George Kurian, Srinivas Devadas, Larry Rudolph
2014 25th Anniversary International Conference on Supercomputing Anniversary Volume -  
We summarize the history of the work, revisit primary observations and lessons that we learned from the modeling effort, and also briefly describe follow-up work to show how the research direction evolved  ...  The number of sampled sets is chosen to obtain good accuracy with negligible hardware overhead. The work also uses a lookahead algorithm to avoid local minima when searching for the best allocation.  ...  an application.  ... 
doi:10.1145/2591635.2591662 dblp:conf/ics/SuhKDR14 fatcat:h3mvnn4xgzc3fbfmg3wy4pe7iq

Making LRU Friendly to Weak Locality Workloads: A Novel Replacement Algorithm to Improve Buffer Cache Performance

Song Jiang, Xiaodong Zhang
2005 IEEE transactions on computers  
Motivated by the limitations of existing algorithms, we propose a general and efficient replacement algorithm, called Low Inter-reference Recency Set (LIRS).  ...  Conducting simulations with a variety of traces of different access patterns and with a wide range of cache sizes, we show that LIRS significantly outperforms LRU and outperforms other existing replacement  ...  Yannis Smaragdakis at the Georgia Institute of Technology, who provided them with the latest version of their EELRU simulator and traces. The preliminary results of this work were presented in [11] .  ... 
doi:10.1109/tc.2005.130 fatcat:xoj6breqknfsxf6qovk7ar3fzm

DSCA

Antonio A. Rocha, Mostafa Dehghan, Theodoros Salonidis, Ting He, Don Towsley
2016 Proceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks - CCDWN '16  
In this paper, we propose a novel caching policy called Data Stream Caching Algorithm (DSCA) with the goal of maximizing cache hit rate of CCN routers by incorporating content popularity in caching decisions  ...  Evaluations on synthetic data and real-world traces show that DSCA outperforms LRU and other caching policies evaluated in this work.  ...  Acknowledgment This work was supported in part by CNPq and FAPERJ, the U.S. Army Research Laboratory and the U.K.  ... 
doi:10.1145/2836183.2836191 dblp:conf/conext/RochaDSHT15 fatcat:s2jgytotc5bq5eibj3a3mp3jea

LIRS

Song Jiang, Xiaodong Zhang
2002 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '02  
Motivated by the limits of previous studies, we propose an efficient buffer cache replacement policy, called Low Interreference Recency Set (LIRS).  ...  Conducting simulations with a variety of traces and a wide range of cache sizes, we show that LIRS significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases.  ...  Working Set Models Lastly, we would like to compare our work with the working set model, an early work by Denning [6] . A working set of a program is a set of its recently used pages.  ... 
doi:10.1145/511334.511340 dblp:conf/sigmetrics/JiangZ02 fatcat:5jz7boohinazxglpr5vqtog3u4

LIRS

Song Jiang, Xiaodong Zhang
2002 Performance Evaluation Review  
Motivated by the limits of previous studies, we propose an efficient buffer cache replacement policy, called Low Interreference Recency Set (LIRS).  ...  Conducting simulations with a variety of traces and a wide range of cache sizes, we show that LIRS significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases.  ...  Working Set Models Lastly, we would like to compare our work with the working set model, an early work by Denning [6] . A working set of a program is a set of its recently used pages.  ... 
doi:10.1145/511399.511340 fatcat:zfatpnxburcwnihmm26gx3xczm

LIRS

Song Jiang, Xiaodong Zhang
2002 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '02  
Motivated by the limits of previous studies, we propose an efficient buffer cache replacement policy, called Low Interreference Recency Set (LIRS).  ...  Conducting simulations with a variety of traces and a wide range of cache sizes, we show that LIRS significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases.  ...  Working Set Models Lastly, we would like to compare our work with the working set model, an early work by Denning [6] . A working set of a program is a set of its recently used pages.  ... 
doi:10.1145/511339.511340 fatcat:re6f7ove7ncnjmdopwigs4aa34
« Previous Showing results 1 — 15 out of 2,570 results