AG-CG-MPI-Tasking_Paper/Schrick-Noah_MPI-Tasking.bbl

136 lines
6.0 KiB
Plaintext

\begin{thebibliography}{10}
\bibitem{9678822}
N.~Dakhno, O.~Leshchenko, Y.~Kravchenko, A.~Dudnik, O.~Trush, and
V.~Khankishiev, ``Dynamic model of the spread of viruses in a computer
network using differential equations,'' in {\em 2021 IEEE 3rd International
Conference on Advanced Trends in Information Theory (ATIT)}, pp.~111--115,
2021.
\bibitem{7993827}
M.~Kwon, J.~Kwon, B.~Park, and H.~Park, ``An architecture of iptv networks
based on network coding,'' in {\em 2017 Ninth International Conference on
Ubiquitous and Future Networks (ICUFN)}, pp.~462--464, 2017.
\bibitem{8652334}
X.~Bai, M.~Liang, and S.~Zhu, ``A new routing scheme for large-scale computer
network,'' in {\em 2018 14th IEEE International Conference on Signal
Processing (ICSP)}, pp.~1019--1023, 2018.
\bibitem{baloyi_guidelines_2019}
N.~Baloyi and P.~Kotzé, ``Guidelines for {Data} {Privacy} {Compliance}: {A}
{Focus} on {Cyberphysical} {Systems} and {Internet} of {Things},'' in {\em
{SAICSIT} '19: {Proceedings} of the {South} {African} {Institute} of
{Computer} {Scientists} and {Information} {Technologists} 2019}, (Skukuza
South Africa), Association for Computing Machinery, 2019.
\bibitem{allman_complying_2006}
E.~Allman, ``Complying with {Compliance}: {Blowing} it off is not an option.,''
{\em ACM Queue}, vol.~4, no.~7, 2006.
\bibitem{j_hale_compliance_nodate}
{J. Hale}, P.~Hawrylak, and M.~Papa, ``Compliance {Method} for a
{Cyber}-{Physical} {System}.''
\newblock U.S. Patent Number 9,471,789, Oct. 18, 2016.
\bibitem{ou_scalable_2006}
X.~Ou, W.~F. Boyer, and M.~A. Mcqueen, ``A {Scalable} {Approach} to {Attack}
{Graph} {Generation},'' {\em CCS '06: Proceedings of the 13th ACM conference
on Computer and communications security}, pp.~336--345, 2006.
\bibitem{CPSIOT}
A.~T. Al~Ghazo, M.~Ibrahim, H.~Ren, and R.~Kumar, ``A2g2v: Automated attack
graph generator and visualizer,'' in {\em Proceedings of the 1st ACM MobiHoc
Workshop on Mobile IoT Sensing, Security, and Privacy}, Mobile IoT SSP'18,
(New York, NY, USA), Association for Computing Machinery, 2018.
\bibitem{ming_jo}
M.~Li, P.~Hawrylak, and J.~Hale, ``Strategies for practical hybrid attack graph
generation and analysis,'' {\em Digital Threats}, oct 2021.
\bibitem{cook_rage_2018}
K.~Cook, ``{RAGE}: {The} {Rage} {Attack} {Graph} {Engine},'' Master's thesis,
The {University} of {Tulsa}, 2018.
\bibitem{pacheco_introduction_2011}
P.~Pacheco, {\em An {Introduction} to {Parallel} {Programming}}.
\newblock Morgan Kaufmann, print~ed., 2011.
\bibitem{ainsworth_graph_2016}
S.~Ainsworth and T.~M. Jones, ``Graph prefetching using data structure
knowledge,'' {\em Proceedings of the International Conference on
Supercomputing}, vol.~01-03-June, 2016.
\bibitem{yao_efficient_2018}
P.~Yao, L.~Zheng, X.~Liao, H.~Jin, and B.~He, ``An efficient graph accelerator
with parallel data conflict management,'' {\em Parallel Architectures and
Compilation Techniques - Conference Proceedings, PACT}, 2018.
\bibitem{zhang_boosting_2017}
J.~Zhang, S.~Khoram, and J.~Li, ``Boosting the performance of {FPGA}-based
graph processor using hybrid memory cube: {A} case for breadth first
search,'' {\em FPGA 2017 - Proceedings of the 2017 ACM/SIGDA International
Symposium on Field-Programmable Gate Arrays}, pp.~207--216, 2017.
\bibitem{dai_fpgp_2016}
G.~Dai, Y.~Chi, Y.~Wang, and H.~Yang, ``{FPGP}: {Graph} processing framework on
{FPGA}: {A} case study of breadth-first search,'' {\em FPGA 2016 -
Proceedings of the 2016 ACM/SIGDA International Symposium on
Field-Programmable Gate Arrays}, pp.~105--110, 2016.
\bibitem{arifuzzaman_fast_2015}
S.~Arifuzzaman and M.~Khan, ``Fast parallel conversion of edge list to
adjacency list for large-scale graphs,'' in {\em {HPC} '15: {Proceedings} of
the {Symposium} on {High} {Performance} {Computing}}, pp.~17--24, Apr. 2015.
\bibitem{yu_construction_2018}
X.~Yu, W.~Chen, J.~Miao, J.~Chen, H.~Mao, Q.~Luo, and L.~Gu, ``The
{Construction} of {Large} {Graph} {Data} {Structures} in a {Scalable}
{Distributed} {Message} {System},'' in {\em {HPCCT} 2018: {Proceedings} of
the 2018 2nd {High} {Performance} {Computing} and {Cluster} {Technologies}
{Conference}}, pp.~6--10, June 2018.
\bibitem{liakos_memory-optimized_2016}
P.~Liakos, K.~Papakonstantinopoulou, and A.~Delis, ``Memory-{Optimized}
{Distributed} {Graph} {Processing} through {Novel} {Compression}
{Techniques},'' in {\em {CIKM} '16: {Proceedings} of the 25th {ACM}
{International} {Conference} on {Information} and {Knowledge} {Management}},
pp.~2317--2322, Oct. 2016.
\bibitem{balaji_graph_2016}
J.~Balaji and R.~Sunderraman, ``Graph {Topology} {Abstraction} for
{Distributed} {Path} {Queries},'' in {\em {HPGP} '16: {Proceedings} of the
{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_boost_nodate}
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}.
\bibitem{cook_scalable_2016}
K.~Cook, T.~Shaw, J.~Hale, and P.~Hawrylak, ``Scalable attack graph
generation,'' {\em Proceedings of the 11th Annual Cyber and Information
Security Research Conference, CISRC 2016}, 2016.
\bibitem{li_concurrency_2019}
M.~Li, P.~Hawrylak, and J.~Hale, ``Concurrency {Strategies} for {Attack}
{Graph} {Generation},'' {\em Proceedings - 2019 2nd International Conference
on Data Intelligence and Security, ICDIS 2019}, pp.~174--179, 2019.
\bibitem{9150145}
M.~Li, P.~J. Hawrylak, and J.~Hale, ``Implementing an attack graph generator in
cuda,'' in {\em 2020 IEEE International Parallel and Distributed Processing
Symposium Workshops (IPDPSW)}, pp.~730--738, 2020.
\bibitem{7087377}
K.~Kaynar and F.~Sivrikaya, ``Distributed attack graph generation,'' {\em IEEE
Transactions on Dependable and Secure Computing}, vol.~13, no.~5,
pp.~519--532, 2016.
\end{thebibliography}