Competitive cache replacement strategies for a shared cache

v

[1]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[2]  Neal E. Young,et al.  Competitive paging and dual-guided algorithms for weighted caching and matching (Thesis) , 1991 .

[3]  Eric Torng,et al.  A Unified Analysis of Paging and Caching , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  A. López-Ortiz,et al.  Paging for Multicore (CMP) Caches , 2010 .

[5]  Mohamed M. Zahran,et al.  Non-Inclusion Property in Multi-Level Caches Revisited , 2007, Int. J. Comput. Their Appl..

[6]  M. Luby,et al.  On ~ competitive algorithms for paging problems , 1991 .

[7]  Sandy Irani,et al.  Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.

[8]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[9]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Edward F. Grove,et al.  Application-controlled paging for a shared cache , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Avinatan Hassidim,et al.  Cache Replacement Policies for Multicore Processors , 2010, ICS.

[13]  Wolfgang E. Nagel,et al.  Comparing cache architectures and coherency protocols on x86-64 multicore SMP systems , 2009, 2009 42nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[14]  Ken Kennedy,et al.  Software prefetching , 1991, ASPLOS IV.

[15]  Prabhakar Raghavan,et al.  Memory versus randomization in on-line algorithms , 1994, IBM J. Res. Dev..

[16]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[17]  Veljko Milutinovic,et al.  The Cache Coherence Problem in Shared-Memory Multiprocessors: Software Solutions , 1996 .

[18]  Anoop Gupta,et al.  Design and evaluation of a compiler algorithm for prefetching , 1992, ASPLOS V.

[19]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[20]  Kai Li,et al.  Application-Controlled File Caching Policies , 1994, USENIX Summer.

[21]  Wen-Hann Wang,et al.  Retrospective: on the inclusion properties for multi-level cache hierarchies , 1998, ISCA 1998.

[22]  Lyle A. McGeoch,et al.  A strongly competitive randomized paging algorithm , 1991, Algorithmica.

[23]  Amos Fiat,et al.  Randomized and multipointer paging with locality of reference , 1995, STOC '95.

[24]  Vijaya Ramachandran,et al.  Oblivious algorithms for multicores and network of processors , 2010, IPDPS.