Hypersparse Traffic Matrix Construction using GraphBLAS on a DPU

William Bergeron,Michael Jones, Chase Barber, Kale DeYoung,George Amariucai, Kaleb Ernst, Nathan Fleming,Peter Michaleas,Sandeep Pisharody, Nathan Wells,Antonio Rosa,Eugene Vasserman,Jeremy Kepner

CoRR(2023)

引用 0|浏览2
暂无评分
摘要
Low-power small form factor data processing units (DPUs) enable offloading and acceleration of a broad range of networking and security services. DPUs have accelerated the transition to programmable networking by enabling the replacement of FPGAs/ASICs in a wide range of network oriented devices. The GraphBLAS sparse matrix graph open standard math library is well-suited for constructing anonymized hypersparse traffic matrices of network traffic which can enable a wide range of network analytics. This paper measures the performance of the GraphBLAS on an ARM based NVIDIA DPU (BlueField 2) and, to the best of our knowledge, represents the first reported GraphBLAS results on a DPU and/or ARM based system. Anonymized hypersparse traffic matrices were constructed at a rate of over 18 million packets per second.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络