Claims
- 1. A cache memory, comprising:
addresses split into a tag part, an index part and an offset part; and means for performing a transformation between the tag part of an address and a coded tag address being unambiguous in both directions.
- 2. The cache memory according to claim 1, wherein said means performs a transformation between the index part of the address and a coded index address that is unambiguous in both directions.
- 3. A method for addressing a cache memory, which comprises the step of:
performing a transformation between a tag part of a cache address and a coded tag address being unambiguous in both directions.
- 4. The method according to claim 3, which further comprises performing a transformation between an index part of the cache address and a coded index address being unambiguous in both directions.
- 5. A cache memory, comprising:
addresses split into a tag part, an index part and an offset part; and a transformation device performing a transformation between the tag part of an address and a coded tag address being unambiguous in both directions.
- 6. The cache memory according to claim 5, wherein said transformation device performs a transformation between the index part of the address and a coded index address that is unambiguous in both directions.
Priority Claims (1)
Number |
Date |
Country |
Kind |
101 01 552.6 |
Jan 2001 |
DE |
|
CROSS-REFERENCE TO RELATED APPLICATION
[0001] This application is a continuation of copending International Application PCT/DE01/04821, filed Dec. 20, 2001, which designated the United States and which was not published in English.
Continuations (1)
|
Number |
Date |
Country |
Parent |
PCT/DE01/04821 |
Dec 2001 |
US |
Child |
10619979 |
Jul 2003 |
US |