← Back to Patent Explorer
US5355471A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiprocessor cache coherency tester that exercises the coherency logic exhaustively and also detects errors in a processor using an automatic CPU sort

Assignee: Fujitsu Siemens Computers Inc
•
Filing: 1992-08-14
•
Granted: 1994-10-11
•
Expires: 2012-08-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A cache coherency test exercises cache coherency logic exhaustively such that any cache coherency failures liable to occur will occur. The CPU(s) which caused the failure is automatically identified by performing an automatic CPU sort. In particular, cache coherency is tested by causing each processor in the system to perform a sequence of read and write accesses to main memory and to its own cache memory so as to cause substantially every possible sequence of cache coherency bus operations. Each processor tests consistency of data read by it with data written by it. As long as no processor detects an error, read and write accesses are continued for a predetermined period of time. When any processor detects an error, each CPU is disabled, one at a time, to see if the remaining CPUs can run the test successfully. If they do not, then every combination of two CPUs are disabled, then every combination of three, etc. In this manner, a maximum running set of CPUs is identified. CPU failures are verified by substituting, one at a time, failing CPUs for a passing CPU and again running the test. If the test is unsuccessful, then failure of the CPU is presumed to be conclusive.

Inventors

  • 👤 Russell H. Weight

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 09:52
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0815; G06F11/00; G06F11/22; G06F2212/00; G06F2212/10; G06F2212/1032

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 160 words
In a computer system having multiple processors sharing a common main memory accessed through a common bus, each processor having its own cache memory, a method of testing cache coherency, comprising the steps of: (a) causing each processor to perform a sequence of read and write accesses to main memory and to its own cache memory so as to cause substantially every possible sequence of cache coherency bus operations, each processor testing consistency of data read by it with data written by it; (b) as long as no processor detects an error, continuing said read and write accesses for a predetermined period of time; (c) when any processor detects an error, signalling said error on said bus and thereafter disabling at least one processor; and (d) repeating steps (a), (b) and (c) until either a passing group of processors remains and no processor has detected an error for a predetermined period of time or no passing group of processors remains.
Claim 2
Dependent Claim 160 words
In a computer system having multiple processors sharing a common main memory accessed through a common bus, each processor having its own cache memory, a method of testing cache coherency, comprising the steps of: (a) causing each processor to perform a sequence of read and write accesses to main memory and to its own cache memory so as to cause substantially every possible sequence of cache coherency bus operations, each processor testing consistency of data read by it with data written by it; (b) as long as no processor detects an error, continuing said read and write accesses for a predetermined period of time; (c) when any processor detects an error, signalling said error on said bus and thereafter disabling at least one processor; and (d) repeating steps (a), (b) and (c) until either a passing group of processors remains and no processor has detected an error for a predetermined period of time or no passing group of processors remains.
Claim 3
Dependent Claim 95 words
The method of claim 1, comprising the further step of (e) disabling a processor among said passing group of processors and re-enabling in its stead a processor previously disabled and suspected of having caused a previous error; (f) repeating step (a)-(c); (g) if an error is detected, disconnecting from said computer system said processor suspected of having caused a previous error; and (h) if no error is detected, repeating steps (a)-(c) with said passing group of processors and said processor suspected of having caused a previous error but with said predetermined period of time increased.
Claim 4
Dependent Claim 51 words
The method of claim 1 in step (c) of which processors are disabled first one at a time, then two at a time, then three at a time, and so forth, until either a passing group of processors remains or no passing group of processors remains as determined in step (d).
Claim 5
Dependent Claim 32 words
The method of claim 1 in step (a) of which a plurality of said processors perform read and write accesses to different assigned words of a single memory line in main memory.
Claim 6
Dependent Claim 107 words
The method of claim 1 wherein said processors each has a cache memory composed of a primary cache, including an internal directory and an external shadow directory, and a secondary cache, said method comprising the further steps of (i) causing each processor to perform a sequence of read and write accesses to its own cache only, so as to cause frequent misses in the primary data cache and line-fills from the secondary cache, each processor testing whether tags in the shadow directory are set correctly; and (j) as long as no processor detects an error, continuing said read and write accesses for a predetermined period of time.

References Cited (Backward Citations)

US4622631A Cited
US4622631B1 Cited
US4991090A Cited
US4833601A Cited
US5276828A Cited
US5136700A Cited
US5247648A Cited
US5155843A Cited
US5265235A Cited
US5261109A Cited
US5271020A Cited
US5265232A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-10-10 1998-04-11 1998-10-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-10-10 2002-04-11 2002-10-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-10-10 2006-04-11 2006-10-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag