Last fixes

inc/4.caches.tex

@@ -21,7 +21,7 @@ Finally, the advantage of non-blocking caches is the topic of Section \ref{sec:c
 \label{sec:caches_locality_principles}
 
 Access patterns of a typical application are not random.
-They tend to repeat in time or are located in the near surrounding of previous accesses.
+They tend to repeat themselfes in time or are located in the near surrounding of previous accesses.
 Those two heuristics are called \textit{temporal locality} and \textit{spatial locality}.
 
 \subsubsection{Temporal Locality}
@@ -65,7 +65,7 @@ There are three main policies:
 \begin{figure}
 \begin{center}
 \tikzfig{img/associativity}
-\caption{Four organizations for a cache of eight blocks \cite{Jacob2008}.}
+\caption[Four organizations for a cache of eight blocks.]{Four organizations for a cache of eight blocks \cite{Jacob2008}.}
 \label{fig:associativity}
 \end{center}
 \end{figure}
@@ -154,11 +154,11 @@ Figure \ref{fig:virtual_address} shows an exemplary division of a virtual addres
 
 Before a process can access a specific region in memory, the kernel has to translate the virtual page number into a physical page number.
 For conversions, so-called \textit{page tables} are used to look up the physical page number.
-Page tables are usually multiple levels deep (e.g. 4-levels on x86), so a single conversion can cause a number of memory accesses, which is expensive.
+Page tables are usually multiple levels deep (e.g., 4-levels on x86), so a single conversion can cause a number of memory accesses, which is expensive.
 To improve performance, a \revabbr{translation lookaside buffer}{TLB} is used, which acts like a cache on its own for physical page numbers.
 
 However, as long as the physical address is not present, the data cache cannot look up its entries as the index is not known yet.
-So the cache has to wait for the TLB or even multiple memory accesses if the physical page number is not stored in it.
+So the cache has to wait for the TLB or even multiple memory accesses in case the physical page number is not stored in it.
 To circumvent this problem, the cache can be indexed by the virtual address, which makes it possible to parallelize both procedures.
 Such a cache is called \textit{virtually indexed} and \textit{physically tagged} and is illustrated in Figure \ref{fig:virtual_address_conversion}.
 
@@ -207,7 +207,7 @@ A possible architecture of an MSHR file is illustrated in Figure \ref{fig:mshr_f
 \begin{figure}
 \begin{center}
 \tikzfig{img/mshr_file}
-\caption[Miss Status Holding Register File \cite{Jahre2007}.]{Miss Status Holding Register File \cite{Jahre2007}. \textit{V} refers to a valid bit.}
+\caption[Miss Status Holding Register File.]{Miss Status Holding Register File \cite{Jahre2007}. \textit{V} refers to a valid bit.}
 \label{fig:mshr_file}
 \end{center}
 \end{figure}