MPI Alg Design and Task 0

Appendices.aux

@@ -1,13 +1,13 @@
 \relax 
-\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }APPENDIX A:\ \ {\bf  \uppercase {THE FIRST APPENDIX}} }{36}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }APPENDIX A:\ \ {\bf  \uppercase {THE FIRST APPENDIX}} }{37}{}\protected@file@percent }
-\newlabel{App:A}{{A}{36}}
+\newlabel{App:A}{{A}{37}}
-\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }APPENDIX B:\ \ {\bf  \uppercase {THE SECOND APPENDIX}} }{37}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }APPENDIX B:\ \ {\bf  \uppercase {THE SECOND APPENDIX}} }{38}{}\protected@file@percent }
-\newlabel{App:B}{{B}{37}}
+\newlabel{App:B}{{B}{38}}
-\@writefile{toc}{\contentsline {section}{\numberline {B.1}\bf  A Heading in an Appendix}{37}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {B.1}\bf  A Heading in an Appendix}{38}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {B.1.1}\it  A Subheading in an Appendix}{37}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {B.1.1}\it  A Subheading in an Appendix}{38}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{A Sub-subsection in an Appendix}{37}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{A Sub-subsection in an Appendix}{38}{}\protected@file@percent }
 \@setckpt{Appendices}{
-\setcounter{page}{38}
+\setcounter{page}{39}
 \setcounter{equation}{0}
 \setcounter{enumi}{4}
 \setcounter{enumii}{0}

Chapter2.tex

@@ -23,7 +23,7 @@ on-chip block RAM, or even levering Hybrid Memory Cubes for optimizing parallel
 
 From a data structure standpoint, the authors of \cite{arifuzzaman_fast_2015} describe the infeasibility of adjacency matrices in large-scale graphs, and this work and other works such as those
 by the authors of \cite{yu_construction_2018} and \cite{liakos_memory-optimized_2016} discuss the appeal of distibuting a graph representation among systems. The author of
-\cite{liakos_memory-optimized_2016} disuss the usage of distributed adjacency lists for assinging vertices to workers. The authors of \cite{liakos_memory-optimized_2016} and
+\cite{liakos_memory-optimized_2016} discuss the usage of distributed adjacency lists for assinging vertices to workers. The authors of \cite{liakos_memory-optimized_2016} and
 \cite{balaji_graph_2016} present other techniques for minimizing communication costs by achieving high compression ratios while maintaining a low compression cost. The Boost Graph Library
 and the Parallel Boost Graph Library both provide appealing features for working with graps, with the latter library notably having interoperability with MPI, Graphviz, and METIS
 \cite{noauthor_overview_nodate}, \cite {noauthor_boost_nodate}.

Chapter3.aux

@@ -15,6 +15,7 @@
 \citation{berry_graph_2007}
 \citation{cook_rage_2018}
 \@writefile{toc}{\contentsline {section}{\numberline {3.4}\bf  Intermediate Database Storage}{11}{}\protected@file@percent }
+\newlabel{sec:db-stor}{{3.4}{11}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {3.4.1}\it  Memory Constraint Difficulties}{11}{}\protected@file@percent }
 \@writefile{lof}{\contentsline {figure}{\numberline {3.2}{\ignorespaces Color Coding a Small Network Based on Violations}}{12}{}\protected@file@percent }
 \newlabel{fig:CC}{{3.2}{12}}

Chapter3.tex

@@ -60,7 +60,7 @@ Figure \ref{fig:CC} displays an example graph that leverages color coding to eas
         \label{fig:CC}
 \end{figure}
 
-\TUsection{Intermediate Database Storage}
+\TUsection{Intermediate Database Storage}\label{sec:db-stor}
 \TUsubsection{Memory Constraint Difficulties}
 Previous works with RAGE have been designed around maximizing performance to limit the longer runtime caused by the state space explosion, such as the works seen by the authors of \cite{cook_rage_2018},
 \cite{li_concurrency_2019}, and \cite{li_combining_2019}. To this end, the output graph is stored in memory during the generation process to minimize disk writing and reading, as well as leverage the

Chapter5.aux

@@ -3,34 +3,35 @@
 \@writefile{toc}{\contentsline {section}{\numberline {5.1}\bf  Introduction to MPI Utilization for Attack Graph Generation}{25}{}\protected@file@percent }
 \@writefile{toc}{\contentsline {section}{\numberline {5.2}\bf  Necessary Components}{25}{}\protected@file@percent }
 \@writefile{toc}{\contentsline {subsection}{\numberline {5.2.1}\it  Serialization}{25}{}\protected@file@percent }
-\citation{cook_rage_2018}
 \citation{li_concurrency_2019}
+\citation{9150145}
+\citation{7087377}
 \@writefile{toc}{\contentsline {subsection}{\numberline {5.2.2}\it  Data Consistency}{26}{}\protected@file@percent }
 \@writefile{toc}{\contentsline {section}{\numberline {5.3}\bf  Tasking Approach}{26}{}\protected@file@percent }
 \@writefile{toc}{\contentsline {subsection}{\numberline {5.3.1}\it  Introduction to the Tasking Approach}{26}{}\protected@file@percent }
 \@writefile{toc}{\contentsline {subsection}{\numberline {5.3.2}\it  Algorithm Design}{26}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Communication Structure}{26}{}\protected@file@percent }
+\@writefile{lof}{\contentsline {figure}{\numberline {5.1}{\ignorespaces Task Overview of the Attack Graph Generation Process}}{27}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Task Zero}{26}{}\protected@file@percent }
+\newlabel{fig:tasks}{{5.1}{27}}
-\@writefile{toc}{\contentsline {subsubsection}{Task One}{26}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Communication Structure}{28}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Task Two}{26}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Task Zero}{28}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Task Three}{26}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Task One}{28}{}\protected@file@percent }
-\@writefile{lof}{\contentsline {figure}{\numberline {5.1}{\ignorespaces Generation Flowchart of RAGE}}{27}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Task Two}{28}{}\protected@file@percent }
-\newlabel{fig:RAGE_chart}{{5.1}{27}}
+\@writefile{toc}{\contentsline {subsubsection}{Task Three}{28}{}\protected@file@percent }
-\@writefile{lof}{\contentsline {figure}{\numberline {5.2}{\ignorespaces Task Overview of the Attack Graph Generation Process}}{28}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Task Four}{28}{}\protected@file@percent }
-\newlabel{fig:tasks}{{5.2}{28}}
+\@writefile{toc}{\contentsline {subsubsection}{Task Five}{28}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Task Four}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {5.3.3}\it  Performance Expectations}{28}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Task Five}{29}{}\protected@file@percent }
+\@writefile{lof}{\contentsline {figure}{\numberline {5.2}{\ignorespaces Node Allocation for each Task}}{29}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {5.3.3}\it  Performance Expectations}{29}{}\protected@file@percent }
+\newlabel{fig:node-alloc}{{5.2}{29}}
-\@writefile{toc}{\contentsline {section}{\numberline {5.4}\bf  Subgraphing Approach}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {5.4}\bf  Subgraphing Approach}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.1}\it  Introduction to the Subgraphing Approach}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.1}\it  Introduction to the Subgraphing Approach}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.2}\it  Algorithm Design}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.2}\it  Algorithm Design}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Communication Structure}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Communication Structure}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Worker Nodes}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Worker Nodes}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Root Node}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Root Node}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsubsection}{Database Node}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsubsection}{Database Node}{30}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.3}\it  Performance Expectations}{29}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.3}\it  Performance Expectations}{30}{}\protected@file@percent }
 \@setckpt{Chapter5}{
-\setcounter{page}{30}
+\setcounter{page}{31}
 \setcounter{equation}{0}
 \setcounter{enumi}{4}
 \setcounter{enumii}{0}

Chapter5.tex

@@ -46,14 +46,27 @@ attack and compliance graph generation.
 \end{figure}
 
 \TUsubsection{Algorithm Design}
-The design of the tasking approach is to leverage a pipeline structure with the six tasks and MPI nodes. Each stage of the pipeline will pass the necessary data to the next stage through various MPI messages, where the next stage's nodes will receive the data and execute their tasks. The pipeline is considered fully saturated when each task has a dedicated node. When there are less nodes than tasks, some nodes will processing multiple tasks. When there are more nodes than tasks, additional nodes will be assigned to Tasks 1 and 2. Timings were collected in the serial approach for various networks that displayed more time requirements for Tasks 1 and 2, with larger network sizes requiring vastly more time to be taken in Tasks 1 and 2. As a result, additional nodes are assigned to Tasks 1 and 2.
+The design of the tasking approach is to leverage a pipeline structure with the six tasks and MPI nodes. Each stage of the pipeline will pass the necessary data to the next stage through various MPI messages, where the next stage's nodes will receive the data and execute their tasks. The pipeline is considered fully saturated when each task has a dedicated node. When there are less nodes than tasks, some nodes will processing multiple tasks. When there are more nodes than tasks, additional nodes will be assigned to Tasks 1 and 2. Timings were collected in the serial approach for various networks that displayed more time requirements for Tasks 1 and 2, with larger network sizes requiring vastly more time to be taken in Tasks 1 and 2. As a result, additional nodes are assigned to Tasks 1 and 2. Node allocation can be seen in Figure \ref{fig:node-alloc}.
+
+For determining which tasks should be handled by the root note, a few considerations were made. Minimizing communication cost and avoiding unnecessary complexity were the main two considerations. In the serial approach, the frontier queue was the primary data structure for the majority of the execution. Rather than using a distributed queue or passing multiple sub-queues between nodes, the minimal option is to pass states individually. This approach also assists in reducing the complexity. Managing multiple frontier queues would require duplication checks, multiple nodes requesting data from and storing data into the database, and devising a strategy to maintain proper queue ordering, all of which would also increase the communication cost. As a result, the root node will be dedicated to Tasks 0 and 3.
+
+\begin{figure}[htp]
+    \includegraphics[width=\linewidth]{"./Chapter5_img/node-alloc.png"}
+    \vspace{.2truein} \centerline{}
+        \caption{Node Allocation for each Task}
+        \label{fig:node-alloc}
+\end{figure}
+
 \TUsubsubsection{Communication Structure}
+
 \TUsubsubsection{Task Zero}
+Task Zero is performed by the root node, and is a conditional task; it is not guaranteed to be executed at each pipeline iteration. Task Zero is only executed when the frontier is empty, but the database still holds unexplored states. This occurs when there are memory constraints, and database storage is performed during execution to offload the demand, as discussed in Section \ref{sec:db-stor}. After the completion of Task 0, the frontier has a state popped, and the root node sends the state to n$_1$. If the frontier is empty, the root node sends the finalize signal to all nodes.
 \TUsubsubsection{Task One}
 \TUsubsubsection{Task Two}
 \TUsubsubsection{Task Three}
 \TUsubsubsection{Task Four}
 \TUsubsubsection{Task Five}
+\TUsubsubsection{MPI Tags}
 
 \TUsubsection{Performance Expectations}
 

Chapter6.aux

@@ -1,23 +1,23 @@
 \relax 
-\@writefile{toc}{\contentsline {chapter}{\numberline {CHAPTER 6: }{\bf  \uppercase {PERFORMANCE ANALYSIS}}}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {chapter}{\numberline {CHAPTER 6: }{\bf  \uppercase {PERFORMANCE ANALYSIS}}}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {section}{\numberline {6.1}\bf  Small Networks}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {6.1}\bf  Small Networks}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.1}\it  Test Information}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.1}\it  Test Information}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.2}\it  Results}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.2}\it  Results}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.3}\it  Analysis}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.1.3}\it  Analysis}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {section}{\numberline {6.2}\bf  Large Networks}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {6.2}\bf  Large Networks}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.1}\it  Test Information}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.1}\it  Test Information}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.2}\it  Results}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.2}\it  Results}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.3}\it  Analysis}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.3}\it  Analysis}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {section}{\numberline {6.3}\bf  Large Exploit Lists}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {6.3}\bf  Large Exploit Lists}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.1}\it  Test Information}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.1}\it  Test Information}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.2}\it  Results}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.2}\it  Results}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.3}\it  Analysis}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.3}\it  Analysis}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {section}{\numberline {6.4}\bf  Distributed Hash Tables}{30}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {6.4}\bf  Distributed Hash Tables}{31}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.1}\it  Test Information}{31}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.1}\it  Test Information}{32}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.2}\it  Results}{31}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.2}\it  Results}{32}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.3}\it  Analysis}{31}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {subsection}{\numberline {6.4.3}\it  Analysis}{32}{}\protected@file@percent }
 \@setckpt{Chapter6}{
-\setcounter{page}{32}
+\setcounter{page}{33}
 \setcounter{equation}{0}
 \setcounter{enumi}{4}
 \setcounter{enumii}{0}

Chapter7.aux

@@ -1,8 +1,8 @@
 \relax 
-\@writefile{toc}{\contentsline {chapter}{\numberline {CHAPTER 7: }{\bf  \uppercase {CONCLUSIONS AND FUTURE WORKS}}}{32}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {chapter}{\numberline {CHAPTER 7: }{\bf  \uppercase {CONCLUSIONS AND FUTURE WORKS}}}{33}{}\protected@file@percent }
-\@writefile{toc}{\contentsline {section}{\numberline {7.1}\bf  Future Work}{32}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {7.1}\bf  Future Work}{33}{}\protected@file@percent }
 \@setckpt{Chapter7}{
-\setcounter{page}{33}
+\setcounter{page}{34}
 \setcounter{equation}{0}
 \setcounter{enumi}{4}
 \setcounter{enumii}{0}

Schrick-Noah_MS-Thesis.aux

@@ -32,9 +32,9 @@
 \bibcite{cook_rage_2018}{9}
 \bibcite{cook_scalable_2016}{10}
 \@writefile{toc}{{\hfill \ }}
-\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }NOMENCLATURE}{33}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }NOMENCLATURE}{34}{}\protected@file@percent }
 \@writefile{toc}{\addvspace {10pt}}
-\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }BIBLIOGRAPHY}{33}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\hspace  {-\parindent }BIBLIOGRAPHY}{34}{}\protected@file@percent }
 \@writefile{toc}{{\hfill \ }}
 \bibcite{CVE-2019-10747}{11}
 \bibcite{dai_fpgp_2016}{12}
@@ -54,4 +54,4 @@
 \bibcite{zhang_boosting_2017}{26}
 \bibstyle{plain}
 \@input{Appendices.aux}
-\gdef \@abspage@last{47}
+\gdef \@abspage@last{48}

Schrick-Noah_MS-Thesis.lof

@@ -4,5 +4,5 @@
 \contentsline {figure}{\numberline {4.1}{\ignorespaces A network without Synchronous Firing generating infeasible states}}{18}{}%
 \contentsline {figure}{\numberline {4.2}{\ignorespaces Inclusion of Synchronous Firing into GNU Bison, GNU Flex, and the overall program}}{21}{}%
 \contentsline {figure}{\numberline {4.3}{\ignorespaces Synchronous Firing in the Graph Generation Process}}{23}{}%
-\contentsline {figure}{\numberline {5.1}{\ignorespaces Generation Flowchart of RAGE}}{27}{}%
+\contentsline {figure}{\numberline {5.1}{\ignorespaces Task Overview of the Attack Graph Generation Process}}{27}{}%
-\contentsline {figure}{\numberline {5.2}{\ignorespaces Task Overview of the Attack Graph Generation Process}}{28}{}%
+\contentsline {figure}{\numberline {5.2}{\ignorespaces Node Allocation for each Task}}{29}{}%

Schrick-Noah_MS-Thesis.log

@@ -1,4 +1,4 @@
-This is pdfTeX, Version 3.141592653-2.6-1.40.23 (TeX Live 2021/Arch Linux) (preloaded format=pdflatex 2022.2.14)  17 MAR 2022 18:17
+This is pdfTeX, Version 3.141592653-2.6-1.40.23 (TeX Live 2021/Arch Linux) (preloaded format=pdflatex 2022.2.14)  17 MAR 2022 23:44
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
@@ -278,53 +278,78 @@ CHAPTER 5.
 
 
 ]
-<./Chapter5_img/RAGE_Chart.png, id=129, 495.8525pt x 557.08125pt>
+<./Chapter5_img/horiz_task.drawio.png, id=129, 1125.20375pt x 738.76pt>
-File: ./Chapter5_img/RAGE_Chart.png Graphic file (type png)
-<use ./Chapter5_img/RAGE_Chart.png>
-Package pdftex.def Info: ./Chapter5_img/RAGE_Chart.png  used on input line 43.
-(pdftex.def)             Requested size: 469.75499pt x 527.76213pt.
-<./Chapter5_img/horiz_task.drawio.png, id=130, 1125.20375pt x 738.76pt>
 File: ./Chapter5_img/horiz_task.drawio.png Graphic file (type png)
 <use ./Chapter5_img/horiz_task.drawio.png>
 Package pdftex.def Info: ./Chapter5_img/horiz_task.drawio.png  used on input li
-ne 49.
+ne 42.
 (pdftex.def)             Requested size: 469.75499pt x 308.4171pt.
- [26] [27 <./Chapter5_img/RAGE_Chart.png>] [28 <./Chapter5_img/horiz_task.drawi
+
-o.png>]) [29]
+
+LaTeX Warning: Reference `fig:node-alloc' on page 26 undefined on input line 49
+.
+
+[26] [27 <./Chapter5_img/horiz_task.drawio.png>]
+
+LaTeX Warning: File `"./Chapter5_img/node-alloc.png"' not found on input line 5
+4.
+
+
+! Package pdftex.def Error: File `./Chapter5_img/node-alloc.png' not found: usi
+ng draft setting.
+
+See the pdftex.def package documentation for explanation.
+Type  H <return>  for immediate help.
+ ...                                              
+                                                  
+l.54 ...inewidth]{"./Chapter5_img/node-alloc.png"}
+                                                  
+? 
+
+LaTeX Warning: Reference `sec:db-stor' on page 28 undefined on input line 63.
+
+[28] [29]) [30]
 \openout2 = `Chapter6.aux'.
 
  (./Chapter6.tex
 CHAPTER 6.
-[30
+[31
 
 
 
 
-]) [31]
+]) [32]
 \openout2 = `Chapter7.aux'.
 
  (./Chapter7.tex
 CHAPTER 7.
-) [32
+) [33
 
 
 
 
-] (./Schrick-Noah_MS-Thesis.bbl [33
+] (./Schrick-Noah_MS-Thesis.bbl [34
 
 
 
-] [34])
+] [35])
 \c@appendixno=\count269
- [35]
+ [36]
 \openout2 = `Appendices.aux'.
 
- (./Appendices.tex [36
+ (./Appendices.tex [37
 
 ])
-[37] (./Schrick-Noah_MS-Thesis.aux (./Chapter1.aux) (./Chapter2.aux)
+[38] (./Schrick-Noah_MS-Thesis.aux (./Chapter1.aux) (./Chapter2.aux)
 (./Chapter3.aux) (./Chapter4.aux) (./Chapter5.aux) (./Chapter6.aux)
-(./Chapter7.aux) (./Appendices.aux)) )
+(./Chapter7.aux) (./Appendices.aux))
+
+LaTeX Warning: There were undefined references.
+
+
+LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right.
+
+ )
 (\end occurred inside a group at level 6)
 
 ### semi simple group (level 6) entered at line 198 (\begingroup)
@@ -335,13 +360,13 @@ CHAPTER 7.
 ### semi simple group (level 1) entered at line 52 (\begingroup)
 ### bottom level 
 Here is how much of TeX's memory you used:
- 2197 strings out of 478353
+ 2236 strings out of 478353
- 39255 string characters out of 5854635
+ 40317 string characters out of 5854635
  345054 words of memory out of 5000000
- 20262 multiletter control sequences out of 15000+600000
+ 20288 multiletter control sequences out of 15000+600000
  407326 words of font info for 40 fonts, out of 8000000 for 9000
  1141 hyphenation exceptions out of 8191
- 55i,7n,62p,946b,1305s stack positions out of 5000i,500n,10000p,200000b,80000s
+ 55i,7n,62p,946b,1307s stack positions out of 5000i,500n,10000p,200000b,80000s
 {/usr/share/texmf-dist/fonts/enc/dvips/cm-super/cm-super-ts1.en
 c}</usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/share/
 texmf-dist/fonts/type1/public/amsfonts/cm/cmmi12.pfb></usr/share/texmf-dist/fon
@@ -350,10 +375,10 @@ ts/type1/public/amsfonts/cm/cmr12.pfb></usr/share/texmf-dist/fonts/type1/public
 y10.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cmti12.pfb></usr/
 share/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt12.pfb></usr/share/texmf-di
 st/fonts/type1/public/cm-super/sfrm1200.pfb>
-Output written on Schrick-Noah_MS-Thesis.pdf (47 pages, 477063 bytes).
+Output written on Schrick-Noah_MS-Thesis.pdf (48 pages, 434222 bytes).
 PDF statistics:
- 209 PDF objects out of 1000 (max. 8388607)
+ 211 PDF objects out of 1000 (max. 8388607)
- 132 compressed objects within 2 object streams
+ 134 compressed objects within 2 object streams
  0 named destinations out of 1000 (max. 500000)
- 36 words of extra memory for PDF output out of 10000 (max. 10000000)
+ 31 words of extra memory for PDF output out of 10000 (max. 10000000)
 

Schrick-Noah_MS-Thesis.toc

@@ -49,48 +49,48 @@
 \contentsline {section}{\numberline {5.3}\bf Tasking Approach}{26}{}%
 \contentsline {subsection}{\numberline {5.3.1}\it Introduction to the Tasking Approach}{26}{}%
 \contentsline {subsection}{\numberline {5.3.2}\it Algorithm Design}{26}{}%
-\contentsline {subsubsection}{Communication Structure}{26}{}%
+\contentsline {subsubsection}{Communication Structure}{28}{}%
-\contentsline {subsubsection}{Task Zero}{26}{}%
+\contentsline {subsubsection}{Task Zero}{28}{}%
-\contentsline {subsubsection}{Task One}{26}{}%
+\contentsline {subsubsection}{Task One}{28}{}%
-\contentsline {subsubsection}{Task Two}{26}{}%
+\contentsline {subsubsection}{Task Two}{28}{}%
-\contentsline {subsubsection}{Task Three}{26}{}%
+\contentsline {subsubsection}{Task Three}{28}{}%
-\contentsline {subsubsection}{Task Four}{29}{}%
+\contentsline {subsubsection}{Task Four}{28}{}%
-\contentsline {subsubsection}{Task Five}{29}{}%
+\contentsline {subsubsection}{Task Five}{28}{}%
-\contentsline {subsection}{\numberline {5.3.3}\it Performance Expectations}{29}{}%
+\contentsline {subsection}{\numberline {5.3.3}\it Performance Expectations}{28}{}%
-\contentsline {section}{\numberline {5.4}\bf Subgraphing Approach}{29}{}%
+\contentsline {section}{\numberline {5.4}\bf Subgraphing Approach}{30}{}%
-\contentsline {subsection}{\numberline {5.4.1}\it Introduction to the Subgraphing Approach}{29}{}%
+\contentsline {subsection}{\numberline {5.4.1}\it Introduction to the Subgraphing Approach}{30}{}%
-\contentsline {subsection}{\numberline {5.4.2}\it Algorithm Design}{29}{}%
+\contentsline {subsection}{\numberline {5.4.2}\it Algorithm Design}{30}{}%
-\contentsline {subsubsection}{Communication Structure}{29}{}%
+\contentsline {subsubsection}{Communication Structure}{30}{}%
-\contentsline {subsubsection}{Worker Nodes}{29}{}%
+\contentsline {subsubsection}{Worker Nodes}{30}{}%
-\contentsline {subsubsection}{Root Node}{29}{}%
+\contentsline {subsubsection}{Root Node}{30}{}%
-\contentsline {subsubsection}{Database Node}{29}{}%
+\contentsline {subsubsection}{Database Node}{30}{}%
-\contentsline {subsection}{\numberline {5.4.3}\it Performance Expectations}{29}{}%
+\contentsline {subsection}{\numberline {5.4.3}\it Performance Expectations}{30}{}%
-\contentsline {chapter}{\numberline {CHAPTER 6: }{\bf \uppercase {PERFORMANCE ANALYSIS}}}{30}{}%
+\contentsline {chapter}{\numberline {CHAPTER 6: }{\bf \uppercase {PERFORMANCE ANALYSIS}}}{31}{}%
-\contentsline {section}{\numberline {6.1}\bf Small Networks}{30}{}%
+\contentsline {section}{\numberline {6.1}\bf Small Networks}{31}{}%
-\contentsline {subsection}{\numberline {6.1.1}\it Test Information}{30}{}%
+\contentsline {subsection}{\numberline {6.1.1}\it Test Information}{31}{}%
-\contentsline {subsection}{\numberline {6.1.2}\it Results}{30}{}%
+\contentsline {subsection}{\numberline {6.1.2}\it Results}{31}{}%
-\contentsline {subsection}{\numberline {6.1.3}\it Analysis}{30}{}%
+\contentsline {subsection}{\numberline {6.1.3}\it Analysis}{31}{}%
-\contentsline {section}{\numberline {6.2}\bf Large Networks}{30}{}%
+\contentsline {section}{\numberline {6.2}\bf Large Networks}{31}{}%
-\contentsline {subsection}{\numberline {6.2.1}\it Test Information}{30}{}%
+\contentsline {subsection}{\numberline {6.2.1}\it Test Information}{31}{}%
-\contentsline {subsection}{\numberline {6.2.2}\it Results}{30}{}%
+\contentsline {subsection}{\numberline {6.2.2}\it Results}{31}{}%
-\contentsline {subsection}{\numberline {6.2.3}\it Analysis}{30}{}%
+\contentsline {subsection}{\numberline {6.2.3}\it Analysis}{31}{}%
-\contentsline {section}{\numberline {6.3}\bf Large Exploit Lists}{30}{}%
+\contentsline {section}{\numberline {6.3}\bf Large Exploit Lists}{31}{}%
-\contentsline {subsection}{\numberline {6.3.1}\it Test Information}{30}{}%
+\contentsline {subsection}{\numberline {6.3.1}\it Test Information}{31}{}%
-\contentsline {subsection}{\numberline {6.3.2}\it Results}{30}{}%
+\contentsline {subsection}{\numberline {6.3.2}\it Results}{31}{}%
-\contentsline {subsection}{\numberline {6.3.3}\it Analysis}{30}{}%
+\contentsline {subsection}{\numberline {6.3.3}\it Analysis}{31}{}%
-\contentsline {section}{\numberline {6.4}\bf Distributed Hash Tables}{30}{}%
+\contentsline {section}{\numberline {6.4}\bf Distributed Hash Tables}{31}{}%
-\contentsline {subsection}{\numberline {6.4.1}\it Test Information}{31}{}%
+\contentsline {subsection}{\numberline {6.4.1}\it Test Information}{32}{}%
-\contentsline {subsection}{\numberline {6.4.2}\it Results}{31}{}%
+\contentsline {subsection}{\numberline {6.4.2}\it Results}{32}{}%
-\contentsline {subsection}{\numberline {6.4.3}\it Analysis}{31}{}%
+\contentsline {subsection}{\numberline {6.4.3}\it Analysis}{32}{}%
-\contentsline {chapter}{\numberline {CHAPTER 7: }{\bf \uppercase {CONCLUSIONS AND FUTURE WORKS}}}{32}{}%
+\contentsline {chapter}{\numberline {CHAPTER 7: }{\bf \uppercase {CONCLUSIONS AND FUTURE WORKS}}}{33}{}%
-\contentsline {section}{\numberline {7.1}\bf Future Work}{32}{}%
+\contentsline {section}{\numberline {7.1}\bf Future Work}{33}{}%
 {\hfill \ }
-\contentsline {section}{\hspace {-\parindent }NOMENCLATURE}{33}{}%
+\contentsline {section}{\hspace {-\parindent }NOMENCLATURE}{34}{}%
 \addvspace {10pt}
-\contentsline {section}{\hspace {-\parindent }BIBLIOGRAPHY}{33}{}%
+\contentsline {section}{\hspace {-\parindent }BIBLIOGRAPHY}{34}{}%
 {\hfill \ }
-\contentsline {section}{\hspace {-\parindent }APPENDIX A:\ \ {\bf \uppercase {THE FIRST APPENDIX}} }{36}{}%
+\contentsline {section}{\hspace {-\parindent }APPENDIX A:\ \ {\bf \uppercase {THE FIRST APPENDIX}} }{37}{}%
-\contentsline {section}{\hspace {-\parindent }APPENDIX B:\ \ {\bf \uppercase {THE SECOND APPENDIX}} }{37}{}%
+\contentsline {section}{\hspace {-\parindent }APPENDIX B:\ \ {\bf \uppercase {THE SECOND APPENDIX}} }{38}{}%
-\contentsline {section}{\numberline {B.1}\bf A Heading in an Appendix}{37}{}%
+\contentsline {section}{\numberline {B.1}\bf A Heading in an Appendix}{38}{}%
-\contentsline {subsection}{\numberline {B.1.1}\it A Subheading in an Appendix}{37}{}%
+\contentsline {subsection}{\numberline {B.1.1}\it A Subheading in an Appendix}{38}{}%
-\contentsline {subsubsection}{A Sub-subsection in an Appendix}{37}{}%
+\contentsline {subsubsection}{A Sub-subsection in an Appendix}{38}{}%