hw1: revision

Project1/project_1_maggioni_claudio.tex

@@ -5,19 +5,22 @@
 \usepackage{subcaption}
 \usepackage{graphicx}
 \usepackage{tikz}
+\usetikzlibrary{decorations.markings}
+\usepackage{url}
+\hypersetup{pdfborder = {0 0 0}}
+\usepackage{xcolor}
 \usepackage{multirow}
 \usepackage{makecell}
 \usepackage{booktabs}
 \usepackage[nomessages]{fp}
-\usetikzlibrary{decorations.markings}
 
 \begin{document}
 
 \setassignment
 \setduedate{12.10.2022 (midnight)}
 
-\serieheader{High-Performance Computing Lab}{2022}{Student: Claudio
-Maggioni}{Discussed with: --}{Solution for Project 1}{}
+\serieheader{High-Performance Computing Lab}{2022}{Student: Claudio Maggioni}{
+    Discussed with: --}{Solution for Project 1}{}
 \newline
 
 %\assignmentpolicy
@@ -29,7 +32,6 @@ Maggioni}{Discussed with: --}{Solution for Project 1}{}
 \section{Explaining Memory Hierarchies \punkte{25}}
 
 \subsection{Memory Hierarchy Parameters of the Cluster}
-
 By invoking \texttt{likwid-topology} for the cache topology and \texttt{free -g}
 for the amount of primary memory, the following memory hierarchy parameters are
 found:
@@ -195,6 +197,7 @@ large sizes and strides, although the largest values of \texttt{stride} for each
 size (like \texttt{csize / 2} and \texttt{csize / 4}) achieve better mean times
 due to the few elements accessed in the pattern (this observation is also valid
 for the largest strides of each size series shown in the graph).
+\marginpar[right text]{\color{white}\url{https://youtu.be/JzJlzGaQFoc}}
 
 \section{Optimize Square Matrix-Matrix Multiplication  \punkte{60}}