edited by
12,896 views
28 votes
28 votes
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline  \text{(B)} & \text{Shared memory} & \text{(q)}& \text{Spatial Locality} \\\hline   \text{(C)}& \text{Look-ahead buffer} & \text{(r)}  & \text{Address Translation} \\\hline  \text{(D)} & \text{Look-aside buffer} &\text{(s)}  & \text{Mutual Exclusion}  \\\hline \end{array}$$
edited by

5 Answers

Best answer
27 votes
27 votes

$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(r)} & \text{Address Translation} \\\hline  \text{(B)} & \text{Shared memory} & \text{(s)}& \text{Mutual Exclusion} \\\hline   \text{(C)}& \text{Look-ahead buffer} & \text{(q)}  & \text{Spatial Locality} \\\hline  \text{(D)} & \text{Look-aside buffer} &\text{(p)}  & \text{Temporal Locality}  \\\hline \end{array}$$

https://gateoverflow.in/3304/difference-between-translation-buffer-translation-buffer

edited by
3 votes
3 votes
(A) Virtual memory (p) Address Translation
(B) Shared memory (s) Mutual Exclusion
(C) Look-ahead buffer (q) spatial locality
(D) Look-aside buffer (p)temporal locality

read caching and virtual memory part in http://eces.colorado.edu/~coxaj/software/memsim/memsim.html

0 votes
0 votes
  1. Virtual Memory     →      R. Address Translation
  2. Shared Memory    →     S. Mutual Exclusion
  3. Look Ahead Buffer →   P. Temporal Locality
  4. Look aside buffer →    Q. Spatial Locality.
0 votes
0 votes

 

Feature Translation Lookaside Buffer (TLB) Translation Lookahead Buffer (TLB)
Location CPU (MMU) Disk Controller
Function Caches virtual-to-physical address translations Prefetches data from disk
Focus Optimizes past translations Anticipates future data needs
Impact Speeds up virtual-to-physical address translation Improves disk read performance

 

 

Related questions

19 votes
19 votes
3 answers
1
makhdoom ghaya asked Nov 27, 2016
5,379 views
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
29 votes
29 votes
3 answers
2
makhdoom ghaya asked Nov 27, 2016
5,904 views
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Base addressing} & \text{(p)} & \text{Reentranecy} \\\hline \text{(B)} & \text...
21 votes
21 votes
6 answers
3
makhdoom ghaya asked Nov 27, 2016
7,135 views
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.