diff --git a/Bibliography.bib b/Bibliography.bib index 352c729..9a59f7c 100644 --- a/Bibliography.bib +++ b/Bibliography.bib @@ -6,6 +6,8 @@ @misc{noauthor_overview_nodate, title = {An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0}, + authors = {Edmonds, Nick and Gregor, Douglas and Lumsdaine, Andrew}, + year = {2009}, url = {https://www.boost.org/doc/libs/1_75_0/libs/graph_parallel/doc/html/overview.html}, } @@ -16,7 +18,8 @@ } @misc{noauthor_boost_nodate, - title = {The {Boost} {Graph} {Library} - 1.75.0}, + title = {The {Boost} {Graph} {Library}, vers. 1.75.0}, + author = {Siek, Jeremy and Lee, Lie-Quan and Lumsdaine, Andrew}, url = {https://www.boost.org/doc/libs/1_75_0/libs/graph/doc/index.html}, } diff --git a/Chapter2.tex b/Chapter2.tex index 2746f16..d265907 100644 --- a/Chapter2.tex +++ b/Chapter2.tex @@ -13,8 +13,8 @@ nodes and edges, graph data structures suffer from poor cache locality, and memo \TUsection{Graph Generation Improvements} \label{sec:gen_improv} For architectural and hardware techniques for generation improvement, the authors of \cite{ainsworth_graph_2016} discuss the high cache miss rate, and how general prefetching -does not increase the prediction rate due to nonsequential graph structures and data-dependent access patterns. However, the authors continue to discuss that the generation -algorithm is known in advance, so explicit tuning of the hardware prefetcher to follow the traversal order pattern can lead to better performance. The authors were able to achieve +does not increase the prediction rate due to nonsequential graph structures and data-dependent access patterns. However, the authors continue to discuss that generation +algorithms are known in advance, so explicit tuning of the hardware prefetcher to follow the traversal order pattern can lead to better performance. The authors were able to achieve over 2x performance improvement of a breadth-first search approach with this method. Another hardware approach is to make use of accelerators. The authors of \cite{yao_efficient_2018} present an approach for minimizing the slowdown caused by the underlying graph atomic functions. By using the atomic function patterns, the authors utilized pipeline stages where vertex updates can be processed in parallel dynamically. Other works, such as those by the authors of \cite{zhang_boosting_2017} and \cite{dai_fpgp_2016}, leverage field-programmable gate arrays @@ -23,7 +23,7 @@ on-chip block RAM, or even leveraging Hybrid Memory Cubes for optimizing paralle 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 distributing a graph representation across systems. The author of -\cite{liakos_memory-optimized_2016} discuss the usage of distributed adjacency lists for assigning vertices to workers. The authors of \cite{liakos_memory-optimized_2016} and +\cite{liakos_memory-optimized_2016} discusses the usage of distributed adjacency lists for assigning 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 graphs, with the latter library notably having interoperability with MPI, Graphviz, and METIS \cite{noauthor_overview_nodate}, \cite{noauthor_boost_nodate}. diff --git a/Schrick-Noah_MS-Thesis.bbl b/Schrick-Noah_MS-Thesis.bbl index 474b9ea..9e4914c 100644 --- a/Schrick-Noah_MS-Thesis.bbl +++ b/Schrick-Noah_MS-Thesis.bbl @@ -103,10 +103,11 @@ J.~Balaji and R.~Sunderraman, ``Graph {Topology} {Abstraction} for May 2016. \bibitem{noauthor_overview_nodate} -``An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0.'' +``An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0,'' 2009. \bibitem{noauthor_boost_nodate} -``The {Boost} {Graph} {Library} - 1.75.0.'' +J.~Siek, L.-Q. Lee, and A.~Lumsdaine, ``The {Boost} {Graph} {Library}, vers. + 1.75.0.'' \bibitem{cook_scalable_2016} K.~Cook, T.~Shaw, J.~Hale, and P.~Hawrylak, ``Scalable attack graph diff --git a/Schrick-Noah_MS-Thesis.blg b/Schrick-Noah_MS-Thesis.blg index 245b15a..9e70492 100644 --- a/Schrick-Noah_MS-Thesis.blg +++ b/Schrick-Noah_MS-Thesis.blg @@ -10,42 +10,42 @@ A level-1 auxiliary file: Chapter6.aux The style file: ieeetr.bst Database file #1: Bibliography.bib Warning--entry type for "j_hale_compliance_nodate" isn't style-file defined ---line 272 of file Bibliography.bib +--line 275 of file Bibliography.bib Warning--entry type for "EUdataregulations2018" isn't style-file defined ---line 1250 of file Bibliography.bib +--line 1253 of file Bibliography.bib Warning--empty journal in ou_scalable_2006 Warning--empty school in cook_rage_2018 Warning--empty school in louthan_hybrid_2011 You've used 30 entries, 1876 wiz_defined-function locations, - 622 strings with 9004 characters, -and the built_in function-call counts, 6493 in all, are: -= -- 608 -> -- 251 + 624 strings with 9065 characters, +and the built_in function-call counts, 6551 in all, are: += -- 612 +> -- 261 < -- 0 -+ -- 97 -- -- 67 -* -- 418 -:= -- 895 -add.period$ -- 29 ++ -- 100 +- -- 70 +* -- 425 +:= -- 911 +add.period$ -- 30 call.type$ -- 30 change.case$ -- 28 chr.to.int$ -- 0 cite$ -- 33 duplicate$ -- 333 empty$ -- 695 -format.name$ -- 67 -if$ -- 1596 +format.name$ -- 70 +if$ -- 1606 int.to.chr$ -- 0 int.to.str$ -- 30 missing$ -- 19 newline$ -- 96 -num.names$ -- 25 -pop$ -- 147 +num.names$ -- 26 +pop$ -- 148 preamble$ -- 1 purify$ -- 0 quote$ -- 0 -skip$ -- 231 +skip$ -- 227 stack$ -- 0 substring$ -- 347 swap$ -- 108 @@ -54,7 +54,7 @@ text.prefix$ -- 0 top$ -- 0 type$ -- 0 warning$ -- 3 -while$ -- 59 +while$ -- 60 width$ -- 32 -write$ -- 248 +write$ -- 250 (There were 5 warnings) diff --git a/Schrick-Noah_MS-Thesis.log b/Schrick-Noah_MS-Thesis.log index 930d97b..84dcdf2 100644 --- a/Schrick-Noah_MS-Thesis.log +++ b/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.3.21) 27 MAR 2022 17:52 +This is pdfTeX, Version 3.141592653-2.6-1.40.23 (TeX Live 2021/Arch Linux) (preloaded format=pdflatex 2022.3.21) 27 MAR 2022 18:09 entering extended mode restricted \write18 enabled. %&-line parsing enabled. @@ -518,7 +518,7 @@ ts/type1/public/amsfonts/cm/cmr12.pfb> -Output written on Schrick-Noah_MS-Thesis.pdf (66 pages, 2061592 bytes). +Output written on Schrick-Noah_MS-Thesis.pdf (66 pages, 2061642 bytes). PDF statistics: 307 PDF objects out of 1000 (max. 8388607) 173 compressed objects within 2 object streams diff --git a/Schrick-Noah_MS-Thesis.pdf b/Schrick-Noah_MS-Thesis.pdf index 039c7fa..3284f09 100644 Binary files a/Schrick-Noah_MS-Thesis.pdf and b/Schrick-Noah_MS-Thesis.pdf differ