A NOVEL DYNAMIC GREEDYDUAL-SIZE REPLACEMENT STRATEGY TO MAKE TIME-CRITICAL WEB APPLICATIONS SUCCESSFUL

Allan K. Y. Wong, Jackei H. K.Wong, Wilfred W. K. Lin, Tharam S. Dillon

2007

Abstract

The GreedyDual-Size (GD-Size) replacement algorithm is a static-cache-size approach that yields a higher hit ratio than the basic LRU replacement algorithm. Yet, maintaining a given hit ratio needs dynamic cache size tuning, and this can only be achieved by the MACSC (model for adaptive cache size control) model so far. Since the GD-Size yields a higher hit ratio than the basic LRU, it is proposed in this paper to replace the LRU unit in MACSC with the GD-Size algorithm. The replacement creates a new and more efficient dynamic cache size tuner, Dynamic GreedyDual-Size (DGD-Size).

Paper Citation

in Harvard Style

K. Y. Wong A., H. K.Wong J., W. K. Lin W. and S. Dillon T. (2007). A NOVEL DYNAMIC GREEDYDUAL-SIZE REPLACEMENT STRATEGY TO MAKE TIME-CRITICAL WEB APPLICATIONS SUCCESSFUL . In Proceedings of the Second International Conference on e-Business - Volume 1: ICE-B, (ICETE 2007) ISBN 978-989-8111-11-1, pages 17-22. DOI: 10.5220/0002106800170022

in Bibtex Style

@conference{ice-b07,
author={Allan K. Y. Wong and Jackei H. K.Wong and Wilfred W. K. Lin and Tharam S. Dillon},
title={A NOVEL DYNAMIC GREEDYDUAL-SIZE REPLACEMENT STRATEGY TO MAKE TIME-CRITICAL WEB APPLICATIONS SUCCESSFUL},
booktitle={Proceedings of the Second International Conference on e-Business - Volume 1: ICE-B, (ICETE 2007)},
year={2007},
pages={17-22},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002106800170022},
isbn={978-989-8111-11-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on e-Business - Volume 1: ICE-B, (ICETE 2007)
TI - A NOVEL DYNAMIC GREEDYDUAL-SIZE REPLACEMENT STRATEGY TO MAKE TIME-CRITICAL WEB APPLICATIONS SUCCESSFUL
SN - 978-989-8111-11-1
AU - K. Y. Wong A.
AU - H. K.Wong J.
AU - W. K. Lin W.
AU - S. Dillon T.
PY - 2007
SP - 17
EP - 22
DO - 10.5220/0002106800170022