Legal claims defining the scope of protection, as filed with the USPTO.
1. In a network holding a central processor having a processor bus connecting first and second level cache units and having a snoop logic unit to sense any changes in address data appearing on a system bus, said first and second level cache units controlled by a single Programmable Logic Array unit having snare unused gates, a method for keeping said first level cache and said second level cache units coherently synchronized while minimizing the load on the interconnecting processor bus, comprising the steps of: (a) initiating a system bus snoop cycle to retrieve addresses of data being modified; (b) loading said addresses in an invalidation queue for use in subsequent invalidation of addresses in said cache units; (c) providing status bits v and R for each address in said second level cache unit, to indicate validity V=1, invalidity V=0 and to indicate, in said second level cache unit, that said first level cache unit has a valid copy of each address when R=1 and no valid copy of each address when R=0; (d) formulating said second level cache as multiple units greater in size than said first level cache so that all data in said first level cache resides in said second level cache but said second level cache holds much larger amounts of information than said first level cache; (e) utilizing said snare gates in said Programmable Logic Array unit as a single cache controller for said first and second level cache units; (f) invalidating, V=0, each address in said second level cache unit, when an address, received from said system bus snoop cycle, matches an address in said second level cache unit; (g) checking the R bit status value when an address from said system bus snoop cycle matches the address in said second level cache unit; (h) turning off, (R=0), when said R bit status value for said address in said second level cache unit is R=1, to render R as invalid, V=0, said turned-off R bit, R=0 indicating that no valid copy of said address, received from said system bus snoop cycle, is stored in said first level cache unit; (i) transferring said address, received from said system bus snoop cycle to said first level cache unit for a match to invalidate, V=0, any matching address in said first level cache unit.
2. The method of claim 1 including the steps of: (j) utilizing, on a cache memory Write operation, an LRU fill algorithm on said first level cache unit to place new data therein.
Complete technical specification and implementation details from the patent document.
DESCRIPTION OF PREFERRED EMBODIMENT
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
Unknown
May 30, 2000
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.