Presentation
SIGN IN TO VIEW THIS PRESENTATION Sign In
Consider studying all-pairs shortest paths
DescriptionThere is a well-known connection between the all-pairs shortest paths (APSP) problem and Gaussian elimination. In the context of this workshop, that makes APSP a good candidate to study because, for an input graph that is sparse but fully connected, the computation lies at the boundary between "sparse" and "dense" and between "regular" and "irregular" parallelism. It may, therefore, be an illuminating prototype or analogue for trends we might foresee in algorithms, programming, and system design as "dense" problems like deep learning become "sparse."
Event Type
Workshop
TimeFriday, 17 November 20239:30am - 10am MST
Location401-402
Graph Algorithms and Frameworks
Linear Algebra
Programming Frameworks and System Software
State of the Practice
W