The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 2049 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
(IL-TLAV-SC; Tel Aviv)
Competitive analysis of the LRFU paging algorithm. (English summary)
Algorithmica 33 (2002), no. 4, 511-516. ...
Summary: “We present a competitive analysis of the LRFU pag- ing algorithm, a hybrid of the LRU (least recently used) and LFU (least frequently used) paging algorithms. ...
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
1999
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads we considered. ...
We also show that there is a spectrum of implementations of the LRFU that again subsumes the LRU and LFU implementations. ...
This work was supported in part by the Ministry of Education under the BK21 program and by the Ministry of Science and Technology under the National Research Laboratory program. ...
doi:10.1145/301464.301487
fatcat:h6h65aqca5bt5bi2oa7l4mhshi
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
1999
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads we considered. ...
We also show that there is a spectrum of implementations of the LRFU that again subsumes the LRU and LFU implementations. ...
This work was supported in part by the Ministry of Education under the BK21 program and by the Ministry of Science and Technology under the National Research Laboratory program. ...
doi:10.1145/301453.301487
dblp:conf/sigmetrics/LeeCKNMCK99
fatcat:xdyqikgiqjbcjnoaa6bsdi34p4
LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies
2001
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads we considered. ...
We also show that there is a spectrum of implementations of the LRFU that again subsumes the LRU and LFU implementations. ...
This work was supported in part by the Ministry of Education under the BK21 program and by the Ministry of Science and Technology under the National Research Laboratory program. ...
doi:10.1109/tc.2001.970573
fatcat:aqjyjw2x6zcwzjif6m5gn2lfz4
Forgetting Fragments from Evolving Ontologies
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In order to evaluate our approach, we situate it in a controlled simulation environment, RoboCup OWLRescue, which is an extension of the widely used RoboCup Rescue platform, which enables agents to build ...
Ontologies underpin the semantic web; they define the concepts and their relationships contained in a data source. ...
The number of concepts in each of the ontologies is given in Table 1 . The next section presents the results and our analysis of our evaluation. ...
doi:10.1007/978-3-642-17746-0_37
fatcat:n2mvabbgmjayxfogtz4bhlraea
The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms
2007
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
only narrow the performance gap but also change the relative performance benefits of different algorithms. ...
This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not ...
EELRU [34] detects looping references by examining aggregate recency distribution of referenced pages and changes the eviction point using a simple cost/benefit analysis. ...
doi:10.1109/tc.2007.1029
fatcat:5arypx7jmjfmvjzh6kw7vklaiy
The performance impact of kernel prefetching on buffer cache replacement algorithms
2005
Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
only narrow the performance gap but also change the relative performance benefits of different algorithms. ...
This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not ...
EELRU [34] detects looping references by examining aggregate recency distribution of referenced pages and changes the eviction point using a simple cost/benefit analysis. ...
doi:10.1145/1064212.1064231
dblp:conf/sigmetrics/ButtGH05
fatcat:frhrhx4qbvhnvfxw4i7xuw37ae
The performance impact of kernel prefetching on buffer cache replacement algorithms
2005
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
only narrow the performance gap but also change the relative performance benefits of different algorithms. ...
This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not ...
EELRU [34] detects looping references by examining aggregate recency distribution of referenced pages and changes the eviction point using a simple cost/benefit analysis. ...
doi:10.1145/1071690.1064231
fatcat:quyjxhqlcfadrjrbjcsfivsjaq
General adaptive replacement policies
2004
Proceedings of the 4th international symposium on Memory management - ISMM '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The resulting policy often performs better than all of the policies it adapts over, as well as two other hand-tuned adaptive policies from the recent literature. ...
Specifically, we show how to combine any two existing replacement policies so that the resulting policy provably can never perform worse than either of the original policies by more than a small factor ...
Such results created the area of competitive analysis of algorithms. ...
doi:10.1145/1029873.1029887
dblp:conf/iwmm/Smaragdakis04
fatcat:7d47pmiky5eslcfl2khnptoffm
Page 4615 of Mathematical Reviews Vol. , Issue 2003f
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Goodrich and Vijay Kumar [Vijay Kumar*], Seller-focused al- gorithms for online auctioning (135-147); Edith Cohen, Haim Kaplan and Uri Zwick, Competitive analysis of the LRFU paging algorithm (148-154) ...
Mount, The analysis of a probabilistic approach to nearest neighbor searching (276-286); Anil Maheshwari, Michiel Smid and Norbert Zeh, I/O-efficient shortest path queries in geometric spanners (287-299 ...
Automating Distributed Tiered Storage Management in Cluster Computing
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
., NVRAM, SSDs) have recently led to the introduction of storage tiering in such settings. ...
However, users are now burdened with the additional complexity of managing the multiple storage tiers and the data residing on them while trying to optimize their workloads. ...
Existing prefetching approaches can be classified in two categories: (i) contentbased that rely on the analysis of web page contents, and (ii) history-based that rely on the observed page access patterns ...
arXiv:1907.02394v2
fatcat:rvmxv35igbbiphdktgmzejweyy
Automating distributed tiered storage management in cluster computing
2019
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
., NVRAM, SSDs) have recently led to the introduction of storage tiering in such settings. ...
However, users are now burdened with the additional complexity of managing the multiple storage tiers and the data residing on them while trying to optimize their workloads. ...
Another recent policy augmented the Marker caching algorithm [15] with a machine learned oracle for improving its competitive ratio [33] . ...
doi:10.14778/3357377.3357381
fatcat:c34zv7c5kjbs5hfreujhrwco5y
Analyzing Adaptive Cache Replacement Strategies
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Even though they can be treated as online algorithms with an "adaptive" twist, a theoretical proof of the competitiveness of ARC and CAR remained unsolved for over a decade. ...
We show that the competitiveness ratio of CAR (and ARC) has a lower bound of N + 1 (where N is the size of the cache) and an upper bound of 18N (4N for ARC). ...
We are grateful to Kirk Pruhs for suggesting enhancing our results with the assumption of unequal cache sizes. ...
arXiv:1503.07624v2
fatcat:mepbmh5i5vg7zfcyzwnskpxmcu
Hyperbolic Caching: Flexible Caching for Web Applications
2017
USENIX Annual Technical Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We also introduce the notion of a cost class in order to measure the costs and manipulate the priorities of all items belonging to a related group. ...
Inspired by Redis's use of random sampling for eviction (in lieu of a data structure) and recent theoretical justification for this approach, we design a new caching algorithm for web applications called ...
Muthu Muthukrishnan coined the name "hyperbolic caching". Finally, we thank our shepherd, Rachit Agarwal. ...
dblp:conf/usenix/BlanksteinSF17
fatcat:eznte5th4rh5nd6a4s5t4ab2na
Learning Cache Replacement with CACHEUS
2021
USENIX Conference on File and Storage Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Paired t-test analysis demonstrates that CACHEUS using the newly proposed lightweight experts, SR-LRU and CR-LFU, is the most consistently performing caching algorithm across a range of workloads and cache ...
Furthermore, CACHEUS enables augmenting state-of-the-art algorithms (e.g., LIRS, ARC) by combining it with a complementary cache replacement algorithm (e.g., LFU) to better handle a wider variety of workload ...
Acknowledgments We would like to thank the reviewers of this paper and our shepherd Ken Salem for insightful feedback that helped improve the content and presentation of this paper substantially. ...
dblp:conf/fast/RodriguezYLPRL021
fatcat:f3kufjtakvarboh2wf6kwaplqq
« Previous
Showing results 1 — 15 out of 38 results