Set associative cache memory with heterogeneous replacement policy

作者: Rodney E. Hooker , Douglas R. Reed , John Michael Greer , Colin Eddy

DOI:

关键词: Set (abstract data type)Mutually exclusive eventsSpecifierScheme (programming language)Associative cacheComputer scienceParallel computingMemory mapCPU cache

摘要: A set associative cache memory, comprising: an array of storage elements arranged as M sets by N ways; allocation unit that allocates the in response to memory accesses miss memory. Each access selects a set; for each parcel plurality parcels, specifier specifies: subset ways included parcel. The subsets parcels associated with selected are mutually exclusive; replacement scheme from among predetermined schemes. For access, unit: access; and uses allocate into

参考文章(84)
David H. Asher, Richard E. Kessler, Brian Lilly, Stephen C. Root, Fast lane prefetching ,(2000)
Iulin Lih, Richard Trauben, Concurrently accessed set associative overflow cache ,(2013)
Brian C. Grayson, Peter J. Wilson, David P. Burgess, Suppression of redundant cache status updates ,(2013)
Samira M. Khan, Christopher B. Wilkerson, Alaa R. Alameldeen, Read-write partitioning of cache memory ,(2013)
Liqun Cheng, Ravishankar Iyer, Sadagopan Srinivasan, Zhen Fang, Jeffrey Wilder, Donald Newell, Searching a shared cache by using search hints and masked ways ,(2009)
Dana M. Vantrease, Christopher Edward Koob, A write-only dataless state for maintaining cache coherency ,(2012)
Srilatha Manne, Steven K. Reinhardt, Lisa Hsu, Prefetch promotion mechanism to reduce cache pollution ,(2009)
Danilo Caraccio, Giuseppe D'Eliseo, Francesco Falanga, Ornella Vitale, Emanuele Confalonieri, Massimo Iaculo, Preparation of memory device for access using memory access type indicator signal ,(2011)