aboutsummaryrefslogtreecommitdiff
path: root/doc/optimal_layout_report/optimal_layout.aux
diff options
context:
space:
mode:
authorMendes <mendes.oulamara@pm.me>2022-07-18 22:35:29 +0200
committerMendes <mendes.oulamara@pm.me>2022-07-18 22:35:29 +0200
commit03e3a1bd153bf7c3bf13216964fb17463a26aaae (patch)
tree28e6898df2f7e8dc98224c48006aa1b0312e4971 /doc/optimal_layout_report/optimal_layout.aux
parent948ff93cf10da1705766c2f0d256c316adcb806b (diff)
downloadgarage-03e3a1bd153bf7c3bf13216964fb17463a26aaae.tar.gz
garage-03e3a1bd153bf7c3bf13216964fb17463a26aaae.zip
Added the latex report on the optimal layout algorithm
Diffstat (limited to 'doc/optimal_layout_report/optimal_layout.aux')
-rw-r--r--doc/optimal_layout_report/optimal_layout.aux32
1 files changed, 32 insertions, 0 deletions
diff --git a/doc/optimal_layout_report/optimal_layout.aux b/doc/optimal_layout_report/optimal_layout.aux
new file mode 100644
index 00000000..fe8b0891
--- /dev/null
+++ b/doc/optimal_layout_report/optimal_layout.aux
@@ -0,0 +1,32 @@
+\relax
+\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Context}{1}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Formal description of the problem}{1}{}\protected@file@percent }
+\newlabel{eq:optimal}{{{OPT}}{1}}
+\@writefile{toc}{\contentsline {section}{\numberline {2}Properties of an optimal 3-strict assignment}{2}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Optimal assignment}{2}{}\protected@file@percent }
+\newlabel{sec:opt_assign}{{2.1}{2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces On the left, the creation of a concrete assignment with the naive approach of repeating tokens. On the right, the zones containing the nodes.}}{4}{}\protected@file@percent }
+\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Flow problem to compute and optimal assignment.}}{4}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Minimal transfer}{5}{}\protected@file@percent }
+\newlabel{hyp:A}{{{H3A}}{5}}
+\newlabel{hyp:B}{{{H3B}}{5}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {A)}Minimizing the zone discrepancy}{6}{}\protected@file@percent }
+\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces On the left: the graph $G_T$ encoding an assignment to minimize the zone discrepancy. On the right: the graph $G_T$ encoding an assignment to minimize the node discrepancy.}}{7}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {B)}Minimizing the node discrepancy}{8}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {C)}Linear combination of both criteria}{8}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Algorithm}{9}{}\protected@file@percent }
+\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Optimal 3-strict assignment}}{9}{}\protected@file@percent }
+\newlabel{alg:total}{{1}{9}}
+\@writefile{toc}{\contentsline {section}{\numberline {3}TODO}{9}{}\protected@file@percent }
+\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces Computation of the optimal utilization}}{10}{}\protected@file@percent }
+\newlabel{alg:util}{{2}{10}}
+\newlabel{lin:subutil}{{2}{10}}
+\newlabel{lin:loopsub}{{3}{10}}
+\newlabel{lin:findmin}{{4}{10}}
+\@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces Computation of a candidate assignment}}{10}{}\protected@file@percent }
+\newlabel{alg:opt}{{3}{10}}
+\@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces Minimization of the number of transfers}}{11}{}\protected@file@percent }
+\newlabel{alg:mini}{{4}{11}}
+\newlabel{lin:repeat}{{3}{11}}
+\gdef \@abspage@last{11}