33 lines
1.3 KiB
Plaintext
33 lines
1.3 KiB
Plaintext
\begin{thebibliography}{1}
|
|
|
|
\bibitem{cook_rage_2018}
|
|
K.~Cook, {\em {RAGE}: {The} {Rage} {Attack} {Graph} {Engine}}.
|
|
\newblock PhD thesis, The {University} of {Tulsa}, 2018.
|
|
|
|
\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{li_combining_2019}
|
|
M.~Li, P.~Hawrylak, and J.~Hale, ``Combining {OpenCL} and {MPI} to support
|
|
heterogeneous computing on a cluster,'' {\em ACM International Conference
|
|
Proceeding Series}, 2019.
|
|
|
|
\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{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{berry_graph_2007}
|
|
J.~Berry and B.~Hendrickson, ``Graph {Analysis} with {High} {Performance}
|
|
{Computing}.,'' {\em Computing in Science and Engineering}, 2007.
|
|
|
|
\end{thebibliography}
|