Two Cache Replacement Algorithms Based on Association Rules and Markov Models

Authors:
Keqiu Li;Wenyu Qu;Hong Shen;Di Wu;Takashi Nanya
Affiliations:
Dalian Maritime University;Japan Advanced Institute of Science and Technology;Japan Advanced Institute of Science and Technology;Dalian University of Technology;University of Tokyo
Venue:
SKG '05 Proceedings of the First International Conference on Semantics, Knowledge and Grid
Year:
2005

Citing 0
Cited 2

Markov Model Based Disk Power Management for Data Intensive Workloads

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Learning user purchase intent from user-centric data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, two cache replacement algorithms are presented. One is based on association rules, in which we extend the LRU replacement algorithm by making it sensible to web access models extracted from web log data using web mining techniques. The other one is based on Markov models, in which we improve the LRU replacement algorithm by applying Markov models.