Dekker1/dekker-phd-thesis
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update compilation structure figures

Browse Source
This commit is contained in:
Jip J. Dekker 2021-05-16 15:58:41 +10:00
parent cc5d1fd016
commit 6b40d52644
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
4 changed files with 12 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.chktexrc
View File

@ -1,4 +1,4 @@
# Exclude these environments from syntax checking # Exclude these environments from syntax checking
VerbEnvir { pgfpicture tikzpicture mzn nzn grammar proof } VerbEnvir { pgfpicture tikzpicture mzn nzn plain grammar proof }
MathCmd { \hypo } MathCmd { \hypo }
WipeArg { \mzninline:{} \nzninline:{} \Sem:{} \texttt:{} } WipeArg { \mzninline:{} \nzninline:{} \Sem:{} \texttt:{} }

BIN
assets/img/back_compilation_structure.pdf
View File

Binary file not shown.

BIN
assets/img/rew_compilation_structure.pdf Normal file
View File

Binary file not shown.

31
chapters/3_rewriting.tex
View File

@ -34,12 +34,13 @@ tool chain allows us to:
functional definitions functional definitions
\end{itemize} \end{itemize}
The new architecture is shown in \Cref{sfig:4-newarch}. A constraint model is The new architecture is shown in \Cref{fig:rew-comp}. A constraint model is
first compiled to byte code (called \microzinc{}), independent of the data. The first compiled into a smaller constraint language called \microzinc{},
byte code is interpreted with the data to produce \nanozinc\ code, an extension independent of the data. After the \microzinc{} is transformed into a byte code,
of the existing \flatzinc\ format. The interpreter can even be made incremental: it is interpreted with the data to produce \nanozinc\ code, an extension of the
in \cref{ch:incremental} we discuss how in meta optimisation, no recompilation existing \flatzinc\ format. The interpreter can even be made incremental: in
is required. \cref{ch:incremental} we discuss how in meta optimisation, no recompilation is
required.
We have developed a prototype of this tool chain, and present experimental We have developed a prototype of this tool chain, and present experimental
validation of these advantages. The prototype is still very experimental, but validation of these advantages. The prototype is still very experimental, but
@ -54,21 +55,11 @@ representation, and in \cref{sec:4-experiments} we report on the experimental
results of the prototype implementation. Finally, \Cref{sec:4-conclusion} results of the prototype implementation. Finally, \Cref{sec:4-conclusion}
presents our conclusions. presents our conclusions.
\begin{figure}[ht] \begin{figure}
\centering \centering
\begin{subfigure}[b]{.45\columnwidth} \includegraphics[width=\linewidth]{assets/img/rew_compilation_structure}
\centering \caption{\label{fig:rew-comp} The proposed process for the compilation of
\includegraphics[width=\columnwidth]{assets/img/4_old_process} \minizinc\ instances.}
\caption{\label{sfig:4-oldarch}}
\end{subfigure}%
\hspace{0.05\columnwidth}%
\begin{subfigure}[b]{.50\columnwidth}
\centering
\includegraphics[width=\columnwidth]{assets/img/4_new_process}
\caption{\label{sfig:4-newarch}}
\end{subfigure}
\caption{\label{fig:4-arch} (a) Current \minizinc\ architecture, and (b) new
\minizinc\ architecture}
\end{figure} \end{figure}