Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Direct mapped cache A cache where the cache location for a given address is determined from the middle address bits. If the cache line size is 2^n then the bottom n address bits correspond to an offset within a cache entry. If the cache can hold 2^m entries then the next m address bits give the cache location. The remaining top address bits are stored as a "tag" along with the entry. In this scheme, there is no choice of which block to flush on a cache miss since there is only one place for any block to go. This simple scheme has the disadvantage that if the program alternately accesses different addresses which map to the same cache location then it will suffer a cache miss on every access to these locations. This kind of cache conflict is quite likely on a multi-processor. See also fully associative cache, set associative cache. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: DIRECT MAPPED CACHE |
| Specialty definitions using "DIRECT MAPPED CACHE": fully associative cache ♦ set associative cache. (references) |
Source: compiled by the editor from various references; see credits. |
Scrabble® YAWL-Verified Anagrams | |
| Words within the letters "a-a-c-c-c-d-d-e-e-e-h-i-m-p-p-r-t" | |
-5 letters: premedicated. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)44 49 52 45 43 54      4D 41 50 50 45 44      43 41 43 48 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000100 01001001 01010010 01000101 01000011 01010100 00100000 01001101 01000001 01010000 01010000 01000101 01000100 00100000 01000011 01000001 01000011 01001000 01000101 |
HTML Code (1990) (references)D I R E C T   M A P P E D   C A C H E |
ISO 10646 (1991-1993) (references)0044 0049 0052 0045 0043 0054      004D 0041 0050 0050 0045 0044      0043 0041 0043 0048 0045 |
Encryption (beginner's substitution cypher): (references)384352393754247355050393823735374239 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.