Abstract
We study the on-line caching problem in a restricted cache where each memory item can be placed in only a restricted subset of cache locations. Examples of restricted caches in practice include victim caches, assist caches, and skew caches. To the best of our knowledge, all previous on-line caching studies have considered on-line caching in identical or fully-associative caches where every memory item can be placed in any cache location.
In this paper, we focus on companion caches, a simple restricted cache that includes victim caches and assist caches as special cases. Our results show that restricted caches are significantly more complex than identical caches. For example, we show that the commonly studied Least Recently Used algorithm is not competitive unless cache reorganization is allowed while the performance of the First In First Out algorithm is competitive but not optimal. We also present two near optimal algorithms for this problem as well as lower bound arguments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Arkin, E. A. and E. B. Silverberg, “Scheduling jobs with fixed start and end times,” Discrete Appl. Math., 18, 1-8 (1987).
Belady, L. A., “A study of replacement algorithms for a virtual-storage computer,” IBM Syst. J., 5(2), 282-288 (1966).
Borodin, A., S. Irani, P. Raghavan, and B. Schieber, “Competitive paging with locality of reference,” in Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 249-259.
Brehob, M., S. Wagner, E. Torng, and R. Enbody, “Optimal replacement is NP-hard for non-standard caches,” Technical Report MSU-CSE-00-14. Department of Computer Science, Michigan State University, East Lansing, Michigan, June, 2000.
Chan, K. K., C. C. Hay, J. R. Keller, G. P. Kurpanek, F. X. Schumacher, and J. Zheng, “Design of the hp pa7200,” Hewlett-Packard J. (February, 1996).
Fiat, A. and A. Karlin, “Randomized and multipointer paging with locality of reference,” in Proc. 27th Annu. ACM Symp. on the Theory of Computing, 1995, pp. 626-634.
Fiat, A. and Z. Rosen, “Experimental studies of access graph based heuristics: Beating the LRU standard?,” in Proc. 8th Annu. ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 63-72.
Fiat, A., R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young, “Competitive paging algorithms,” J. Algorithms, 12, 685-699 (1991).
Irani, S. S., A. R. Karlin, and S. J. Phillips, “Strongly competitive algorithms for paging with locality of reference,” in 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 228-236.
Jouppi, N., “Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers” Proc. 17th Annu. Inter. Symp. on Comput. Architecture, 18(2), 364-373 (May, 1990).
Kolen, A. W. J. and J. G. Kroon, “On the computation complexity of (maximum) class scheduling,” Eur. J. Operational Res., 54, 23-38 (1991).
Lund, C., S. Phillips, and N. Reingold, “IP over connection-oriented networks and distributional paging,” in Proc. 35th Annu. IEEE Foundations of Comput. Sci., 1994, pp. 424-434.
McGeoch, L. L. and D. D. Sleator, “A strongly competitive randomized paging algorithm,” Algorithmica, 6, 816-825 (1991).
Seznec, A., “A case for two-way skewed-associative caches,” in Proc. 20th Inter. Symp. on Computer Architecture, 1993, pp. 169-178.
Sleator, D. D. and R. E. Tarjan, “Amortized efficiency of list update and paging rules,” CACM, 28, 202-208 (1985).
Tam, E. S., J. A. Rivers, V. Srinivasan, G. S. Tyson, and E. S. Davidson, “Active management of data caches by exploiting reuse information,” IEEE Trans. Comput., 48(11) (November 1999).
Torng, E., “A unified analysis of paging and caching,” Algorithmica, 20, 175-200 (1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brehob, M., Enbody, R., Torng, E. et al. On-line Restricted Caching. Journal of Scheduling 6, 149–166 (2003). https://doi.org/10.1023/A:1022989909868
Issue Date:
DOI: https://doi.org/10.1023/A:1022989909868