An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem

Keyphrases

• Single-source Shortest Paths 100%
• Adaptation 50%
• Parallelization 50%
• Parallel Algorithm 50%
• Message-driven 50%
• Graph Problems 50%
• Common Graphs 50%
• Large Graphs 50%
• Speculative Execution 50%
• Graph Algorithms 50%
• Synchronization Cost 50%
• Introspection 50%
• Edge Relaxation 50%
• Bulk Synchronous Parallel 50%
• Adaptive Aggregation 50%
• Multi-task Scheduling 50%
• Synchronous Parallel Algorithms 50%

Computer Science

• Shortest Path Problem 100%
• Parallel Algorithm 100%
• Parallelism 50%
• Speculative Execution 50%
• Graph Algorithms 50%