Cleaning biblio
This commit is contained in:
parent
f22d9c87ca
commit
cb5bdea23c
1070
Bibliography.bib
1070
Bibliography.bib
File diff suppressed because it is too large
Load Diff
@ -41,7 +41,7 @@
|
||||
\citation{liakos_memory-optimized_2016}
|
||||
\citation{liakos_memory-optimized_2016}
|
||||
\citation{balaji_graph_2016}
|
||||
\citation{noauthor_overview_nodate}
|
||||
\citation{noauthor_parmetis_nodate}
|
||||
\citation{noauthor_boost_nodate}
|
||||
\citation{ou_scalable_2006}
|
||||
\citation{cook_scalable_2016}
|
||||
@ -141,7 +141,7 @@
|
||||
\bibcite{yu_construction_2018}{17}
|
||||
\bibcite{liakos_memory-optimized_2016}{18}
|
||||
\bibcite{balaji_graph_2016}{19}
|
||||
\bibcite{noauthor_overview_nodate}{20}
|
||||
\bibcite{noauthor_parmetis_nodate}{20}
|
||||
\bibcite{noauthor_boost_nodate}{21}
|
||||
\bibcite{cook_scalable_2016}{22}
|
||||
\bibcite{li_concurrency_2019}{23}
|
||||
|
||||
@ -103,14 +103,16 @@ J.~Balaji and R.~Sunderraman, ``Graph {Topology} {Abstraction} for
|
||||
{ACM} {Workshop} on {High} {Performance} {Graph} {Processing}}, pp.~27--34,
|
||||
May 2016.
|
||||
|
||||
\bibitem{noauthor_overview_nodate}
|
||||
``An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0,'' 2009.
|
||||
\bibitem{noauthor_parmetis_nodate}
|
||||
K.~Lab, ``Parmetis - parallel graph partitioning and fill-reducing matrix
|
||||
ordering.''
|
||||
\newblock http://glaros.dtc.umn.edu/gkhome/metis/parmetis/overview.
|
||||
|
||||
\bibitem{noauthor_boost_nodate}
|
||||
J.~Siek, L.-Q. Lee, and A.~Lumsdaine, ``The {Boost} {Graph} {Library}, vers.
|
||||
J.~Siek, L.-Q. Lee, and A.~Lumsdaine, ``The boost graph library, vers.
|
||||
1.75.0.''
|
||||
\newblock
|
||||
{https://www.boost.org/doc/libs/1$\_$75$\_$0/libs/graph/doc/index.html}.
|
||||
https://www.boost.org/doc/libs/1$\_$75$\_$0/libs/graph/doc/index.html.
|
||||
|
||||
\bibitem{cook_scalable_2016}
|
||||
K.~Cook, T.~Shaw, J.~Hale, and P.~Hawrylak, ``Scalable attack graph
|
||||
@ -139,6 +141,8 @@ M.~Li, P.~Hawrylak, and J.~Hale, ``Combining {OpenCL} and {MPI} to support
|
||||
|
||||
\bibitem{Slurm}
|
||||
SchedMD, ``Slurm {Workload} {Manager}.''
|
||||
https://slurm.schedmd.com/overview.html, Apr. 2023.
|
||||
\newblock Version 23.02.
|
||||
|
||||
\bibitem{Amdahl}
|
||||
G.~M. Amdahl, ``Validity of the single processor approach to achieving large
|
||||
|
||||
@ -3,38 +3,36 @@ Capacity: max_strings=200000, hash_size=200000, hash_prime=170003
|
||||
The top-level auxiliary file: Schrick-Noah_MPI-Tasking.aux
|
||||
The style file: ieeetr.bst
|
||||
Database file #1: Bibliography.bib
|
||||
Warning--entry type for "Slurm" isn't style-file defined
|
||||
--line 1112 of file Bibliography.bib
|
||||
You've used 30 entries,
|
||||
1876 wiz_defined-function locations,
|
||||
636 strings with 9395 characters,
|
||||
and the built_in function-call counts, 7761 in all, are:
|
||||
= -- 739
|
||||
> -- 299
|
||||
640 strings with 9512 characters,
|
||||
and the built_in function-call counts, 7812 in all, are:
|
||||
= -- 749
|
||||
> -- 302
|
||||
< -- 0
|
||||
+ -- 112
|
||||
- -- 82
|
||||
* -- 504
|
||||
:= -- 1055
|
||||
add.period$ -- 30
|
||||
+ -- 113
|
||||
- -- 83
|
||||
* -- 508
|
||||
:= -- 1068
|
||||
add.period$ -- 32
|
||||
call.type$ -- 30
|
||||
change.case$ -- 30
|
||||
chr.to.int$ -- 0
|
||||
cite$ -- 30
|
||||
duplicate$ -- 437
|
||||
empty$ -- 789
|
||||
format.name$ -- 82
|
||||
if$ -- 1925
|
||||
format.name$ -- 83
|
||||
if$ -- 1936
|
||||
int.to.chr$ -- 0
|
||||
int.to.str$ -- 30
|
||||
missing$ -- 26
|
||||
newline$ -- 96
|
||||
num.names$ -- 29
|
||||
pop$ -- 148
|
||||
newline$ -- 98
|
||||
num.names$ -- 30
|
||||
pop$ -- 149
|
||||
preamble$ -- 1
|
||||
purify$ -- 0
|
||||
quote$ -- 0
|
||||
skip$ -- 296
|
||||
skip$ -- 290
|
||||
stack$ -- 0
|
||||
substring$ -- 451
|
||||
swap$ -- 169
|
||||
@ -43,7 +41,6 @@ text.prefix$ -- 0
|
||||
top$ -- 0
|
||||
type$ -- 0
|
||||
warning$ -- 0
|
||||
while$ -- 68
|
||||
while$ -- 69
|
||||
width$ -- 32
|
||||
write$ -- 271
|
||||
(There was 1 warning)
|
||||
write$ -- 277
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Arch Linux) (preloaded format=pdflatex 2023.4.3) 22 APR 2023 17:12
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Arch Linux) (preloaded format=pdflatex 2023.4.3) 22 APR 2023 17:39
|
||||
entering extended mode
|
||||
restricted \write18 enabled.
|
||||
%&-line parsing enabled.
|
||||
@ -709,16 +709,21 @@ Underfull \hbox (badness 1859) in paragraph at lines 65--68
|
||||
[]
|
||||
|
||||
|
||||
Underfull \hbox (badness 10000) in paragraph at lines 110--114
|
||||
Underfull \hbox (badness 10000) in paragraph at lines 112--116
|
||||
[]\OT1/ptm/m/n/8 J. Siek, L.-Q. Lee, and A. Lumsdaine,
|
||||
[]
|
||||
|
||||
|
||||
Underfull \hbox (badness 10000) in paragraph at lines 110--114
|
||||
\OT1/ptm/m/n/8 ``The Boost Graph Library, vers. 1.75.0.''
|
||||
Underfull \hbox (badness 10000) in paragraph at lines 112--116
|
||||
\OT1/ptm/m/n/8 ``The boost graph library, vers. 1.75.0.''
|
||||
[]
|
||||
|
||||
[11 <./images/load-speedup.png> <./images/load-eff.png>])
|
||||
[11 <./images/load-speedup.png> <./images/load-eff.png>]
|
||||
Underfull \hbox (badness 10000) in paragraph at lines 143--146
|
||||
[]\OT1/ptm/m/n/8 SchedMD, ``Slurm Workload Manager.''
|
||||
[]
|
||||
|
||||
)
|
||||
|
||||
** Conference Paper **
|
||||
Before submitting the final camera ready copy, remember to:
|
||||
@ -744,7 +749,7 @@ Here is how much of TeX's memory you used:
|
||||
32513 multiletter control sequences out of 15000+600000
|
||||
550927 words of font info for 105 fonts, out of 8000000 for 9000
|
||||
1141 hyphenation exceptions out of 8191
|
||||
75i,14n,76p,2022b,587s stack positions out of 5000i,500n,10000p,200000b,80000s
|
||||
75i,14n,76p,2022b,589s stack positions out of 5000i,500n,10000p,200000b,80000s
|
||||
</usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/share/
|
||||
texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texmf-dist/font
|
||||
s/type1/public/amsfonts/cm/cmr7.pfb></usr/share/texmf-dist/fonts/type1/public/a
|
||||
@ -752,7 +757,7 @@ msfonts/cm/cmsy10.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cms
|
||||
y7.pfb></usr/share/texmf-dist/fonts/type1/urw/times/utmb8a.pfb></usr/share/texm
|
||||
f-dist/fonts/type1/urw/times/utmbi8a.pfb></usr/share/texmf-dist/fonts/type1/urw
|
||||
/times/utmr8a.pfb></usr/share/texmf-dist/fonts/type1/urw/times/utmri8a.pfb>
|
||||
Output written on Schrick-Noah_MPI-Tasking.pdf (12 pages, 943257 bytes).
|
||||
Output written on Schrick-Noah_MPI-Tasking.pdf (12 pages, 943367 bytes).
|
||||
PDF statistics:
|
||||
385 PDF objects out of 1000 (max. 8388607)
|
||||
308 compressed objects within 4 object streams
|
||||
|
||||
Binary file not shown.
@ -67,7 +67,7 @@ Other works, such as those by the authors of \cite{zhang_boosting_2017} and \cit
|
||||
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} 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}.
|
||||
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_parmetis_nodate}, \cite{noauthor_boost_nodate}.
|
||||
|
||||
There have also been numerous approaches at generation improvement specific to attack graphs. As a means of improving scalability of attack graphs, the authors of \cite{ou_scalable_2006} present a new representation scheme. Traditional attack graphs encode the entire network at each state, but the representation presented by the authors uses logical statements to represent a portion of the network at each node. This is called a logical attack graph. This approach led to the reduction of the generation process to quadratic time and reduced the number of nodes in the resulting graph to $\mathcal{O}({n}^2)$. However, this approach does require more analysis for identifying attack vectors.
|
||||
Another approach presented by the authors of \cite{cook_scalable_2016} represents a description of systems and their qualities and topologies as a state, with a queue of unexplored states.
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user