http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CA-2240616-C
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_e757fd4fedc4fe825bb81b1b466a0947 |
classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2212-6082 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F12-08 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F12-1054 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F12-0864 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F12-08 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F12-10 |
filingDate | 1998-06-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2002-01-29-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_b3990b889dbb0526749f9a305906c784 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_0fa2e44071404cda170ef9d517101543 |
publicationDate | 2002-01-29-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | CA-2240616-C |
titleOfInvention | Cache address generation |
abstract | A cache system provides for accessing set associative caches with no increase in critical path delay, for reducing the latency penalty for cache accesses, for reducing snoop busy time, and for responding to MRU misses and cache misses. The cache array is accessed by multiplexing two most-recently-used (MRU) arrays which are addressed and accessed substantially in parallel with effective address generation, the outputs of which MRU arrays are generated, one by assuming a carryin of zero, and the other by assuming a carryin of one to the least significant bit of the portion of the effective addressed used to access the MRU arrays. The hit rate in the MRU array is improved by hashing within an adder the adder's input operands with predetermined additional operand bits. |
priorityDate | 1997-06-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 27.