Appeal 2006-3434
Application 10/687,907
of a miss, the requested data is placed in the data array and the
corresponding system address is placed in of the ACAM, setting one or more
valid status bits to the valid state (col. 15, ll. 42-59). Miller also teaches an
invalidation operation to invalidate an entry in the ACAM (104). (col. 16,
lls 11-18).
Geva teaches a system for optimizing computer software through
construction and unrolling of counted loops. (col. 1, ll. 18-24). Particularly,
Geva teaches an advanced load address table (ALAT) that interacts with an
advance load or advance load check causing the processor to perform a load
from a memory location. The ALAT acts as a cache of the physical memory
address and the physical register address accessed by the most recently
executed advance load. (col. 14, ll. 15-31). During each memory store, store
instructions cause the processor to search all entries in the ALAT. All
entries in overlapping regions of memory are invalidated. (col. 14, ll. 32-47).
Hale teaches a method for securely invalidating portion of a cache
following a write back invalidate instruction during initialization. (col. 9,
lines 30-45). Particularly, Hale discloses preventing unlocking of
nonvolatile memory during such initialization. Further, Hale indicates that
performance of initialization and security functions are vital to ensure the
security and integrity of the computer system. Therefore, they must be
protected. (col. 1, ll. 24-36).
PRINCIPLES OF LAW
1. ANTICIPATION
It is axiomatic that anticipation of a claim under § 102 can be found
only if the prior art reference discloses every element of the claim. See In re
King, 801 F.2d 1324, 1326, 231 USPQ 136, 138 (Fed. Cir. 1986) and
5
Page: Previous 1 2 3 4 5 6 7 8 9 10 Next
Last modified: September 9, 2013