Method and apparatus for miss sequence cache block replacement utilizing a most recently used state

• US 6,098,152 A
• Filed: 10/17/1997
• Issued: 08/01/2000
• Est. Priority Date: 10/17/1997
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mounes-Toussi, Farnaz
• Primary Examiner(s): Chan, Eddie P.
• Assistant Examiner(s): Ellis, Kevin L.
• Application Number:
  US08/953,396
• Time in Patent Office: 1,019 Days
• Field of Search: 711/133, 711/134, 711/136
• US Class Current: 711/134
• CPC Class Codes: G06F 12/0864 using pseudo-associative means, e.g. set-associative or hashing
• CPC Class Codes: G06F 12/121 using replacement algorithms
• CPC Class Codes: G06F 12/123 with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
• CPC Class Codes: G06F 12/127 using additional replacement algorithms
• CPC Class Codes: G06F 2212/1021 Hit rate improvement

Abstract

A method and apparatus are provided for miss sequence cache block replacement in a cache including a plurality of cache blocks in a computer system. First checking for an invalid block is performed. Responsive to identifying an invalid cache block, the identified invalid block is selected for replacement. If an invalid cache block is not found, then checking for a first priority cache block and not equal to most recently used (MRU) state is performed. Responsive to identifying a first priority cache block and not equal to most recently used (MRU) state, the identified first priority cache block is selected for replacement. If a first priority cache block and not equal to most recently used (MRU) state is not found, then checking for a next priority cache block and not equal to most recently used (MRU) state is performed. Responsive to identifying a next priority cache block and not equal to most recently used (MRU) state, the identified next priority cache block is selected for replacement. In the absence of identifying an invalid cache block, a first priority cache block and not equal to most recently used (MRU) state, or a next priority cache block and not equal to most recently used (MRU) state, one of the plurality of cache blocks is randomly selected for replacement. A tag field stores the most recently used (MRU) state information which is used to determine where not to replace a cache block in the cache.

Claims

1. A cache block replacement method used with a cache including a plurality of cache blocks in a computer system responsive to a cache miss comprising the steps of:

checking for an invalid block;

responsive to identifying an invalid cache block, selecting said identified invalid block for replacement;

checking for a first priority cache block and not equal to most recently used (MRU) state;

responsive to identifying a first priority cache block and not equal to most recently used (MRU) state, selecting said identified first priority cache block not equal to most recently used (MRU) state for replacement;

checking for a next priority cache block and not equal to most recently used (MRU) state;

responsive to identifying a next priority cache block and not equal to most recently used (MRU) state, selecting said identified next priority cache block not equal to most recently used (MRU) state for replacement; and

in the absence of identifying an invalid cache block, a first priority cache block and not equal to most recently used (MRU) state, or a next priority cache block and not equal to most recently used (MRU) state, randomly selecting one of the plurality of cache blocks for replacement.

2. A cache block replacement method as recited in claim 1 further includes the step of storing said most recently used state information in a cache block address tag field in a cache directory.

3. A cache block replacement method as recited in claim 1 wherein the step of checking for said invalid block includes the step of checking a cache block state field in a cache directory.

4. A cache block replacement method as recited in claim 1 wherein the step of checking for said first priority cache block and not equal to most recently used (MRU) state includes the step of checking both a block state field and an address tag field of most recently used state information in a cache directory.

5. A cache block replacement method as recited in claim 1 wherein the step of checking for said first priority cache block and not equal to most recently used (MRU) state includes the step of checking for a shared-modified cache block state and not equal to most recently used (MRU) state.

6. A cache block replacement method as recited in claim 1 wherein the step of checking for said next priority cache block and not equal to most recently used (MRU) state includes the step of checking for a shared cache block state and not equal to most recently used (MRU) state.

7. A cache block replacement method as recited in claim 1 wherein the step of checking for said next priority cache block and not equal to most recently used (MRU) state includes the step of checking for an exclusive cache block state and not equal to most recently used (MRU) state.

8. A cache block replacement method as recited in claim 1 wherein the step of checking for said next priority cache block and not equal to most recently used (MRU) state includes the step of checking for a modified cache block state and not equal to most recently used (MRU) state.

9. A cache block replacement method as recited in claim 1 wherein the step of checking for said first priority cache block and not equal to most recently used (MRU) state includes the step of checking for a shared-modified cache block state and not equal to most recently used (MRU) state and a shared cache block state and not equal to most recently used (MRU) state.

10. Apparatus for cache block replacement responsive to a cache miss in a cache including a plurality of cache blocks in a computer system comprising:

a cache directory for storing cache block address tags and a most recently used (MRU) state field, each of said cache block address tags including a cache block state field,

means for checking said cache directory for an invalid block;

means responsive to identifying an invalid cache block, for selecting said identified invalid block for replacement;

means for checking said cache directory for a first priority cache block and not equal to most recently used (MRU) state;

means responsive to identifying a first priority cache block and not equal to most recently used (MRU) state, for selecting said identified first priority cache block not equal to most recently used (MRU) state for replacement;

means for checking said cache directory for a next priority cache block and not equal to most recently used (MRU) state;

means responsive to identifying a next priority cache block and not equal to most recently used (MRU) state, for selecting said identified next priority cache block not equal to most recently used (MRU) state for replacement; and

means responsive to the absence of identifying an invalid cache block, a first priority cache block and not equal to most recently used (MRU) state, or a next priority cache block and not equal to most recently used (MRU) state, for randomly selecting one of the plurality of cache blocks for replacement.

11. Apparatus for cache block replacement responsive to a cache miss as recited in claim 10 wherein the cache is a set-associative cache and one said most recently used (MRU) state field is stored with each set, whereby said most recently used (MRU) state field is independent of the number of cache blocks within each set.

12. Apparatus for cache block replacement responsive to a cache miss as recited in claim 10 wherein the computer system is a multiple processor shared memory system and wherein one of five states is stored in said cache block state field for each cache block, said five states including invalid, shared-modified, shared, exclusive and modified.

13. Apparatus for cache block replacement responsive to a cache miss as recited in claim 12 wherein said means for checking said cache directory for said first priority cache block and not equal to most recently used (MRU) state include means for checking said cache block state field for a shared-modified state.

14. Apparatus for cache block replacement responsive to a cache miss as recited in claim 12 wherein said means for checking said cache directory for said next priority cache block and not equal to most recently used (MRU) state include means for checking said cache block state field for at least one of a shared state, an exclusive state or a modified state and not equal to most recently used (MRU) state.

15. A computer system comprising:

a processor;

a cache coupled to said processor, said cache including a plurality of cache blocks;

a plurality of input/output devices;

a bus connecting said processor and said plurality of input/output devices;

a cache directory for storing cache block address tags and a most recently used (MRU) state field, said cache block address tags including a cache block state field,

means, responsive to a cache miss, for checking said cache directory for an invalid block;

means responsive to identifying an invalid cache block, for selecting said identified invalid block for replacement;

means for checking said cache directory for a first priority cache block and not equal to most recently used (MRU) state;

means responsive to identifying a first priority cache block and not equal to most recently used (MRU) state, for selecting said identified first priority cache block not equal to most recently used (MRU) state for replacement;

means for checking said cache directory for a next priority cache block and not equal to most recently used (MRU) state;

means responsive to identifying a next priority cache block and not equal to most recently used (MRU) state, for selecting said identified next priority cache block not equal to most recently used (MRU) state for replacement; and

means responsive to the absence of identifying an invalid cache block, a first priority cache block and not equal to most recently used (MRU) state, or a next priority cache block and not equal to most recently used (MRU) state, for randomly selecting one of the plurality of cache blocks for replacement.

16. A computer system as recited in claim 15 wherein the computer system is a cache coherent multiple processor system and wherein one of five states is stored in said cache block state field for each cache block, said five states including invalid, shared-modified, shared, exclusive and modified.

17. A computer system as recited in claim 16 wherein both said first priority cache block and said next priority cache block are at least one of said five states.

18. A computer system as recited in claim 16 wherein said means for checking said cache directory for said first priority cache block and not equal to most recently used (MRU) state include means for checking said cache block state field for a shared-modified state.

19. Apparatus for cache block replacement in a computer system comprising:

a cache including a plurality of cache blocks;

a cache controller for implementing a cache block replacement method responsive to a cache miss;

said cache controller including;

a cache directory storing cache block address tags and a most recently used (MRU) state field, each of said cache block address tags including a cache block state field, each said cache block state field storing one cache block state, one of five states being stored in said cache block state field for each cache block, said five states including invalid, shared-modified, shared, exclusive and modified

said cache controller utilizing said most recently used (MRU) state field and said stored cache block state for selecting a cache block for replacement; and

wherein priorities are assigned to said five states for selecting a cache block for replacement and wherein an invalid state is assigned a highest priority.

20. Apparatus for cache block replacement as recited in claim 19 wherein said cache is a set-associative cache and one said most recently used (MRU) state field is stored with each set, whereby said most recently used (MRU) state field is independent of the number of cache blocks within each set.