Diversity in database reference behavior
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Empirical results on locality in database referencing
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Database buffer paging in virtual storage systems
ACM Transactions on Database Systems (TODS)
Some Distribution-Free Aspects of Paging Algorithm Performance
Journal of the ACM (JACM)
Performance Analysis of Cache Memories
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Operating Systems Theory
Index Access with a Finite Buffer
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Managing IBM database 2 buffers to maximize performance
IBM Systems Journal
Analytical modelling of a hierarchical buffer for a data sharing environment
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of recovery in a database system using a write-ahead log protocol
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Analysis of the generalized clock buffer replacement scheme for database transaction processing
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Asymptotic performance of a buffer model in a data sharing environment
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
IEEE Transactions on Computers
Database buffer size investigation for OLTP workloads
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Biased dictionaries with fast insert/deletes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM Transactions on Database Systems (TODS)
Characterization of database access pattern for analytic prediction of buffer hit probability
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Computers
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment
IEEE Transactions on Parallel and Distributed Systems
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
L/MRP: A Buffer Management Strategy for Interactive Continuous Data Flows in a Multimedia DBMS
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Buffer Management in Active, Real-Time Database Systems - Concepts and an Algorithm
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
Biased Skip Lists for Highly Skewed Access Patterns
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Performance Simulations of a QoS Aware Caching Method
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Network-Adaptive Cache Management Schemes for Mixed Media
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
A new cache management algorithm for multimedia storage systems
Proceedings of the 2003 ACM symposium on Applied computing
Modeling epidemic information dissemination on mobile devices with finite buffers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A page fault equation for modeling the effect of memory size
Performance Evaluation
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Cross-layer QoS support for multimedia delivery over wireless internet
EURASIP Journal on Applied Signal Processing
IEEE Transactions on Parallel and Distributed Systems
Estimating the output cardinality of partial preaggregation with a measure of clusteredness
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A new approach to dynamic self-tuning of database buffers
ACM Transactions on Storage (TOS)
A unified multiple-level cache for high performance storage systems
International Journal of High Performance Computing and Networking
An efficient design for fast memory registration in RDMA
Journal of Network and Computer Applications
Adaptive multi-level cache allocation in distributed storage architectures
Proceedings of the 24th ACM International Conference on Supercomputing
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Impact of flash memory on video-on-demand storage: analysis of tradeoffs
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Modelling and evaluation of CCN-caching trees
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Cache location in tree networks: preliminary results
INOC'11 Proceedings of the 5th international conference on Network optimization
Efficient page caching algorithm with prediction and migration for a hybrid main memory
ACM SIGAPP Applied Computing Review
Efficient memory management of a hierarchical and a hybrid main memory for MN-MATE platform
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
An update-aware storage system for low-locality update-intensive workloads
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Cache "less for more" in information-centric networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
On the effects of caching in access aggregation networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Fluid limit analysis of FIFO and RR caching for independent reference models
Performance Evaluation
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
ACM SIGCOMM Computer Communication Review
Temporal locality in today's content caching: why it matters and how to model it
ACM SIGCOMM Computer Communication Review
Caching in information centric networking: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance of bandwidth and storage sharing in information-centric networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
Estimating instantaneous cache hit ratio using Markov chain analysis
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
In this paper, we develop approximate analytical models for predicting the buffer hit probability under the Least Recently Used (LRU) and First In First Out (FIFO) buffer replacement policies under the independent reference model. 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 distinct access probabilities. In the case of the FIFO policy, the solution algorithm is iterative and the computational complexity of each iteration is O(K). Results from these models are compared to exact results for models originally developed by King [KING71] for small values of the buffer size, B, and the total number of items sharing the buffer, D. Results are also compared with results from a simulation for large values of B and D. In most cases, the error is extremely small (less than 0.1%) for both LRU and FIFO, and a maximum error of 3% is observed for very small buffer size (less than 5) when the access probabilities are extremely skewed. To demonstrate the usefulness of the model, we consider two applications. In our first application, we compare the LRU and FIFO policies to an optimal static buffer allocation policy for a database consisting of two classes of data items. We observe that the performance of LRU is close to that of the optimal allocation. As the optimal allocation requires knowledge of the access probabilities, the LRU policy is preferred when this information is unavailable. We also observe that the LRU policy always performs better than the FIFO policy in our experiments. In our second application, we show that if multiple independent reference streams on mutually disjoint sets of data compete for the same buffer, it is better to partition the buffer using an optimal allocation policy than to share a common buffer.