Filters








156,516 Hits in 4.5 sec

How to evaluate page replacement algorithms

Richard Y. Kain
1975 Proceedings of the fifth symposium on Operating systems principles - SOSP '75  
of paging algorithms.  ...  We show how to combine the averages, how to use the measure to determine the size of primary memory while achieving system balance between memory and processor demands, and how to partially order the performance  ...  I wish to acknowledge helpful discussions with Arvind, D. Grit, and M. Riad in connection with our paging studies, and with E. Sadeh particularly in reference to the content of this paper. P. J.  ... 
doi:10.1145/800213.806515 dblp:conf/sosp/Kain75 fatcat:xvgsbazve5fjzbhslnzq3jdvam

ML-CLOCK: Efficient Page Cache Algorithm Based on Perceptron-Based Neural Network

Minseon Cho, Donghyun Kang
2021 Electronics  
In this paper, we propose a new page replacement algorithm, called ML-CLOCK, that embeds single-layer perceptron neural network algorithms to enable an intelligent eviction policy.  ...  For evaluation, we implemented a prototype of ML-CLOCK based on trace-driven simulation and compared it with the traditional four replacement algorithms and one flash-friendly algorithm.  ...  Unfortunately, most prior efforts have not focused on how to orchestrate ML technologies and I/O patterns in designing page replacement algorithms.  ... 
doi:10.3390/electronics10202503 fatcat:c4iyk4jyc5eo7pfdbutybzfdve

A framework for modeling buffer replacement strategies

Stephane Bressan, Chong Leng Goh, Beng Chin Ooi, Kian-Lee Tan
2000 Proceedings of the ninth international conference on Information and knowledge management - CIKM '00  
The framework allows the bu er manager to beeasily extended to provide support for and ne-tuning of di erent replacement policies. Our work is novel in t wo aspects.  ...  In this paper, we present a uniform framework for modeling bu er replacement policies.  ...  Acknowledgement We would like to thank Chee Yong Chan and Hongjun Lu for their contribution in conceptualizing the concept of extensible bu er management.  ... 
doi:10.1145/354756.354792 dblp:conf/cikm/BressanGOT00 fatcat:v3yfjvp4a5bapk65x6acnsamma

Content Distribution for Publish/Subscribe Services [chapter]

Mao Chen, Andrea LaPaugh, Jaswinder Pal Singh
2003 Lecture Notes in Computer Science  
To our knowledge, this work is the first effort to investigate content distribution under the publish/subscribe paradigm.  ...  To study the performance of the proposed approaches, we built a simulator and developed a workload to mimic the content and access dynamics of a busy news site.  ...  An alternative is to use independent replacement algorithms as well as evaluation functions at push-time and access-time.  ... 
doi:10.1007/3-540-44892-6_5 fatcat:oszv23kf4jhcpmuojhls2nba4q

Managing distributed collections

Zubin Dalal, Suvendu Dash, Pratik Dave, Luis Francisco-Revilla, Richard Furuta, Unmil Karadkar, Frank Shipman
2004 Proceedings of the 2004 joint ACM/IEEE conference on Digital libraries - JCDL '04  
We now extend this work with algorithms for evaluating drastic changes to page content based on context.  ...  Additionally, we expand on previous work to locate moved pages and apply the modified approach to suggesting page replacements when the original page cannot be found.  ...  We used two algorithms to evaluate the replacement of a page in a collection. The first measure is the angle between the original page's term vector and that of its replacement.  ... 
doi:10.1145/996350.996387 dblp:conf/jcdl/DalalDDFFKS04 fatcat:umhrov5cvzhfnbq2q53abjz57e

Enhanced Proxy Caching with Content Management

Kai Cheng, Yahiko Kambayashi
2002 Knowledge and Information Systems  
To verify the proposed approach, we have designed a content-aware replacement algorithm, LRU-SP+. We evaluate the algorithm through preliminary experiments.  ...  By defining priority on each abstraction level, the cache manager can make replacement decisions on topics, logical pages, and physical pages hierarchically.  ...  We would also like to thank Mukesh Mohania for his helpful advice and productive discussion during his visit to our laboratory.  ... 
doi:10.1007/s101150200004 fatcat:6dkdpqmydrh2daxlne4c3nmvia

A Novel Page Replacement Algorithm for the Hybrid Memory Architecture Involving PCM and DRAM [chapter]

Kaimeng Chen, Peiquan Jin, Lihua Yue
2014 Lecture Notes in Computer Science  
Therefore, we have to design a new page replacement algorithm that can not only maintain a high hit ratio as traditional algorithms do but also can avoid frequent writes to PCM.  ...  An important issue in such hybrid memory architectures is how to manage the pages resisting in heterogeneous memories.  ...  Hit ratio is the key metric to evaluate the performance. LRU (Least Recently Used) is a conventional page replacement algorithm that has been widely used.  ... 
doi:10.1007/978-3-662-44917-2_10 fatcat:63qxhjvlnnb25pjcgymsgyzydm

Design and Development of a Web-based Interactive Software Tool for Teaching Operating Systems

Aristogiannis Garmpis
2011 Journal of Information Technology Education  
An optimal algorithm is useful for evaluating page replacement algorithms; it is of no use in practical systems as the OS cannot look into the future to know how long it will take to reference every page  ...  Equipped with a dynamic user interface for page table visualization, it allows the student to experiment and helps them understand how page tables operate and which pages page replacement algorithms evict  ...  mechanism of page replacement algorithms in operating systems, the software friendliness and usability, the intentions of continuous use, and also the subjective judgments for the knowledge acquisition  ... 
doi:10.28945/1357 fatcat:gdmhnwogv5e3rowmpdqdeddflu

On using cache conscious clustering for improving OODBMS performance

Zhen He, Richard Lai, Alonso Marquez
2006 Information and Software Technology  
Clustering is the placement of objects accessed near to each other in time into the same page. Buffer replacement involves the selection of a page to be evicted, when the buffer is full.  ...  We have tested C3-GP against three well known clustering algorithms. The results show that C3-GP out performs them by up to 40% when using popular buffer replacement algorithms such as LRU and CLOCK.  ...  In addition we would like to thank John Zigman and Stephen Blackburn for their helpful comments and suggestions.  ... 
doi:10.1016/j.infsof.2006.01.006 fatcat:e2wy42lqzra4bgvfliz5jnpp7y

A Comparison of Cache Replacement Algorithms for Video Services

Areej M. Osman, Niemah I. Osman
2018 International Journal of Computer Science & Information Technology (IJCSIT)  
We use simulations to evaluate and compare these algorithms using video popularities that follow a Zipf distribution. We consider different cache sizes and video request rates.  ...  Therefore, the best cache replacement algorithm is the algorithm which dynamically selects a suitable subset of videos for caching, and maximizes the cache hit ratio by attempting to cache the videos which  ...  The model is run using different cache sizes to evaluate how each algorithm performs having a small cache size and under large cache sizes.  ... 
doi:10.5121/ijcsit.2018.10208 fatcat:jjqpz53cnjewzpubprsopkc7ai

What is a good buffer cache replacement scheme for mobile flash storage?

Hyojun Kim, Moonkyung Ryu, Umakishore Ramachandran
2012 Performance Evaluation Review  
To answer this question, we first expose the limitations of current buffer cache performance evaluation methods, and propose a novel evaluation framework that is a hybrid between trace-driven simulation  ...  Using our evaluation framework, we show the superior performance of SpatialClock relative to the state-of-the-art for mobile flash storage.  ...  Main Idea The key question is how to design a new page replacement scheme to achieve the two different objectives simultaneously: high cache hit-ratio and sequentially ordered write requests.  ... 
doi:10.1145/2318857.2254786 fatcat:db5bup3btnfzfnp7tgtlg5u3bq

The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System

Marco T. Morazan, Douglas R. Troeger, Myles Nash
2018 CLEI Electronic Journal  
Our empirical results suggest that LRU is superior to FIFO as a page replacement policy for MT stack pages.  ...  We outline the paging algorithm and present an argument of partial cor- rectness.  ...  The data on stack fault rates refers to how pages are swapped between the evaluator and the stack network.  ... 
doi:10.19153/cleiej.5.1.2 fatcat:ecq2q5kmjzgz3nl6tqdvzbia4u

GD-GhOST

Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chrysanthis, Dan Li
2004 Proceedings of the 2004 ACM symposium on Applied computing - SAC '04  
Many caching algorithms have been proposed in the literature, most attempting to optimize for one criteria or another, and recent efforts have explored the automation and self-tuning of caching algorithms  ...  in response to observed workloads.  ...  ACKNOWLEDGMENTS We would like to thank our colleagues at the University of Pittsburgh: Milos Hauskrecht for valuable discussions, and Huiming Qu for early contributions to this work.  ... 
doi:10.1145/967900.968131 dblp:conf/sac/SanthanakrishnanACL04 fatcat:o53yyjvw2vaftk5x6s42st3xx4

Increasing PCM main memory lifetime

Alexandre P Ferreira, Miao Zhou, Santiago Bock, Bruce Childers, Rami Melhem, Daniel Mosse
2010 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)  
A failure detection algorithm is also incorporated to improve the reliability of PCM. With these approaches, the lifetime of a PCM main memory is increased from just a few days to over 8 years.  ...  with a novel PCM-aware swap algorithm for wearleveling.  ...  We compare this algorithm to a global counter (GC) with LFW and random replacement selection algorithms.  ... 
doi:10.1109/date.2010.5456923 dblp:conf/date/FerreiraZBCMM10 fatcat:ypfk4gmgu5hvzcleljhn57zujy

Page replacement algorithm using swap-in history for remote memory paging

Kazuhiro Saito, Hiroko Midorikawa, Munenori Kai
2009 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing  
For more efficient swap-out page selection, we propose a new page replacement algorithm which pays attention to swap-in history.  ...  In this paper, we describe the design of the new page replacement algorithm and evaluate performances in several applications, including NPB and HimenoBmk. 533 978-1-4244-4561-5/09/$25.00  ...  Performance Evaluation We evaluate the performance of the new page replacement algorithm proposed in this paper in some applications. The experiments are done in two environments.  ... 
doi:10.1109/pacrim.2009.5291315 fatcat:omshwstauvavfciyfy4iu4d2zi
« Previous Showing results 1 — 15 out of 156,516 results