Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Fully associative cache A cache where data from any address can be stored in any cache location. The whole address must be used as the tag. All tags must be compared simultaneously (associatively) with the requested address and if one matches then its associated data is accessed. This requires an associative memory to hold the tags which makes this form of cache more expensive. It does however solve the problem of contention for cache locations (cache conflict) since a block need only be flushed when the whole cache is full and then the block to flush can be selected in a more efficient way. See also direct mapped cache, set associative cache. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: FULLY ASSOCIATIVE CACHE |
| Specialty definitions using "FULLY ASSOCIATIVE CACHE": direct mapped cache ♦ set associative cache. (references) |
Source: compiled by the editor from various references; see credits. |
Hexadecimal (or equivalents, 770AD-1900s) (references)46 55 4C 4C 59 41 53 53 4F 43 49 41 54 49 56 45 43 41 43 48 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000110 01010101 01001100 01001100 01011001 00100000 01000001 01010011 01010011 01001111 01000011 01001001 01000001 01010100 01001001 01010110 01000101 00100000 01000011 01000001 01000011 01001000 01000101 |
HTML Code (1990) (references)F U L L Y   A S S O C I A T I V E   C A C H E |
ISO 10646 (1991-1993) (references)0046 0055 004C 004C 0059 0041 0053 0053 004F 0043 0049 0041 0054 0049 0056 0045 0043 0041 0043 0048 0045 |
Encryption (beginner's substitution cypher): (references)40554646592355353493743355443563923735374239 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
