In a direct?mapped cache memory system, what is the meaning of the terms
a. word?
b. line?
c. set?
a. word
The word is the same as the computer word (i.e., the basic unit of memory access). A line is composed of several
adjacent words.
b. line
A line is the fundamental unit of data in a cache and consists of several words (typically 64 bytes or 32 words in a
16?bit computer or 16 words in a 32?bit computer). Data is transferred between memory and cache as lines and
between cache and processor as words.
c. set.
In a direct?mapped cache, the main memory is divided into sets, and each set is the same size as the cache. A line
in the cache can come from any of the sets in the main memory.
You might also like to view...
Which of the following correctly declare 3 integer pointers?
a. int* p1, p2, p3; b. int *p1, p2, p3; c. int *p1, *p2, *p3; d. all of the above.
Is there an error?
What will be an ideal response? ``` class B { public: void virtual f(); }; void B::f() {/*. . . */} ```
A(n) ________ is the area of blank space that displays to the left, right, top, and bottom of a document.
A. margin B. indent C. tab D. border
Answer the following statements true (T) or false (F)
1. The efficiency of the selection sort depends on the initial arrangement of the data. 2. For large arrays, the insertion sort is prohibitively inefficient. 3. In a recursive mergesort, the actual sorting occurs during the recursive calls. The merge step simply puts two array segments together again. 4. To sort numeric data, the radix sort treats each number as a character string. 5. Insertion sort can be implemented as in-place sort. 6. Quick sort can be slower than insertion sort.