Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next?
2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)(2018)
摘要
Numerical computational science dominated the first half century of high- performance computing; graph theory served numerical linear algebra by enabling efficient sparse matrix methods. Turnabout is fair play: Nowadays more and more computational problems concern graphs in their own right, and sparse matrix methods are often a good way to look at algorithms on graphs. This has led via a long path to the Graph BLAS and its reference implementations, which are a significant milestone. But there's a lot left to do. What happens now?
更多查看译文
关键词
graph BLAS,graph algorithms,sparse matrix methods,numerical linear algebra,graph theory,high- performance computing,numerical computational science
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要