The Framework for Study Of Caching Algorithm Efficiency

In this paper we offer several models of reference sequences (traces of references) using Markov chains for testing of the replacement policies in caching systems. These models enable the generations of traces with the repeated subsequences of references, which are of great interest for study of forecasting methods in caching systems. Furthermore, we offer the scheme of the program stand, where these models have been realized, and result of the experiments, which have been carried out with its help.

• Type: Conference
• Year: 2008
• Where: SYRCODIS
• Authors: Michael V. Grankov, Ngo Thanh Hung, Mosab Bassam Y Al Zgool
• Keywords: Database, Markov Chains, Reference Sequences, Replacement Policies, SYRCODIS 2008