Abstract:
A parity checking arrangement for tag information in a cache memory. Parity generation is performed on the input tag in parallel with tag memory lookup and then compared with the parity stored in tag memory in order to speed operation. A single parity generator also may be used for writing into tag memory.

Description:
TECHNICAL FIELD 
     This invention relates to data processing systems and more particularly, to data processing systems using cache memory. 
     BACKGROUND OF THE INVENTION 
     A cache is a memory that is functionally located between a data processor and its main memory. The cache is smaller but faster than the main memory. A cache memory decreases the effective access time of a memory system by storing copies of data that are also present in main memory. Here, the term &#34;data&#34; may include both program instructions and the data that they manipulate. Because of its size, the cache cannot hold copies of all of the main memory contents. When the processor performs a memory read operation, the cache tests to see if it contains the referand. If so, the cache will provide it to the processor, and no main memory access will occur. If the referenced data is not present in the cache, main memory will be accessed. References which find their target in the cache are called cache hits. All other memory references are called cache misses. 
     A main memory address consists of two fields. The higher order bits are called the tag field, while the remaining lower order bits are the index field. The cache uses a tag memory, separate from its data memory, to remember the tag fields of the addresses of the main memory contents that it presently holds. When the processor performs a memory access, the index field of the address is used to address the tag memory. The output data from the tag memory is then compared bit by bit with the tag field of the main memory address. If the two fields are identical, a hit has occurred, and the corresponding data will be supplied to the processor. If the fields are not identical, it is a miss, and main memory must be accessed. 
     If contents of the tag memory were to become corrupted, memory accesses that should miss may actually hit. This would result in incorrect data being supplied to the processor, a dangerous occurrence. Therefore, it is desirable that some method of error checking be performed over the tag fields when they are output from the tag memory. It is common to use a single parity bit over each word in the tag memory. If bad parity is detected when tag memory is read, a miss condition is forced. In the prior art, a parity check on the tag information is performed after the tag information is read from tag memory. This serial action slows the cache memory. It would be beneficial if this serial action could be replaced by a faster arrangement. 
     SUMMARY OF THE INVENTION 
     Cache memory action is speeded by generating a parity bit over the tag field supplied by the processor, and comparing this bit with the parity bit stored in the tag memory. This permits tag memory access and parity generation to occur simultaneously, reducing overall response time. Circuitry is reduced by using a single parity generator for writing into tag memory. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 shows the layout of a main memory address; 
     FIG. 2 shows tag access and comparison; 
     FIG. 3 shows a prior art tag memory comparison and parity check; 
     FIG. 4 shows an embodiment of the present invention; and 
     FIG. 5 shows a second embodiment of the present invention including means for writing parity bits into tag memory. 
    
    
     DETAILED DESCRIPTION 
     As shown in FIG. 1, a main memory address consists of two fields. The higher order bits are called the tag field, while the remaining lower order bits are the index field. 
     FIG. 2 shows the hardware of a cache typically necessary for hit or miss determination. The cache uses tag memory 10 separate from its data memory (not shown) to remember the tag fields of the addresses of the main memory contents that it presently holds. When the processor performs a memory access, the index field of the address is used to address the tag memory. The output data from the tag memory is then compared bit by bit with the tag field of the main memory address in comparator 20. If the two fields are identical, a hit has occurred, comparator 20 will produce a &#34;hit&#34; output signal, and the corresponding data will be supplied to the processor from data memory. If the fields are not identical, it is a miss, and main memory must be accessed. Added details of such a cache memory arrangement may be found, for example, in U.S. Pat. No. 4,197,580. 
     FIG. 3 shows a prior art arrangement for performing a parity check over the tag field. Tag memory 10 is accessed, and the resulting parity data is sent to a parity checker 30. The &#34;hit&#34; signal is the logical AND of the tag comparison of comparator 20 and the parity check. The major liability of this design is the fact that the tag memory access and the parity check--the slowest functions shown--are performed serially. Because the tag comparison is faster than the parity check, the critical path from processor address to the &#34;hit&#34; signal is the tag memory access plus the parity check plus the AND gate 40. 
     FIG. 4 shows an implementation of the present invention. Here, a parity bit is generated in parity generator 60 over the tag field supplied by the processor. This bit is compared at comparator 50 with the parity bit stored in the tag memory 10. The tag fields from the processor address and the tag memory are also compared, as before, in comparator 20. Now, the &#34;hit&#34; signal is the logical AND of the tag comparison and the parity bit comparison. Therefore, this signal behaves the same as in the prior art design. That is, it will be asserted if, and only if, the tag fields match and the parity is correct over the stored tag. The advantage in the present embodiment design is that the tag memory access and parity generation occur simultaneously. Assuming that the parity generation is faster than the memory access, the critical path is now the memory access plus the tag comparison plus AND gate 40. The tag comparison has replaced parity checking in this equation. This results in faster cache operation. 
     An additional asset of this arrangement can be seen when the tag memory 10 is to be written by the tag field supplied by the processor as shown in FIG. 5. The parity generator 60 is now well positioned to generate the parity bit which will be written into the tag memory over conducting path 80, along with the tag field from the processor over bus 70. In the prior art design, an additional parity generator would probably be required. 
     The implementations of the present invention as set forth herein are exemplary only and are not intended to be exhaustive. Other arrangements may be implemented by those skilled in the art without departing from the spirit of the invention.