Minimizing communication in all-pairs shortest paths

Keyphrases

• All-pairs Shortest Paths 100%
• Minimizing Communication 100%
• Latency 40%
• Shortest Path Algorithm 40%
• C1-2 40%
• Distributed Memory Algorithms 40%
• 2.5D Algorithm 40%
• Divide-and-conquer 20%
• Block Size 20%
• Tight Lower Bound 20%
• Cray 20%
• Temporal Data 20%
• Minimal Memory 20%
• Interprocessor Communications 20%
• Bandwidth Cost 20%
• Data Locality 20%
• Matrix multiplication 20%
• Temporal Locality 20%
• High Concurrency 20%
• Communication Lower Bounds 20%
• Intra-node 20%
• Latency Overhead 20%
• Semiring 20%
• Latency Cost 20%
• Cyclic Algorithm 20%

Computer Science

• Distributed Memory 100%
• Pair Shortest Path 100%
• All-Pairs-Shortest-Paths Algorithm 100%
• Pair Shortest Path Problem 100%
• Supercomputer 50%
• Concurrency 50%
• Data Locality 50%
• Critical Path 50%
• Matrix Multiplication 50%
• Temporal Data 50%
• Temporal Locality 50%